tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545

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 (538) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +58 -54
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +4 -1
  8. package/dist/index.d.ts +4 -1
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +45 -44
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +3 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +336 -88
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/dependencies.ts +23 -2
  36. package/src/dfid.ts +9 -2
  37. package/src/environment.ts +27 -5
  38. package/src/errors.ts +30 -3
  39. package/src/evaluate.ts +9 -3
  40. package/src/exit-codes.ts +5 -2
  41. package/src/instances.ts +1 -1
  42. package/src/levels.ts +3 -2
  43. package/src/lexer.ts +5 -3
  44. package/src/liveness-checker.ts +572 -204
  45. package/src/liveness.ts +47 -32
  46. package/src/obligations/action.ts +10 -6
  47. package/src/obligations/anonymize.ts +33 -14
  48. package/src/obligations/enabled-axioms.ts +218 -0
  49. package/src/obligations/equality.ts +1 -3
  50. package/src/obligations/expression.ts +18 -6
  51. package/src/obligations/format.ts +0 -2
  52. package/src/obligations/generate.ts +22 -17
  53. package/src/obligations/index.ts +36 -6
  54. package/src/obligations/levels.ts +24 -11
  55. package/src/obligations/module.ts +1 -3
  56. package/src/obligations/normalize.ts +24 -13
  57. package/src/obligations/operators.ts +0 -2
  58. package/src/obligations/pragma.ts +53 -16
  59. package/src/obligations/printer.ts +43 -13
  60. package/src/obligations/proof.ts +3 -2
  61. package/src/obligations/regroup.ts +0 -2
  62. package/src/obligations/simplify.ts +17 -7
  63. package/src/obligations/source.ts +71 -17
  64. package/src/obligations/subexpression.ts +45 -18
  65. package/src/obligations/substitution.ts +1 -3
  66. package/src/obligations/temporal.ts +0 -2
  67. package/src/obligations/tuples.ts +0 -2
  68. package/src/parallel-worker.ts +8 -2
  69. package/src/parallel.ts +7 -2
  70. package/src/parser.ts +633 -186
  71. package/src/pretty-print.ts +1 -1
  72. package/src/prover/deciders.ts +11 -8
  73. package/src/prover/isabelle/decide.ts +3 -25
  74. package/src/prover/isabelle/encode.ts +71 -41
  75. package/src/prover/isabelle/isar/attrib.ts +250 -0
  76. package/src/prover/isabelle/isar/context.ts +335 -0
  77. package/src/prover/isabelle/isar/induct.ts +382 -0
  78. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  79. package/src/prover/isabelle/isar/method.ts +506 -198
  80. package/src/prover/isabelle/isar/proof.ts +570 -14
  81. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  82. package/src/prover/isabelle/isar/theory.ts +479 -69
  83. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  84. package/src/prover/isabelle/isar/type-check.ts +83 -8
  85. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  91. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  92. package/src/prover/isabelle/provers/classical.ts +45 -20
  93. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  94. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  95. package/src/prover/isabelle/pure/consts.ts +0 -2
  96. package/src/prover/isabelle/pure/conv.ts +0 -2
  97. package/src/prover/isabelle/pure/drule.ts +63 -4
  98. package/src/prover/isabelle/pure/envir.ts +0 -2
  99. package/src/prover/isabelle/pure/goal.ts +1 -3
  100. package/src/prover/isabelle/pure/logic.ts +0 -2
  101. package/src/prover/isabelle/pure/name.ts +0 -2
  102. package/src/prover/isabelle/pure/net.ts +0 -2
  103. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  104. package/src/prover/isabelle/pure/pattern.ts +0 -2
  105. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  106. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  107. package/src/prover/isabelle/pure/search.ts +0 -2
  108. package/src/prover/isabelle/pure/seq.ts +0 -2
  109. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  110. package/src/prover/isabelle/pure/table.ts +0 -2
  111. package/src/prover/isabelle/pure/tactic.ts +0 -2
  112. package/src/prover/isabelle/pure/tactical.ts +0 -2
  113. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  114. package/src/prover/isabelle/pure/term.ts +0 -2
  115. package/src/prover/isabelle/pure/thm.ts +0 -2
  116. package/src/prover/isabelle/pure/type.ts +0 -2
  117. package/src/prover/isabelle/pure/unify.ts +0 -2
  118. package/src/prover/isabelle/pure/variable.ts +0 -2
  119. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  120. package/src/prover/isabelle/tla/context.ts +51 -9
  121. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  122. package/src/prover/isabelle/tla/logic.ts +40 -1
  123. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  124. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  125. package/src/prover/ocaml.ts +4 -1
  126. package/src/prover/prep/action.ts +19 -12
  127. package/src/prover/prep/enabled-axioms.ts +11 -2
  128. package/src/prover/prep/methods.ts +159 -50
  129. package/src/prover/prep/normalize.ts +38 -9
  130. package/src/prover/prove.ts +343 -65
  131. package/src/prover/ptl/decide.ts +95 -50
  132. package/src/prover/ptl/encode.ts +2 -3
  133. package/src/prover/ptl/tableau.ts +28 -2
  134. package/src/prover/smt/arithmetic.ts +310 -0
  135. package/src/prover/smt/axioms.ts +12 -8
  136. package/src/prover/smt/context.ts +42 -6
  137. package/src/prover/smt/data.ts +191 -84
  138. package/src/prover/smt/encode.ts +122 -43
  139. package/src/prover/smt/extensionality.ts +5 -3
  140. package/src/prover/smt/flatten.ts +4 -6
  141. package/src/prover/smt/format.ts +28 -4
  142. package/src/prover/smt/instances.ts +7 -1
  143. package/src/prover/smt/layout.ts +91 -0
  144. package/src/prover/smt/rewrite.ts +483 -116
  145. package/src/prover/smt/simplify.ts +441 -0
  146. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  147. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  148. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  149. package/src/prover/smt/solver/act-cache.ts +0 -1
  150. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  151. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  152. package/src/prover/smt/solver/aig.ts +889 -0
  153. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  154. package/src/prover/smt/solver/arith-terms.ts +121 -0
  155. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  156. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  157. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  158. package/src/prover/smt/solver/ast-lt.ts +165 -11
  159. package/src/prover/smt/solver/ast-util.ts +160 -2
  160. package/src/prover/smt/solver/ast.ts +1448 -41
  161. package/src/prover/smt/solver/auf-solver.ts +0 -1
  162. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  163. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  164. package/src/prover/smt/solver/bound-manager.ts +196 -0
  165. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  166. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  167. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  168. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  169. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  170. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  171. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  172. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  173. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  174. package/src/prover/smt/solver/card2bv.ts +109 -0
  175. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  176. package/src/prover/smt/solver/cg-table.ts +39 -25
  177. package/src/prover/smt/solver/check-logic.ts +330 -0
  178. package/src/prover/smt/solver/clause.ts +0 -1
  179. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  180. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  181. package/src/prover/smt/solver/context.ts +533 -114
  182. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  183. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  184. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  185. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  186. package/src/prover/smt/solver/demodulator.ts +786 -0
  187. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  188. package/src/prover/smt/solver/der.ts +38 -10
  189. package/src/prover/smt/solver/diff-neq.ts +205 -0
  190. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  191. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  192. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  193. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  194. package/src/prover/smt/solver/e-matching.ts +6 -7
  195. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  196. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  197. package/src/prover/smt/solver/enode.ts +100 -3
  198. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  199. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  200. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  201. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  202. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  203. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  204. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  205. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  206. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  207. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  208. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  209. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  210. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  211. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  212. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  213. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  214. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  215. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  216. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  217. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  218. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  219. package/src/prover/smt/solver/expr-ref.ts +0 -1
  220. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  221. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  222. package/src/prover/smt/solver/factor.ts +163 -0
  223. package/src/prover/smt/solver/fd-solver.ts +267 -0
  224. package/src/prover/smt/solver/fingerprints.ts +15 -15
  225. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  226. package/src/prover/smt/solver/flat-literals.ts +0 -1
  227. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  228. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  229. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  230. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  231. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  232. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  233. package/src/prover/smt/solver/goal.ts +177 -15
  234. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  235. package/src/prover/smt/solver/guard-set.ts +219 -0
  236. package/src/prover/smt/solver/hash.ts +0 -1
  237. package/src/prover/smt/solver/hashtable.ts +30 -16
  238. package/src/prover/smt/solver/inf-eps.ts +63 -0
  239. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  240. package/src/prover/smt/solver/internalizer.ts +109 -36
  241. package/src/prover/smt/solver/lackr.ts +381 -0
  242. package/src/prover/smt/solver/lbool.ts +0 -1
  243. package/src/prover/smt/solver/lia2card.ts +268 -0
  244. package/src/prover/smt/solver/lia2pb.ts +154 -0
  245. package/src/prover/smt/solver/literal.ts +0 -1
  246. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  247. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  248. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  249. package/src/prover/smt/solver/lp/containers.ts +7 -2
  250. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  251. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  252. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  253. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  254. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  255. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  256. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  257. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  259. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  260. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  261. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  262. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  263. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  264. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  265. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  266. package/src/prover/smt/solver/lp/nex.ts +2 -2
  267. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  268. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  269. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  270. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  271. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  272. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  274. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  278. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  281. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  282. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  283. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  284. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  286. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  287. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  288. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  289. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  290. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  291. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  292. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  293. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  294. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  295. package/src/prover/smt/solver/macro-finder.ts +530 -0
  296. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  297. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  298. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  299. package/src/prover/smt/solver/max-cliques.ts +105 -0
  300. package/src/prover/smt/solver/maxcore.ts +309 -0
  301. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  302. package/src/prover/smt/solver/maxlex.ts +115 -0
  303. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  304. package/src/prover/smt/solver/maxsmt.ts +92 -0
  305. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  306. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  307. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  308. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  309. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  310. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  311. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  312. package/src/prover/smt/solver/model-checker.ts +17 -26
  313. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  314. package/src/prover/smt/solver/model-finder.ts +0 -1
  315. package/src/prover/smt/solver/model-generator.ts +59 -30
  316. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  317. package/src/prover/smt/solver/model-printer.ts +214 -0
  318. package/src/prover/smt/solver/mpf.ts +709 -0
  319. package/src/prover/smt/solver/mus.ts +50 -0
  320. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  321. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  322. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  323. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  324. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  325. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  326. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  327. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  328. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  329. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  330. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  331. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  332. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  333. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  334. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  335. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  336. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  337. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  338. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  339. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  340. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  341. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  342. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  343. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  344. package/src/prover/smt/solver/nlqsat.ts +484 -0
  345. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  346. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  347. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  348. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  349. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  350. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  351. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  352. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  353. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  354. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  355. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  356. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  357. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  358. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  359. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  360. package/src/prover/smt/solver/nnf.ts +105 -23
  361. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  362. package/src/prover/smt/solver/occf.ts +97 -0
  363. package/src/prover/smt/solver/opt-context.ts +792 -0
  364. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  365. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  366. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  367. package/src/prover/smt/solver/opt-solver.ts +311 -0
  368. package/src/prover/smt/solver/opt-value.ts +55 -0
  369. package/src/prover/smt/solver/optsmt.ts +692 -0
  370. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  371. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  372. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  373. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  374. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  375. package/src/prover/smt/solver/probes.ts +511 -0
  376. package/src/prover/smt/solver/propagate-values.ts +37 -21
  377. package/src/prover/smt/solver/proto-model.ts +650 -17
  378. package/src/prover/smt/solver/pull-quant.ts +28 -12
  379. package/src/prover/smt/solver/purify-arith.ts +632 -0
  380. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  381. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  382. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  383. package/src/prover/smt/solver/qe-lite.ts +37 -17
  384. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  385. package/src/prover/smt/solver/qe.ts +1499 -0
  386. package/src/prover/smt/solver/qel.ts +25 -0
  387. package/src/prover/smt/solver/qi-queue.ts +0 -1
  388. package/src/prover/smt/solver/qsat.ts +814 -0
  389. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  390. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  391. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  392. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  393. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  394. package/src/prover/smt/solver/random-gen.ts +0 -1
  395. package/src/prover/smt/solver/rational.ts +45 -1
  396. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  397. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  398. package/src/prover/smt/solver/reduce-args.ts +225 -0
  399. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  400. package/src/prover/smt/solver/ref-vector.ts +0 -1
  401. package/src/prover/smt/solver/relevancy.ts +1 -2
  402. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  403. package/src/prover/smt/solver/rewriter.ts +475 -36
  404. package/src/prover/smt/solver/rlimit.ts +38 -2
  405. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  406. package/src/prover/smt/solver/sat/big.ts +177 -0
  407. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  408. package/src/prover/smt/solver/sat/clause.ts +203 -0
  409. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  410. package/src/prover/smt/solver/sat/config.ts +122 -0
  411. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  412. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  413. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  414. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  415. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  416. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  417. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  418. package/src/prover/smt/solver/sat/probing.ts +170 -0
  419. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  420. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  421. package/src/prover/smt/solver/sat/scc.ts +142 -0
  422. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  423. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  424. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  425. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  426. package/src/prover/smt/solver/search-tree.ts +284 -0
  427. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  428. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  429. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  430. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  431. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  432. package/src/prover/smt/solver/seq-factory.ts +89 -0
  433. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  434. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  435. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  436. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  437. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  438. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  439. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  440. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  441. package/src/prover/smt/solver/seq-subset.ts +165 -0
  442. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  443. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  444. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  445. package/src/prover/smt/solver/smt-logics.ts +66 -0
  446. package/src/prover/smt/solver/smt-setup.ts +496 -0
  447. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  448. package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
  449. package/src/prover/smt/solver/smtlib-script.ts +1702 -0
  450. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  451. package/src/prover/smt/solver/solver.ts +113 -22
  452. package/src/prover/smt/solver/static-features.ts +314 -0
  453. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  454. package/src/prover/smt/solver/tactic.ts +1995 -0
  455. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  456. package/src/prover/smt/solver/theory-array.ts +1240 -0
  457. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  458. package/src/prover/smt/solver/theory-char.ts +355 -0
  459. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  460. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  461. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  462. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  463. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  464. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  465. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  466. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  467. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  468. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  469. package/src/prover/smt/solver/theory-lra.ts +188 -2
  470. package/src/prover/smt/solver/theory-pb.ts +933 -0
  471. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  472. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  473. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  474. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  475. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  476. package/src/prover/smt/solver/theory-seq.ts +961 -0
  477. package/src/prover/smt/solver/theory.ts +189 -0
  478. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  479. package/src/prover/smt/solver/var-subst.ts +36 -14
  480. package/src/prover/smt/table.ts +3 -2
  481. package/src/prover/smt/types.ts +146 -0
  482. package/src/prover/tlapm/cache.ts +29 -8
  483. package/src/prover/tlapm-library.ts +3208 -0
  484. package/src/prover/verdict.ts +2 -0
  485. package/src/prover/zenon/decide.ts +10 -7
  486. package/src/prover/zenon/encode.ts +0 -2
  487. package/src/prover/zenon/eqrel.ts +0 -2
  488. package/src/prover/zenon/equality-rules.ts +24 -2
  489. package/src/prover/zenon/expr.ts +21 -2
  490. package/src/prover/zenon/index-table.ts +7 -4
  491. package/src/prover/zenon/isar-case.ts +1 -3
  492. package/src/prover/zenon/isar.ts +2 -4
  493. package/src/prover/zenon/llproof.ts +0 -2
  494. package/src/prover/zenon/mltoll.ts +0 -2
  495. package/src/prover/zenon/node.ts +20 -5
  496. package/src/prover/zenon/parse.ts +6 -2
  497. package/src/prover/zenon/phrase.ts +1 -3
  498. package/src/prover/zenon/proof.ts +0 -2
  499. package/src/prover/zenon/propositional-rules.ts +0 -2
  500. package/src/prover/zenon/rules.ts +2 -3
  501. package/src/prover/zenon/search.ts +7 -5
  502. package/src/prover/zenon/tla/functions.ts +0 -2
  503. package/src/prover/zenon/tla/llproof.ts +0 -2
  504. package/src/prover/zenon/tla/records.ts +0 -2
  505. package/src/prover/zenon/tla/rewrites.ts +0 -2
  506. package/src/prover/zenon/tla/sets.ts +7 -8
  507. package/src/prover/zenon/tla/terms.ts +0 -2
  508. package/src/prover/zenon/tla/tla.ts +0 -2
  509. package/src/resolve.ts +72 -36
  510. package/src/runtime.ts +6 -0
  511. package/src/sany/generation.ts +1 -13
  512. package/src/sany/generator-definitions.ts +1 -1
  513. package/src/sany/generator-expressions.ts +9 -17
  514. package/src/sany/generator-proofs.ts +1 -1
  515. package/src/sany/generator.ts +1 -1
  516. package/src/sany/levels.ts +0 -2
  517. package/src/sany/linter.ts +0 -2
  518. package/src/search.ts +198 -45
  519. package/src/simulate.ts +3 -0
  520. package/src/standard-definitions.ts +4 -0
  521. package/src/state-graph.ts +0 -2
  522. package/src/subexpressions.ts +4 -2
  523. package/src/successors.ts +1 -1
  524. package/src/symmetry.ts +2 -2
  525. package/src/tableau.ts +2 -2
  526. package/src/tlc/fingerprint.ts +81 -9
  527. package/src/tlc/jar-data.ts +12 -0
  528. package/src/tlc/order.ts +14 -3
  529. package/src/tlc/summary.ts +29 -14
  530. package/src/tlc/tlcext-operators.ts +61 -16
  531. package/src/tlc/trace-spec.ts +2 -3
  532. package/src/typed-tier.ts +6541 -0
  533. package/src/typescript/types.ts +2 -2
  534. package/src/values.ts +1 -1
  535. package/src/prover/isabelle/isar/statement.ts +0 -52
  536. package/src/prover/smt/solver/z3-license.txt +0 -10
  537. package/src/prover/tlaps-module.ts +0 -510
  538. package/src/prover/zenon/LICENSE +0 -32
