tla-ts 0.0.10-dev.cb7650c54 → 0.0.10-dev.d166e0ae9

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 (522) hide show
  1. package/dist/compile.cjs +3 -3
  2. package/dist/compile.js +1 -1
  3. package/dist/deciders.cjs +36 -36
  4. package/dist/deciders.js +53 -53
  5. package/dist/index.cjs +1 -1
  6. package/dist/index.d.cts +14 -4
  7. package/dist/index.d.ts +14 -4
  8. package/dist/index.js +1 -1
  9. package/dist/parallel-worker.cjs +1 -1
  10. package/dist/parallel-worker.js +1 -1
  11. package/dist/prove-worker.cjs +1 -1
  12. package/dist/prove-worker.js +1 -1
  13. package/dist/prove.cjs +69 -69
  14. package/dist/prove.js +79 -79
  15. package/dist/run.cjs +42 -44
  16. package/dist/run.js +44 -46
  17. package/dist/tlapm.cjs +1 -1
  18. package/dist/tlapm.js +2 -2
  19. package/dist/transfer.cjs +46 -44
  20. package/dist/transfer.js +42 -40
  21. package/dist/worker.cjs +7 -7
  22. package/dist/worker.js +7 -7
  23. package/package.json +1 -1
  24. package/src/ast.ts +11 -1
  25. package/src/bags.ts +50 -29
  26. package/src/builtins.ts +4 -3
  27. package/src/check-failure.ts +9 -6
  28. package/src/check-trace.ts +116 -78
  29. package/src/check.ts +474 -209
  30. package/src/cli/runtime-invariants.ts +20 -56
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +5 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +29 -9
  35. package/src/cli/xml-exporter.ts +1 -1
  36. package/src/codegen.ts +34 -13
  37. package/src/coverage.ts +3 -0
  38. package/src/dependencies.ts +61 -13
  39. package/src/dfid.ts +22 -10
  40. package/src/environment.ts +96 -37
  41. package/src/errors.ts +7 -0
  42. package/src/evaluate.ts +152 -55
  43. package/src/exit-codes.ts +29 -13
  44. package/src/instances.ts +16 -6
  45. package/src/java-hash.ts +14 -0
  46. package/src/java-overrides.ts +2 -2
  47. package/src/levels.ts +186 -97
  48. package/src/liveness-checker.ts +172 -83
  49. package/src/liveness.ts +52 -11
  50. package/src/obligations/action.ts +0 -2
  51. package/src/obligations/anonymize.ts +0 -2
  52. package/src/obligations/equality.ts +0 -2
  53. package/src/obligations/expression.ts +0 -2
  54. package/src/obligations/format.ts +0 -2
  55. package/src/obligations/generate.ts +0 -2
  56. package/src/obligations/index.ts +1 -1
  57. package/src/obligations/levels.ts +0 -2
  58. package/src/obligations/module.ts +0 -2
  59. package/src/obligations/normalize.ts +1 -6
  60. package/src/obligations/operators.ts +0 -2
  61. package/src/obligations/printer.ts +5 -7
  62. package/src/obligations/proof.ts +0 -2
  63. package/src/obligations/regroup.ts +0 -2
  64. package/src/obligations/simplify.ts +0 -2
  65. package/src/obligations/source.ts +2 -0
  66. package/src/obligations/subexpression.ts +0 -2
  67. package/src/obligations/substitution.ts +0 -2
  68. package/src/obligations/temporal.ts +0 -2
  69. package/src/obligations/tuples.ts +0 -2
  70. package/src/parallel-worker.ts +8 -2
  71. package/src/parallel.ts +5 -0
  72. package/src/parser.ts +115 -145
  73. package/src/pretty-print.ts +1 -1
  74. package/src/prover/isabelle/encode.ts +0 -2
  75. package/src/prover/isabelle/isar/attrib.ts +4 -8
  76. package/src/prover/isabelle/isar/context.ts +0 -4
  77. package/src/prover/isabelle/isar/induct.ts +0 -4
  78. package/src/prover/isabelle/isar/method.ts +0 -2
  79. package/src/prover/isabelle/isar/proof.ts +0 -2
  80. package/src/prover/isabelle/isar/rule-cases.ts +8 -8
  81. package/src/prover/isabelle/isar/toplevel.ts +0 -4
  82. package/src/prover/isabelle/isar/type-check.ts +0 -2
  83. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  84. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  85. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  89. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  90. package/src/prover/isabelle/provers/classical.ts +0 -2
  91. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  92. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  93. package/src/prover/isabelle/pure/consts.ts +0 -2
  94. package/src/prover/isabelle/pure/conv.ts +0 -2
  95. package/src/prover/isabelle/pure/drule.ts +0 -2
  96. package/src/prover/isabelle/pure/envir.ts +0 -2
  97. package/src/prover/isabelle/pure/goal.ts +0 -2
  98. package/src/prover/isabelle/pure/logic.ts +0 -2
  99. package/src/prover/isabelle/pure/name.ts +0 -2
  100. package/src/prover/isabelle/pure/net.ts +0 -2
  101. package/src/prover/isabelle/pure/object-logic.ts +0 -2
  102. package/src/prover/isabelle/pure/pattern.ts +0 -2
  103. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  104. package/src/prover/isabelle/pure/rewriter.ts +3 -5
  105. package/src/prover/isabelle/pure/search.ts +0 -2
  106. package/src/prover/isabelle/pure/seq.ts +0 -2
  107. package/src/prover/isabelle/pure/simplifier.ts +0 -2
  108. package/src/prover/isabelle/pure/table.ts +0 -2
  109. package/src/prover/isabelle/pure/tactic.ts +0 -2
  110. package/src/prover/isabelle/pure/tactical.ts +0 -2
  111. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  112. package/src/prover/isabelle/pure/term.ts +3 -5
  113. package/src/prover/isabelle/pure/thm.ts +0 -2
  114. package/src/prover/isabelle/pure/type.ts +0 -2
  115. package/src/prover/isabelle/pure/unify.ts +0 -2
  116. package/src/prover/isabelle/pure/variable.ts +0 -2
  117. package/src/prover/isabelle/tla/classical-setup.ts +0 -2
  118. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  119. package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
  120. package/src/prover/prep/md5.ts +26 -29
  121. package/src/prover/smt/rewrite.ts +2 -7
  122. package/src/prover/smt/simplify.ts +1 -1
  123. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
  124. package/src/prover/smt/solver/ackr-helper.ts +0 -3
  125. package/src/prover/smt/solver/ackr-model-converter.ts +0 -1
  126. package/src/prover/smt/solver/act-cache.ts +0 -1
  127. package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
  128. package/src/prover/smt/solver/aig-tactic.ts +0 -1
  129. package/src/prover/smt/solver/aig.ts +2 -3
  130. package/src/prover/smt/solver/arith-rewriter.ts +11 -4
  131. package/src/prover/smt/solver/arith-terms.ts +0 -2
  132. package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
  133. package/src/prover/smt/solver/array-rewriter.ts +12 -3
  134. package/src/prover/smt/solver/asserted-formulas.ts +169 -59
  135. package/src/prover/smt/solver/ast-lt.ts +1 -2
  136. package/src/prover/smt/solver/ast-util.ts +0 -2
  137. package/src/prover/smt/solver/ast.ts +63 -15
  138. package/src/prover/smt/solver/auf-solver.ts +23 -13
  139. package/src/prover/smt/solver/bit-blast-tactic.ts +26 -3
  140. package/src/prover/smt/solver/bit-blaster.ts +0 -3
  141. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  142. package/src/prover/smt/solver/bound-manager.ts +0 -1
  143. package/src/prover/smt/solver/bound-simplifier.ts +11 -15
  144. package/src/prover/smt/solver/bv-bound-chk.ts +0 -2
  145. package/src/prover/smt/solver/bv-decl-plugin.ts +13 -11
  146. package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
  147. package/src/prover/smt/solver/bv-rewriter.ts +1 -3
  148. package/src/prover/smt/solver/bv1-blast.ts +0 -2
  149. package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
  150. package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
  151. package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
  152. package/src/prover/smt/solver/card2bv.ts +35 -20
  153. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  154. package/src/prover/smt/solver/cg-table.ts +0 -2
  155. package/src/prover/smt/solver/check-logic.ts +0 -1
  156. package/src/prover/smt/solver/clause.ts +0 -1
  157. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +39 -26
  158. package/src/prover/smt/solver/conflict-resolution.ts +0 -1
  159. package/src/prover/smt/solver/context.ts +67 -14
  160. package/src/prover/smt/solver/ctx-simplify.ts +1 -3
  161. package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
  162. package/src/prover/smt/solver/datatype-decl-plugin.ts +15 -8
  163. package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
  164. package/src/prover/smt/solver/demodulator.ts +0 -3
  165. package/src/prover/smt/solver/dependent-expr-state.ts +26 -18
  166. package/src/prover/smt/solver/der.ts +0 -1
  167. package/src/prover/smt/solver/diff-neq.ts +1 -3
  168. package/src/prover/smt/solver/distribute-forall.ts +0 -1
  169. package/src/prover/smt/solver/dom-simplify.ts +0 -2
  170. package/src/prover/smt/solver/dt2bv-tactic.ts +36 -22
  171. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  172. package/src/prover/smt/solver/e-matching.ts +0 -1
  173. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  174. package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
  175. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  176. package/src/prover/smt/solver/elim-uncnstr.ts +5 -10
  177. package/src/prover/smt/solver/enode.ts +0 -1
  178. package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
  179. package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
  180. package/src/prover/smt/solver/euf/arith-internalize.ts +1 -3
  181. package/src/prover/smt/solver/euf/arith-solver.ts +0 -1
  182. package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
  183. package/src/prover/smt/solver/euf/array-internalize.ts +1 -3
  184. package/src/prover/smt/solver/euf/array-solver.ts +0 -2
  185. package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
  186. package/src/prover/smt/solver/euf/bv-internalize.ts +1 -3
  187. package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
  188. package/src/prover/smt/solver/euf/dt-solver.ts +0 -2
  189. package/src/prover/smt/solver/euf/egraph.ts +4 -12
  190. package/src/prover/smt/solver/euf/euf-solver.ts +1 -5
  191. package/src/prover/smt/solver/euf/fpa-solver.ts +0 -2
  192. package/src/prover/smt/solver/euf/mam.ts +1 -7
  193. package/src/prover/smt/solver/euf/q-ematch.ts +1 -4
  194. package/src/prover/smt/solver/euf/q-mbi.ts +0 -2
  195. package/src/prover/smt/solver/euf/q-model-fixer.ts +0 -3
  196. package/src/prover/smt/solver/euf/q-solver.ts +0 -2
  197. package/src/prover/smt/solver/euf/th-solver.ts +0 -9
  198. package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
  199. package/src/prover/smt/solver/expr-ref.ts +0 -1
  200. package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
  201. package/src/prover/smt/solver/expr2polynomial.ts +204 -80
  202. package/src/prover/smt/solver/factor.ts +36 -15
  203. package/src/prover/smt/solver/fd-solver.ts +148 -42
  204. package/src/prover/smt/solver/fingerprints.ts +0 -1
  205. package/src/prover/smt/solver/fix-dl-var.ts +1 -3
  206. package/src/prover/smt/solver/flat-literals.ts +0 -1
  207. package/src/prover/smt/solver/fm-tactic.ts +0 -1
  208. package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
  209. package/src/prover/smt/solver/fpa-rewriter.ts +1 -3
  210. package/src/prover/smt/solver/fpa2bv-converter.ts +3 -2
  211. package/src/prover/smt/solver/fpa2bv-rewriter.ts +1 -1
  212. package/src/prover/smt/solver/fpa2bv-tactic.ts +0 -2
  213. package/src/prover/smt/solver/goal.ts +6 -4
  214. package/src/prover/smt/solver/goal2nlsat.ts +57 -32
  215. package/src/prover/smt/solver/guard-set.ts +0 -1
  216. package/src/prover/smt/solver/hash.ts +0 -1
  217. package/src/prover/smt/solver/hashtable.ts +4 -1
  218. package/src/prover/smt/solver/inf-eps.ts +1 -2
  219. package/src/prover/smt/solver/inj-axiom.ts +0 -1
  220. package/src/prover/smt/solver/internalizer.ts +1 -2
  221. package/src/prover/smt/solver/lackr.ts +0 -2
  222. package/src/prover/smt/solver/lbool.ts +0 -1
  223. package/src/prover/smt/solver/lia2card.ts +0 -1
  224. package/src/prover/smt/solver/lia2pb.ts +0 -1
  225. package/src/prover/smt/solver/literal.ts +0 -1
  226. package/src/prover/smt/solver/logic-tactics.ts +9 -6
  227. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  228. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  229. package/src/prover/smt/solver/lp/containers.ts +7 -2
  230. package/src/prover/smt/solver/lp/core-solver.ts +0 -3
  231. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  232. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  233. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  234. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  235. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  236. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  237. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  238. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  239. package/src/prover/smt/solver/lp/int-cube.ts +0 -1
  240. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  241. package/src/prover/smt/solver/lp/lar-solver.ts +0 -1
  242. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  243. package/src/prover/smt/solver/lp/lp-settings.ts +5 -2
  244. package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
  245. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  246. package/src/prover/smt/solver/lp/nex.ts +2 -2
  247. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  248. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  249. package/src/prover/smt/solver/lp/nla-core.ts +26 -7
  250. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  251. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  252. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  253. package/src/prover/smt/solver/lp/nla-grobner.ts +158 -82
  254. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  255. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  256. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  257. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  258. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  259. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  260. package/src/prover/smt/solver/lp/nla-powers.ts +0 -1
  261. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  262. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  263. package/src/prover/smt/solver/lp/nla-transcendentals.ts +0 -2
  264. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  265. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  266. package/src/prover/smt/solver/lp/nra-solver.ts +138 -97
  267. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  268. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  269. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  270. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  271. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  272. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  273. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  274. package/src/prover/smt/solver/lp/union-find.ts +1 -2
  275. package/src/prover/smt/solver/macro-finder.ts +0 -3
  276. package/src/prover/smt/solver/mam-compiler.ts +1 -2
  277. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  278. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +0 -2
  279. package/src/prover/smt/solver/max-cliques.ts +0 -2
  280. package/src/prover/smt/solver/maxcore.ts +3 -3
  281. package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -1
  282. package/src/prover/smt/solver/maxlex.ts +0 -1
  283. package/src/prover/smt/solver/maxsmt-base.ts +1 -1
  284. package/src/prover/smt/solver/maxsmt.ts +0 -1
  285. package/src/prover/smt/solver/mbp/mbp-arith.ts +0 -1
  286. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
  287. package/src/prover/smt/solver/mbp/mbp-plugin.ts +0 -2
  288. package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
  289. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +0 -1
  290. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +0 -1
  291. package/src/prover/smt/solver/model-based-opt.ts +1 -2
  292. package/src/prover/smt/solver/model-checker.ts +1 -2
  293. package/src/prover/smt/solver/model-evaluator.ts +2 -1
  294. package/src/prover/smt/solver/model-finder.ts +0 -1
  295. package/src/prover/smt/solver/model-generator.ts +85 -44
  296. package/src/prover/smt/solver/model-macro-solver.ts +0 -1
  297. package/src/prover/smt/solver/model-printer.ts +0 -1
  298. package/src/prover/smt/solver/mpf.ts +2 -5
  299. package/src/prover/smt/solver/mus.ts +2 -4
  300. package/src/prover/smt/solver/muz/dl-context.ts +22 -46
  301. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
  302. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +1 -3
  303. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +0 -2
  304. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -2
  305. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +0 -1
  306. package/src/prover/smt/solver/muz/dl-mk-slice.ts +3 -4
  307. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +0 -2
  308. package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -1
  309. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -2
  310. package/src/prover/smt/solver/muz/dl-rule.ts +8 -11
  311. package/src/prover/smt/solver/muz/hnf.ts +2 -3
  312. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +1 -3
  313. package/src/prover/smt/solver/muz/horn-tactic.ts +15 -4
  314. package/src/prover/smt/solver/muz/rule-properties.ts +22 -1
  315. package/src/prover/smt/solver/muz/spacer-context.ts +2 -5
  316. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +0 -1
  317. package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
  318. package/src/prover/smt/solver/muz/spacer-manager.ts +0 -2
  319. package/src/prover/smt/solver/muz/spacer-pdr.ts +1 -1
  320. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +2 -3
  321. package/src/prover/smt/solver/muz/spacer-util.ts +0 -1
  322. package/src/prover/smt/solver/muz/substitution.ts +0 -2
  323. package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
  324. package/src/prover/smt/solver/nlqsat.ts +3 -3
  325. package/src/prover/smt/solver/nlsat/algebraic.ts +196 -94
  326. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  327. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  328. package/src/prover/smt/solver/nlsat/explain.ts +375 -218
  329. package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
  330. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  331. package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
  332. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  333. package/src/prover/smt/solver/nlsat/solver.ts +77 -75
  334. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
  335. package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -19
  336. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  337. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  338. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  339. package/src/prover/smt/solver/nlsat-tactic.ts +1 -2
  340. package/src/prover/smt/solver/nnf.ts +6 -3
  341. package/src/prover/smt/solver/normalize-bounds.ts +0 -1
  342. package/src/prover/smt/solver/occf.ts +0 -1
  343. package/src/prover/smt/solver/opt-context.ts +22 -9
  344. package/src/prover/smt/solver/opt-nlsat.ts +29 -19
  345. package/src/prover/smt/solver/opt-pareto.ts +19 -2
  346. package/src/prover/smt/solver/opt-preprocess.ts +1 -2
  347. package/src/prover/smt/solver/opt-solver.ts +10 -7
  348. package/src/prover/smt/solver/opt-value.ts +0 -1
  349. package/src/prover/smt/solver/optsmt.ts +1 -3
  350. package/src/prover/smt/solver/parallel-tactic.ts +1 -3
  351. package/src/prover/smt/solver/pattern-inference.ts +0 -1
  352. package/src/prover/smt/solver/pb-rewriter.ts +1 -7
  353. package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
  354. package/src/prover/smt/solver/poly-rewriter.ts +75 -19
  355. package/src/prover/smt/solver/probes.ts +90 -27
  356. package/src/prover/smt/solver/propagate-values.ts +0 -1
  357. package/src/prover/smt/solver/proto-model.ts +8 -9
  358. package/src/prover/smt/solver/pull-quant.ts +0 -1
  359. package/src/prover/smt/solver/purify-arith.ts +0 -1
  360. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  361. package/src/prover/smt/solver/qe-arith-plugin.ts +2 -6
  362. package/src/prover/smt/solver/qe-lite-der.ts +0 -1
  363. package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
  364. package/src/prover/smt/solver/qe-lite.ts +2 -3
  365. package/src/prover/smt/solver/qe-mbp.ts +0 -1
  366. package/src/prover/smt/solver/qe.ts +3 -4
  367. package/src/prover/smt/solver/qel.ts +0 -1
  368. package/src/prover/smt/solver/qi-queue.ts +0 -1
  369. package/src/prover/smt/solver/qsat.ts +23 -9
  370. package/src/prover/smt/solver/quant-hoist.ts +0 -1
  371. package/src/prover/smt/solver/quant-tactics.ts +0 -1
  372. package/src/prover/smt/solver/quantifier-analyzer.ts +0 -1
  373. package/src/prover/smt/solver/quantifier-manager.ts +14 -10
  374. package/src/prover/smt/solver/quasi-macros.ts +0 -2
  375. package/src/prover/smt/solver/random-gen.ts +0 -1
  376. package/src/prover/smt/solver/rational.ts +0 -1
  377. package/src/prover/smt/solver/recfun-decl-plugin.ts +2 -2
  378. package/src/prover/smt/solver/recfun-rewriter.ts +0 -1
  379. package/src/prover/smt/solver/reduce-args.ts +0 -1
  380. package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
  381. package/src/prover/smt/solver/ref-vector.ts +0 -1
  382. package/src/prover/smt/solver/relevancy.ts +0 -1
  383. package/src/prover/smt/solver/rewriter-tpl.ts +7 -7
  384. package/src/prover/smt/solver/rewriter.ts +31 -26
  385. package/src/prover/smt/solver/rlimit.ts +17 -1
  386. package/src/prover/smt/solver/sat/asymm-branch.ts +0 -2
  387. package/src/prover/smt/solver/sat/big.ts +0 -1
  388. package/src/prover/smt/solver/sat/clause-use-list.ts +0 -2
  389. package/src/prover/smt/solver/sat/clause.ts +0 -3
  390. package/src/prover/smt/solver/sat/cleaner.ts +0 -2
  391. package/src/prover/smt/solver/sat/config.ts +1 -4
  392. package/src/prover/smt/solver/sat/consequences.ts +0 -1
  393. package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
  394. package/src/prover/smt/solver/sat/goal2sat.ts +0 -3
  395. package/src/prover/smt/solver/sat/inc-sat-solver.ts +81 -29
  396. package/src/prover/smt/solver/sat/model-converter.ts +1 -3
  397. package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
  398. package/src/prover/smt/solver/sat/pb-solver.ts +1 -3
  399. package/src/prover/smt/solver/sat/probing.ts +0 -2
  400. package/src/prover/smt/solver/sat/sat-tactic.ts +17 -8
  401. package/src/prover/smt/solver/sat/sat2goal.ts +10 -9
  402. package/src/prover/smt/solver/sat/scc.ts +0 -1
  403. package/src/prover/smt/solver/sat/simplifier.ts +1 -4
  404. package/src/prover/smt/solver/sat/solver.ts +25 -49
  405. package/src/prover/smt/solver/sat/var-queue.ts +0 -2
  406. package/src/prover/smt/solver/sat/watch-list.ts +0 -3
  407. package/src/prover/smt/solver/search-tree.ts +0 -1
  408. package/src/prover/smt/solver/seq-axioms.ts +20 -36
  409. package/src/prover/smt/solver/seq-decl-plugin.ts +1 -2
  410. package/src/prover/smt/solver/seq-derive.ts +4 -9
  411. package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
  412. package/src/prover/smt/solver/seq-eq-solver.ts +2 -3
  413. package/src/prover/smt/solver/seq-factory.ts +0 -1
  414. package/src/prover/smt/solver/seq-monadic.ts +7 -7
  415. package/src/prover/smt/solver/seq-range-predicate.ts +0 -2
  416. package/src/prover/smt/solver/seq-re-rewriter.ts +2 -2
  417. package/src/prover/smt/solver/seq-re-util.ts +1 -3
  418. package/src/prover/smt/solver/seq-regex-bisim.ts +1 -2
  419. package/src/prover/smt/solver/seq-regex-live.ts +2 -4
  420. package/src/prover/smt/solver/seq-rewriter.ts +31 -31
  421. package/src/prover/smt/solver/seq-skolem.ts +0 -24
  422. package/src/prover/smt/solver/seq-subset.ts +0 -1
  423. package/src/prover/smt/solver/seq-view-witness.ts +4 -6
  424. package/src/prover/smt/solver/smt-consequences.ts +1 -3
  425. package/src/prover/smt/solver/smt-kernel.ts +48 -9
  426. package/src/prover/smt/solver/smt-logics.ts +0 -1
  427. package/src/prover/smt/solver/smt-setup.ts +99 -15
  428. package/src/prover/smt/solver/smt2-printer.ts +0 -2
  429. package/src/prover/smt/solver/smtlib-parser.ts +589 -226
  430. package/src/prover/smt/solver/smtlib-script.ts +674 -197
  431. package/src/prover/smt/solver/solve-eqs.ts +36 -39
  432. package/src/prover/smt/solver/solver.ts +19 -5
  433. package/src/prover/smt/solver/static-features.ts +0 -2
  434. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  435. package/src/prover/smt/solver/tactic.ts +332 -191
  436. package/src/prover/smt/solver/term-enumeration.ts +0 -1
  437. package/src/prover/smt/solver/theory-array.ts +0 -2
  438. package/src/prover/smt/solver/theory-bv.ts +13 -5
  439. package/src/prover/smt/solver/theory-char.ts +0 -1
  440. package/src/prover/smt/solver/theory-datatype.ts +0 -1
  441. package/src/prover/smt/solver/theory-finite-set.ts +2 -2
  442. package/src/prover/smt/solver/theory-fpa.ts +1 -2
  443. package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
  444. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
  445. package/src/prover/smt/solver/theory-lra-final-check.ts +1 -1
  446. package/src/prover/smt/solver/theory-lra-internalize.ts +10 -1
  447. package/src/prover/smt/solver/theory-lra-model.ts +0 -1
  448. package/src/prover/smt/solver/theory-lra-propagate.ts +11 -4
  449. package/src/prover/smt/solver/theory-lra-state.ts +0 -1
  450. package/src/prover/smt/solver/theory-lra.ts +1 -2
  451. package/src/prover/smt/solver/theory-pb.ts +24 -9
  452. package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
  453. package/src/prover/smt/solver/theory-recfun.ts +0 -1
  454. package/src/prover/smt/solver/theory-seq-regex.ts +0 -1
  455. package/src/prover/smt/solver/theory-seq-solve.ts +1 -3
  456. package/src/prover/smt/solver/theory-seq-state.ts +2 -23
  457. package/src/prover/smt/solver/theory-seq.ts +0 -1
  458. package/src/prover/smt/solver/theory.ts +0 -1
  459. package/src/prover/smt/solver/tseitin-cnf.ts +1 -2
  460. package/src/prover/smt/solver/var-subst.ts +0 -1
  461. package/src/prover/tlapm/cache.ts +8 -8
  462. package/src/prover/zenon/decide.ts +0 -2
  463. package/src/prover/zenon/encode.ts +0 -2
  464. package/src/prover/zenon/eqrel.ts +0 -2
  465. package/src/prover/zenon/equality-rules.ts +24 -2
  466. package/src/prover/zenon/expr.ts +21 -2
  467. package/src/prover/zenon/index-table.ts +7 -4
  468. package/src/prover/zenon/isar-case.ts +1 -3
  469. package/src/prover/zenon/isar.ts +2 -4
  470. package/src/prover/zenon/llproof.ts +0 -2
  471. package/src/prover/zenon/mltoll.ts +0 -2
  472. package/src/prover/zenon/node.ts +0 -2
  473. package/src/prover/zenon/parse.ts +0 -2
  474. package/src/prover/zenon/phrase.ts +1 -3
  475. package/src/prover/zenon/proof.ts +0 -2
  476. package/src/prover/zenon/propositional-rules.ts +0 -2
  477. package/src/prover/zenon/rules.ts +2 -3
  478. package/src/prover/zenon/search.ts +0 -2
  479. package/src/prover/zenon/tla/functions.ts +0 -2
  480. package/src/prover/zenon/tla/llproof.ts +0 -2
  481. package/src/prover/zenon/tla/records.ts +0 -2
  482. package/src/prover/zenon/tla/rewrites.ts +0 -2
  483. package/src/prover/zenon/tla/sets.ts +0 -2
  484. package/src/prover/zenon/tla/terms.ts +0 -2
  485. package/src/prover/zenon/tla/tla.ts +0 -2
  486. package/src/resolve.ts +1072 -253
  487. package/src/runtime.ts +11 -1
  488. package/src/sany/builtins.ts +10 -10
  489. package/src/sany/generation.ts +2 -13
  490. package/src/sany/generator-definitions.ts +3 -1
  491. package/src/sany/generator-expressions.ts +38 -30
  492. package/src/sany/generator-proofs.ts +6 -3
  493. package/src/sany/generator.ts +2 -1
  494. package/src/sany/levels.ts +0 -2
  495. package/src/sany/lexer.ts +3 -3
  496. package/src/sany/linter.ts +0 -2
  497. package/src/sany/modules.ts +4 -2
  498. package/src/sany/nodes.ts +1 -1
  499. package/src/sany/selectors.ts +11 -6
  500. package/src/sany/xml.ts +2 -3
  501. package/src/search.ts +262 -144
  502. package/src/simulate.ts +168 -102
  503. package/src/spec-description.ts +8 -6
  504. package/src/standard-definitions.ts +4 -0
  505. package/src/standard-modules.ts +56 -22
  506. package/src/state-graph.ts +0 -2
  507. package/src/subexpressions.ts +518 -123
  508. package/src/successors.ts +10 -3
  509. package/src/symmetry.ts +2 -1
  510. package/src/tlc/jar-data.ts +10 -0
  511. package/src/tlc/messages.ts +3 -3
  512. package/src/tlc/order.ts +14 -3
  513. package/src/tlc/random.ts +2 -1
  514. package/src/tlc/replay.ts +27 -14
  515. package/src/tlc/tlc-operators.ts +10 -8
  516. package/src/tlc/tlcext-operators.ts +87 -26
  517. package/src/tlc/trace-spec.ts +11 -25
  518. package/src/typed-tier.ts +44 -27
  519. package/src/typescript/types.ts +2 -2
  520. package/src/values.ts +135 -78
  521. package/src/prover/smt/solver/z3-license.txt +0 -10
  522. package/src/prover/zenon/LICENSE +0 -32
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/nlsat/nlsat_explain.cpp), MIT license, see z3-license.txt.
2
1
  import type { AlgebraicManager, Anum } from "./algebraic";
