tla-ts 0.0.4-dev.0be9567 → 0.0.4-dev.43f28be

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (311) hide show
  1. package/README.md +27 -141
  2. package/dist/deciders.cjs +366 -0
  3. package/dist/deciders.js +366 -0
  4. package/dist/index.cjs +1 -1
  5. package/dist/index.d.cts +35 -1
  6. package/dist/index.d.ts +35 -1
  7. package/dist/index.js +1 -1
  8. package/dist/parallel-worker.cjs +1 -4
  9. package/dist/parallel-worker.js +1 -4
  10. package/dist/prove-worker.cjs +9 -0
  11. package/dist/prove-worker.d.cts +9 -0
  12. package/dist/prove-worker.d.ts +9 -0
  13. package/dist/prove-worker.js +9 -0
  14. package/dist/prove.cjs +996 -0
  15. package/dist/prove.js +996 -0
  16. package/dist/run-cli.cjs +517 -47
  17. package/dist/run-cli.js +517 -47
  18. package/dist/tlapm.cjs +10 -0
  19. package/dist/tlapm.js +10 -0
  20. package/dist/transfer.cjs +38 -44
  21. package/dist/transfer.js +38 -44
  22. package/dist/worker.cjs +21 -0
  23. package/dist/worker.js +21 -0
  24. package/package.json +21 -12
  25. package/src/check.ts +1 -0
  26. package/src/errors.ts +86 -0
  27. package/src/evaluate.ts +54 -19
  28. package/src/index.ts +10 -0
  29. package/src/{obligation-action.ts → obligations/action.ts} +258 -37
  30. package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
  31. package/src/obligations/ctx.ts +64 -0
  32. package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
  33. package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
  34. package/src/{obligation-format.ts → obligations/format.ts} +6 -5
  35. package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
  36. package/src/{obligations.ts → obligations/index.ts} +28 -12
  37. package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
  38. package/src/{obligation-module.ts → obligations/module.ts} +46 -20
  39. package/src/obligations/pickle.ts +100 -0
  40. package/src/obligations/pragma.ts +189 -0
  41. package/src/{obligation-printer.ts → obligations/printer.ts} +9 -63
  42. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  43. package/src/{obligation-source.ts → obligations/source.ts} +91 -35
  44. package/src/obligations/temporal.ts +319 -0
  45. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  46. package/src/ocaml-marshal.ts +166 -0
  47. package/src/parallel-worker.ts +2 -18
  48. package/src/parallel.ts +10 -43
  49. package/src/prove/decide-pool.ts +100 -0
  50. package/src/prove/deciders.ts +33 -0
  51. package/src/prove/isabelle/LICENSE +36 -0
  52. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  53. package/src/prove/isabelle/decide.ts +47 -0
  54. package/src/prove/isabelle/encode.ts +508 -0
  55. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  56. package/src/prove/isabelle/isar/method.ts +367 -0
  57. package/src/prove/isabelle/isar/proof.ts +28 -0
  58. package/src/prove/isabelle/isar/statement.ts +57 -0
  59. package/src/prove/isabelle/isar/theory.ts +192 -0
  60. package/src/prove/isabelle/isar/type-check.ts +278 -0
  61. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  62. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  63. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  64. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  65. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  66. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  67. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  68. package/src/prove/isabelle/provers/classical.ts +389 -0
  69. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  70. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  71. package/src/prove/isabelle/pure/consts.ts +32 -0
  72. package/src/prove/isabelle/pure/conv.ts +79 -0
  73. package/src/prove/isabelle/pure/drule.ts +264 -0
  74. package/src/prove/isabelle/pure/envir.ts +363 -0
  75. package/src/prove/isabelle/pure/goal.ts +53 -0
  76. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  77. package/src/prove/isabelle/pure/list.ts +12 -0
  78. package/src/prove/isabelle/pure/logic.ts +402 -0
  79. package/src/prove/isabelle/pure/name.ts +110 -0
  80. package/src/prove/isabelle/pure/net.ts +262 -0
  81. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  82. package/src/prove/isabelle/pure/pattern.ts +650 -0
  83. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  84. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  85. package/src/prove/isabelle/pure/search.ts +68 -0
  86. package/src/prove/isabelle/pure/seq.ts +156 -0
  87. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  88. package/src/prove/isabelle/pure/table.ts +208 -0
  89. package/src/prove/isabelle/pure/tactic.ts +276 -0
  90. package/src/prove/isabelle/pure/tactical.ts +347 -0
  91. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  92. package/src/prove/isabelle/pure/term.ts +808 -0
  93. package/src/prove/isabelle/pure/thm.ts +806 -0
  94. package/src/prove/isabelle/pure/type.ts +133 -0
  95. package/src/prove/isabelle/pure/unify.ts +753 -0
  96. package/src/prove/isabelle/pure/variable.ts +25 -0
  97. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  98. package/src/prove/isabelle/tla/context.ts +74 -0
  99. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  100. package/src/prove/isabelle/tla/logic.ts +215 -0
  101. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  102. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  103. package/src/prove/ocaml.ts +22 -0
  104. package/src/prove/prep/action.ts +520 -0
  105. package/src/prove/prep/defs.ts +33 -0
  106. package/src/prove/prep/elab.ts +156 -0
  107. package/src/prove/prep/enabled-axioms.ts +189 -0
  108. package/src/prove/prep/enabled.ts +43 -0
  109. package/src/prove/prep/fingerprint.ts +388 -0
  110. package/src/prove/prep/flatten.ts +70 -0
  111. package/src/prove/prep/level-comparison.ts +552 -0
  112. package/src/prove/prep/md5.ts +67 -0
  113. package/src/prove/prep/pragma.ts +221 -0
  114. package/src/prove/prep/trivial.ts +22 -0
  115. package/src/prove/prove-worker.ts +27 -0
  116. package/src/prove/prove.ts +518 -0
  117. package/src/prove/ptl/decide.ts +68 -0
  118. package/src/prove/ptl/encode.ts +256 -0
  119. package/src/prove/ptl/sat.ts +151 -0
  120. package/src/prove/ptl/tableau.ts +276 -0
  121. package/src/prove/smt/axiomatize.ts +69 -0
  122. package/src/prove/smt/axioms.ts +210 -0
  123. package/src/prove/smt/context.ts +108 -0
  124. package/src/prove/smt/data.ts +665 -0
  125. package/src/prove/smt/encode.ts +169 -0
  126. package/src/prove/smt/extensionality.ts +63 -0
  127. package/src/prove/smt/flatten.ts +127 -0
  128. package/src/prove/smt/format.ts +143 -0
  129. package/src/prove/smt/instances.ts +182 -0
  130. package/src/prove/smt/rewrite.ts +784 -0
  131. package/src/prove/smt/simplify.ts +57 -0
  132. package/src/prove/smt/solver/act-cache.ts +265 -0
  133. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  134. package/src/prove/smt/solver/array.ts +22 -0
  135. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  136. package/src/prove/smt/solver/ast-lt.ts +157 -0
  137. package/src/prove/smt/solver/ast-util.ts +147 -0
  138. package/src/prove/smt/solver/ast.ts +1315 -0
  139. package/src/prove/smt/solver/auf-solver.ts +572 -0
  140. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  141. package/src/prove/smt/solver/cg-table.ts +175 -0
  142. package/src/prove/smt/solver/clause.ts +276 -0
  143. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  144. package/src/prove/smt/solver/context.ts +1292 -0
  145. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  146. package/src/prove/smt/solver/der.ts +224 -0
  147. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  148. package/src/prove/smt/solver/e-matching.ts +659 -0
  149. package/src/prove/smt/solver/enode.ts +259 -0
  150. package/src/prove/smt/solver/expr-ref.ts +21 -0
  151. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  152. package/src/prove/smt/solver/fingerprints.ts +92 -0
  153. package/src/prove/smt/solver/flat-literals.ts +51 -0
  154. package/src/prove/smt/solver/goal.ts +138 -0
  155. package/src/prove/smt/solver/hash.ts +173 -0
  156. package/src/prove/smt/solver/hashtable.ts +166 -0
  157. package/src/prove/smt/solver/internalizer.ts +1381 -0
  158. package/src/prove/smt/solver/lbool.ts +5 -0
  159. package/src/prove/smt/solver/literal.ts +24 -0
  160. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  161. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  162. package/src/prove/smt/solver/lp/containers.ts +296 -0
  163. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  164. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  165. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  166. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  167. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  168. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  169. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  170. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  171. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  172. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  173. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  174. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  175. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  176. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  177. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  178. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  179. package/src/prove/smt/solver/lp/nex.ts +120 -0
  180. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  181. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  182. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  183. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  184. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  185. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  186. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  187. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  188. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  189. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  190. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  191. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  192. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  193. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  194. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  195. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  196. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  197. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  198. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  199. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  200. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  201. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  202. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  203. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  204. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  205. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  206. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  207. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  208. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  209. package/src/prove/smt/solver/model-checker.ts +347 -0
  210. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  211. package/src/prove/smt/solver/model-finder.ts +155 -0
  212. package/src/prove/smt/solver/model-generator.ts +97 -0
  213. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  214. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  215. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  216. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  217. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  218. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  219. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  220. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  221. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  222. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  223. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  224. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  225. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  226. package/src/prove/smt/solver/nnf.ts +469 -0
  227. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  228. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  229. package/src/prove/smt/solver/propagate-values.ts +83 -0
  230. package/src/prove/smt/solver/proto-model.ts +551 -0
  231. package/src/prove/smt/solver/pull-quant.ts +139 -0
  232. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  233. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  234. package/src/prove/smt/solver/qe-lite.ts +381 -0
  235. package/src/prove/smt/solver/qi-queue.ts +362 -0
  236. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  237. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  238. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  239. package/src/prove/smt/solver/random-gen.ts +10 -0
  240. package/src/prove/smt/solver/rational.ts +165 -0
  241. package/src/prove/smt/solver/ref-vector.ts +62 -0
  242. package/src/prove/smt/solver/relevancy.ts +247 -0
  243. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  244. package/src/prove/smt/solver/rewriter.ts +843 -0
  245. package/src/prove/smt/solver/rlimit.ts +79 -0
  246. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  247. package/src/prove/smt/solver/solver.ts +71 -0
  248. package/src/prove/smt/solver/sort.ts +35 -0
  249. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  250. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  251. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  252. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  253. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  254. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  255. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  256. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  257. package/src/prove/smt/solver/theory-lra.ts +56 -0
  258. package/src/prove/smt/solver/var-subst.ts +258 -0
  259. package/src/prove/smt/solver/z3-license.txt +10 -0
  260. package/src/prove/smt/table.ts +170 -0
  261. package/src/prove/tlapm/tlapm.ts +97 -0
  262. package/src/prove/tlaps-module.ts +510 -0
  263. package/src/prove/verdict.ts +18 -0
  264. package/src/prove/zenon/LICENSE +32 -0
  265. package/src/prove/zenon/check/check.ts +105 -0
  266. package/src/prove/zenon/check/definitions.ts +144 -0
  267. package/src/prove/zenon/check/equality.ts +182 -0
  268. package/src/prove/zenon/check/functions.ts +62 -0
  269. package/src/prove/zenon/check/keys.ts +125 -0
  270. package/src/prove/zenon/check/propositional.ts +104 -0
  271. package/src/prove/zenon/check/records.ts +188 -0
  272. package/src/prove/zenon/check/relations.ts +121 -0
  273. package/src/prove/zenon/check/rewrites.ts +224 -0
  274. package/src/prove/zenon/check/sets.ts +302 -0
  275. package/src/prove/zenon/check/terms.ts +127 -0
  276. package/src/prove/zenon/check/tla.ts +126 -0
  277. package/src/prove/zenon/decide.ts +113 -0
  278. package/src/prove/zenon/encode.ts +444 -0
  279. package/src/prove/zenon/eqrel.ts +300 -0
  280. package/src/prove/zenon/equality-rules.ts +435 -0
  281. package/src/prove/zenon/expr.ts +551 -0
  282. package/src/prove/zenon/index-table.ts +350 -0
  283. package/src/prove/zenon/isar-case.ts +513 -0
  284. package/src/prove/zenon/isar.ts +1249 -0
  285. package/src/prove/zenon/limits.ts +15 -0
  286. package/src/prove/zenon/llproof.ts +173 -0
  287. package/src/prove/zenon/mltoll.ts +1566 -0
  288. package/src/prove/zenon/node.ts +297 -0
  289. package/src/prove/zenon/ocaml.ts +169 -0
  290. package/src/prove/zenon/parse.ts +247 -0
  291. package/src/prove/zenon/phrase.ts +191 -0
  292. package/src/prove/zenon/proof.ts +198 -0
  293. package/src/prove/zenon/propositional-rules.ts +387 -0
  294. package/src/prove/zenon/rules.ts +94 -0
  295. package/src/prove/zenon/search.ts +288 -0
  296. package/src/prove/zenon/tla/functions.ts +151 -0
  297. package/src/prove/zenon/tla/llproof.ts +480 -0
  298. package/src/prove/zenon/tla/records.ts +225 -0
  299. package/src/prove/zenon/tla/rewrites.ts +447 -0
  300. package/src/prove/zenon/tla/sets.ts +304 -0
  301. package/src/prove/zenon/tla/terms.ts +181 -0
  302. package/src/prove/zenon/tla/tla.ts +506 -0
  303. package/src/run-cli.ts +338 -62
  304. package/src/successors.ts +24 -5
  305. package/src/tlapm-cache.ts +244 -0
  306. package/src/tlc-random.ts +55 -32
  307. package/src/tlc-version.ts +8 -7
  308. package/src/values.ts +47 -4
  309. package/src/worker.ts +65 -0
  310. package/dist/parallel.cjs +0 -12
  311. package/dist/parallel.js +0 -12
