tla-ts 0.0.10-dev.094b9b512 → 0.0.10-dev.1ebc153bd

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 (530) hide show
  1. package/dist/compile.cjs +3 -3
  2. package/dist/compile.js +1 -1
  3. package/dist/deciders.cjs +37 -36
  4. package/dist/deciders.js +38 -37
  5. package/dist/index.cjs +1 -1
  6. package/dist/index.d.cts +5 -1
  7. package/dist/index.d.ts +5 -1
  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 +146 -58
  14. package/dist/prove.js +145 -57
  15. package/dist/run.cjs +43 -43
  16. package/dist/run.js +45 -45
  17. package/dist/tlapm.cjs +1 -1
  18. package/dist/tlapm.js +2 -2
  19. package/dist/transfer.cjs +40 -37
  20. package/dist/transfer.js +38 -35
  21. package/dist/worker.cjs +6 -6
  22. package/dist/worker.js +6 -6
  23. package/package.json +1 -1
  24. package/src/ast.ts +4 -3
  25. package/src/bags.ts +46 -28
  26. package/src/check-trace.ts +2 -16
  27. package/src/check.ts +349 -91
  28. package/src/cli/runtime-invariants.ts +20 -56
  29. package/src/cli/tlapm.ts +268 -71
  30. package/src/cli/tlc-arguments.ts +2 -2
  31. package/src/cli/tlc-output.ts +4 -5
  32. package/src/cli/tlc-usage.ts +0 -1
  33. package/src/cli/tlc.ts +26 -7
  34. package/src/cli/xml-exporter.ts +1 -1
  35. package/src/codegen.ts +9 -5
  36. package/src/dependencies.ts +72 -11
  37. package/src/dfid.ts +9 -2
  38. package/src/environment.ts +65 -36
  39. package/src/errors.ts +8 -1
  40. package/src/evaluate.ts +92 -32
  41. package/src/exit-codes.ts +5 -2
  42. package/src/instances.ts +5 -5
  43. package/src/java-overrides.ts +2 -2
  44. package/src/levels.ts +138 -90
  45. package/src/liveness-checker.ts +572 -204
  46. package/src/liveness.ts +47 -32
  47. package/src/obligations/action.ts +0 -2
  48. package/src/obligations/anonymize.ts +2 -6
  49. package/src/obligations/equality.ts +0 -2
  50. package/src/obligations/expression.ts +0 -2
  51. package/src/obligations/format.ts +0 -2
  52. package/src/obligations/generate.ts +0 -2
  53. package/src/obligations/index.ts +9 -8
  54. package/src/obligations/levels.ts +0 -2
  55. package/src/obligations/module.ts +0 -2
  56. package/src/obligations/normalize.ts +1 -6
  57. package/src/obligations/operators.ts +0 -2
  58. package/src/obligations/pragma.ts +2 -2
  59. package/src/obligations/printer.ts +5 -7
  60. package/src/obligations/proof.ts +0 -2
  61. package/src/obligations/regroup.ts +0 -2
  62. package/src/obligations/simplify.ts +0 -2
  63. package/src/obligations/subexpression.ts +1 -4
  64. package/src/obligations/substitution.ts +0 -2
  65. package/src/obligations/temporal.ts +0 -2
  66. package/src/obligations/tuples.ts +0 -2
  67. package/src/parallel-worker.ts +8 -2
  68. package/src/parallel.ts +7 -2
  69. package/src/parser.ts +256 -185
  70. package/src/pretty-print.ts +1 -1
  71. package/src/prover/deciders.ts +1 -8
  72. package/src/prover/isabelle/encode.ts +0 -2
  73. package/src/prover/isabelle/isar/attrib.ts +86 -55
  74. package/src/prover/isabelle/isar/context.ts +25 -26
  75. package/src/prover/isabelle/isar/induct.ts +2 -12
  76. package/src/prover/isabelle/isar/method.ts +6 -10
  77. package/src/prover/isabelle/isar/proof.ts +40 -39
  78. package/src/prover/isabelle/isar/rule-cases.ts +14 -22
  79. package/src/prover/isabelle/isar/theory.ts +16 -17
  80. package/src/prover/isabelle/isar/toplevel.ts +46 -56
  81. package/src/prover/isabelle/isar/type-check.ts +0 -2
  82. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  83. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  84. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  85. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  88. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  89. package/src/prover/isabelle/provers/classical.ts +1 -3
  90. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  91. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  92. package/src/prover/isabelle/pure/consts.ts +0 -2
  93. package/src/prover/isabelle/pure/conv.ts +0 -2
  94. package/src/prover/isabelle/pure/drule.ts +0 -2
  95. package/src/prover/isabelle/pure/envir.ts +0 -2
  96. package/src/prover/isabelle/pure/goal.ts +0 -2
  97. package/src/prover/isabelle/pure/logic.ts +0 -2
  98. package/src/prover/isabelle/pure/name.ts +0 -2
  99. package/src/prover/isabelle/pure/net.ts +0 -2
  100. package/src/prover/isabelle/pure/object-logic.ts +0 -2
  101. package/src/prover/isabelle/pure/pattern.ts +0 -2
  102. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  103. package/src/prover/isabelle/pure/rewriter.ts +3 -5
  104. package/src/prover/isabelle/pure/search.ts +0 -2
  105. package/src/prover/isabelle/pure/seq.ts +0 -2
  106. package/src/prover/isabelle/pure/simplifier.ts +0 -2
  107. package/src/prover/isabelle/pure/table.ts +0 -2
  108. package/src/prover/isabelle/pure/tactic.ts +0 -2
  109. package/src/prover/isabelle/pure/tactical.ts +0 -2
  110. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  111. package/src/prover/isabelle/pure/term.ts +3 -5
  112. package/src/prover/isabelle/pure/thm.ts +0 -2
  113. package/src/prover/isabelle/pure/type.ts +0 -2
  114. package/src/prover/isabelle/pure/unify.ts +0 -2
  115. package/src/prover/isabelle/pure/variable.ts +0 -2
  116. package/src/prover/isabelle/tla/classical-setup.ts +0 -2
  117. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  118. package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
  119. package/src/prover/ocaml.ts +4 -1
  120. package/src/prover/prep/action.ts +1 -0
  121. package/src/prover/prep/md5.ts +26 -29
  122. package/src/prover/prep/methods.ts +55 -6
  123. package/src/prover/prep/normalize.ts +4 -1
  124. package/src/prover/prove.ts +58 -32
  125. package/src/prover/ptl/decide.ts +43 -63
  126. package/src/prover/smt/context.ts +10 -14
  127. package/src/prover/smt/data.ts +51 -45
  128. package/src/prover/smt/encode.ts +1 -2
  129. package/src/prover/smt/rewrite.ts +3 -7
  130. package/src/prover/smt/simplify.ts +1 -1
  131. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
  132. package/src/prover/smt/solver/ackr-helper.ts +0 -3
  133. package/src/prover/smt/solver/ackr-model-converter.ts +1 -8
  134. package/src/prover/smt/solver/act-cache.ts +0 -1
  135. package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
  136. package/src/prover/smt/solver/aig-tactic.ts +25 -16
  137. package/src/prover/smt/solver/aig.ts +2 -3
  138. package/src/prover/smt/solver/arith-rewriter.ts +4 -7
  139. package/src/prover/smt/solver/arith-terms.ts +0 -2
  140. package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
  141. package/src/prover/smt/solver/array-rewriter.ts +1 -4
  142. package/src/prover/smt/solver/asserted-formulas.ts +67 -3
  143. package/src/prover/smt/solver/ast-lt.ts +2 -3
  144. package/src/prover/smt/solver/ast-util.ts +4 -5
  145. package/src/prover/smt/solver/ast.ts +171 -168
  146. package/src/prover/smt/solver/auf-solver.ts +0 -1
  147. package/src/prover/smt/solver/bit-blast-tactic.ts +2 -11
  148. package/src/prover/smt/solver/bit-blaster.ts +0 -3
  149. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  150. package/src/prover/smt/solver/bound-manager.ts +39 -29
  151. package/src/prover/smt/solver/bound-simplifier.ts +2 -5
  152. package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
  153. package/src/prover/smt/solver/bv-decl-plugin.ts +13 -11
  154. package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
  155. package/src/prover/smt/solver/bv-rewriter.ts +15 -19
  156. package/src/prover/smt/solver/bv1-blast.ts +1 -11
  157. package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
  158. package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
  159. package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
  160. package/src/prover/smt/solver/card2bv.ts +3 -7
  161. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  162. package/src/prover/smt/solver/cg-table.ts +19 -16
  163. package/src/prover/smt/solver/check-logic.ts +6 -2
  164. package/src/prover/smt/solver/clause.ts +0 -1
  165. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +2 -5
  166. package/src/prover/smt/solver/conflict-resolution.ts +8 -8
  167. package/src/prover/smt/solver/context.ts +45 -15
  168. package/src/prover/smt/solver/ctx-simplify.ts +1 -3
  169. package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
  170. package/src/prover/smt/solver/datatype-decl-plugin.ts +22 -17
  171. package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
  172. package/src/prover/smt/solver/demodulator.ts +2 -5
  173. package/src/prover/smt/solver/dependent-expr-state.ts +25 -7
  174. package/src/prover/smt/solver/der.ts +0 -1
  175. package/src/prover/smt/solver/diff-neq.ts +1 -3
  176. package/src/prover/smt/solver/distribute-forall.ts +1 -11
  177. package/src/prover/smt/solver/dom-simplify.ts +1 -3
  178. package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
  179. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  180. package/src/prover/smt/solver/e-matching.ts +6 -7
  181. package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
  182. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  183. package/src/prover/smt/solver/elim-uncnstr.ts +7 -23
  184. package/src/prover/smt/solver/enode.ts +16 -10
  185. package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
  186. package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
  187. package/src/prover/smt/solver/euf/arith-internalize.ts +2 -8
  188. package/src/prover/smt/solver/euf/arith-solver.ts +0 -6
  189. package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
  190. package/src/prover/smt/solver/euf/array-internalize.ts +21 -12
  191. package/src/prover/smt/solver/euf/array-solver.ts +0 -2
  192. package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
  193. package/src/prover/smt/solver/euf/bv-internalize.ts +1 -3
  194. package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
  195. package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
  196. package/src/prover/smt/solver/euf/egraph.ts +69 -53
  197. package/src/prover/smt/solver/euf/euf-solver.ts +38 -37
  198. package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
  199. package/src/prover/smt/solver/euf/mam.ts +7 -55
  200. package/src/prover/smt/solver/euf/q-ematch.ts +27 -98
  201. package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
  202. package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
  203. package/src/prover/smt/solver/euf/q-solver.ts +3 -3
  204. package/src/prover/smt/solver/euf/th-solver.ts +1 -16
  205. package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
  206. package/src/prover/smt/solver/expr-ref.ts +0 -1
  207. package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
  208. package/src/prover/smt/solver/expr2polynomial.ts +204 -80
  209. package/src/prover/smt/solver/factor.ts +37 -26
  210. package/src/prover/smt/solver/fd-solver.ts +3 -5
  211. package/src/prover/smt/solver/fingerprints.ts +0 -1
  212. package/src/prover/smt/solver/fix-dl-var.ts +2 -4
  213. package/src/prover/smt/solver/flat-literals.ts +0 -1
  214. package/src/prover/smt/solver/fm-tactic.ts +25 -14
  215. package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
  216. package/src/prover/smt/solver/fpa-rewriter.ts +12 -14
  217. package/src/prover/smt/solver/fpa2bv-converter.ts +13 -8
  218. package/src/prover/smt/solver/fpa2bv-rewriter.ts +1 -1
  219. package/src/prover/smt/solver/fpa2bv-tactic.ts +1 -3
  220. package/src/prover/smt/solver/goal.ts +6 -4
  221. package/src/prover/smt/solver/goal2nlsat.ts +57 -32
  222. package/src/prover/smt/solver/guard-set.ts +0 -1
  223. package/src/prover/smt/solver/hash.ts +0 -1
  224. package/src/prover/smt/solver/hashtable.ts +4 -1
  225. package/src/prover/smt/solver/inf-eps.ts +1 -2
  226. package/src/prover/smt/solver/inj-axiom.ts +0 -1
  227. package/src/prover/smt/solver/internalizer.ts +41 -3
  228. package/src/prover/smt/solver/lackr.ts +0 -2
  229. package/src/prover/smt/solver/lbool.ts +0 -1
  230. package/src/prover/smt/solver/lia2card.ts +1 -2
  231. package/src/prover/smt/solver/lia2pb.ts +18 -5
  232. package/src/prover/smt/solver/literal.ts +0 -1
  233. package/src/prover/smt/solver/logic-tactics.ts +9 -6
  234. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  235. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  236. package/src/prover/smt/solver/lp/containers.ts +7 -2
  237. package/src/prover/smt/solver/lp/core-solver.ts +0 -3
  238. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  239. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  240. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  241. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  242. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  243. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  244. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  245. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  246. package/src/prover/smt/solver/lp/int-cube.ts +0 -1
  247. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  248. package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
  249. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  250. package/src/prover/smt/solver/lp/lp-settings.ts +1 -2
  251. package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
  252. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  253. package/src/prover/smt/solver/lp/nex.ts +2 -2
  254. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  255. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  256. package/src/prover/smt/solver/lp/nla-core.ts +26 -7
  257. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  258. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  259. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  260. package/src/prover/smt/solver/lp/nla-grobner.ts +158 -82
  261. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  262. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  263. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  264. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  265. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  266. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  267. package/src/prover/smt/solver/lp/nla-powers.ts +144 -108
  268. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  269. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  270. package/src/prover/smt/solver/lp/nla-transcendentals.ts +50 -19
  271. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  273. package/src/prover/smt/solver/lp/nra-solver.ts +138 -97
  274. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  275. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  276. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  277. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  278. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  279. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  280. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  281. package/src/prover/smt/solver/lp/union-find.ts +1 -2
  282. package/src/prover/smt/solver/macro-finder.ts +1 -4
  283. package/src/prover/smt/solver/mam-compiler.ts +14 -15
  284. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  285. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
  286. package/src/prover/smt/solver/max-cliques.ts +0 -2
  287. package/src/prover/smt/solver/maxcore.ts +6 -15
  288. package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -2
  289. package/src/prover/smt/solver/maxlex.ts +0 -8
  290. package/src/prover/smt/solver/maxsmt-base.ts +7 -1
  291. package/src/prover/smt/solver/maxsmt.ts +0 -1
  292. package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
  293. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
  294. package/src/prover/smt/solver/mbp/mbp-plugin.ts +10 -3
  295. package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
  296. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
  297. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +1 -19
  298. package/src/prover/smt/solver/model-based-opt.ts +1 -2
  299. package/src/prover/smt/solver/model-checker.ts +2 -3
  300. package/src/prover/smt/solver/model-evaluator.ts +9 -6
  301. package/src/prover/smt/solver/model-finder.ts +0 -1
  302. package/src/prover/smt/solver/model-generator.ts +3 -2
  303. package/src/prover/smt/solver/model-macro-solver.ts +3 -4
  304. package/src/prover/smt/solver/model-printer.ts +0 -1
  305. package/src/prover/smt/solver/mpf.ts +2 -5
  306. package/src/prover/smt/solver/mus.ts +2 -4
  307. package/src/prover/smt/solver/muz/dl-context.ts +67 -19
  308. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
  309. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
  310. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
  311. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -6
  312. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
  313. package/src/prover/smt/solver/muz/dl-mk-slice.ts +78 -16
  314. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
  315. package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -30
  316. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
  317. package/src/prover/smt/solver/muz/dl-rule.ts +93 -57
  318. package/src/prover/smt/solver/muz/hnf.ts +6 -6
  319. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  320. package/src/prover/smt/solver/muz/horn-tactic.ts +15 -6
  321. package/src/prover/smt/solver/muz/rule-properties.ts +195 -37
  322. package/src/prover/smt/solver/muz/spacer-context.ts +111 -102
  323. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -4
  324. package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
  325. package/src/prover/smt/solver/muz/spacer-manager.ts +0 -6
  326. package/src/prover/smt/solver/muz/spacer-pdr.ts +4 -4
  327. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +4 -15
  328. package/src/prover/smt/solver/muz/spacer-util.ts +2 -29
  329. package/src/prover/smt/solver/muz/substitution.ts +88 -39
  330. package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
  331. package/src/prover/smt/solver/nlqsat.ts +5 -5
  332. package/src/prover/smt/solver/nlsat/algebraic.ts +197 -96
  333. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  334. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  335. package/src/prover/smt/solver/nlsat/explain.ts +379 -217
  336. package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
  337. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  338. package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
  339. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  340. package/src/prover/smt/solver/nlsat/solver.ts +118 -105
  341. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
  342. package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -19
  343. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  344. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  345. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  346. package/src/prover/smt/solver/nlsat-tactic.ts +1 -2
  347. package/src/prover/smt/solver/nnf.ts +6 -3
  348. package/src/prover/smt/solver/normalize-bounds.ts +0 -1
  349. package/src/prover/smt/solver/occf.ts +0 -1
  350. package/src/prover/smt/solver/opt-context.ts +19 -13
  351. package/src/prover/smt/solver/opt-nlsat.ts +97 -77
  352. package/src/prover/smt/solver/opt-pareto.ts +0 -2
  353. package/src/prover/smt/solver/opt-preprocess.ts +1 -2
  354. package/src/prover/smt/solver/opt-solver.ts +22 -11
  355. package/src/prover/smt/solver/opt-value.ts +0 -1
  356. package/src/prover/smt/solver/optsmt.ts +13 -12
  357. package/src/prover/smt/solver/parallel-tactic.ts +0 -2
  358. package/src/prover/smt/solver/pattern-inference.ts +2 -3
  359. package/src/prover/smt/solver/pb-rewriter.ts +15 -30
  360. package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
  361. package/src/prover/smt/solver/poly-rewriter.ts +76 -21
  362. package/src/prover/smt/solver/probes.ts +91 -28
  363. package/src/prover/smt/solver/propagate-values.ts +4 -1
  364. package/src/prover/smt/solver/proto-model.ts +9 -12
  365. package/src/prover/smt/solver/pull-quant.ts +0 -1
  366. package/src/prover/smt/solver/purify-arith.ts +50 -16
  367. package/src/prover/smt/solver/qe-arith-plugin.ts +4 -7
  368. package/src/prover/smt/solver/qe-lite-der.ts +0 -1
  369. package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
  370. package/src/prover/smt/solver/qe-lite.ts +2 -3
  371. package/src/prover/smt/solver/qe-mbp.ts +13 -24
  372. package/src/prover/smt/solver/qe.ts +48 -57
  373. package/src/prover/smt/solver/qel.ts +0 -1
  374. package/src/prover/smt/solver/qi-queue.ts +0 -1
  375. package/src/prover/smt/solver/qsat.ts +71 -97
  376. package/src/prover/smt/solver/quant-hoist.ts +2 -1
  377. package/src/prover/smt/solver/quant-tactics.ts +0 -1
  378. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  379. package/src/prover/smt/solver/quantifier-manager.ts +14 -10
  380. package/src/prover/smt/solver/quasi-macros.ts +9 -20
  381. package/src/prover/smt/solver/random-gen.ts +0 -1
  382. package/src/prover/smt/solver/rational.ts +17 -1
  383. package/src/prover/smt/solver/recfun-decl-plugin.ts +35 -21
  384. package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
  385. package/src/prover/smt/solver/reduce-args.ts +0 -1
  386. package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
  387. package/src/prover/smt/solver/ref-vector.ts +0 -1
  388. package/src/prover/smt/solver/relevancy.ts +0 -1
  389. package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
  390. package/src/prover/smt/solver/rewriter.ts +1 -2
  391. package/src/prover/smt/solver/rlimit.ts +17 -1
  392. package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
  393. package/src/prover/smt/solver/sat/big.ts +0 -1
  394. package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
  395. package/src/prover/smt/solver/sat/clause.ts +2 -20
  396. package/src/prover/smt/solver/sat/cleaner.ts +0 -2
  397. package/src/prover/smt/solver/sat/config.ts +6 -9
  398. package/src/prover/smt/solver/sat/consequences.ts +1 -2
  399. package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
  400. package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
  401. package/src/prover/smt/solver/sat/inc-sat-solver.ts +30 -15
  402. package/src/prover/smt/solver/sat/model-converter.ts +2 -22
  403. package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
  404. package/src/prover/smt/solver/sat/pb-solver.ts +50 -26
  405. package/src/prover/smt/solver/sat/probing.ts +22 -21
  406. package/src/prover/smt/solver/sat/sat-tactic.ts +4 -4
  407. package/src/prover/smt/solver/sat/sat2goal.ts +9 -15
  408. package/src/prover/smt/solver/sat/scc.ts +1 -2
  409. package/src/prover/smt/solver/sat/simplifier.ts +16 -60
  410. package/src/prover/smt/solver/sat/solver.ts +47 -70
  411. package/src/prover/smt/solver/sat/var-queue.ts +0 -2
  412. package/src/prover/smt/solver/sat/watch-list.ts +7 -3
  413. package/src/prover/smt/solver/search-tree.ts +0 -1
  414. package/src/prover/smt/solver/seq-axioms.ts +21 -39
  415. package/src/prover/smt/solver/seq-decl-plugin.ts +10 -14
  416. package/src/prover/smt/solver/seq-derive.ts +11 -16
  417. package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
  418. package/src/prover/smt/solver/seq-eq-solver.ts +9 -10
  419. package/src/prover/smt/solver/seq-factory.ts +2 -4
  420. package/src/prover/smt/solver/seq-monadic.ts +7 -7
  421. package/src/prover/smt/solver/seq-range-predicate.ts +18 -8
  422. package/src/prover/smt/solver/seq-re-rewriter.ts +5 -130
  423. package/src/prover/smt/solver/seq-re-util.ts +8 -27
  424. package/src/prover/smt/solver/seq-regex-bisim.ts +2 -3
  425. package/src/prover/smt/solver/seq-regex-live.ts +6 -8
  426. package/src/prover/smt/solver/seq-rewriter.ts +32 -35
  427. package/src/prover/smt/solver/seq-skolem.ts +0 -24
  428. package/src/prover/smt/solver/seq-subset.ts +0 -1
  429. package/src/prover/smt/solver/seq-view-witness.ts +4 -6
  430. package/src/prover/smt/solver/smt-consequences.ts +0 -2
  431. package/src/prover/smt/solver/smt-kernel.ts +9 -5
  432. package/src/prover/smt/solver/smt-logics.ts +0 -1
  433. package/src/prover/smt/solver/smt-setup.ts +86 -20
  434. package/src/prover/smt/solver/smt2-printer.ts +0 -2
  435. package/src/prover/smt/solver/smtlib-parser.ts +1681 -721
  436. package/src/prover/smt/solver/smtlib-script.ts +1273 -793
  437. package/src/prover/smt/solver/solve-eqs.ts +13 -23
  438. package/src/prover/smt/solver/solver.ts +1 -2
  439. package/src/prover/smt/solver/static-features.ts +0 -5
  440. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  441. package/src/prover/smt/solver/tactic.ts +269 -130
  442. package/src/prover/smt/solver/term-enumeration.ts +0 -1
  443. package/src/prover/smt/solver/theory-array.ts +25 -60
  444. package/src/prover/smt/solver/theory-bv.ts +15 -54
  445. package/src/prover/smt/solver/theory-char.ts +0 -1
  446. package/src/prover/smt/solver/theory-datatype.ts +0 -1
  447. package/src/prover/smt/solver/theory-finite-set.ts +2 -2
  448. package/src/prover/smt/solver/theory-fpa.ts +46 -79
  449. package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
  450. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
  451. package/src/prover/smt/solver/theory-lra-final-check.ts +1 -2
  452. package/src/prover/smt/solver/theory-lra-internalize.ts +9 -1
  453. package/src/prover/smt/solver/theory-lra-model.ts +0 -1
  454. package/src/prover/smt/solver/theory-lra-propagate.ts +6 -5
  455. package/src/prover/smt/solver/theory-lra-state.ts +0 -1
  456. package/src/prover/smt/solver/theory-lra.ts +0 -7
  457. package/src/prover/smt/solver/theory-pb.ts +34 -15
  458. package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
  459. package/src/prover/smt/solver/theory-recfun.ts +2 -3
  460. package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
  461. package/src/prover/smt/solver/theory-seq-solve.ts +6 -8
  462. package/src/prover/smt/solver/theory-seq-state.ts +8 -36
  463. package/src/prover/smt/solver/theory-seq.ts +32 -55
  464. package/src/prover/smt/solver/theory.ts +16 -2
  465. package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
  466. package/src/prover/smt/solver/var-subst.ts +6 -6
  467. package/src/prover/smt/table.ts +3 -2
  468. package/src/prover/tlapm/cache.ts +8 -8
  469. package/src/prover/zenon/decide.ts +9 -13
  470. package/src/prover/zenon/encode.ts +0 -2
  471. package/src/prover/zenon/eqrel.ts +0 -2
  472. package/src/prover/zenon/equality-rules.ts +24 -2
  473. package/src/prover/zenon/expr.ts +21 -2
  474. package/src/prover/zenon/index-table.ts +7 -4
  475. package/src/prover/zenon/isar-case.ts +1 -3
  476. package/src/prover/zenon/isar.ts +2 -4
  477. package/src/prover/zenon/llproof.ts +0 -2
  478. package/src/prover/zenon/mltoll.ts +0 -2
  479. package/src/prover/zenon/node.ts +12 -13
  480. package/src/prover/zenon/parse.ts +0 -2
  481. package/src/prover/zenon/phrase.ts +1 -3
  482. package/src/prover/zenon/proof.ts +0 -2
  483. package/src/prover/zenon/propositional-rules.ts +0 -2
  484. package/src/prover/zenon/rules.ts +2 -3
  485. package/src/prover/zenon/search.ts +0 -2
  486. package/src/prover/zenon/tla/functions.ts +0 -2
  487. package/src/prover/zenon/tla/llproof.ts +0 -2
  488. package/src/prover/zenon/tla/records.ts +0 -2
  489. package/src/prover/zenon/tla/rewrites.ts +0 -2
  490. package/src/prover/zenon/tla/sets.ts +1 -3
  491. package/src/prover/zenon/tla/terms.ts +0 -2
  492. package/src/prover/zenon/tla/tla.ts +0 -2
  493. package/src/resolve.ts +625 -189
  494. package/src/runtime.ts +7 -1
  495. package/src/sany/builtins.ts +10 -10
  496. package/src/sany/generation.ts +2 -13
  497. package/src/sany/generator-definitions.ts +3 -1
  498. package/src/sany/generator-expressions.ts +36 -30
  499. package/src/sany/generator-proofs.ts +5 -3
  500. package/src/sany/generator.ts +2 -1
  501. package/src/sany/levels.ts +0 -2
  502. package/src/sany/lexer.ts +3 -3
  503. package/src/sany/linter.ts +0 -2
  504. package/src/sany/modules.ts +4 -2
  505. package/src/sany/nodes.ts +1 -1
  506. package/src/sany/selectors.ts +11 -6
  507. package/src/sany/xml.ts +2 -3
  508. package/src/search.ts +209 -56
  509. package/src/simulate.ts +3 -0
  510. package/src/spec-description.ts +2 -2
  511. package/src/standard-definitions.ts +4 -0
  512. package/src/state-graph.ts +0 -2
  513. package/src/subexpressions.ts +265 -94
  514. package/src/successors.ts +2 -1
  515. package/src/symmetry.ts +3 -3
  516. package/src/tableau.ts +2 -2
  517. package/src/tlc/fingerprint.ts +81 -9
  518. package/src/tlc/jar-data.ts +10 -0
  519. package/src/tlc/messages.ts +3 -3
  520. package/src/tlc/order.ts +14 -3
  521. package/src/tlc/summary.ts +29 -14
  522. package/src/tlc/tlc-operators.ts +3 -1
  523. package/src/tlc/tlcext-operators.ts +61 -16
  524. package/src/tlc/trace-spec.ts +5 -5
  525. package/src/typed-tier.ts +6541 -0
  526. package/src/typescript/types.ts +2 -2
  527. package/src/values.ts +46 -27
  528. package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
  529. package/src/prover/smt/solver/z3-license.txt +0 -10
  530. package/src/prover/zenon/LICENSE +0 -32
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/fpa_rewriter.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  OP_EXTRACT,
@@ -404,6 +403,8 @@ const mkIsInfOfInt = (
404
403
  ? mkCompare(OP_LE, -threshold)
405
404
  : manager.falseExpr;
406
405
  }