3
2
  import {
4
3
  type AtomTable,
@@ -9,12 +8,14 @@ import {
9
8
  TRUE_BOOL_VAR,
10
9
  TRUE_LITERAL,
11
10
  } from "./atoms";
12
- import { getSingleCell, TodoSet } from "./levelwise";
11
+ import { type CellInterval, Levelwise, releaseIntervals, TodoSet } from "./levelwise";
13
12
  import {
14
13
  NULL_VAR,
15
14
  type Polynomial,
16
15
  type PolynomialCache,
17
16
  type PolynomialManager,
17
+ PolynomialRef,
18
+ PolynomialRefVector,
18
19
  } from "./polynomial";
19
20
  import { type IneqAtom, type IneqKind, type RootKind, isIneqAtom } from "./types";
20
21
 
@@ -65,9 +66,13 @@ const getKindForSign = (sign: number): IneqKind => (sign === 0 ? "EQ" : sign < 0
65
66
  export class Explain {
66
67
  private result: ScopedLiterals | null = null;
67
68
  private added = new Set<number>();
69
+ private ps: PolynomialRefVector;
70
+ private factors: PolynomialRefVector;
71
+ private factorsSave: PolynomialRefVector;
68
72
  private todo: TodoSet;
69
- private lowerStagePolys: Polynomial[] = [];
70
73
  private core: ScopedLiterals;
74
+ private lowerStagePolys: PolynomialRefVector;
75
+ private lastLwsInputPolys: PolynomialRefVector;
71
76
  private isAddAllCoeffs = false;
72
77
 
73
78
  isFullDimensional = false;
@@ -79,8 +84,13 @@ export class Explain {
79
84
  private cache: PolynomialCache,
80
85
  private context: ExplainContext,
81
86
  ) {
82
- this.todo = new TodoSet(pm, cache);
87
+ this.ps = new PolynomialRefVector(pm);
88
+ this.factors = new PolynomialRefVector(pm);
89
+ this.factorsSave = new PolynomialRefVector(pm);
90
+ this.todo = new TodoSet(cache, true);
83
91
  this.core = new ScopedLiterals(context.atoms);
92
+ this.lowerStagePolys = new PolynomialRefVector(pm);
93
+ this.lastLwsInputPolys = new PolynomialRefVector(pm);
84
94
  }
85
95
 
86
96
  private getSign(polynomial: Polynomial) {
@@ -107,16 +117,13 @@ export class Explain {
107
117
  this.core.reset();
108
118
  }
109
119
 
110
- private collectPolys(literals: readonly number[]) {
111
- return literals.flatMap((literal) => {
120
+ private collectPolys(literals: readonly number[], ps: PolynomialRefVector) {
121
+ ps.reset();
122
+ for (const literal of literals) {
112
123
  const atom = this.getAtom(literal);
113
- return isIneqAtom(atom) ? atom.polynomials : [atom.polynomial];
114
- });
115
- }
116
-
117
- private addAssumption(kind: IneqKind, polynomial: Polynomial, isNeg = false) {
118
- const boolVar = this.context.atoms.mkIneqAtom(kind, [polynomial], [false]);
119
- this.addLiteral(2 * boolVar + (isNeg ? 0 : 1));
124
+ if (isIneqAtom(atom)) for (const polynomial of atom.polynomials) ps.push(polynomial);
125
+ else ps.push(atom.polynomial);
126
+ }
120
127
  }
121
128
 
122
129
  private findSectionRoot(polynomial: Polynomial, variable: number) {
@@ -134,104 +141,153 @@ export class Explain {
134
141
  }
135
142
 
136
143
  private addZeroAssumption(polynomial: Polynomial) {
137
- const squareFree = this.pm.squareFree(polynomial);
138
- if (this.pm.isConst(squareFree)) return;
139
- const variable = this.pm.maxVar(squareFree);
140
- const index = this.findSectionRoot(squareFree, variable);
141
- if (index !== null) this.addRootLiteral("ROOT_EQ", variable, index, squareFree);
144
+ const q = new PolynomialRef(this.pm);
145
+ try {
146
+ this.pm.squareFree(polynomial, q);
147
+ if (this.pm.isConst(q.get())) return;
148
+ const variable = this.pm.maxVar(q.get());
149
+ const index = this.findSectionRoot(q.get(), variable);
150
+ if (index !== null) this.addRootLiteral("ROOT_EQ", variable, index, q.get());
151
+ } finally {
152
+ q.reset();
153
+ }
142
154
  }
143
155
 
144
- private elimVanishing(polynomial: Polynomial) {
145
- let p = polynomial;
146
- let variable = this.pm.maxVar(p);
147
- let degree = this.pm.degree(p, variable);
148
- while (true) {
149
- if (this.pm.isConst(p)) return p;
150
- if (degree === 0) {
151
- variable = this.pm.maxVar(p);
152
- degree = this.pm.degree(p, variable);
153
- }
154
- if (this.pm.isNonzeroConstCoeff(p, variable, degree)) return p;
155
- // Z3's insert_fresh_factors_in_todo writes lc back without its vanishing coefficients.
156
- const lc = this.insertFreshFactorsInTodo(this.pm.coeff(p, variable, degree));
157
- const reduct = this.pm.reduct(p, variable, degree);
158
- if (!this.pm.isZero(lc) && this.getSign(lc) !== 0) return p;
159
- if (degree === 0) {
160
- if (this.isAddAllCoeffs) {
161
- this.addZeroAssumption(lc);
162
- return this.pm.zero;
156
+ private addAssumption(kind: IneqKind, polynomial: Polynomial, isNeg = false) {
157
+ const boolVar = this.context.atoms.mkIneqAtom(kind, [polynomial], [false]);
158
+ this.addLiteral(2 * boolVar + (isNeg ? 0 : 1));
159
+ }
160
+
161
+ private elimVanishing(p: PolynomialRef) {
162
+ const pm = this.pm;
163
+ let variable = pm.maxVar(p.get());
164
+ let degree = pm.degree(p.get(), variable);
165
+ const lc = new PolynomialRef(pm);
166
+ const reduct = new PolynomialRef(pm);
167
+ try {
168
+ while (true) {
169
+ if (pm.isConst(p.get())) return;
170
+ if (degree === 0) {
171
+ variable = pm.maxVar(p.get());
172
+ degree = pm.degree(p.get(), variable);
163
173
  }
164
- this.isAddAllCoeffs = true;
165
- throw new AddAllCoeffsRestart();
174
+ if (pm.isNonzeroConstCoeff(p.get(), variable, degree)) return;
175
+ lc.set(pm.coeffWithReduct(p.get(), variable, degree, reduct));
176
+ this.insertFreshFactorsInTodo(lc);
177
+ if (!pm.isZero(lc.get()) && this.getSign(lc.get()) !== 0) return;
178
+ if (degree === 0) {
179
+ p.set(pm.zero);
180
+ if (this.isAddAllCoeffs) {
181
+ this.addZeroAssumption(lc.get());
182
+ return;
183
+ }
184
+ this.isAddAllCoeffs = true;
185
+ throw new AddAllCoeffsRestart();
186
+ }
187
+ this.addZeroAssumption(lc.get());
188
+ degree--;
189
+ p.copy(reduct);
166
190
  }
167
- this.addZeroAssumption(lc);
168
- degree--;
169
- p = reduct;
191
+ } finally {
192
+ reduct.reset();
193
+ lc.reset();
170
194
  }
171
195
  }
172
196
 
173
- private elimVanishingAll(polynomials: readonly Polynomial[]) {
174
- return polynomials
175
- .map((polynomial) => this.elimVanishing(polynomial))
176
- .filter((polynomial) => !this.pm.isConst(polynomial));
197
+ private elimVanishingAll(ps: PolynomialRefVector) {
198
+ const size = ps.size;
199
+ const p = new PolynomialRef(this.pm);
200
+ try {
201
+ let kept = 0;
202
+ for (let index = 0; index < size; index++) {
203
+ p.set(ps.get(index));
204
+ this.elimVanishing(p);
205
+ if (!this.pm.isConst(p.get())) ps.set(kept++, p.get());
206
+ }
207
+ ps.shrink(kept);
208
+ } finally {
209
+ p.reset();
210
+ }
177
211
  }
178
212
 
179
- private insertFreshFactorsInTodo(polynomial: Polynomial) {
180
- if (this.pm.isConst(polynomial)) return polynomial;
181
- const p = this.elimVanishing(polynomial);
182
- if (this.pm.isConst(p)) return p;
213
+ private insertFreshFactorsInTodo(p: PolynomialRef) {
214
+ if (this.pm.isConst(p.get())) return;
215
+ this.elimVanishing(p);
216
+ if (this.pm.isConst(p.get())) return;
183
217
  if (!this.isFactoring) {
184
- this.todo.insert(p);
185
- return p;
218
+ this.todo.insert(p.get());
219
+ return;
186
220
  }
187
- for (const factor of this.cache.factor(p)) {
188
- const reduced = this.elimVanishing(factor);
189
- if (!this.pm.isConst(reduced)) this.todo.insert(reduced);
221
+ const saved = this.factorsSave.size;
222
+ this.factorsSave.append(this.factors);
223
+ const f = new PolynomialRef(this.pm);
224
+ try {
225
+ this.cache.factor(p.get(), this.factors);
226
+ for (let index = 0; index < this.factors.size; index++) {
227
+ f.set(this.factors.get(index));
228
+ this.elimVanishing(f);
229
+ if (!this.pm.isConst(f.get())) this.todo.insert(f.get());
230
+ }
231
+ } finally {
232
+ f.reset();
233
+ this.factors.reset();
234
+ for (let index = saved; index < this.factorsSave.size; index++)
235
+ this.factors.push(this.factorsSave.get(index));
236
+ this.factorsSave.shrink(saved);
190
237
  }
191
- return p;
192
238
  }
193
239
 
194
240
  private normalizeLiteral(literal: number, max: number) {
195
241
  if (literal >> 1 === TRUE_BOOL_VAR) return literal;
196
242
  const atom = this.getAtom(literal);
197
243
  if (!isIneqAtom(atom)) return literal;
244
+ const pm = this.pm;
198
245
  const isNeg = (literal & 1) === 1;
199
- const polynomials: Polynomial[] = [];
246
+ const ps = new PolynomialRefVector(pm);
200
247
  const isEven: boolean[] = [];
201
- let atomSign = 1;
202
- let isNormalized = false;
203
- for (const [index, factor] of atom.polynomials.entries()) {
204
- const p = this.pm.maxVar(factor) === max ? this.elimVanishing(factor) : factor;
205
- if (this.pm.isConst(p) || this.pm.maxVar(p) < max) {
206
- const sign = this.getSign(p);
207
- if (!this.pm.isConst(p)) {
208
- this.lowerStagePolys.push(p);
209
- if (sign === 0) this.addAssumption("EQ", p);
210
- else if (atom.isEven[index]) this.addAssumption("EQ", p, true);
211
- else this.addAssumption(getKindForSign(sign), p);
248
+ const p = new PolynomialRef(pm);
249
+ try {
250
+ let atomSign = 1;
251
+ let isNormalized = false;
252
+ for (let index = 0; index < atom.polynomials.length; index++) {
253
+ p.set(atom.polynomials[index]);
254
+ if (pm.maxVar(p.get()) === max) this.elimVanishing(p);
255
+ if (pm.isConst(p.get()) || pm.maxVar(p.get()) < max) {
256
+ const sign = this.getSign(p.get());
257
+ if (!pm.isConst(p.get())) {
258
+ this.lowerStagePolys.push(p.get());
259
+ if (sign === 0) this.addAssumption("EQ", p.get());
260
+ else if (atom.isEven[index]) this.addAssumption("EQ", p.get(), true);
261
+ else this.addAssumption(getKindForSign(sign), p.get());
262
+ }
263
+ if (sign === 0) return (atom.kind === "EQ") !== isNeg ? TRUE_LITERAL : FALSE_LITERAL;
264
+ if (sign < 0 && !atom.isEven[index]) atomSign = -atomSign;
265
+ isNormalized = true;
266
+ continue;
212
267
  }
213
- if (sign === 0) return (atom.kind === "EQ") !== isNeg ? TRUE_LITERAL : FALSE_LITERAL;
214
- if (sign < 0 && !atom.isEven[index]) atomSign = -atomSign;
215
- isNormalized = true;
216
- continue;
268
+ if (p.get() !== atom.polynomials[index]) isNormalized = true;
269
+ isEven.push(atom.isEven[index]);
270
+ ps.push(p.get());
217
271
  }
218
- if (p !== factor) isNormalized = true;
219
- isEven.push(atom.isEven[index]);
220
- polynomials.push(p);
221
- }
222
- if (polynomials.length === 0) {
223
- const isTrue = atom.kind === "EQ" ? false : atom.kind === "LT" ? atomSign < 0 : atomSign > 0;
224
- return isTrue !== isNeg ? TRUE_LITERAL : FALSE_LITERAL;
272
+ if (ps.size === 0) {
273
+ const isTrue =
274
+ atom.kind === "EQ" ? false : atom.kind === "LT" ? atomSign < 0 : atomSign > 0;
275
+ return isTrue !== isNeg ? TRUE_LITERAL : FALSE_LITERAL;
276
+ }
277
+ if (!isNormalized) return literal;
278
+ const kind = atomSign < 0 ? flipKind(atom.kind) : atom.kind;
279
+ return this.context.atoms.mkIneqLiteral(kind, ps.items, isEven) ^ (isNeg ? 1 : 0);
280
+ } finally {
281
+ p.reset();
282
+ ps.reset();
225
283
  }
226
- if (!isNormalized) return literal;
227
- const kind = atomSign < 0 ? flipKind(atom.kind) : atom.kind;
228
- return this.context.atoms.mkIneqLiteral(kind, polynomials, isEven) ^ (isNeg ? 1 : 0);
229
284
  }
230
285
 
231
286
  private normalizeCore(core: ScopedLiterals, max: number) {
287
+ const size = core.size;
232
288
  let kept = 0;
233
- for (const literal of core.literals) {
234
- const normalized = this.normalizeLiteral(literal, max);
289
+ for (let index = 0; index < size; index++) {
290
+ const normalized = this.normalizeLiteral(core.literals[index], max);
235
291
  if (normalized === TRUE_LITERAL) continue;
236
292
  if (normalized === FALSE_LITERAL) {
237
293
  core.reset();
@@ -248,81 +304,93 @@ export class Explain {
248
304
  newLiteral.set(literal);
249
305
  return;
250
306
  }
307
+ const pm = this.pm;
251
308
  const isNeg = (literal & 1) === 1;
252
- const factors: Polynomial[] = [];
253
- const isEven: boolean[] = [];
254
309
  let atomSign = 1;
255
310
  let isModified = false;
311
+ const newFactors = new PolynomialRefVector(pm);
312
+ const newFactorsEven: boolean[] = [];
313
+ const newFactor = new PolynomialRef(pm);
256
314
  const addLcCondition = (steps: number, isFactorEven: boolean) => {
257
315
  if (info.isLcConst) return;
258
316
  if (steps % 2 === 0 || isFactorEven || atom.kind === "EQ") addLcDiseq(info);
259
317
  else addLcIneq(info);
260
318
  };
261
- for (const [index, factor] of atom.polynomials.entries()) {
262
- const isFactorEven = atom.isEven[index];
263
- if (this.pm.degree(factor, info.variable) < info.degree) {
264
- factors.push(factor);
265
- isEven.push(isFactorEven);
266
- continue;
319
+ try {
320
+ for (let index = 0; index < atom.polynomials.length; index++) {
321
+ const factor = atom.polynomials[index];
322
+ const isFactorEven = atom.isEven[index];
323
+ if (pm.degree(factor, info.variable) < info.degree) {
324
+ newFactors.push(factor);
325
+ newFactorsEven.push(isFactorEven);
326
+ continue;
327
+ }
328
+ isModified = true;
329
+ const steps = pm.pseudoRemainder(factor, info.eq, info.variable, newFactor);
330
+ if (steps % 2 === 1 && !isFactorEven && info.lcSign < 0) atomSign = -atomSign;
331
+ if (pm.isConst(newFactor.get())) {
332
+ const sign = this.getSign(newFactor.get());
333
+ if (sign === 0) {
334
+ newLiteral.set((atom.kind === "EQ") !== isNeg ? TRUE_LITERAL : FALSE_LITERAL);
335
+ if (!info.isLcConst) addLcDiseq(info);
336
+ return;
337
+ }
338
+ addLcCondition(steps, isFactorEven);
339
+ if (sign < 0 && !isFactorEven) atomSign = -atomSign;
340
+ continue;
341
+ }
342
+ newFactors.push(newFactor.get());
343
+ newFactorsEven.push(isFactorEven);
344
+ addLcCondition(steps, isFactorEven);
267
345
  }
268
- isModified = true;
269
- const division = this.pm.pseudoRemainder(factor, info.eq, info.variable);
270
- if (division.steps % 2 === 1 && !isFactorEven && info.lcSign < 0) atomSign = -atomSign;
271
- const remainder = division.remainder;
272
- if (!this.pm.isConst(remainder)) {
273
- factors.push(remainder);
274
- isEven.push(isFactorEven);
275
- addLcCondition(division.steps, isFactorEven);
276
- continue;
346
+ if (!isModified) {
347
+ newLiteral.set(literal);
348
+ return;
277
349
  }
278
- const sign = this.getSign(remainder);
279
- if (sign === 0) {
280
- newLiteral.set((atom.kind === "EQ") !== isNeg ? TRUE_LITERAL : FALSE_LITERAL);
281
- if (!info.isLcConst) addLcDiseq(info);
350
+ const kind = atomSign < 0 ? flipKind(atom.kind) : atom.kind;
351
+ newLiteral.set(
352
+ this.context.atoms.mkIneqLiteral(kind, newFactors.items, newFactorsEven) ^ (isNeg ? 1 : 0),
353
+ );
354
+ // Z3's null_var is the largest unsigned, so true and false never count as lower stage.
355
+ const maxVar = this.context.atoms.getMaxVar(newLiteral.literal);
356
+ if (maxVar === NULL_VAR || maxVar >= max) {
357
+ newLiteral.set(this.normalizeLiteral(newLiteral.literal, max));
282
358
  return;
283
359
  }
284
- addLcCondition(division.steps, isFactorEven);
285
- if (sign < 0 && !isFactorEven) atomSign = -atomSign;
286
- }
287
- if (!isModified) {
288
- newLiteral.set(literal);
289
- return;
290
- }
291
- const kind = atomSign < 0 ? flipKind(atom.kind) : atom.kind;
292
- newLiteral.set(this.context.atoms.mkIneqLiteral(kind, factors, isEven) ^ (isNeg ? 1 : 0));
293
- // Z3's null_var is the largest unsigned, so true and false never count as lower stage.
294
- const maxVar = this.context.atoms.getMaxVar(newLiteral.literal);
295
- if (maxVar === NULL_VAR || maxVar >= max) {
296
- newLiteral.set(this.normalizeLiteral(newLiteral.literal, max));
297
- return;
298
- }
299
- if (this.context.getValue(newLiteral.literal) === 1) {
300
- newLiteral.set(literal);
301
- return;
360
+ if (this.context.getValue(newLiteral.literal) === 1) {
361
+ newLiteral.set(literal);
362
+ return;
363
+ }
364
+ this.addLiteral(newLiteral.literal);
365
+ newLiteral.set(TRUE_LITERAL);
366
+ } finally {
367
+ newFactor.reset();
368
+ newFactors.reset();
302
369
  }
303
- this.addLiteral(newLiteral.literal);
304
- newLiteral.set(TRUE_LITERAL);
305
370
  }
306
371
 
307
372
  private simplifyWithEq(core: ScopedLiterals, eq: Polynomial, max: number) {
308
373
  const variable = this.pm.maxVar(eq);
309
374
  const degree = this.pm.degree(eq, variable);
310
- const lc = this.pm.coeff(eq, variable, degree);
311
- const info = {
312
- eq,
313
- variable,
314
- degree,
315
- lc,
316
- lcSign: this.getSign(lc),
317
- isLcConst: this.pm.isConst(lc),
318
- isLcAdded: false,
319
- isLcIneqAdded: false,
320
- };
375
+ const lcEq = new PolynomialRef(this.pm);
321
376
  const newLiteral = new ScopedLiteral(this.context.atoms);
322
377
  try {
378
+ lcEq.set(this.pm.coeff(eq, variable, degree));
379
+ const info = {
380
+ eq,
381
+ variable,
382
+ degree,
383
+ lc: lcEq.get(),
384
+ lcSign: this.getSign(lcEq.get()),
385
+ isLcConst: this.pm.isConst(lcEq.get()),
386
+ isLcAdded: false,
387
+ isLcIneqAdded: false,
388
+ };
389
+ const size = core.size;
323
390
  let isModified = false;
324
391
  let kept = 0;
325
- for (const literal of core.literals) {
392
+ for (let index = 0; index < size; index++) {
393
+ const literal = core.literals[index];
326
394
  newLiteral.set(TRUE_LITERAL);
327
395
  this.simplifyLiteral(literal, info, max, newLiteral);
328
396
  if (newLiteral.literal === literal) {
@@ -345,6 +413,7 @@ export class Explain {
345
413
  return isModified;
346
414
  } finally {
347
415
  newLiteral.set(TRUE_LITERAL);
416
+ lcEq.reset();
348
417
  }
349
418
  }
350
419
 
@@ -371,8 +440,7 @@ export class Explain {
371
440
  const atom = this.getAtom(literal);
372
441
  if (!isIneqAtom(atom)) continue;
373
442
  for (const factor of atom.polynomials) {
374
- const variables = new Set(factor.ms.flatMap((monomial) => [...monomial.vars]));
375
- for (const variable of variables) {
443
+ for (const variable of this.pm.getVars(factor)) {
376
444
  if (variable >= max) continue;
377
445
  const eq = this.context.var2eq[variable] ?? null;
378
446
  if (eq === null) continue;
@@ -400,122 +468,210 @@ export class Explain {
400
468
  }
401
469
 
402
470
  private addRootLiteral(kind: RootKind, variable: number, index: number, polynomial: Polynomial) {
403
- if (this.mkLinearRoot(kind, variable, polynomial)) return;
404
- if (this.mkQuadraticRoot(kind, variable, index, polynomial)) return;
405
- const boolVar = this.context.atoms.mkRootAtom(kind, variable, index, polynomial);
406
- this.addLiteral(2 * boolVar + 1);
471
+ const pr = new PolynomialRef(this.pm);
472
+ pr.set(polynomial);
473
+ try {
474
+ if (
475
+ this.mkLinearRoot(kind, variable, polynomial) ||
476
+ this.mkQuadraticRoot(kind, variable, index, polynomial)
477
+ )
478
+ return;
479
+ const boolVar = this.context.atoms.mkRootAtom(kind, variable, index, polynomial);
480
+ this.addLiteral(2 * boolVar + 1);
481
+ } finally {
482
+ pr.reset();
483
+ }
407
484
  }
408
485
 
409
486
  private mkLinearRoot(kind: RootKind, variable: number, polynomial: Polynomial) {
487
+ if (this.pm.degree(polynomial, variable) !== 1) return false;
410
488
  const coeff = this.pm.getConstCoeff(polynomial, variable, 1);
411
- if (this.pm.degree(polynomial, variable) !== 1 || coeff === null) return false;
489
+ if (coeff === null) return false;
412
490
  this.addLinearRoot(kind, polynomial, coeff < 0n);
413
491
  return true;
414
492
  }
415
493
 
416
- private addLinearRoot(kind: RootKind, polynomial: Polynomial, isNegated: boolean) {
417
- const ineq = ROOT_TO_INEQ[kind];
418
- this.addAssumption(ineq.kind, isNegated ? this.pm.neg(polynomial) : polynomial, ineq.isNeg);
419
- }
420
-
421
494
  private mkPlinearRoot(kind: RootKind, variable: number, polynomial: Polynomial) {
422
495
  if (this.pm.degree(polynomial, variable) !== 1) return false;
423
- const coeff = this.pm.coeff(polynomial, variable, 1);
424
- const sign = this.getSign(coeff);
425
- if (sign === 0) return false;
426
- this.ensureSign(coeff);
427
- this.addLinearRoot(kind, polynomial, sign < 0);
428
- return true;
496
+ const c = new PolynomialRef(this.pm);
497
+ try {
498
+ c.set(this.pm.coeff(polynomial, variable, 1));
499
+ const sign = this.getSign(c.get());
500
+ if (sign === 0) return false;
501
+ this.ensureSign(c);
502
+ this.addLinearRoot(kind, polynomial, sign < 0);
503
+ return true;
504
+ } finally {
505
+ c.reset();
506
+ }
429
507
  }
430
508
 
431
509
  private mkQuadraticRoot(kind: RootKind, variable: number, index: number, polynomial: Polynomial) {
432
- if (this.pm.degree(polynomial, variable) !== 2 || (index !== 1 && index !== 2)) return false;
433
- const a = this.pm.coeff(polynomial, variable, 2);
434
- const b = this.pm.coeff(polynomial, variable, 1);
435
- const c = this.pm.coeff(polynomial, variable, 0);
436
- const discriminant = this.pm.sub(this.pm.mul(b, b), this.pm.mul(this.pm.mulConst(4n, a), c));
437
- const y = this.pm.mkVar(variable);
438
- const derivative = this.pm.normalize(this.pm.add(this.pm.mul(this.pm.mulConst(2n, a), y), b));
439
- if (this.ensureSignQuad(discriminant) < 0) return false;
440
- if (this.ensureSignQuad(a) === 0)
441
- return this.mkPlinearRoot(kind, variable, this.pm.add(this.pm.mul(b, y), c));
442
- this.ensureSign(derivative);
443
- if (this.getSign(discriminant) > 0) this.ensureSign(polynomial);
444
- return true;
510
+ const pm = this.pm;
511
+ if (pm.degree(polynomial, variable) !== 2) return false;
512
+ if (index !== 1 && index !== 2) return false;
513
+ const a = new PolynomialRef(pm);
514
+ const b = new PolynomialRef(pm);
515
+ const c = new PolynomialRef(pm);
516
+ const q = new PolynomialRef(pm);
517
+ const pDiff = new PolynomialRef(pm);
518
+ const yy = new PolynomialRef(pm);
519
+ const pr = new PolynomialRef(pm);
520
+ const first = new PolynomialRef(pm);
521
+ const second = new PolynomialRef(pm);
522
+ const third = new PolynomialRef(pm);
523
+ try {
524
+ a.set(pm.coeff(polynomial, variable, 2));
525
+ b.set(pm.coeff(polynomial, variable, 1));
526
+ c.set(pm.coeff(polynomial, variable, 0));
527
+ first.set(pm.mul(b.get(), b.get()));
528
+ second.set(pm.mulConst(4n, a.get()));
529
+ third.set(pm.mul(second.get(), c.get()));
530
+ q.set(pm.sub(first.get(), third.get()));
531
+ third.reset();
532
+ second.reset();
533
+ first.reset();
534
+ yy.set(pm.mkVar(variable));
535
+ first.set(pm.mulConst(2n, a.get()));
536
+ second.set(pm.mul(first.get(), yy.get()));
537
+ pDiff.set(pm.add(second.get(), b.get()));
538
+ second.reset();
539
+ first.reset();
540
+ pDiff.set(pm.normalize(pDiff.get()));
541
+ const discriminantSign = this.ensureSignQuad(q);
542
+ if (discriminantSign < 0) return false;
543
+ if (this.ensureSignQuad(a) === 0) {
544
+ first.set(pm.mul(b.get(), yy.get()));
545
+ q.set(pm.add(first.get(), c.get()));
546
+ first.reset();
547
+ return this.mkPlinearRoot(kind, variable, q.get());
548
+ }
549
+ this.ensureSign(pDiff);
550
+ if (discriminantSign > 0) {
551
+ pr.set(polynomial);
552
+ this.ensureSign(pr);
553
+ }
554
+ return true;
555
+ } finally {
556
+ third.reset();
557
+ second.reset();
558
+ first.reset();
559
+ pr.reset();
560
+ yy.reset();
561
+ pDiff.reset();
562
+ q.reset();
563
+ c.reset();
564
+ b.reset();
565
+ a.reset();
566
+ }
445
567
  }
446
568
 
447
- private ensureSign(polynomial: Polynomial) {
448
- if (this.pm.isConst(polynomial)) return;
449
- this.addAssumption(getKindForSign(this.getSign(polynomial)), polynomial);
450
- this.insertFreshFactorsInTodo(polynomial);
569
+ private ensureSign(p: PolynomialRef) {
570
+ if (this.pm.isConst(p.get())) return;
571
+ this.addAssumption(getKindForSign(this.getSign(p.get())), p.get());
572
+ this.insertFreshFactorsInTodo(p);
451
573
  }
452
574
 
453
- private ensureSignQuad(polynomial: Polynomial) {
454
- const sign = this.getSign(polynomial);
455
- if (!this.pm.isConst(polynomial)) {
456
- this.addAssumption(getKindForSign(sign), polynomial);
457
- this.insertFreshFactorsInTodo(polynomial);
575
+ private ensureSignQuad(p: PolynomialRef) {
576
+ const sign = this.getSign(p.get());
577
+ if (!this.pm.isConst(p.get())) {
578
+ this.addAssumption(getKindForSign(sign), p.get());
579
+ this.insertFreshFactorsInTodo(p);
458
580
  }
459
581
  return sign;
460
582
  }
461
583
 
462
- private addCellLiterals(polynomials: readonly Polynomial[], maxVar: number, isLinear: boolean) {
463
- const cell = getSingleCell(
584
+ private addLinearRoot(kind: RootKind, polynomial: Polynomial, isNegated: boolean) {
585
+ const pPrime = new PolynomialRef(this.pm);
586
+ pPrime.set(polynomial);
587
+ if (isNegated) pPrime.set(this.pm.neg(pPrime.get()));
588
+ const ineq = ROOT_TO_INEQ[kind];
589
+ this.addAssumption(ineq.kind, pPrime.get(), ineq.isNeg);
590
+ pPrime.reset();
591
+ }
592
+
593
+ private levelwiseSingleCell(ps: PolynomialRefVector, maxVar: number, isLinear: boolean) {
594
+ this.lastLwsInputPolys.reset();
595
+ for (let index = 0; index < ps.size; index++) this.lastLwsInputPolys.push(ps.get(index));
596
+ const levelwise = new Levelwise(
464
597
  this.pm,
465
598
  this.am,
466
599
  this.cache,
467
- polynomials,
600
+ ps,
468
601
  maxVar,
469
602
  this.context.sample,
470
603
  isLinear,
471
604
  );
472
- const isFull = this.isFullDimensional;
473
- for (const interval of cell) {
474
- if (interval.isSection) {
475
- const lower = interval.lower!;
476
- this.addRootLiteral("ROOT_EQ", this.pm.maxVar(lower), interval.lowerIndex, lower);
477
- continue;
605
+ let cell: CellInterval[] = [];
606
+ try {
607
+ cell = levelwise.singleCell();
608
+ const isFull = this.isFullDimensional;
609
+ for (const interval of cell) {
610
+ if (interval.isSection) {
611
+ const lower = interval.lower.get();
612
+ this.addRootLiteral("ROOT_EQ", this.pm.maxVar(lower), interval.lowerIndex, lower);
613
+ continue;
614
+ }
615
+ const lower = interval.lower.getOrNull();
616
+ const upper = interval.upper.getOrNull();
617
+ if (lower !== null)
618
+ this.addRootLiteral(
619
+ isFull ? "ROOT_GE" : "ROOT_GT",
620
+ this.pm.maxVar(lower),
621
+ interval.lowerIndex,
622
+ lower,
623
+ );
624
+ if (upper !== null)
625
+ this.addRootLiteral(
626
+ isFull ? "ROOT_LE" : "ROOT_LT",
627
+ this.pm.maxVar(upper),
628
+ interval.upperIndex,
629
+ upper,
630
+ );
478
631
  }
479
- if (interval.lower !== null)
480
- this.addRootLiteral(
481
- isFull ? "ROOT_GE" : "ROOT_GT",
482
- this.pm.maxVar(interval.lower),
483
- interval.lowerIndex,
484
- interval.lower,
485
- );
486
- if (interval.upper !== null)
487
- this.addRootLiteral(
488
- isFull ? "ROOT_LE" : "ROOT_LT",
489
- this.pm.maxVar(interval.upper),
490
- interval.upperIndex,
491
- interval.upper,
492
- );
632
+ } finally {
633
+ releaseIntervals(cell);
634
+ levelwise.release();
493
635
  }
494
636
  }
495
637
 
496
- private project(polynomials: readonly Polynomial[], maxVar: number) {
497
- if (polynomials.length === 0) return;
638
+ private project(ps: PolynomialRefVector, maxVar: number) {
639
+ if (ps.size === 0) return;
498
640
  this.todo.reset();
499
- for (const polynomial of polynomials) this.insertFreshFactorsInTodo(polynomial);
500
- this.addCellLiterals([...this.todo.polynomials], maxVar, false);
641
+ const p = new PolynomialRef(this.pm);
642
+ try {
643
+ for (let index = 0; index < ps.size; index++) {
644
+ p.set(ps.get(index));
645
+ this.insertFreshFactorsInTodo(p);
646
+ p.reset();
647
+ }
648
+ } finally {
649
+ p.reset();
650
+ }
651
+ ps.reset();
652
+ for (const polynomial of this.todo.set.items) ps.push(polynomial);
653
+ this.levelwiseSingleCell(ps, maxVar, false);
501
654
  }
502
655
 
503
- private explainCore(literals: readonly number[]) {
656
+ private main(literals: readonly number[]) {
504
657
  if (literals.length === 0) return;
505
- const polynomials = [...this.collectPolys(literals), ...this.lowerStagePolys];
506
- const maxVar = this.pm.getMaxVarOfPolys(polynomials);
507
- this.project(this.elimVanishingAll(polynomials), maxVar);
658
+ this.collectPolys(literals, this.ps);
659
+ for (let index = 0; index < this.lowerStagePolys.size; index++)
660
+ this.ps.push(this.lowerStagePolys.get(index));
661
+ const maxVar = this.pm.getMaxVarOfPolys(this.ps.items);
662
+ this.elimVanishingAll(this.ps);
663
+ this.project(this.ps, maxVar);
508
664
  }
509
665
 
510
666
  private process(literals: readonly number[]) {
511
- this.lowerStagePolys = [];
667
+ this.lowerStagePolys.reset();
512
668
  const core = this.core;
513
669
  core.reset();
514
670
  for (const literal of literals) core.push(literal);
515
671
  const max = this.context.atoms.getMaxVarOfLiterals(literals);
516
672
  this.normalizeCore(core, max);
517
673
  this.simplifyCore(core, max);
518
- this.explainCore(core.literals);
674
+ this.main(core.literals);
519
675
  core.reset();
520
676
  }
521
677
 
@@ -564,9 +720,9 @@ export class Explain {
564
720
  if (isContaining) kept.push(literal);
565
721
  else this.addLiteral(literal ^ 1);
566
722
  }
567
- const polynomials = this.collectPolys(kept);
568
- if (polynomials.length > 0) {
569
- const maxVar = this.pm.getMaxVarOfPolys(polynomials);
723
+ this.collectPolys(kept, this.ps);
724
+ if (this.ps.size > 0) {
725
+ const maxVar = this.pm.getMaxVarOfPolys(this.ps.items);
570
726
  if (maxVar !== variable) {
571
727
  const renaming = Array.from({ length: this.context.getNumVars() }, (_value, index) =>
572
728
  index === variable ? maxVar : index === maxVar ? variable : index,
@@ -574,7 +730,8 @@ export class Explain {
574
730
  this.context.reorder(renaming);
575
731
  isReordered = true;
576
732
  }
577
- this.project(this.elimVanishingAll(polynomials), maxVar);
733
+ this.elimVanishingAll(this.ps);
734
+ this.project(this.ps, maxVar);
578
735
  this.resetResult();
579
736
  if (isReordered) this.context.restoreOrder();
580
737
  }
@@ -592,11 +749,11 @@ export class Explain {
592
749
 
593
750
  computeLinearExplanation(literals: readonly number[], result: ScopedLiterals) {
594
751
  this.result = result;
595
- this.lowerStagePolys = [];
596
- const polynomials = this.collectPolys(literals);
597
752
  try {
598
- if (polynomials.length > 0)
599
- this.addCellLiterals(polynomials, this.pm.getMaxVarOfPolys(polynomials) + 1, true);
753
+ this.lowerStagePolys.reset();
754
+ this.collectPolys(literals, this.ps);
755
+ if (this.ps.size === 0) return;
756
+ this.levelwiseSingleCell(this.ps, this.pm.getMaxVarOfPolys(this.ps.items) + 1, true);
600
757
  } finally {
601
758
  this.resetResult();
602
759
  }