@@ -1,10 +1,31 @@
1
- // Ported from Z3 (src/smt/smt_context.cpp), MIT license, see z3-license.txt.
2
1
  import type { AssertedFormulas } from "./asserted-formulas";
3
- import { AstManager, FAMILY_ARITH, KIND_APP, KIND_QUANTIFIER, KIND_VAR } from "./ast";
2
+ import {
3
+ AstManager,
4
+ FAMILY_ARITH,
5
+ FAMILY_ARRAY,
6
+ FAMILY_BASIC,
7
+ FAMILY_BV,
8
+ FAMILY_CHAR,
9
+ FAMILY_DATATYPE,
10
+ FAMILY_FINITE_SET,
11
+ FAMILY_FPA,
12
+ FAMILY_PB,
13
+ FAMILY_POLY,
14
+ FAMILY_RECFUN,
15
+ FAMILY_SEQ,
16
+ KIND_APP,
17
+ KIND_QUANTIFIER,
18
+ KIND_VAR,
19
+ OP_IMPLIES,
20
+ OP_ITE,
21
+ OP_NOT,
22
+ SORT_BOOL,
23
+ } from "./ast";
4
24
  import { getCongruenceJustification, isCongruent } from "./cg-table";
5
25
  import { BJustification, type Clause, CLS_LEARNED, CLS_TH_LEMMA, HEADER_SIZE } from "./clause";