406
+ // Deviation from Z3: it runs out of memory from an exponent width of 31, so this gives up as Z3 does from 34.
407
+ if (ebits > 30) return -1;
407
408
  const maxFinite = mpfToRational(mkMaxValue(ebits, sbits, false)).num;
408
409
  const halfUlp = 1n << BigInt(maxExp - sbits);
409
410
  return rm === MPF_ROUND_NEAREST_TEVEN || rm === MPF_ROUND_NEAREST_TAWAY
@@ -432,11 +433,10 @@ const mkIsInf = (manager: AstManager, arg: number): Result => {
432
433
  const folded = mkPredicate(manager, arg, isInf);
433
434
  if (folded !== undefined) return folded;
434
435
  const toFp = getToFpOfInt(manager, arg);
435
- if (toFp !== undefined)
436
- return rewrite(
437
- mkIsInfOfInt(manager, toFp.rm, toFp.ebits, toFp.sbits, toFp.integer),
438
- BR_REWRITE_FULL,
439
- );
436
+ if (toFp !== undefined) {
437
+ const infCond = mkIsInfOfInt(manager, toFp.rm, toFp.ebits, toFp.sbits, toFp.integer);
438
+ if (infCond !== -1) return rewrite(infCond, BR_REWRITE_FULL);
439
+ }
440
440
  return mkPredicateOfIte(manager, arg, isInf);
441
441
  };