@@ -0,0 +1,252 @@
1
+ // Ported from Z3 (src/smt/theory_lra.cpp), MIT license, see z3-license.txt. The final check of
2
+ // theory_lra: the integer solver and its branches and cuts, then nla on nonlinear terms, whose
3
+ // lemmas become clauses.
4
+ import { OP_ADD, OP_GE, OP_LE, OP_MUL, OP_TO_REAL, SORT_BOOL, SORT_INT, SORT_REAL } from "./ast";
5
+ import { FC_CONTINUE, FC_DONE, FC_GIVEUP } from "./context";
6
+ import { TheoryJustification } from "./enode";
7
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
8
+ import { getVar, Literal, negate } from "./literal";
9
+ import { getGcd, getLcm, Rational } from "./rational";
10
+ import { KIND_EQ, KIND_GE, KIND_GT, KIND_LT, KIND_NE } from "./lp/constraints";
11
+ import { Explanation } from "./lp/explanation";
12
+ import { IntSolver } from "./lp/int-solver";
13
+ import type { LarTerm } from "./lp/lar-term";
14
+ import { NlaCore } from "./lp/nla-core";
15
+ import { Ineq, Lemma } from "./lp/nla-types";
16
+ import { TheoryLraModel } from "./theory-lra-model";
17
+
18
+ export abstract class TheoryLraFinalCheck extends TheoryLraModel {
19
+ private lia = new IntSolver(this.solver);
20
+
21
+ finalCheckEh(level: number) {
22
+ const context = this.context;
23
+ if (this.propagateCore()) return FC_CONTINUE;
24
+ this.isModelInitialized = false;
25
+ const solver = this.solver;
26
+ this.propagateNla(false);
27
+ const status =
28
+ !solver.isFeasible() || solver.columnsWithChangedBounds.size > 0
29
+ ? this.makeFeasible()
30
+ : L_TRUE;
31
+ if (status === L_FALSE) {
32
+ this.setInfeasibilityConflict();
33
+ return FC_CONTINUE;
34
+ }
35
+ if (status === L_UNDEF) return context.checkCanceled() ? FC_GIVEUP : FC_CONTINUE;
36
+ if (!this.isLiaSat() || !this.checkIdivBounds()) return FC_CONTINUE;
37
+ let result = FC_DONE;
38
+ const nlaStatus = this.checkNla(level);
39
+ if (nlaStatus === FC_CONTINUE) return FC_CONTINUE;
40
+ // Nonlinear bound optimization may invalidate integer feasibility.
41
+ if (nlaStatus === FC_DONE && !this.nla?.isUsingNraModel && solver.hasInfInt())
42
+ return FC_CONTINUE;
43
+ if (nlaStatus === FC_GIVEUP) result = FC_GIVEUP;
44
+ if (this.assumeEqs()) return FC_CONTINUE;
45
+ if (this.unsupportedTerms.length > 0) this.initVariableValues();
46
+ // eval_unsupported gives up on every term but powers, which are not supported here.
47
+ return this.unsupportedTerms.some((term) => context.isRelevant(term)) ? FC_GIVEUP : result;
48
+ }
49
+
50
+ // check_nla: whether the values of the monomials agree with their factors', or the lemmas that
51
+ // refine them.
52
+ private checkNla(level: number) {
53
+ if (this.context.checkCanceled()) return FC_GIVEUP;
54
+ const nla = this.nla;
55
+ if (nla === undefined || !nla.hasRelevantMonomial()) return FC_DONE;
56
+ const status = nla.check(level);
57
+ if (status === L_FALSE) {
58
+ this.addLemmas(nla);
59
+ return FC_CONTINUE;
60
+ }
61
+ return status === L_TRUE ? FC_DONE : FC_GIVEUP;
62
+ }
63
+
64
+ // check_idiv_bounds: the lemmas of the bounded divisions.
65
+ private checkIdivBounds() {
66
+ const nla = this.nla;
67
+ if (nla === undefined) return true;
68
+ nla.checkBoundedDivisions();
69
+ this.addLemmas(nla);
70
+ return nla.lemmas.length === 0;
71
+ }
72
+
73
+ // propagate_nla and incremental_propagate_nla: the bounds nla derives for monomials.
74
+ protected propagateNla(isIncremental: boolean) {
75
+ const nla = this.nla;
76
+ if (nla === undefined) return;
77
+ if (isIncremental) nla.incrementalPropagate();
78
+ else nla.propagate();
79
+ this.addLemmas(nla);
80
+ this.solver.collectMoreRowsForLpPropagation();
81
+ }
82
+
83
+ private addLemmas(nla: NlaCore) {
84
+ if (nla.isCheckFeasible && this.makeFeasible() === L_FALSE) {
85
+ this.setInfeasibilityConflict();
86
+ return;
87
+ }
88
+ for (const ineq of nla.literals) {
89
+ const literal = this.mkNlaLiteral(ineq);
90
+ this.context.markLiteralAsRelevant(literal);
91
+ this.context.setTrueFirstFlag(getVar(literal));
92
+ }
93
+ for (const lemma of nla.lemmas) this.falseCaseOfCheckNla(lemma);
94
+ for (const equality of nla.fixedEqualities)
95
+ this.addEquality(equality.lpVar, equality.value, equality.explanation);
96
+ for (const equality of nla.equalities)
97
+ this.addEq(equality.first, equality.second, equality.explanation, false);
98
+ }
99
+
100
+ // add_equality: a column fixed to a value, equal to the variable of the value's numeral.
101
+ private addEquality(column: number, value: Rational, explanation: Explanation) {
102
+ const thVar = value.equals(Rational.one)
103
+ ? this.oneVar
104
+ : value.isZero()
105
+ ? this.zeroVar
106
+ : (this.value2var.get(`true:${value}`) ?? this.value2var.get(`false:${value}`));
107
+ if (thVar === undefined || this.solver.getExternal(column) < 0) return;
108
+ this.addEq(this.registerVar(thVar), column, explanation, true);
109
+ }
110
+
111
+ // mk_literal: the literal of an inequality of nla, over a bound or equality atom.
112
+ private mkNlaLiteral(ineq: Ineq) {
113
+ // scoped_auxiliary: the bounds of the atom are auxiliary constraints.
114
+ const constraints = this.solver.constraints;
115
+ constraints.isAuxiliaryMode = true;
116
+ const literal = this.mkNlaLiteralCore(ineq);
117
+ constraints.isAuxiliaryMode = false;
118
+ return literal;
119
+ }
120
+
121
+ private mkNlaLiteralCore(ineq: Ineq) {
122
+ const kind = ineq.cmp;
123
+ if (kind === KIND_EQ || kind === KIND_NE) {
124
+ const atom = this.mkTermEq(ineq.term, ineq.rs);
125
+ const literal = this.context.getLiteral(atom);
126
+ return kind === KIND_NE ? negate(literal) : literal;
127
+ }
128
+ const isLower = kind === KIND_LT || kind === KIND_GE;
129
+ const literal = this.context.getLiteral(this.mkBound(ineq.term, ineq.rs, isLower));
130
+ return kind === KIND_LT || kind === KIND_GT ? negate(literal) : literal;
131
+ }
132
+
133
+ // mk_eq: the atom term = offset.
134
+ private mkTermEq(term: LarTerm, offset: Rational) {
135
+ const manager = this.manager;
136
+ const coeffs = this.getTermCoeffs(term);
137
+ const isInt =
138
+ offset.isInt() && coeffs.every((entry) => this.isIntVar(entry[0]) && entry[1].isInt());
139
+ const left = this.coeffsToApp(coeffs, isInt);
140
+ const right = manager.mkNumeralOfSort(offset, isInt ? SORT_INT : SORT_REAL);
141
+ if (left === right) return manager.trueExpr;
142
+ const atom = manager.mkEq(left, right);
143
+ this.context.internalize(atom, true);
144
+ this.context.markAsRelevant(atom);
145
+ return atom;
146
+ }
147
+
148
+ // false_case_of_check_nla and set_conflict_or_lemma: the lemma as a theory axiom, unless one of
149
+ // its literals is already true.
150
+ private falseCaseOfCheckNla(lemma: Lemma) {
151
+ const context = this.context;
152
+ const literals = lemma.ineqs.map((ineq) => negate(this.mkNlaLiteral(ineq)));
153
+ this.resetEvidence();
154
+ this.coreLiterals.push(...literals);
155
+ this.numConflicts++;
156
+ for (const constraint of lemma.expl) this.setEvidence(constraint);
157
+ const clause: Literal[] = [];
158
+ for (const literal of this.coreLiterals) {
159
+ const negated = negate(literal);
160
+ clause.push(negated);
161
+ context.markLiteralAsRelevant(negated);
162
+ if (context.getAssignment(negated) === L_TRUE) return;
163
+ }
164
+ context.mkThAxiom(clause);
165
+ }
166
+
167
+ // check_lia: whether the integer solver found the integer columns integral.
168
+ private isLiaSat() {
169
+ if (this.context.checkCanceled()) return false;
170
+ const move = this.lia.check();
171
+ if (move.kind === "branch") this.mkBound(this.lia.term, move.offset, !move.isUpper);
172
+ else if (move.kind === "cut") {
173
+ this.resetEvidence();
174
+ for (const constraint of this.lia.explanation) this.setEvidence(constraint);
175
+ const atom = this.mkBound(this.lia.term, move.offset, !move.isUpper);
176
+ this.context.assign(
177
+ this.context.getLiteral(atom),
178
+ new TheoryJustification(this.coreLiterals, []),
179
+ );
180
+ } else if (move.kind === "conflict") {
181
+ this.explanation.clear();
182
+ this.explanation.addExplanation(this.lia.explanation);
183
+ this.setConflict();
184
+ }
185
+ return move.kind === "sat";
186
+ }
187
+
188
+ // mk_bound: the atom of a bound on an lp term, over the theory variables of its columns.
189
+ private mkBound(lpTerm: LarTerm, inputOffset: Rational, inputIsLower: boolean) {
190
+ const manager = this.manager;
191
+ const context = this.context;
192
+ let coeffs = this.getTermCoeffs(lpTerm);
193
+ let offset = inputOffset;
194
+ let isLower = inputIsLower;
195
+ let lcm = offset.den;
196
+ const isInt = coeffs.every((entry) => this.isIntVar(entry[0]));
197
+ if (isInt) {
198
+ for (const entry of coeffs) lcm = getLcm(lcm, entry[1].den);
199
+ if (lcm !== 1n) {
200
+ const scale = Rational.of(lcm);
201
+ offset = offset.mul(scale);
202
+ coeffs = coeffs.map((entry) => [entry[0], entry[1].mul(scale)]);
203
+ }
204
+ let gcd = 0n;
205
+ for (const entry of coeffs) gcd = getGcd(gcd, entry[1].num);
206
+ if (gcd !== 0n && gcd !== 1n) {
207
+ const divisor = Rational.of(gcd);
208
+ coeffs = coeffs.map((entry) => [entry[0], entry[1].div(divisor)]);
209
+ offset = isLower ? offset.div(divisor).ceil() : offset.div(divisor).floor();
210
+ }
211
+ }
212
+ if (coeffs.length > 0 && coeffs[0][1].isNegative()) {
213
+ offset = offset.neg();
214
+ isLower = !isLower;
215
+ coeffs = coeffs.map((entry) => [entry[0], entry[1].neg()]);
216
+ }
217
+ const sort = isInt ? SORT_INT : SORT_REAL;
218
+ const term = this.coeffsToApp(coeffs, isInt);
219
+ const atom = manager.mkApp(
220
+ isLower ? OP_GE : OP_LE,
221
+ [term, manager.mkNumeralOfSort(offset, sort)],
222
+ SORT_BOOL,
223
+ );
224
+ context.internalize(atom, true);
225
+ context.markAsRelevant(atom);
226
+ return atom;
227
+ }
228
+
229
+ // coeffs2app: the sum of the expressions of theory variables times coefficients, with Int
230
+ // expressions of a Real sum coerced to Real.
231
+ private coeffsToApp(coeffs: [number, Rational][], isInt: boolean) {
232
+ const manager = this.manager;
233
+ const sort = isInt ? SORT_INT : SORT_REAL;
234
+ const summands = coeffs
235
+ .filter((entry) => !entry[1].isZero())
236
+ .map((entry) => {
237
+ const original = this.getExpr(entry[0]);
238
+ const expr =
239
+ !isInt && manager.isInt(original)
240
+ ? manager.mkApp(OP_TO_REAL, [original], SORT_REAL)
241
+ : original;
242
+ return entry[1].equals(Rational.one)
243
+ ? expr
244
+ : manager.mkApp(OP_MUL, [manager.mkNumeralOfSort(entry[1], sort), expr], sort);
245
+ });
246
+ return summands.length === 0
247
+ ? manager.mkNumeralOfSort(Rational.zero, sort)
248
+ : summands.length === 1
249
+ ? summands[0]
250
+ : manager.mkApp(OP_ADD, summands, sort);
251
+ }
252
+ }