6
26
  import { ConflictResolution } from "./conflict-resolution";
7
27
  import { DynAckManager } from "./dyn-ack";
28
+ import { FingerprintSet } from "./fingerprints";
8
29
  import {
9
30
  Enode,
10
31
  EqConflictJustification,
@@ -26,34 +47,55 @@ import {
26
47
  UNDO_TH_VAR,
27
48
  } from "./internalizer";
28
49
  import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
29
- import { BoolVar, getVar, isNegated, Literal, mkLiteral, negate } from "./literal";
50
+ import { MaxCliques } from "./max-cliques";
51
+ import { BoolVar, getVar, isNegated, Literal, mkLiteral, negate, toBoolVar } from "./literal";
52
+ import type { MacroManager } from "./macro-finder";
30
53
  import { mkModel } from "./model-generator";
54
+ import { TheoryRecfun } from "./theory-recfun";
31
55
  import type { GeneratedModel } from "./model-generator";
32
56
  import type { ProtoModel } from "./proto-model";
33
57
  import { DefaultQuantifierManager } from "./quantifier-manager";
58
+ import { FC_CONTINUE, FC_DONE, FC_GIVEUP, Theory } from "./theory";
59
+ import { TheoryArray } from "./theory-array";
60
+ import { TheoryBv } from "./theory-bv";
61
+ import { TheoryFpa } from "./theory-fpa";
62
+ import { TheoryChar } from "./theory-char";
63
+ import { TheorySeq } from "./theory-seq";
64
+ import { TheoryDatatype } from "./theory-datatype";
65
+ import { TheoryFiniteSet } from "./theory-finite-set";
66
+ import { TheoryPb } from "./theory-pb";
67
+ import { TheoryPolymorphism } from "./theory-polymorphism";
34
68
  import { TheoryLra } from "./theory-lra";
35
69
  import { shrink } from "./array";
36
-
37
- export const FC_DONE = 0;
38
- export const FC_CONTINUE = 1;
39
- export const FC_GIVEUP = 2;
70
+ import {
71
+ DEFAULT_CONFIG,
72
+ getSmtConfig,
73
+ PS_ALWAYS_FALSE,
74
+ PS_CACHING_CONSERVATIVE,
75
+ PS_CACHING_CONSERVATIVE2,
76
+ PS_THEORY,
77
+ RS_GEOMETRIC,
78
+ RS_LUBY,
79
+ type SmtSetup,
80
+ } from "./smt-setup";
81
+ import type { KernelParams } from "./solver";
40
82
 
41
83
  const ACTIVITY_LIMIT = 1e100;
42
84
  const INV_ACTIVITY_LIMIT = 1e-100;
43
85
  const INV_DECAY = 1.052;
44
86
  const RESTART_INITIAL = 100;
45
- const RESTART_FACTOR = 1.1;
46
87
  const PHASE_CACHING_ON = 400;
47
88
  const PHASE_CACHING_OFF = 100;
48
89
  const AGILITY_FACTOR = 0.9999;
49
90
  const LEMMA_GC_INITIAL = 5000;
50
- const NUM_ARITH_FINAL_CHECK_LEVELS = 2;
51
91
  const NEW_OLD_RATIO = 16;
52
92
  const OLD_CLAUSE_ACTIVITY = 500;
53
93
  const NEW_CLAUSE_RELEVANCY = 45;
54
94
  const OLD_CLAUSE_RELEVANCY = 6;
55
95
  const RESTART_AGILITY_THRESHOLD = 0.18;
56
96
 
97
+ export const MBQI_MAX_ITERATIONS = 1000;
98
+
57
99
  export const CHECK_MODEL_SAT = 0;
58
100
  export const CHECK_MODEL_UNKNOWN = 1;
59
101
  export const CHECK_MODEL_RESTART = 2;
@@ -62,12 +104,14 @@ const FAILURE_OK = 0;
62
104
  const FAILURE_THEORY = 1;
63
105
  const FAILURE_QUANTIFIERS = 2;
64
106
  const FAILURE_CANCELED = 3;
107
+ const FAILURE_NUM_CONFLICTS = 4;
65
108
 
66
109
  type SearchFailure =
67
110
  | typeof FAILURE_OK
68
111
  | typeof FAILURE_THEORY
69
112
  | typeof FAILURE_QUANTIFIERS
70
- | typeof FAILURE_CANCELED;
113
+ | typeof FAILURE_CANCELED
114
+ | typeof FAILURE_NUM_CONFLICTS;
71
115
 
72
116
  type ModelState =
73
117
  | { kind: "none" }
@@ -75,14 +119,52 @@ type ModelState =
75
119
  | { kind: "proto"; generated: GeneratedModel }
76
120
  | { kind: "final"; generated: GeneratedModel; model: ProtoModel };
77
121
 
78
- interface SmtParams {
122
+ const THEORY_MAKERS = new Map<number, (context: Context) => Theory>([
123
+ [FAMILY_ARITH, (context) => new TheoryLra(context)],
124
+ [FAMILY_ARRAY, (context) => new TheoryArray(context)],
125
+ [FAMILY_BV, (context) => new TheoryBv(context)],
126
+ [FAMILY_DATATYPE, (context) => new TheoryDatatype(context)],
127
+ [FAMILY_RECFUN, (context) => new TheoryRecfun(context)],
128
+ [FAMILY_SEQ, (context) => new TheorySeq(context)],
129
+ [FAMILY_CHAR, (context) => new TheoryChar(context)],
130
+ [FAMILY_FPA, (context) => new TheoryFpa(context)],
131
+ [FAMILY_FINITE_SET, (context) => new TheoryFiniteSet(context)],
132
+ [FAMILY_POLY, (context) => new TheoryPolymorphism(context)],
133
+ [FAMILY_PB, (context) => new TheoryPb(context)],
134
+ ]);
135
+
136
+ // get_luby
137
+ const getLuby = (index: number): number => {
138
+ if (index === 1) return 1;
139
+ const exponent = Math.log(index + 1) / Math.log(2);
140
+ if (exponent === Math.floor(exponent + 0.5)) return 2 ** (exponent - 1);
141
+ return getLuby(index - 2 ** Math.floor(exponent) + 1);
142
+ };
143
+
144
+ const isValidAssumption = (manager: AstManager, expr: number) => {
145
+ if (manager.sorts[expr] !== SORT_BOOL) return false;
146
+ if (manager.isUninterpretedConst(expr)) return true;
147
+ if (manager.isNot(expr) && manager.isUninterpretedConst(manager.getArg(expr, 0))) return true;
148
+ if (manager.kinds[expr] !== KIND_APP || expr === manager.falseExpr) return false;
149
+ if (expr === manager.trueExpr) return true;
150
+ return manager.getFamily(expr) !== FAMILY_BASIC && manager.getNumArgs(expr) === 0;
151
+ };
152
+
153
+ export interface SmtParams {
79
154
  isMbqi: boolean;
155
+ mbqiMaxIterations: number;
80
156
  relevancyLevel: 0 | 2;
157
+ // The model checker's auxiliary context pretends every array operation is supported.
158
+ isArrayFakeSupport?: boolean;
81
159
  }
82
160
 
83
161
  export class Context extends Internalizer {
84
- theory!: TheoryLra;
162
+ arith: TheoryLra | undefined;
163
+ setup: SmtSetup | undefined;
164
+ readonly theories: Theory[] = [];
165
+ private theoryByFamily: (Theory | undefined)[] = [];
85
166
  readonly qmanager: DefaultQuantifierManager;
167
+ readonly fingerprints = new FingerprintSet(this.manager);
86
168
  readonly conflictResolution: ConflictResolution = new ConflictResolution(this);
87
169
  private readonly dynAck = new DynAckManager(this);
88
170
  private qhead = 0;
@@ -96,30 +178,91 @@ export class Context extends Internalizer {
96
178
  private bvarInc = 1;
97
179
  private agility = 0;
98
180
  private numConflicts = 0;
181
+ maxConflicts = Infinity;
99
182
  private numConflictsSinceRestart = 0;
100
183
  private numConflictsSinceLemmaGc = 0;
101
184
  private restartThreshold = RESTART_INITIAL;
102
185
  private restartOuterThreshold = RESTART_INITIAL;
103
186
  private isPhaseCacheOn = true;
104
187
  private phaseCounter = 0;
188
+ private phaseDefault = false;
189
+ private lubyIndex = 1;
105
190
  private finalCheckIndex = 0;
191
+ private literalAssumptions = new Map<Literal, number>();
192
+ unsatCore: number[] = [];
106
193
  private r1ParentGenerations = new Map<Enode, number>();
107
194
  private erasedGenerations = new Map<Enode, number>();
108
195
  private lastSearchFailure: SearchFailure = FAILURE_OK;
196
+ // As in Z3, a new search doesn't reset it.
197
+ reasonUnknown = "unknown";
198
+ private hasCaseSplit = true;
199
+ private incompleteTheories: Theory[] = [];
109
200
  private modelState: ModelState = { kind: "none" };
201
+ private asserted: AssertedFormulas | undefined;
202
+ macros: MacroManager | undefined;
203
+ hasQuantifiers = false;
110
204
 
111
- constructor(manager: AstManager, params: SmtParams) {
205
+ constructor(
206
+ manager: AstManager,
207
+ readonly params: SmtParams,
208
+ ) {
112
209
  super(manager, params.relevancyLevel > 0);
113
- this.qmanager = new DefaultQuantifierManager(this, params.isMbqi);
210
+ this.qmanager = new DefaultQuantifierManager(this);
211
+ }
212
+
213
+ // As in Z3, reading the parameters again drops the setup's tuning, but relevancy keeps the lower level.
214
+ updateParams(params: KernelParams) {
215
+ this.params.isMbqi = params.isMbqi;
216
+ this.params.mbqiMaxIterations = params.mbqiMaxIterations;
217
+ this.config = {
218
+ ...DEFAULT_CONFIG,
219
+ theories: this.config.theories,
220
+ isFindingMacros: params.isFindingMacros,
221
+ };
222
+ this.qmanager.updateParams();
223
+ }
224
+
225
+ // setup_context and setup_components. The setup's theories come in its order, then setup_card's.
226
+ setupContext(
227
+ setup: SmtSetup | undefined,
228
+ isUsingStaticFeatures: boolean,
229
+ asserted: AssertedFormulas,
230
+ ) {
231
+ const config = getSmtConfig(
232
+ this.manager,
233
+ setup,
234
+ isUsingStaticFeatures,
235
+ asserted.getFormulas(),
236
+ this.config,
237
+ );
238
+ this.setup = setup;
239
+ this.config = config;
240
+ if (config.relevancyLevel !== undefined) this.relevancy.isEnabled = config.relevancyLevel > 0;
241
+ for (const family of config.theories)
242
+ if (family !== FAMILY_POLY || this.manager.hasTypeVars) this.registerFamily(family);
243
+ this.registerFamily(FAMILY_PB);
244
+ asserted.setup(config);
114
245
  }
115
246
 
116
- setupContext() {
117
- this.theory = new TheoryLra(this);
118
- this.theory.init();
247
+ // register_plugin keeps the theory a family already has.
248
+ registerFamily(family: number) {
249
+ if (this.getTheory(family) !== undefined) return;
250
+ const theory = THEORY_MAKERS.get(family)!(this);
251
+ if (theory instanceof TheoryLra) this.arith = theory;
252
+ this.theories.push(theory);
253
+ this.theoryByFamily[theory.id] = theory;
254
+ theory.init();
255
+ for (let level = 0; level < this.scopeLevel; level++) theory.pushScopeEh();
256
+ }
257
+
258
+ getTheory(family: number) {
259
+ return family < 0 ? undefined : this.theoryByFamily[family];
119
260
  }
120
261
 
121
262
  checkCanceled() {
122
- return !this.manager.limit.inc();
263
+ if (this.manager.limit.inc()) return false;
264
+ this.lastSearchFailure = FAILURE_CANCELED;
265
+ return true;
123
266
  }
124
267
 
125
268
  assign(literal: Literal, justification: BJustification, isDecision = false) {
@@ -136,7 +279,7 @@ export class Context extends Internalizer {
136
279
  this.justifications[boolVar] = justification;
137
280
  this.setLevel(boolVar, this.scopeLevel);
138
281
  const isNegative = isNegated(literal);
139
- if (this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE)) {
282
+ if (this.config.isRestartAdaptive && this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE)) {
140
283
  this.agility *= AGILITY_FACTOR;
141
284
  if (!isDecision && this.hasBoolVarFlag(boolVar, BV_PHASE) === isNegative)
142
285
  this.agility += 1 - AGILITY_FACTOR;
@@ -244,7 +387,7 @@ export class Context extends Internalizer {
244
387
  }
245
388
  }
246
389
  } else if (this.hasBoolVarFlag(boolVar, BV_THEORY))
247
- this.theory.assignEh(boolVar, value === L_TRUE);
390
+ this.getTheory(this.getBoolVarTheory(boolVar))?.assignEh(boolVar, value === L_TRUE);
248
391
  else if (this.hasBoolVarFlag(boolVar, BV_QUANTIFIER) && value === L_TRUE)
249
392
  this.qmanager.assignEh(this.boolVar2Expr[boolVar]);
250
393
  if (this.isInconsistent()) return false;
@@ -294,8 +437,14 @@ export class Context extends Internalizer {
294
437
  if (this.manager.kinds[expr] !== KIND_APP) return;
295
438
  const node = this.exprToEnode[expr];
296
439
  if (node !== undefined) this.qmanager.relevantEh(node);
297
- if (this.manager.getFamily(expr) === FAMILY_ARITH || (node !== undefined && node.thVar >= 0))
298
- this.theory.relevantEh(expr);
440
+ const propagated = this.getTheory(this.manager.getFamily(expr));
441
+ propagated?.relevantEh(expr);
442
+ if (node === undefined || node.thVar < 0) return;
443
+ if (this.theoryByFamily[node.thId] !== propagated)
444
+ this.theoryByFamily[node.thId]?.relevantEh(expr);
445
+ for (let cell = node.thNext; cell !== null; cell = cell.next)
446
+ if (this.theoryByFamily[cell.thId] !== propagated)
447
+ this.theoryByFamily[cell.thId]?.relevantEh(expr);
299
448
  }
300
449
 
301
450
  private propagateRelevancy(qhead: number) {
@@ -308,25 +457,38 @@ export class Context extends Internalizer {
308
457
 
309
458
  private propagateThEqs() {
310
459
  const queue = this.thEqQueue;
311
- for (let index = 0; index < queue.length && !this.isInconsistent(); index += 2)
312
- this.theory.newEqEh(queue[index], queue[index + 1]);
460
+ for (let index = 0; index < queue.length && !this.isInconsistent(); index += 3)
461
+ this.theoryByFamily[queue[index]]?.newEqEh(queue[index + 1], queue[index + 2]);
313
462
  this.thEqQueue = [];
314
463
  }
315
464
 
316
465
  private propagateThDiseqs() {
317
466
  const queue = this.thDiseqQueue;
318
- for (let index = 0; index < queue.length && !this.isInconsistent(); index += 2)
319
- this.theory.newDiseqEh(queue[index], queue[index + 1]);
467
+ for (let index = 0; index < queue.length && !this.isInconsistent(); index += 3)
468
+ this.theoryByFamily[queue[index]]?.newDiseqEh(queue[index + 1], queue[index + 2]);
320
469
  this.thDiseqQueue = [];
321
470
  }
322
471
 
472
+ private canTheoriesPropagate() {
473
+ for (const theory of this.theories) if (theory.canPropagate()) return true;
474
+ return false;
475
+ }
476
+
477
+ private propagateTheories() {
478
+ for (const theory of this.theories) {
479
+ theory.propagate();
480
+ if (this.isInconsistent()) return false;
481
+ }
482
+ return true;
483
+ }
484
+
323
485
  canPropagate() {
324
486
  return (
325
487
  this.qhead !== this.assignedLiterals.length ||
326
488
  this.relevancy.canPropagate() ||
327
489
  this.atomPropagationQueue.length > 0 ||
328
490
  this.qmanager.canPropagate() ||
329
- this.theory.canPropagate() ||
491
+ this.canTheoriesPropagate() ||
330
492
  this.eqPropagationQueue.length > 0 ||
331
493
  this.thEqQueue.length > 0 ||
332
494
  this.thDiseqQueue.length > 0
@@ -345,8 +507,7 @@ export class Context extends Internalizer {
345
507
  this.propagateThEqs();
346
508
  this.propagateThDiseqs();
347
509
  if (this.isInconsistent()) return false;
348
- this.theory.propagate();
349
- if (this.isInconsistent()) return false;
510
+ if (!this.propagateTheories()) return false;
350
511
  if (!this.checkCanceled()) this.qmanager.propagate();
351
512
  if (this.isInconsistent()) return false;
352
513
  if (this.isResourceLimitExceeded()) {
@@ -357,9 +518,12 @@ export class Context extends Internalizer {
357
518
  }
358
519
  }
359
520
 
360
- private getClosestVar(start: Enode) {
361
- for (let node: Enode | null = start; node !== null; node = node.transTarget)
362
- if (node.thVar >= 0) return node.thVar;
521
+ private getClosestVar(start: Enode, thId: number) {
522
+ if (thId < 0) return -1;
523
+ for (let node: Enode | null = start; node !== null; node = node.transTarget) {
524
+ const thVar = node.getThVar(thId);
525
+ if (thVar >= 0) return thVar;
526
+ }
363
527
  return -1;
364
528
  }
365
529
 
@@ -379,17 +543,19 @@ export class Context extends Internalizer {
379
543
  }
380
544
  }
381
545
 
382
- private pushNewThEq(first: number, second: number) {
383
- this.thEqQueue.push(first, second);
546
+ private pushNewThEq(thId: number, first: number, second: number) {
547
+ this.thEqQueue.push(thId, first, second);
384
548
  }
385
549
 
386
- private pushNewThDiseq(first: number, second: number) {
387
- const theory = this.theory;
550
+ private pushNewThDiseq(thId: number, first: number, second: number) {
551
+ const theory = this.theoryByFamily[thId];
552
+ if (theory === undefined) return;
388
553
  if (theory.getEnode(first).isInterpreted && theory.getEnode(second).isInterpreted) return;
389
- this.thDiseqQueue.push(first, second);
554
+ this.thDiseqQueue.push(thId, first, second);
390
555
  }
391
556
 
392
- private pushNewThDiseqs(root: Enode, thVar: number) {
557
+ private pushNewThDiseqs(root: Enode, thVar: number, thId: number) {
558
+ if (!this.theoryByFamily[thId]?.useDiseqs()) return;
393
559
  for (const parent of root.parents) {
394
560
  if (!parent.isEq) continue;
395
561
  if (this.assignment[mkLiteral(this.getBoolVar(parent.owner))] !== L_FALSE) continue;
@@ -400,10 +566,10 @@ export class Context extends Internalizer {
400
566
  lhs = rhs;
401
567
  rhs = saved;
402
568
  }
403
- const rhsVar = this.getClosestVar(rhs);
404
- const lhsVar = this.getClosestVar(lhs);
569
+ const rhsVar = this.getClosestVar(rhs, thId);
570
+ const lhsVar = this.getClosestVar(lhs, thId);
405
571
  const finalVar = lhsVar >= 0 ? lhsVar : thVar;
406
- if (rhsVar >= 0 && finalVar !== rhsVar) this.pushNewThDiseq(finalVar, rhsVar);
572
+ if (rhsVar >= 0 && finalVar !== rhsVar) this.pushNewThDiseq(thId, finalVar, rhsVar);
407
573
  }
408
574
  }
409
575
 
@@ -411,38 +577,65 @@ export class Context extends Internalizer {
411
577
  const r2 = n2.root;
412
578
  const r1 = n1.root;
413
579
  if (r1.thVar < 0 && r2.thVar < 0) return;
414
- const isFromTheory = justification.kind === "justification";
415
- const v2 = this.getClosestVar(n2);
416
- const v1 = this.getClosestVar(n1);
417
- if (v2 >= 0 && v1 >= 0) {
418
- if (!isFromTheory) this.pushNewThEq(v2, v1);
419
- } else if (v1 < 0 && v2 >= 0) this.pushNewThDiseqs(r1, v2);
420
- else if (v1 >= 0 && v2 < 0) {
421
- r2.thVar = v1;
422
- this.pushNewThDiseqs(r2, v1);
580
+ const fromTheory =
581
+ justification.kind === "justification" ? justification.justification.fromTheory : -1;
582
+ if (r2.thNext === null && r1.thNext === null) {
583
+ const t2 = r2.thId;
584
+ const t1 = r1.thId;
585
+ const v2 = this.getClosestVar(n2, t2);
586
+ const v1 = this.getClosestVar(n1, t1);
587
+ if (v2 >= 0 && v1 >= 0) {
588
+ if (t1 === t2) {
589
+ if (t1 !== fromTheory) this.pushNewThEq(t1, v2, v1);
590
+ return;
591
+ }
592
+ r2.addThVar(v1, t1);
593
+ this.pushNewThDiseqs(r2, v1, t1);
594
+ this.pushNewThDiseqs(r1, v2, t2);
595
+ } else if (v1 < 0 && v2 >= 0) this.pushNewThDiseqs(r1, v2, t2);
596
+ else if (v1 >= 0 && v2 < 0) {
597
+ r2.thVar = v1;
598
+ r2.thId = t1;
599
+ this.pushNewThDiseqs(r2, v1, t1);
600
+ }
601
+ return;
423
602
  }
424
- }
425
-
426
- attachThVar(node: Enode, thVar: number) {
427
- const oldVar = node.thVar;
603
+ r2.forEachThVar((t2) => {
604
+ const v2 = this.getClosestVar(n2, t2);
605
+ const v1 = this.getClosestVar(n1, t2);
606
+ if (v1 >= 0) {
607
+ if (t2 !== fromTheory) this.pushNewThEq(t2, v2, v1);
608
+ } else this.pushNewThDiseqs(r1, v2, t2);
609
+ });
610
+ r1.forEachThVar((t1) => {
611
+ const v1 = this.getClosestVar(n1, t1);
612
+ if (r2.getThVar(t1) >= 0) return;
613
+ r2.addThVar(v1, t1);
614
+ this.pushNewThDiseqs(r2, v1, t1);
615
+ });
616
+ }
617
+
618
+ attachThVar(node: Enode, theory: Theory, thVar: number) {
619
+ const thId = theory.id;
620
+ const oldVar = node.getThVar(thId);
428
621
  if (oldVar >= 0) {
429
- node.thVar = thVar;
622
+ node.replaceThVar(thVar, thId);
430
623
  this.pushTrail(() => {
431
- node.thVar = oldVar;
624
+ node.replaceThVar(oldVar, thId);
432
625
  });
433
- this.pushNewThEq(thVar, oldVar);
626
+ this.pushNewThEq(thId, thVar, oldVar);
434
627
  return;
435
628
  }
436
629
  const root = node.root;
437
- const rootVar = root.thVar;
438
- node.thVar = thVar;
439
- this.trailInts.push(thVar);
630
+ const rootVar = root.getThVar(thId);
631
+ node.addThVar(thVar, thId);
632
+ this.trailInts.push(thId);
440
633
  this.trailNodes.push(node);
441
634
  this.trailKinds.push(UNDO_TH_VAR);
442
635
  if (rootVar < 0) {
443
- if (root !== node) root.thVar = thVar;
444
- this.pushNewThDiseqs(root, thVar);
445
- } else if (root !== node) this.pushNewThEq(rootVar, thVar);
636
+ if (root !== node) root.addThVar(thVar, thId);
637
+ this.pushNewThDiseqs(root, thVar, thId);
638
+ } else if (root !== node) this.pushNewThEq(thId, rootVar, thVar);
446
639
  }
447
640
 
448
641
  addEq(inputN1: Enode, inputN2: Enode, justification: EqJustification) {
@@ -555,9 +748,10 @@ export class Context extends Internalizer {
555
748
  }
556
749
  case UNDO_TH_VAR: {
557
750
  const node = this.popTrailNode();
558
- const thVar = this.popTrailInt();
559
- node.thVar = -1;
560
- if (node.root !== node && node.root.thVar === thVar) node.root.thVar = -1;
751
+ const thId = this.popTrailInt();
752
+ const thVar = node.getThVar(thId);
753
+ node.delThVar(thId);
754
+ if (node.root !== node && node.root.getThVar(thId) === thVar) node.root.delThVar(thId);
561
755
  return;
562
756
  }
563
757
  default:
@@ -601,7 +795,12 @@ export class Context extends Internalizer {
601
795
  parent.cg = congruent;
602
796
  if (congruent === parent) parent.generation = generation;
603
797
  }
604
- if (r2.thVar >= 0 && this.theory.getEnode(r2.thVar).root !== r2) r2.thVar = -1;
798
+ if (r2.thNext === null) {
799
+ if (r2.thVar >= 0 && this.theoryByFamily[r2.thId]?.getEnode(r2.thVar).root !== r2) {
800
+ r2.thVar = -1;
801
+ r2.thId = -1;
802
+ }
803
+ } else r2.restoreThVars((thId, thVar) => this.theoryByFamily[thId]?.getEnode(thVar) ?? r2);
605
804
  n1.transTarget = null;
606
805
  this.invertTrans(r1);
607
806
  }
@@ -643,13 +842,38 @@ export class Context extends Internalizer {
643
842
  private addDiseq(n1: Enode, n2: Enode) {
644
843
  const r1 = n1.root;
645
844
  const r2 = n2.root;
646
- if (r1 === r2) return r1.thVar >= 0;
647
- const v1 = this.getClosestVar(n1);
648
- const v2 = this.getClosestVar(n2);
649
- if (v1 >= 0 && v2 >= 0) this.pushNewThDiseq(v1, v2);
845
+ if (r1 === r2) return this.theoryByFamily[r1.thId]?.useDiseqs() ?? false;
846
+ if (r1.thNext === null && r2.thNext === null) {
847
+ const t1 = r1.thId;
848
+ const v1 = this.getClosestVar(n1, t1);
849
+ const v2 = this.getClosestVar(n2, t1);
850
+ if (v1 >= 0 && v2 >= 0 && t1 === r2.thId && this.theoryByFamily[t1]?.useDiseqs())
851
+ this.pushNewThDiseq(t1, v1, v2);
852
+ return true;
853
+ }
854
+ r1.forEachThVar((t1) => {
855
+ if (!this.theoryByFamily[t1]?.useDiseqs()) return;
856
+ const v1 = this.getClosestVar(n1, t1);
857
+ const v2 = this.getClosestVar(n2, t1);
858
+ if (v2 >= 0) this.pushNewThDiseq(t1, v1, v2);
859
+ });
650
860
  return true;
651
861
  }
652
862
 
863
+ isShared(node: Enode) {
864
+ const root = node.root;
865
+ if (this.manager.getOp(root.owner) === OP_ITE) return true;
866
+ if (root.thVar < 0) return false;
867
+ if (root.thNext !== null) return true;
868
+ if (this.qmanager.isShared(root)) return true;
869
+ for (const parent of root.parents) {
870
+ const family = this.manager.getFamily(parent.owner);
871
+ if (family === root.thId || family === FAMILY_BASIC) continue;
872
+ if (!this.getTheory(family)?.isBetaRedex(parent, root)) return true;
873
+ }
874
+ return this.getTheory(root.thId)?.isShared(root.thVar) ?? false;
875
+ }
876
+
653
877
  assumeEq(lhs: Enode, rhs: Enode) {
654
878
  if (lhs.root === rhs.root) return false;
655
879
  const eq = this.mkEqAtom(lhs.owner, rhs.owner);
@@ -659,7 +883,10 @@ export class Context extends Internalizer {
659
883
  const boolVar = this.getBoolVar(eq);
660
884
  this.setBoolVarFlag(boolVar, BV_EQ, true);
661
885
  this.setTrueFirstFlag(boolVar);
662
- this.theory.internalizeEqEh(eq);
886
+ this.getTheory(this.manager.getSortFamily(this.manager.sorts[lhs.owner]))?.internalizeEqEh(
887
+ eq,
888
+ boolVar,
889
+ );
663
890
  isNew = true;
664
891
  }
665
892
  const boolVar = this.getBoolVar(eq);
@@ -685,14 +912,15 @@ export class Context extends Internalizer {
685
912
  this.caseSplitQueue.activityIncreased(boolVar);
686
913
  }
687
914
 
688
- private pushScope() {
915
+ pushScope() {
689
916
  this.scopeLevel++;
690
917
  this.scopeAssignedLimits.push(this.assignedLiterals.length);
691
918
  this.scopeAuxClauseLimits.push(this.auxClauses.length);
692
919
  this.scopeTrailLimits.push(this.trailKinds.length);
693
920
  this.relevancy.push();
694
921
  this.qmanager.push();
695
- this.theory.pushScopeEh();
922
+ this.fingerprints.push();
923
+ for (const theory of this.theories) theory.pushScopeEh();
696
924
  }
697
925
 
698
926
  private cacheGenerationOfExpr(expr: number, newLevel: number, visited: Set<number>) {
@@ -750,6 +978,7 @@ export class Context extends Internalizer {
750
978
  const newLevel = this.scopeLevel - numScopes;
751
979
  this.cacheGeneration(newLevel, visited);
752
980
  this.qmanager.pop(numScopes);
981
+ this.fingerprints.pop(numScopes);
753
982
  if (newLevel < this.baseLevel) {
754
983
  this.deleteClauses(this.lemmas, this.baseScopeLemmaLimits[newLevel]);
755
984
  shrink(this.baseScopeLemmaLimits, newLevel);
@@ -759,7 +988,7 @@ export class Context extends Internalizer {
759
988
  this.relevancy.pop(numScopes);
760
989
  this.unassignVars(this.scopeAssignedLimits[newLevel]);
761
990
  this.popTrail(this.scopeTrailLimits[newLevel]);
762
- this.theory.popScopeEh(numScopes);
991
+ for (const theory of this.theories) theory.popScopeEh(numScopes);
763
992
  this.eqPropagationQueue = [];
764
993
  this.thEqQueue = [];
765
994
  this.thDiseqQueue = [];
@@ -777,7 +1006,7 @@ export class Context extends Internalizer {
777
1006
  return numBoolVars;
778
1007
  }
779
1008
 
780
- private popScope(numScopes: number) {
1009
+ popScope(numScopes: number) {
781
1010
  this.popScopeCore(numScopes, new Set());
782
1011
  this.cachedGeneration.clear();
783
1012
  }
@@ -875,11 +1104,17 @@ export class Context extends Internalizer {
875
1104
  private guess(boolVar: BoolVar) {
876
1105
  if (this.manager.kinds[this.boolVar2Expr[boolVar]] === KIND_QUANTIFIER) return false;
877
1106
  if (this.hasBoolVarFlag(boolVar, BV_TRUE_FIRST)) return true;
878
- return (
879
- this.isPhaseCacheOn &&
880
- this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE) &&
881
- this.hasBoolVarFlag(boolVar, BV_PHASE)
882
- );
1107
+ const phaseSelection = this.config.phaseSelection;
1108
+ if (phaseSelection === PS_ALWAYS_FALSE) return false;
1109
+ const isPhaseAvailable = this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE);
1110
+ if (phaseSelection === PS_THEORY) {
1111
+ const phase = this.getTheory(this.getBoolVarTheory(boolVar))?.getPhase(boolVar) ?? L_UNDEF;
1112
+ if (phase !== L_UNDEF) return phase === L_TRUE;
1113
+ return isPhaseAvailable ? this.hasBoolVarFlag(boolVar, BV_PHASE) : this.phaseDefault;
1114
+ }
1115
+ return this.isPhaseCacheOn && isPhaseAvailable
1116
+ ? this.hasBoolVarFlag(boolVar, BV_PHASE)
1117
+ : this.phaseDefault;
883
1118
  }
884
1119
 
885
1120
  private updatePhaseCacheCounter() {
@@ -887,18 +1122,27 @@ export class Context extends Internalizer {
887
1122
  if (this.phaseCounter < (this.isPhaseCacheOn ? PHASE_CACHING_ON : PHASE_CACHING_OFF)) return;
888
1123
  this.phaseCounter = 0;
889
1124
  this.isPhaseCacheOn = !this.isPhaseCacheOn;
1125
+ if (this.config.phaseSelection === PS_CACHING_CONSERVATIVE2)
1126
+ this.phaseDefault = !this.phaseDefault;
890
1127
  }
891
1128
 
892
1129
  private decide() {
893
1130
  const boolVar = this.caseSplitQueue.nextCaseSplit();
894
- if (boolVar === undefined) return false;
1131
+ if (boolVar === undefined) {
1132
+ const hadCaseSplit = this.hasCaseSplit;
1133
+ this.pushTrail(() => {
1134
+ this.hasCaseSplit = hadCaseSplit;
1135
+ });
1136
+ this.hasCaseSplit = false;
1137
+ return false;
1138
+ }
895
1139
  const isPositive = this.guess(boolVar);
896
1140
  this.pushScope();
897
1141
  this.assign(mkLiteral(boolVar, !isPositive), "axiom", true);
898
1142
  return true;
899
1143
  }
900
1144
 
901
- private resolveConflict() {
1145
+ resolveConflict() {
902
1146
  this.numConflicts++;
903
1147
  this.numConflictsSinceRestart++;
904
1148
  this.numConflictsSinceLemmaGc++;
@@ -906,9 +1150,15 @@ export class Context extends Internalizer {
906
1150
  this.eqPropagationQueue = [];
907
1151
  this.thEqQueue = [];
908
1152
  this.thDiseqQueue = [];
1153
+ const phaseSelection = this.config.phaseSelection;
909
1154
  const head = this.scopeLevel === 0 ? 0 : this.scopeAssignedLimits[this.scopeLevel - 1];
910
- for (let index = head; index < this.assignedLiterals.length; index++)
911
- this.setBoolVarFlag(getVar(this.assignedLiterals[index]), BV_PHASE_AVAILABLE, false);
1155
+ if (
1156
+ phaseSelection === PS_THEORY ||
1157
+ phaseSelection === PS_CACHING_CONSERVATIVE ||
1158
+ phaseSelection === PS_CACHING_CONSERVATIVE2
1159
+ )
1160
+ for (let index = head; index < this.assignedLiterals.length; index++)
1161
+ this.setBoolVarFlag(getVar(this.assignedLiterals[index]), BV_PHASE_AVAILABLE, false);
912
1162
  const resolution = this.conflictResolution;
913
1163
  if (
914
1164
  this.conflict === null ||
@@ -954,19 +1204,18 @@ export class Context extends Internalizer {
954
1204
  let failure: SearchFailure = FAILURE_OK;
955
1205
  let level = 1;
956
1206
  let maxLevel = 1;
1207
+ this.incompleteTheories = [];
957
1208
  for (;;) {
958
- const isTheory = this.finalCheckIndex === 0;
959
- // Z3's theory_finite_set makes a set.range declaration here, and its assume_eqs draws a random value.
960
- if (!isTheory) {
961
- this.manager.initFiniteSetPlugin();
962
- this.getRandomValue();
963
- }
964
- const check = isTheory ? this.theory.finalCheckEh(level) : qmanager.finalCheckEh(true);
965
- if (isTheory) maxLevel = Math.max(maxLevel, NUM_ARITH_FINAL_CHECK_LEVELS);
966
- const isCanceled = isTheory && this.checkCanceled();
1209
+ const theory = this.theories[this.finalCheckIndex];
1210
+ const check = theory === undefined ? qmanager.finalCheckEh(true) : theory.finalCheckEh(level);
1211
+ if (theory !== undefined) maxLevel = Math.max(maxLevel, theory.numFinalCheckLevels());
1212
+ const isCanceled = theory === this.arith && this.checkCanceled();
967
1213
  if (isCanceled) failure = FAILURE_CANCELED;
968
- else if (isTheory && check === FC_GIVEUP) failure = FAILURE_THEORY;
969
- this.finalCheckIndex = (this.finalCheckIndex + 1) % 2;
1214
+ else if (theory !== undefined && check === FC_GIVEUP) {
1215
+ failure = FAILURE_THEORY;
1216
+ if (!this.incompleteTheories.includes(theory)) this.incompleteTheories.push(theory);
1217
+ }
1218
+ this.finalCheckIndex = (this.finalCheckIndex + 1) % (this.theories.length + 1);
970
1219
  if (check === FC_CONTINUE) return FC_CONTINUE;
971
1220
  if (check === FC_GIVEUP || isCanceled) result = FC_GIVEUP;
972
1221
  if (this.finalCheckIndex !== oldIndex) continue;
@@ -974,13 +1223,14 @@ export class Context extends Internalizer {
974
1223
  level++;
975
1224
  result = FC_DONE;
976
1225
  failure = FAILURE_OK;
1226
+ this.incompleteTheories = [];
977
1227
  }
978
1228
  if (this.canPropagate()) return FC_CONTINUE;
979
1229
  if (result === FC_GIVEUP && failure !== FAILURE_OK) this.lastSearchFailure = failure;
980
1230
  return result;
981
1231
  }
982
1232
 
983
- private boundedSearch() {
1233
+ boundedSearch() {
984
1234
  for (;;) {
985
1235
  while (!this.propagate()) {
986
1236
  if (!this.resolveConflict()) return L_FALSE;
@@ -991,6 +1241,10 @@ export class Context extends Internalizer {
991
1241
  this.scopeLevel - this.baseLevel > 2
992
1242
  )
993
1243
  return L_UNDEF;
1244
+ if (this.numConflicts > this.maxConflicts) {
1245
+ this.lastSearchFailure = FAILURE_NUM_CONFLICTS;
1246
+ return L_UNDEF;
1247
+ }
994
1248
  }
995
1249
  if (this.numConflictsSinceLemmaGc > LEMMA_GC_INITIAL) this.delInactiveLemmas();
996
1250
  this.dynAck.propagateEh();
@@ -1035,13 +1289,41 @@ export class Context extends Internalizer {
1035
1289
  return generated;
1036
1290
  }
1037
1291
 
1292
+ getLastFailureMessage() {
1293
+ if (this.lastSearchFailure === FAILURE_CANCELED) return "canceled";
1294
+ if (this.lastSearchFailure === FAILURE_NUM_CONFLICTS) return "max-conflicts-reached";
1295
+ if (this.lastSearchFailure === FAILURE_QUANTIFIERS) return "(incomplete quantifiers)";
1296
+ if (this.lastSearchFailure === FAILURE_THEORY)
1297
+ return `(incomplete (theory${this.incompleteTheories.map((theory) => ` ${theory.name}`).join("")}))`;
1298
+ return this.reasonUnknown;
1299
+ }
1300
+
1301
+ private hasCaseSplits() {
1302
+ if (!this.hasCaseSplit) return false;
1303
+ for (let index = this.numBoolVars; index-- > 0;)
1304
+ if (
1305
+ this.isRelevant(this.boolVar2Expr[index]) &&
1306
+ this.assignment[mkLiteral(toBoolVar(index))] === L_UNDEF
1307
+ )
1308
+ return true;
1309
+ return false;
1310
+ }
1311
+
1312
+ isQuantifierIncomplete() {
1313
+ return this.lastSearchFailure === FAILURE_QUANTIFIERS;
1314
+ }
1315
+
1316
+ // Z3's update_model always answers false, after it recomputes a final state for the next model.
1317
+ updateModel() {
1318
+ if (!this.hasCaseSplits() && this.finalCheck() === FC_DONE) this.resetModel();
1319
+ }
1320
+
1038
1321
  getModel() {
1039
1322
  if (this.modelState.kind === "final") return this.modelState.model;
1040
1323
  const generated =
1041
1324
  this.modelState.kind === "proto" ? this.modelState.generated : this.mkProtoModel();
1042
1325
  const model = generated.model.mkModel();
1043
- for (const entry of this.manager.macros)
1044
- if (!model.constInterps.has(entry[0])) model.registerConst(entry[0], entry[1]);
1326
+ model.addRecFuns();
1045
1327
  model.incRef();
1046
1328
  this.modelState = { kind: "final", generated, model };
1047
1329
  return model;
@@ -1095,17 +1377,15 @@ export class Context extends Internalizer {
1095
1377
  return L_UNDEF;
1096
1378
  }
1097
1379
  }
1098
- if (this.numConflictsSinceRestart >= this.restartThreshold) {
1099
- this.restartThreshold = Math.trunc(this.restartThreshold * RESTART_FACTOR);
1100
- if (this.restartThreshold > this.restartOuterThreshold) {
1101
- this.restartThreshold = RESTART_INITIAL;
1102
- this.restartOuterThreshold = Math.trunc(this.restartOuterThreshold * RESTART_FACTOR);
1103
- }
1104
- }
1105
- this.numConflictsSinceRestart = 0;
1106
- if (isForcedRestart || status === L_TRUE || this.agility < RESTART_AGILITY_THRESHOLD) {
1380
+ this.incLimits();
1381
+ if (
1382
+ isForcedRestart ||
1383
+ status === L_TRUE ||
1384
+ !this.config.isRestartAdaptive ||
1385
+ this.agility < RESTART_AGILITY_THRESHOLD
1386
+ ) {
1107
1387
  if (this.scopeLevel > currentLevel) this.popScope(this.scopeLevel - currentLevel);
1108
- if (!this.isInconsistent()) this.theory.restartEh();
1388
+ for (const theory of this.theories) if (!this.isInconsistent()) theory.restartEh();
1109
1389
  if (!this.isInconsistent()) qmanager.restartEh();
1110
1390
  if (this.isInconsistent()) {
1111
1391
  this.resolveConflict();
@@ -1115,6 +1395,28 @@ export class Context extends Internalizer {
1115
1395
  return undefined;
1116
1396
  }
1117
1397
 
1398
+ incLimits() {
1399
+ const config = this.config;
1400
+ if (this.numConflictsSinceRestart >= this.restartThreshold) {
1401
+ if (config.restartStrategy === RS_LUBY) {
1402
+ this.lubyIndex++;
1403
+ this.restartThreshold = getLuby(this.lubyIndex) * RESTART_INITIAL;
1404
+ } else {
1405
+ this.restartThreshold = Math.trunc(this.restartThreshold * config.restartFactor);
1406
+ if (
1407
+ config.restartStrategy !== RS_GEOMETRIC &&
1408
+ this.restartThreshold > this.restartOuterThreshold
1409
+ ) {
1410
+ this.restartThreshold = RESTART_INITIAL;
1411
+ this.restartOuterThreshold = Math.trunc(
1412
+ this.restartOuterThreshold * config.restartFactor,
1413
+ );
1414
+ }
1415
+ }
1416
+ }
1417
+ this.numConflictsSinceRestart = 0;
1418
+ }
1419
+
1118
1420
  private isDeletable(clause: Clause) {
1119
1421
  const store = this.clauses;
1120
1422
  if (store.isReinit(clause)) return false;
@@ -1177,7 +1479,26 @@ export class Context extends Internalizer {
1177
1479
  if (this.scopeLevel > this.baseLevel) this.popScope(this.scopeLevel - this.baseLevel);
1178
1480
  }
1179
1481
 
1482
+ popToSearchLevel() {
1483
+ if (this.scopeLevel > this.searchLevel) this.popScope(this.scopeLevel - this.searchLevel);
1484
+ }
1485
+
1486
+ hasSearchFailure() {
1487
+ return this.lastSearchFailure !== FAILURE_OK;
1488
+ }
1489
+
1490
+ resetConflict() {
1491
+ this.conflict = null;
1492
+ }
1493
+
1494
+ getNumAssertedFormulas() {
1495
+ return this.asserted?.getNumFormulas() ?? 0;
1496
+ }
1497
+
1180
1498
  internalizeAssertions(asserted: AssertedFormulas) {
1499
+ this.asserted = asserted;
1500
+ this.macros = asserted.macros;
1501
+ this.hasQuantifiers = asserted.hasQuantifiers;
1181
1502
  const formulas = asserted.reduce();
1182
1503
  if (asserted.isInconsistent) {
1183
1504
  this.setConflict("axiom", null);
@@ -1189,34 +1510,132 @@ export class Context extends Internalizer {
1189
1510
  }
1190
1511
  }
1191
1512
 
1192
- initAssumptions(assumptions: number[]) {
1513
+ initAssumptions(assumptions: number[], asserted: AssertedFormulas) {
1514
+ this.literalAssumptions.clear();
1515
+ for (const assumption of this.unsatCore) this.manager.decRef(assumption);
1516
+ this.unsatCore = [];
1193
1517
  if (assumptions.length > 0) {
1194
1518
  this.propagate();
1195
1519
  if (this.isInconsistent()) return;
1196
1520
  this.delInactiveLemmas();
1197
1521
  this.pushScope();
1198
- for (const assumption of assumptions) {
1522
+ const manager = this.manager;
1523
+ const proxies = assumptions.map((assumption) => {
1524
+ if (isValidAssumption(manager, assumption)) return assumption;
1525
+ const proxy = manager.mkFreshConst(null, SORT_BOOL);
1526
+ asserted.assertExpr(manager.mkApp(OP_IMPLIES, [proxy, assumption], SORT_BOOL));
1527
+ return proxy;
1528
+ });
1529
+ this.internalizeAssertions(asserted);
1530
+ for (const [index, proxy] of proxies.entries()) {
1199
1531
  if (this.isInconsistent()) break;
1200
- this.internalizeAssertion(assumption, 0);
1532
+ if (proxy === manager.trueExpr) continue;
1533
+ this.internalizeAssertion(proxy, 0);
1534
+ const literal = this.getLiteral(proxy);
1535
+ if (literal === this.trueLiteral || literal === this.falseLiteral) continue;
1536
+ this.literalAssumptions.set(literal, assumptions[index]);
1201
1537
  }
1202
1538
  }
1203
1539
  this.searchLevel = this.scopeLevel;
1204
1540
  }
1205
1541
 
1542
+ addTheoryAssumptions(assumptions: number[]) {
1543
+ for (const theory of this.theories) theory.addTheoryAssumptions(assumptions);
1544
+ }
1545
+
1546
+ checkResearching(asserted: AssertedFormulas, assumptions: readonly number[]) {
1547
+ let result: number;
1548
+ for (;;) {
1549
+ this.popToBaseLevel();
1550
+ this.internalizeAssertions(asserted);
1551
+ const all = [...assumptions];
1552
+ this.addTheoryAssumptions(all);
1553
+ this.initAssumptions(all, asserted);
1554
+ result = this.mkUnsatCore(this.search());
1555
+ if (result !== L_FALSE || this.unsatCore.length === 0) return result;
1556
+ if (!this.theories.some((theory) => theory.shouldResearch(this.unsatCore))) return result;
1557
+ }
1558
+ }
1559
+
1560
+ findMutexes(vars: readonly number[]) {
1561
+ const manager = this.manager;
1562
+ const cliques = new MaxCliques((index) => index ^ 1);
1563
+ const literals: number[] = [];
1564
+ for (const variable of vars) {
1565
+ const isNot = manager.getOp(variable) === OP_NOT;
1566
+ const atom = isNot ? manager.getArg(variable, 0) : variable;
1567
+ const boolVar = this.findBoolVar(atom);
1568
+ if (boolVar !== undefined) literals.push(mkLiteral(boolVar, isNot));
1569
+ }
1570
+ for (let index = 0; index < this.binaryWatches.length; index++)
1571
+ for (const other of this.binaryWatches[index] ?? []) {
1572
+ const source = index ^ 1;
1573
+ if (source < other) cliques.addEdge(source, other);
1574
+ }
1575
+ return cliques.cliques2(literals).map((mutex) =>
1576
+ mutex.map((index) => {
1577
+ const literal = index as Literal;
1578
+ if (literal === this.trueLiteral) return manager.trueExpr;
1579
+ if (literal === this.falseLiteral) return manager.falseExpr;
1580
+ const atom = this.boolVar2Expr[getVar(literal)];
1581
+ return isNegated(literal) ? manager.mkApp(OP_NOT, [atom], SORT_BOOL) : atom;
1582
+ }),
1583
+ );
1584
+ }
1585
+
1586
+ isAssumption(boolVar: BoolVar) {
1587
+ return (
1588
+ this.literalAssumptions.has(mkLiteral(boolVar)) ||
1589
+ this.literalAssumptions.has(mkLiteral(boolVar, true))
1590
+ );
1591
+ }
1592
+
1593
+ isTrackingAssumptions() {
1594
+ return this.literalAssumptions.size > 0 && this.searchLevel > this.baseLevel;
1595
+ }
1596
+
1597
+ mkUnsatCore(result: number) {
1598
+ if (result !== L_FALSE || !this.isTrackingAssumptions()) return result;
1599
+ const literalAssumptions = this.literalAssumptions;
1600
+ const found = new Set<Literal>();
1601
+ const core: number[] = [];
1602
+ for (const literal of this.conflictResolution.unsatCore) {
1603
+ const assumed = literalAssumptions.has(literal) ? literal : negate(literal);
1604
+ const assumption = literalAssumptions.get(assumed);
1605
+ if (assumption === undefined || found.has(assumed)) continue;
1606
+ found.add(assumed);
1607
+ this.manager.incRef(assumption);
1608
+ core.push(assumption);
1609
+ }
1610
+ literalAssumptions.clear();
1611
+ this.popToBaseLevel();
1612
+ this.searchLevel = this.baseLevel;
1613
+ const ids = this.manager.ids;
1614
+ this.unsatCore = core.sort((left, right) => ids[left] - ids[right]);
1615
+ return L_FALSE;
1616
+ }
1617
+
1206
1618
  search() {
1207
- if (this.isInconsistent()) return L_FALSE;
1619
+ if (this.isInconsistent()) {
1620
+ this.resolveConflict();
1621
+ return L_FALSE;
1622
+ }
1208
1623
  this.resetModel();
1209
- this.theory.initSearchEh();
1624
+ for (const theory of this.theories) theory.initSearchEh();
1210
1625
  this.qmanager.initSearchEh();
1211
1626
  this.dynAck.initSearchEh();
1627
+ this.incompleteTheories = [];
1212
1628
  this.numConflicts = 0;
1213
1629
  this.numConflictsSinceRestart = 0;
1214
1630
  this.numConflictsSinceLemmaGc = 0;
1215
1631
  this.restartThreshold = RESTART_INITIAL;
1216
1632
  this.restartOuterThreshold = RESTART_INITIAL;
1217
1633
  this.agility = 0;
1634
+ this.lubyIndex = 1;
1218
1635
  this.finalCheckIndex = 0;
1219
1636
  this.lastSearchFailure = FAILURE_OK;
1637
+ this.phaseDefault = false;
1638
+ if (this.manager.hasTypeVars) this.registerFamily(FAMILY_POLY);
1220
1639
  this.isSearching = true;
1221
1640
  const currentLevel = this.scopeLevel;
1222
1641
  let result: number | undefined;