442
442
 
@@ -444,14 +444,12 @@ const mkIsNormal = (manager: AstManager, arg: number): Result => {
444
444
  const folded = mkPredicate(manager, arg, isNormal);
445
445
  if (folded !== undefined) return folded;
446
446
  const toFp = getToFpOfInt(manager, arg);
447
- if (toFp !== undefined)
448
- return rewrite(
449
- manager.mkAnd([
450
- manager.mkNot(manager.mkEq(toFp.integer, manager.mkNumeral(0n))),
451
- manager.mkNot(mkIsInfOfInt(manager, toFp.rm, toFp.ebits, toFp.sbits, toFp.integer)),
452
- ]),
453
- BR_REWRITE_FULL,
454
- );
447
+ if (toFp !== undefined) {
448
+ const notZero = manager.mkNot(manager.mkEq(toFp.integer, manager.mkNumeral(0n)));
449
+ const infCond = mkIsInfOfInt(manager, toFp.rm, toFp.ebits, toFp.sbits, toFp.integer);
450
+ if (infCond === -1) return undefined;
451
+ return rewrite(manager.mkAnd([notZero, manager.mkNot(infCond)]), BR_REWRITE_FULL);
452
+ }
455
453
  return mkPredicateOfIte(manager, arg, isNormal);
456
454
  };
457
455
 
@@ -1,5 +1,6 @@
1
- // Ported from Z3 (src/ast/fpa/fpa2bv_converter.cpp), MIT license, see z3-license.txt.
2
- import { SmtUnsupportedError } from "../../../errors";
1
+ // A statement that discards its result builds a term that upstream builds and never uses, so the
2
+ // terms after it get the ids Z3 gives them.
3
+ import { SmtCanceledError, SmtUnsupportedError } from "../../../errors";
3
4
  import {
4
5
  type AstManager,
5
6
  OP_BADD,
@@ -103,15 +104,15 @@ export class Fpa2BvConverter {
103
104
  manager.decDeclRef(entry[0]);
104
105
  manager.decRef(entry[1]);
105
106
  }
107
+ for (const entry of this.uf2BvUf) {
108
+ manager.decDeclRef(entry[0]);
109
+ manager.decDeclRef(entry[1]);
110
+ }
106
111
  for (const entry of this.minMaxUfs) {
107
112
  manager.decDeclRef(entry[0]);
108
113
  manager.decRef(entry[1][0]);
109
114
  manager.decRef(entry[1][1]);
110
115
  }
111
- for (const entry of this.uf2BvUf) {
112
- manager.decDeclRef(entry[0]);
113
- manager.decDeclRef(entry[1]);
114
- }
115
116
  this.constants.clear();
116
117
  this.rmConstants.clear();
117
118
  this.minMaxUfs.clear();
@@ -1413,10 +1414,12 @@ export class Fpa2BvConverter {
1413
1414
  if (manager.getOp(x) !== OP_NUM) return this.mkToFpSymbolicReal(sort, rm, x);
1414
1415
  const value = manager.getRationalValue(x);
1415
1416
  if (value.isZero()) return this.mkPzero(sort);
1416
- if (manager.isBvNumeral(rm))
1417
+ if (manager.isBvNumeral(rm)) {
1418
+ const mode = Number(manager.getBvNumeralValue(rm));
1417
1419
  return this.mkFpOfMpf(
1418
- mpfFromRational(ebits, sbits, Number(manager.getBvNumeralValue(rm)), 0n, value),
1420
+ mpfFromRational(ebits, sbits, mode > BV_RM_TO_ZERO ? BV_RM_TO_ZERO : mode, 0n, value),
1419
1421
  );
1422
+ }
1420
1423
  const rmNta = this.mkIsRm(rm, BV_RM_TIES_TO_AWAY);
1421
1424
  const rmNte = this.mkIsRm(rm, BV_RM_TIES_TO_EVEN);
1422
1425
  const rmTp = this.mkIsRm(rm, BV_RM_TO_POSITIVE);
@@ -1437,6 +1440,8 @@ export class Fpa2BvConverter {
1437
1440
  const manager = this.manager;
1438
1441
  const ebits = manager.getEbits(sort);
1439
1442
  const sbits = manager.getSbits(sort);
1443
+ // Deviation from Z3: it runs out of memory from an exponent width of 31, where this gives up as at a resource limit.
1444
+ if (ebits > 30) throw new SmtCanceledError();
1440
1445
  const x =
1441
1446
  manager.sorts[input] === SORT_INT ? manager.mkApp(OP_TO_REAL, [input], SORT_REAL) : input;
1442
1447
  const real = (op: number, ...args: number[]) => manager.mkApp(op, args, SORT_REAL);
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/fpa/fpa2bv_rewriter.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtUnsupportedError } from "../../../errors";
3
2
  import {
4
3
  type AstManager,
@@ -215,6 +214,7 @@ export class Fpa2BvRewriter extends RewriterTpl {
215
214
  isSwapped ? args[1] : args[2],
216
215
  );
217
216
  }
217
+ // Deviation from Z3: mk_sub hands mk_add a rounding mode under bv2rm, so fpa2bv fails on fp.sub.
218
218
  case OP_FPA_SUB:
219
219
  return converter.mkSub(sort, getRm(), args[1], args[2]);
220
220
  case OP_FPA_NEG:
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/tactic/fpa/fpa2bv_tactic.cpp, src/tactic/fpa/fpa2bv_model_converter.cpp,
2
- // src/ast/fpa/bv2fpa_converter.cpp), MIT license, see z3-license.txt.
3
1
  import type { AstManager } from "./ast";
4
2
  import { TACTIC_ARITH_OPTIONS } from "./arith-rewriter";
5
3
  import { convertMinMaxSpecials, convertUf2BvUf } from "./bv2fpa-converter";
@@ -64,7 +62,7 @@ export const runFpa2Bv = (manager: AstManager) => (goal: Goal) => {
64
62
  const size = goal.forms.size;
65
63
  for (let index = 0; !goal.isInconsistent && index < size; index++) {
66
64
  const result = rewriter.rewrite(goal.forms.items[index]);
67
- goal.update(index, result);
65
+ goal.update(index, result, goal.getDependency(index));
68
66
  manager.decRef(result);
69
67
  }
70
68
  goal.addModelConversion((model) => convertModel(converter, model));
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/tactic/goal.cpp), MIT license, see z3-license.txt.
2
1
  import { OP_AND, OP_NOT, OP_OR, SORT_BOOL, type AstManager } from "./ast";
3
2
  import type { ProtoModel } from "./proto-model";
4
3
  import { RefVector } from "./ref-vector";
@@ -21,7 +20,6 @@ export const joinDependencies = (
21
20
  ? first
22
21
  : { value: -1, children: [first, second] };
23
22
 
24
- // Breadth first and once per node, so a value that two leaves hold is listed twice.
25
23
  export const getDependencyValues = (dependency: Dependency | undefined) => {
26
24
  if (dependency === undefined) return [];
27
25
  const todo = [dependency];
@@ -36,7 +34,7 @@ export const getDependencyValues = (dependency: Dependency | undefined) => {
36
34
  todo.push(child);
37
35
  }
38
36
  }
39
- return values;
37
+ return [...new Set(values)];
40
38
  };
41
39
 
42
40
  interface Polarized {
@@ -44,7 +42,7 @@ interface Polarized {
44
42
  isPositive: boolean;
45
43
  }
46
44
 
47
- export const PRECISE = 0;
45
+ const PRECISE = 0;
48
46
  export const UNDER = 1;
49
47
  export const OVER = 2;
50
48
  const UNDER_OVER = 3;
@@ -82,7 +80,10 @@ export class Goal {
82
80
  converters: (HiddenDecl | Definitions | ModelConversion)[] = [];
83
81
  model: ProtoModel | undefined;
84
82
  isProofsEnabled = false;
83
+ isModelsEnabled = true;
85
84
  isCoresEnabled = false;
85
+ // As in Z3, it isn't copied with the goal.
86
+ reasonUnknown = "";
86
87
 
87
88
  constructor(readonly manager: AstManager) {
88
89
  this.forms = new RefVector(manager);
@@ -104,6 +105,7 @@ export class Goal {
104
105
  this.precision = getPrecisionUnion(source.precision, this.precision);
105
106
  this.converters = source.converters;
106
107
  this.isProofsEnabled = source.isProofsEnabled;
108
+ this.isModelsEnabled = source.isModelsEnabled;
107
109
  this.isCoresEnabled = source.isCoresEnabled;
108
110
  }
109
111
 
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/nlsat/tactic/goal2nlsat.cpp, src/ast/expr2polynomial.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import { SmtTacticError } from "../../../errors";
4
2
  import {
5
3
  type AstManager,
@@ -24,9 +22,10 @@ import {
24
22
  SORT_INT,
25
23
  SORT_REAL,
26
24
  } from "./ast";
27
- import { toPolynomial } from "./expr2polynomial";
25
+ import { Expr2Polynomial } from "./expr2polynomial";
28
26
  import { getLcm } from "./rational";
29
27
  import { flipKind } from "./nlsat/atoms";
28
+ import { Factors, type Polynomial, PolynomialRef } from "./nlsat/polynomial";
30
29
  import type { NlsatSolver } from "./nlsat/solver";
31
30
  import { TRANSCENDENTAL_OPS } from "./nlsat/transcendental-eval";
32
31
  import type { IneqKind } from "./nlsat/types";
@@ -41,38 +40,54 @@ export const goal2nlsat = (
41
40
  isFactoring = true,
42
41
  ) => {
43
42
  const pm = solver.pm;
43
+ const expr2poly = new Expr2Polynomial(manager, pm, t2x, (isInt) => solver.mkVar(isInt));
44
44
 
45
- const mkVar = (term: number) => {
46
- let variable = t2x.get(term);
47
- if (variable === undefined) {
48
- variable = solver.mkVar(manager.sorts[term] === SORT_INT);
49
- t2x.set(term, variable);
50
- }
51
- return variable;
45
+ const factorAtom = (polynomial: Polynomial, kind: IneqKind) => {
46
+ const factors = new Factors(pm);
47
+ pm.factor(polynomial, factors);
48
+ const literal = solver.mkIneqLiteral(
49
+ factors.constant < 0n ? flipKind(kind) : kind,
50
+ factors.factors,
51
+ factors.degrees.map((degree) => degree % 2 === 0),
52
+ );
53
+ factors.reset();
54
+ return literal;
52
55
  };
53
56
 
54
- const processIneq = (atom: number, kind: IneqKind) => {
55
- const lhs = toPolynomial(manager, pm, manager.getArg(atom, 0), mkVar);
56
- const rhs = toPolynomial(manager, pm, manager.getArg(atom, 1), mkVar);
57
- const lcm = getLcm(lhs.denominator, rhs.denominator);
58
- const polynomial = pm.addmul(
59
- lcm / lhs.denominator,
60
- lhs.polynomial,
61
- -(lcm / rhs.denominator),
62
- rhs.polynomial,
63
- );
57
+ const processIneqPolynomial = (p: PolynomialRef, kind: IneqKind) => {
58
+ const polynomial = p.get();
64
59
  if (pm.isConst(polynomial)) {
65
60
  const sign = pm.isZero(polynomial) ? 0 : polynomial.as[0] > 0n ? 1 : -1;
66
61
  const isTrue = kind === "EQ" ? sign === 0 : kind === "LT" ? sign < 0 : sign > 0;
67
62
  return isTrue ? 0 : 1;
68
63
  }
69
- if (!isFactoring) return solver.mkIneqLiteral(kind, [polynomial], [false]);
70
- const factors = pm.factor(polynomial);
71
- return solver.mkIneqLiteral(
72
- factors.constant < 0n ? flipKind(kind) : kind,
73
- factors.factors,
74
- factors.degrees.map((degree) => degree % 2 === 0),
64
+ return isFactoring
65
+ ? factorAtom(polynomial, kind)
66
+ : solver.mkIneqLiteral(kind, [polynomial], [false]);
67
+ };
68
+
69
+ const processIneq = (atom: number, kind: IneqKind) => {
70
+ const first = new PolynomialRef(pm);
71
+ const second = new PolynomialRef(pm);
72
+ const p = new PolynomialRef(pm);
73
+ const firstDenominator = expr2poly.toPolynomial(manager.getArg(atom, 0), first);
74
+ const secondDenominator = expr2poly.toPolynomial(manager.getArg(atom, 1), second);
75
+ const lcm = getLcm(firstDenominator, secondDenominator);
76
+ p.set(
77
+ pm.addmulTerms(
78
+ lcm / firstDenominator,
79
+ pm.unit,
80
+ first.get(),
81
+ -(lcm / secondDenominator),
82
+ pm.unit,
83
+ second.get(),
84
+ ),
75
85
  );
86
+ const literal = processIneqPolynomial(p, kind);
87
+ p.reset();
88
+ second.reset();
89
+ first.reset();
90
+ return literal;
76
91
  };
77
92
 
78
93
  const processBoolVar = (atom: number) => {
@@ -131,20 +146,29 @@ export const goal2nlsat = (
131
146
  // The polynomial conversion treats a transcendental application, argument included, as one
132
147
  // variable, so its argument gets a variable here, through an equation unless it is one already.
133
148
  const mkArgVar = (term: number) => {
134
- const result = toPolynomial(manager, pm, term, mkVar);
135
- const polynomial = result.polynomial;
149
+ const p = new PolynomialRef(pm);
150
+ const denominator = expr2poly.toPolynomial(term, p);
151
+ const polynomial = p.get();
136
152
  const monomial = polynomial.ms[0];
137
153
  if (
138
- result.denominator === 1n &&
154
+ denominator === 1n &&
139
155
  polynomial.ms.length === 1 &&
140
156
  polynomial.as[0] === 1n &&
141
157
  monomial.size === 1 &&
142
158
  monomial.degrees[0] === 1
143
- )
159
+ ) {
160
+ p.reset();
144
161
  return monomial.vars[0];
162
+ }
145
163
  const variable = solver.mkVar(false);
146
- const equation = pm.addmul(result.denominator, pm.mkVar(variable), -1n, polynomial);
147
- solver.mkExternalClause([solver.mkIneqLiteral("EQ", [equation], [false])], null);
164
+ const vp = new PolynomialRef(pm);
165
+ const equation = new PolynomialRef(pm);
166
+ vp.set(pm.mkVar(variable));
167
+ equation.set(pm.addmulTerms(denominator, pm.unit, vp.get(), -1n, pm.unit, polynomial));
168
+ solver.mkExternalClause([solver.mkIneqLiteral("EQ", [equation.get()], [false])], null);
169
+ equation.reset();
170
+ vp.reset();
171
+ p.reset();
148
172
  return variable;
149
173
  };
150
174
 
@@ -176,6 +200,7 @@ export const goal2nlsat = (
176
200
  }
177
201
  }
178
202
  if (piVar !== undefined) solver.transcendentals.addPi(piVar);
203
+ expr2poly.release();
179
204
  };
180
205
 
181
206
  const hasTermIte = (manager: AstManager, form: number) => {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/guard_set.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  OP_AND,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/hash.h, src/util/hash.cpp), MIT license, see z3-license.txt.
2
1
  const GOLDEN_RATIO = 0x9e3779b9;
3
2
 
4
3
  const mix = (state: Uint32Array) => {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/hashtable.h, src/util/obj_hashtable.h), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
2
 
4
3
  const INITIAL_CAPACITY = 8;
@@ -164,6 +163,10 @@ export class ObjHashtable {
164
163
  this.map.delete(key);
165
164
  }
166
165
 
166
+ clear() {
167
+ this.map.clear();
168
+ }
169
+
167
170
  [Symbol.iterator]() {
168
171
  return this.map.keys();
169
172
  }
@@ -1,5 +1,4 @@
1
- // Ported from Z3 (src/util/inf_eps_rational.h), MIT license, see z3-license.txt. A value
2
- // infinity * oo + value + epsilon * ε, ordered lexicographically.
1
+ // A value infinity * oo + value + epsilon * ε, ordered lexicographically.
3
2
  import { Rational } from "./rational";
4
3
 
5
4
  export class InfEps {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/inj_axiom.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  FAMILY_USER,
4
3
  KIND_APP,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_context.h, src/smt/smt_internalizer.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError, SmtUnsupportedError } from "../../../errors";
3
2
  import {
4
3
  AstManager,
@@ -6,10 +5,18 @@ import {
6
5
  FAMILY_USER,
7
6
  KIND_APP,
8
7
  KIND_QUANTIFIER,
8
+ OP_ADD,
9
9
  OP_AND,
10
+ OP_BADD,
11
+ OP_BAND,
12
+ OP_BMUL,
13
+ OP_BOR,
14
+ OP_BXNOR,
15
+ OP_BXOR,
10
16
  OP_EQ,
11
17
  OP_IMPLIES,
12
18
  OP_ITE,
19
+ OP_MUL,
13
20
  OP_NOT,
14
21
  OP_OR,
15
22
  OP_XOR,
@@ -36,6 +43,7 @@ import {
36
43
  NO_ENODES,
37
44
  UnitResolutionJustification,
38
45
  } from "./enode";
46
+ import { isCommutativeDecl } from "./euf/egraph";
39
47
  import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
40
48
  import {
41
49
  BoolVar,
@@ -84,6 +92,26 @@ export const BV_THEORY = 1 << 31;
84
92
  export const UNDO_ADD_EQ = 8;
85
93
  export const UNDO_TH_VAR = 9;
86
94
 
95
+ // func_decl_info::is_flat_associative of a commutative declaration. cg_table::mk_table_for gives
96
+ // such a declaration the n-ary table, not the binary commutative one.
97
+ const isFlatAssociativeDecl = (manager: AstManager, decl: number) => {
98
+ switch (manager.funcDecls[decl].op) {
99
+ case OP_AND:
100
+ case OP_OR:
101
+ case OP_ADD:
102
+ case OP_MUL:
103
+ case OP_BADD:
104
+ case OP_BMUL:
105
+ case OP_BAND:
106
+ case OP_BOR:
107
+ case OP_BXOR:
108
+ case OP_BXNOR:
109
+ return true;
110
+ default:
111
+ return false;
112
+ }
113
+ };
114
+
87
115
  interface NewEq {
88
116
  lhs: Enode;
89
117
  rhs: Enode;
@@ -306,7 +334,13 @@ export abstract class Internalizer {
306
334
  }
307
335
 
308
336
  findCongruent(decl: number, args: Enode[]) {
309
- return this.cgTable.findFor(decl, args, decl === OP_EQ);
337
+ return this.cgTable.findFor(
338
+ decl,
339
+ args,
340
+ args.length === 2 &&
341
+ isCommutativeDecl(this.manager, decl) &&
342
+ !isFlatAssociativeDecl(this.manager, decl),
343
+ );
310
344
  }
311
345
 
312
346
  isDiseq(first: Enode, second: Enode, isCheckingValues = true) {
@@ -552,15 +586,19 @@ export abstract class Internalizer {
552
586
  const moreArgs: Enode[] = numArgs > 2 ? [] : NO_ENODES;
553
587
  for (let index = 2; index < numArgs; index++) moreArgs.push(this.getArgEnode(expr, index));
554
588
  const isEq = !isSuppressingArgs && manager.getOp(expr) === OP_EQ;
589
+ const decl = manager.decls[expr];
590
+ const isCommutative = isEq || (numArgs === 2 && isCommutativeDecl(manager, decl));
555
591
  const node = new Enode(
556
592
  expr,
557
- manager.decls[expr],
593
+ decl,
558
594
  numArgs,
559
595
  numArgs > 0 ? this.getArgEnode(expr, 0) : null,
560
596
  numArgs > 1 ? this.getArgEnode(expr, 1) : null,
561
597
  moreArgs,
562
598
  generation,
563
599
  isEq,
600
+ isCommutative,
601
+ isEq || (isCommutative && !isFlatAssociativeDecl(manager, decl)),
564
602
  manager.sorts[expr] === SORT_BOOL,
565
603
  isMergeTf,
566
604
  isCgcEnabled,
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/ackermannization/lackr.cpp, src/ackermannization/lackr_model_constructor.cpp),
2
- // MIT license, see z3-license.txt.
3
1
  import {
4
2
  type AstManager,
5
3
  KIND_APP,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/lbool.h), MIT license, see z3-license.txt.
2
1
  export const L_TRUE = 1;
3
2
  export const L_FALSE = -1;
4
3
  export const L_UNDEF = 0;
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/tactic/arith/lia2card_tactic.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  KIND_APP,
@@ -257,7 +256,7 @@ export const lia2card = (
257
256
  const replaced = replace.apply(goal.forms.items[index]);
258
257
  const rewritten = rewriter.rewrite(replaced);
259
258
  manager.decRef(replaced);
260
- goal.update(index, rewritten);
259
+ goal.update(index, rewritten, goal.getDependency(index));
261
260
  manager.decRef(rewritten);
262
261
  }
263
262
  for (const axiom of axioms) goal.assert(axiom);
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/tactic/arith/lia2pb_tactic.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtTacticError } from "../../../errors";
3
2
  import {
4
3
  type AstManager,
@@ -18,7 +17,7 @@ import {
18
17
  isArithSort,
19
18
  } from "./ast";
20
19
  import { BoundManager } from "./bound-manager";
21
- import type { Definition, Goal } from "./goal";
20
+ import { type Definition, type Dependency, type Goal, joinDependencies } from "./goal";
22
21
  import { Rational } from "./rational";
23
22
  import { RefVector } from "./ref-vector";
24
23
  import { Rewriter, type RewriterOptions } from "./rewriter";
@@ -38,7 +37,8 @@ export const lia2pb = (manager: AstManager, goal: Goal, options: Lia2PbOptions)
38
37
  if (goal.isProofsEnabled) throw new SmtTacticError("lia2pb does not support proof production");
39
38
  if (goal.isInconsistent) return;
40
39
  const bounds = new BoundManager(manager);
41
- for (const form of goal.forms.items) bounds.add(form);
40
+ for (let index = 0; index < goal.forms.size; index++)
41
+ bounds.add(goal.forms.items[index], goal.getDependency(index));
42
42
  const getTargetUpper = (expr: number) => {
43
43
  if (!manager.isUninterpretedConst(expr)) return undefined;
44
44
  const lower = bounds.lowers.get(expr);
@@ -101,6 +101,7 @@ export const lia2pb = (manager: AstManager, goal: Goal, options: Lia2PbOptions)
101
101
  const terms = new RefVector(manager);
102
102
  const definitions: Definition[] = [];
103
103
  const substitution = new Map<number, number>();
104
+ const substitutionDependencies = new Map<number, Dependency | undefined>();
104
105
  const zero = manager.mkNumeral(0n);
105
106
  const one = manager.mkNumeral(1n);
106
107
  terms.push(zero);
@@ -124,14 +125,26 @@ export const lia2pb = (manager: AstManager, goal: Goal, options: Lia2PbOptions)
124
125
  const def = manager.mkApp(OP_ADD, args, SORT_INT);
125
126
  terms.push(def);
126
127
  substitution.set(variable, def);
128
+ substitutionDependencies.set(
129
+ variable,
130
+ joinDependencies(
131
+ bounds.lowerDependencies.get(variable),
132
+ bounds.upperDependencies.get(variable),
133
+ ),
134
+ );
127
135
  definitions.push({ decl: manager.decls[variable], def });
128
136
  }
129
137
  const rewriter = new Rewriter(manager, options.rewriter);
130
- rewriter.setSubstitution(substitution);
138
+ rewriter.setSubstitution(substitution, substitutionDependencies);
131
139
  const size = goal.forms.size;
132
140
  for (let index = 0; !goal.isInconsistent && index < size; index++) {
133
141
  const rewritten = rewriter.rewrite(goal.forms.items[index]);
134
- goal.update(index, rewritten);
142
+ goal.update(
143
+ index,
144
+ rewritten,
145
+ joinDependencies(rewriter.usedDependencies, goal.getDependency(index)),
146
+ );
147
+ rewriter.usedDependencies = undefined;
135
148
  manager.decRef(rewritten);
136
149
  }
137
150
  rewriter.release();
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_literal.h, src/smt/smt_types.h), MIT license, see z3-license.txt.
2
1
  declare const boolVarBrand: unique symbol;
3
2
  declare const literalBrand: unique symbol;
4
3
 
@@ -1,7 +1,3 @@
1
- // Ported from Z3 (src/tactic/smtlogics/*.cpp, src/tactic/portfolio/default_tactic.cpp,
2
- // src/tactic/ufbv/ufbv_tactic.cpp, src/nlsat/tactic/qfnra_nlsat_tactic.cpp), MIT license, see
3
- // z3-license.txt.
4
-
5
1
  interface QfnraSolver {
6
2
  simpleCheck: number;
7
3
  heuristic?: number;
@@ -85,8 +81,8 @@ const getQfnraSolver = (solver: QfnraSolver) =>
85
81
  `${solver.simpleCheck})`,
86
82
  ...(solver.heuristic === undefined ? [] : [`(try-for ${QFNRA_NLSAT} ${solver.heuristic})`]),
87
83
  ...solver.orders.map(
88
- ([strategy, limit]) =>
89
- `(try-for (using-params ${QFNRA_NLSAT} :variable_ordering_strategy ${strategy}) ${limit})`,
84
+ (order) =>
85
+ `(try-for (using-params ${QFNRA_NLSAT} :variable_ordering_strategy ${order[0]}) ${order[1]})`,
90
86
  ),
91
87
  `(using-params smt :use_ls true :ls_time ${solver.ls})`,
92
88
  `(and-then (try-for (using-params smt :arith.greatest_error_pivot true) ${solver.smt}) ` +
@@ -260,6 +256,12 @@ export const QFUFBV_ACKR_PREAMBLE =
260
256
  ":pull_cheap_ite true :push_ite_bv false :local_ctx true :local_ctx_limit 10000000 " +
261
257
  ":ite_extra_rules true :mul2concat true :flat_and_or false))";
262
258
 
259
+ const QFUFBV =
260
+ "(using-params (and-then (and-then (using-params simplify :flat_and_or false) (using-params " +
261
+ "propagate-values :flat_and_or false) solve-eqs elim-uncnstr (if-no-proofs (if-no-unsat-cores " +
262
+ "reduce-args)) (if-no-proofs (if-no-unsat-cores reduce-bv-size)) max-bv-sharing (if-no-proofs " +
263
+ "(if-no-unsat-cores ackermannize_bv))) (if is-qfbv qfbv smt)) :elim_and true :blast_distinct true)";
264
+
263
265
  const QFAUFLIA =
264
266
  "(and-then (using-params (and-then simplify propagate-values solve-eqs elim-uncnstr simplify) " +
265
267
  ":elim_and true :som true :sort_store true) (using-params smt :array.simplify false))";
@@ -306,6 +308,7 @@ export const LOGIC_TACTICS: ReadonlyMap<string, string> = new Map([
306
308
  ["bv", UFBV],
307
309
  ["qfbv", QFBV],
308
310
  ["qfaufbv", QFAUFBV],
311
+ ["qfufbv", QFUFBV],
309
312
  ["qfauflia", QFAUFLIA],
310
313
  ["qfuf", QFUF],
311
314
  ["qffp", QFFP],
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/bound_analyzer_on_row.h, src/math/lp/lp_bound_propagator.h, src/math/lp/implied_bound.h, and propagate_bounds_for_touched_rows in src/math/lp/lar_solver.h), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
3
2
  import { COLUMN_FIXED, COLUMN_FREE, COLUMN_LOWER, COLUMN_UPPER } from "./core-solver";
4
3
  import { type ConstraintKind, KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/lar_constraints.h), MIT license, see z3-license.txt.
2
1
  import { type Dependency, mkLeaf } from "./dependency";
3
2
  import { Impq } from "./numeric-pair";
4
3
  import { shrink } from "../array";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/uint_set.h, src/util/heap.h, src/math/lp/stacked_vector.h), MIT license, see z3-license.txt.
2
1
  import { shrink } from "../array";
3
2
 
4
3
  export class IndexedUintSet {
@@ -160,7 +159,7 @@ interface HashLink<V> {
160
159
  }
161
160
 
162
161
  interface HashNode<V> extends HashLink<V> {
163
- readonly value: V;
162
+ value: V;
164
163
  }
165
164
 
166
165
  const constrainHash = (hash: number, count: number) =>
@@ -198,6 +197,12 @@ export class UnorderedUintMap<V> {
198
197
  for (let node = this.anchor.next; node !== null; node = node.next) yield [node.key, node.value];
199
198
  }
200
199
 
200
+ set(key: number, value: V) {
201
+ const node = this.nodes.get(key);
202
+ if (node === undefined) this.insert(key, value);
203
+ else node.value = value;
204
+ }
205
+
201
206
  insert(key: number, value: V) {
202
207
  const node: HashNode<V> = { key, value, next: null };
203
208
  const count = this.buckets.length;
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/math/lp/lar_core_solver.h, src/math/lp/lp_core_solver_base.h,
2
- // src/math/lp/lp_primal_core_solver.h, src/math/lp/lp_primal_core_solver_tableau_def.h), MIT
3
- // license, see z3-license.txt.
4
1
  import { Rational } from "../rational";
5
2
  import { IndexedUintSet, StackedVector, VarHeap } from "./containers";
6
3
  import type { LpSettings } from "./lp-settings";
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/math/lp/cross_nested.h), MIT license, see z3-license.txt.
2
- // Deviation from Z3: the occurrence map iterates in insertion order where Z3 has an unordered_map,
3
- // so an extracted common factor may list its variables in another order.
4
1
  import { Rational } from "../rational";
5
2
  import {
6
3
  type Nex,
@@ -147,7 +144,7 @@ export class CrossNested {
147
144
  private getVarsFromOccurencesMap() {
148
145
  const occurences = this.nexCreator.occurencesMap;
149
146
  const isRandomBit = this.nextRandom() % 2 === 1;
150
- return [...occurences.keys()].sort((first, second) => {
147
+ return Array.from(occurences, (entry) => entry[0]).sort((first, second) => {
151
148
  const firstOcc = occurences.get(first);
152
149
  const secondOcc = occurences.get(second);
153
150
  if (firstOcc === undefined || secondOcc === undefined) return 0;