tla-ts 0.0.10-dev.8aec06f77 → 0.0.10-dev.8be00045c

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 (509) hide show
  1. package/dist/deciders.cjs +37 -36
  2. package/dist/deciders.js +55 -54
  3. package/dist/index.cjs +1 -1
  4. package/dist/index.d.cts +4 -1
  5. package/dist/index.d.ts +4 -1
  6. package/dist/index.js +1 -1
  7. package/dist/parallel-worker.cjs +1 -1
  8. package/dist/parallel-worker.js +1 -1
  9. package/dist/prove.cjs +146 -58
  10. package/dist/prove.js +143 -55
  11. package/dist/run.cjs +43 -43
  12. package/dist/run.js +45 -45
  13. package/dist/transfer.cjs +29 -26
  14. package/dist/transfer.js +43 -40
  15. package/dist/worker.cjs +1 -1
  16. package/dist/worker.js +1 -1
  17. package/package.json +1 -1
  18. package/src/ast.ts +3 -3
  19. package/src/bags.ts +46 -28
  20. package/src/check-trace.ts +2 -16
  21. package/src/check.ts +336 -88
  22. package/src/cli/runtime-invariants.ts +20 -56
  23. package/src/cli/tlapm.ts +261 -68
  24. package/src/cli/tlc-arguments.ts +2 -2
  25. package/src/cli/tlc-output.ts +4 -5
  26. package/src/cli/tlc-usage.ts +0 -1
  27. package/src/cli/tlc.ts +26 -7
  28. package/src/dependencies.ts +23 -2
  29. package/src/dfid.ts +9 -2
  30. package/src/environment.ts +27 -5
  31. package/src/errors.ts +1 -1
  32. package/src/evaluate.ts +9 -3
  33. package/src/exit-codes.ts +5 -2
  34. package/src/instances.ts +1 -1
  35. package/src/levels.ts +134 -86
  36. package/src/liveness-checker.ts +572 -204
  37. package/src/liveness.ts +47 -32
  38. package/src/obligations/action.ts +0 -2
  39. package/src/obligations/anonymize.ts +2 -6
  40. package/src/obligations/equality.ts +0 -2
  41. package/src/obligations/expression.ts +0 -2
  42. package/src/obligations/format.ts +0 -2
  43. package/src/obligations/generate.ts +0 -2
  44. package/src/obligations/index.ts +5 -3
  45. package/src/obligations/levels.ts +0 -2
  46. package/src/obligations/module.ts +0 -2
  47. package/src/obligations/normalize.ts +0 -2
  48. package/src/obligations/operators.ts +0 -2
  49. package/src/obligations/pragma.ts +2 -2
  50. package/src/obligations/printer.ts +0 -2
  51. package/src/obligations/proof.ts +0 -2
  52. package/src/obligations/regroup.ts +0 -2
  53. package/src/obligations/simplify.ts +0 -2
  54. package/src/obligations/subexpression.ts +0 -2
  55. package/src/obligations/substitution.ts +0 -2
  56. package/src/obligations/temporal.ts +0 -2
  57. package/src/obligations/tuples.ts +0 -2
  58. package/src/parallel-worker.ts +8 -2
  59. package/src/parallel.ts +7 -2
  60. package/src/parser.ts +224 -82
  61. package/src/pretty-print.ts +1 -1
  62. package/src/prover/deciders.ts +1 -8
  63. package/src/prover/isabelle/encode.ts +0 -2
  64. package/src/prover/isabelle/isar/attrib.ts +86 -49
  65. package/src/prover/isabelle/isar/context.ts +25 -26
  66. package/src/prover/isabelle/isar/induct.ts +2 -9
  67. package/src/prover/isabelle/isar/method.ts +5 -9
  68. package/src/prover/isabelle/isar/proof.ts +33 -18
  69. package/src/prover/isabelle/isar/rule-cases.ts +14 -22
  70. package/src/prover/isabelle/isar/theory.ts +16 -17
  71. package/src/prover/isabelle/isar/toplevel.ts +46 -56
  72. package/src/prover/isabelle/isar/type-check.ts +0 -2
  73. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  74. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  75. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  76. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  77. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  78. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  79. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  80. package/src/prover/isabelle/provers/classical.ts +1 -3
  81. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  82. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  83. package/src/prover/isabelle/pure/consts.ts +0 -2
  84. package/src/prover/isabelle/pure/conv.ts +0 -2
  85. package/src/prover/isabelle/pure/drule.ts +0 -2
  86. package/src/prover/isabelle/pure/envir.ts +0 -2
  87. package/src/prover/isabelle/pure/goal.ts +0 -2
  88. package/src/prover/isabelle/pure/logic.ts +0 -2
  89. package/src/prover/isabelle/pure/name.ts +0 -2
  90. package/src/prover/isabelle/pure/net.ts +0 -2
  91. package/src/prover/isabelle/pure/object-logic.ts +0 -2
  92. package/src/prover/isabelle/pure/pattern.ts +0 -2
  93. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  94. package/src/prover/isabelle/pure/rewriter.ts +0 -2
  95. package/src/prover/isabelle/pure/search.ts +0 -2
  96. package/src/prover/isabelle/pure/seq.ts +0 -2
  97. package/src/prover/isabelle/pure/simplifier.ts +0 -2
  98. package/src/prover/isabelle/pure/table.ts +0 -2
  99. package/src/prover/isabelle/pure/tactic.ts +0 -2
  100. package/src/prover/isabelle/pure/tactical.ts +0 -2
  101. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  102. package/src/prover/isabelle/pure/term.ts +0 -2
  103. package/src/prover/isabelle/pure/thm.ts +0 -2
  104. package/src/prover/isabelle/pure/type.ts +0 -2
  105. package/src/prover/isabelle/pure/unify.ts +0 -2
  106. package/src/prover/isabelle/pure/variable.ts +0 -2
  107. package/src/prover/isabelle/tla/classical-setup.ts +0 -2
  108. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  109. package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
  110. package/src/prover/ocaml.ts +4 -1
  111. package/src/prover/prep/action.ts +1 -0
  112. package/src/prover/prep/methods.ts +50 -3
  113. package/src/prover/prep/normalize.ts +4 -1
  114. package/src/prover/prove.ts +58 -32
  115. package/src/prover/ptl/decide.ts +43 -63
  116. package/src/prover/smt/data.ts +51 -45
  117. package/src/prover/smt/encode.ts +1 -2
  118. package/src/prover/smt/rewrite.ts +3 -7
  119. package/src/prover/smt/simplify.ts +1 -1
  120. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
  121. package/src/prover/smt/solver/ackr-helper.ts +0 -3
  122. package/src/prover/smt/solver/ackr-model-converter.ts +0 -1
  123. package/src/prover/smt/solver/act-cache.ts +0 -1
  124. package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
  125. package/src/prover/smt/solver/aig-tactic.ts +25 -16
  126. package/src/prover/smt/solver/aig.ts +2 -3
  127. package/src/prover/smt/solver/arith-rewriter.ts +3 -6
  128. package/src/prover/smt/solver/arith-terms.ts +0 -2
  129. package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
  130. package/src/prover/smt/solver/array-rewriter.ts +0 -1
  131. package/src/prover/smt/solver/asserted-formulas.ts +9 -3
  132. package/src/prover/smt/solver/ast-lt.ts +1 -2
  133. package/src/prover/smt/solver/ast-util.ts +3 -3
  134. package/src/prover/smt/solver/ast.ts +112 -156
  135. package/src/prover/smt/solver/auf-solver.ts +0 -1
  136. package/src/prover/smt/solver/bit-blast-tactic.ts +0 -3
  137. package/src/prover/smt/solver/bit-blaster.ts +0 -3
  138. package/src/prover/smt/solver/bound-manager.ts +39 -29
  139. package/src/prover/smt/solver/bound-simplifier.ts +0 -2
  140. package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
  141. package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
  142. package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
  143. package/src/prover/smt/solver/bv-rewriter.ts +15 -19
  144. package/src/prover/smt/solver/bv1-blast.ts +1 -11
  145. package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
  146. package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
  147. package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
  148. package/src/prover/smt/solver/card2bv.ts +1 -4
  149. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  150. package/src/prover/smt/solver/cg-table.ts +19 -16
  151. package/src/prover/smt/solver/check-logic.ts +6 -2
  152. package/src/prover/smt/solver/clause.ts +0 -1
  153. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
  154. package/src/prover/smt/solver/conflict-resolution.ts +0 -1
  155. package/src/prover/smt/solver/context.ts +41 -14
  156. package/src/prover/smt/solver/ctx-simplify.ts +1 -3
  157. package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
  158. package/src/prover/smt/solver/datatype-decl-plugin.ts +0 -1
  159. package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
  160. package/src/prover/smt/solver/demodulator.ts +2 -5
  161. package/src/prover/smt/solver/dependent-expr-state.ts +16 -3
  162. package/src/prover/smt/solver/der.ts +0 -1
  163. package/src/prover/smt/solver/diff-neq.ts +1 -3
  164. package/src/prover/smt/solver/distribute-forall.ts +1 -11
  165. package/src/prover/smt/solver/dom-simplify.ts +1 -3
  166. package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
  167. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  168. package/src/prover/smt/solver/e-matching.ts +6 -7
  169. package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
  170. package/src/prover/smt/solver/elim-uncnstr.ts +7 -23
  171. package/src/prover/smt/solver/enode.ts +15 -2
  172. package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
  173. package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
  174. package/src/prover/smt/solver/euf/arith-internalize.ts +1 -3
  175. package/src/prover/smt/solver/euf/arith-solver.ts +0 -1
  176. package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
  177. package/src/prover/smt/solver/euf/array-internalize.ts +20 -11
  178. package/src/prover/smt/solver/euf/array-solver.ts +0 -2
  179. package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
  180. package/src/prover/smt/solver/euf/bv-internalize.ts +1 -3
  181. package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
  182. package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
  183. package/src/prover/smt/solver/euf/egraph.ts +68 -43
  184. package/src/prover/smt/solver/euf/euf-solver.ts +36 -23
  185. package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
  186. package/src/prover/smt/solver/euf/mam.ts +7 -55
  187. package/src/prover/smt/solver/euf/q-ematch.ts +21 -97
  188. package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
  189. package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
  190. package/src/prover/smt/solver/euf/q-solver.ts +2 -2
  191. package/src/prover/smt/solver/euf/th-solver.ts +1 -10
  192. package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
  193. package/src/prover/smt/solver/expr-ref.ts +0 -1
  194. package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
  195. package/src/prover/smt/solver/expr2polynomial.ts +204 -80
  196. package/src/prover/smt/solver/factor.ts +37 -26
  197. package/src/prover/smt/solver/fd-solver.ts +3 -5
  198. package/src/prover/smt/solver/fingerprints.ts +0 -1
  199. package/src/prover/smt/solver/fix-dl-var.ts +1 -3
  200. package/src/prover/smt/solver/flat-literals.ts +0 -1
  201. package/src/prover/smt/solver/fm-tactic.ts +19 -14
  202. package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
  203. package/src/prover/smt/solver/fpa-rewriter.ts +2 -2
  204. package/src/prover/smt/solver/fpa2bv-converter.ts +13 -8
  205. package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
  206. package/src/prover/smt/solver/fpa2bv-tactic.ts +0 -2
  207. package/src/prover/smt/solver/goal.ts +3 -2
  208. package/src/prover/smt/solver/goal2nlsat.ts +57 -32
  209. package/src/prover/smt/solver/guard-set.ts +0 -1
  210. package/src/prover/smt/solver/hash.ts +0 -1
  211. package/src/prover/smt/solver/hashtable.ts +0 -1
  212. package/src/prover/smt/solver/inf-eps.ts +1 -2
  213. package/src/prover/smt/solver/inj-axiom.ts +0 -1
  214. package/src/prover/smt/solver/internalizer.ts +41 -3
  215. package/src/prover/smt/solver/lackr.ts +0 -2
  216. package/src/prover/smt/solver/lbool.ts +0 -1
  217. package/src/prover/smt/solver/lia2card.ts +0 -1
  218. package/src/prover/smt/solver/lia2pb.ts +18 -5
  219. package/src/prover/smt/solver/literal.ts +0 -1
  220. package/src/prover/smt/solver/logic-tactics.ts +0 -4
  221. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  222. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  223. package/src/prover/smt/solver/lp/containers.ts +7 -2
  224. package/src/prover/smt/solver/lp/core-solver.ts +0 -3
  225. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  226. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  227. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  228. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  229. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  230. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  231. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  232. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  233. package/src/prover/smt/solver/lp/int-cube.ts +0 -1
  234. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  235. package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
  236. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  237. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  238. package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
  239. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  240. package/src/prover/smt/solver/lp/nex.ts +2 -2
  241. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  242. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  243. package/src/prover/smt/solver/lp/nla-core.ts +26 -7
  244. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  245. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  246. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  247. package/src/prover/smt/solver/lp/nla-grobner.ts +158 -82
  248. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  249. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  250. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  251. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  252. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  253. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  254. package/src/prover/smt/solver/lp/nla-powers.ts +144 -108
  255. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  256. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  257. package/src/prover/smt/solver/lp/nla-transcendentals.ts +50 -19
  258. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  259. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  260. package/src/prover/smt/solver/lp/nra-solver.ts +138 -97
  261. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  262. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  263. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  264. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  265. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  266. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  267. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  268. package/src/prover/smt/solver/lp/union-find.ts +1 -2
  269. package/src/prover/smt/solver/macro-finder.ts +1 -4
  270. package/src/prover/smt/solver/mam-compiler.ts +14 -15
  271. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  272. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
  273. package/src/prover/smt/solver/max-cliques.ts +0 -2
  274. package/src/prover/smt/solver/maxcore.ts +5 -14
  275. package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -1
  276. package/src/prover/smt/solver/maxlex.ts +0 -8
  277. package/src/prover/smt/solver/maxsmt-base.ts +7 -1
  278. package/src/prover/smt/solver/maxsmt.ts +0 -1
  279. package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
  280. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
  281. package/src/prover/smt/solver/mbp/mbp-plugin.ts +9 -2
  282. package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
  283. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
  284. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +0 -1
  285. package/src/prover/smt/solver/model-based-opt.ts +1 -2
  286. package/src/prover/smt/solver/model-checker.ts +0 -1
  287. package/src/prover/smt/solver/model-evaluator.ts +9 -6
  288. package/src/prover/smt/solver/model-finder.ts +0 -1
  289. package/src/prover/smt/solver/model-generator.ts +3 -2
  290. package/src/prover/smt/solver/model-macro-solver.ts +3 -4
  291. package/src/prover/smt/solver/model-printer.ts +0 -1
  292. package/src/prover/smt/solver/mpf.ts +2 -5
  293. package/src/prover/smt/solver/mus.ts +1 -3
  294. package/src/prover/smt/solver/muz/dl-context.ts +67 -9
  295. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
  296. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
  297. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
  298. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -2
  299. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
  300. package/src/prover/smt/solver/muz/dl-mk-slice.ts +78 -16
  301. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
  302. package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -1
  303. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
  304. package/src/prover/smt/solver/muz/dl-rule.ts +95 -33
  305. package/src/prover/smt/solver/muz/hnf.ts +6 -6
  306. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  307. package/src/prover/smt/solver/muz/horn-tactic.ts +15 -6
  308. package/src/prover/smt/solver/muz/rule-properties.ts +194 -37
  309. package/src/prover/smt/solver/muz/spacer-context.ts +104 -89
  310. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -3
  311. package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
  312. package/src/prover/smt/solver/muz/spacer-manager.ts +0 -2
  313. package/src/prover/smt/solver/muz/spacer-pdr.ts +4 -4
  314. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +3 -9
  315. package/src/prover/smt/solver/muz/spacer-util.ts +2 -3
  316. package/src/prover/smt/solver/muz/substitution.ts +88 -39
  317. package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
  318. package/src/prover/smt/solver/nlqsat.ts +4 -4
  319. package/src/prover/smt/solver/nlsat/algebraic.ts +194 -93
  320. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  321. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  322. package/src/prover/smt/solver/nlsat/explain.ts +379 -217
  323. package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
  324. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  325. package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
  326. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  327. package/src/prover/smt/solver/nlsat/solver.ts +112 -99
  328. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
  329. package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -19
  330. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  331. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  332. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  333. package/src/prover/smt/solver/nlsat-tactic.ts +0 -1
  334. package/src/prover/smt/solver/nnf.ts +0 -1
  335. package/src/prover/smt/solver/normalize-bounds.ts +0 -1
  336. package/src/prover/smt/solver/occf.ts +0 -1
  337. package/src/prover/smt/solver/opt-context.ts +15 -10
  338. package/src/prover/smt/solver/opt-nlsat.ts +97 -77
  339. package/src/prover/smt/solver/opt-pareto.ts +0 -2
  340. package/src/prover/smt/solver/opt-preprocess.ts +0 -1
  341. package/src/prover/smt/solver/opt-solver.ts +22 -11
  342. package/src/prover/smt/solver/opt-value.ts +0 -1
  343. package/src/prover/smt/solver/optsmt.ts +13 -12
  344. package/src/prover/smt/solver/parallel-tactic.ts +0 -2
  345. package/src/prover/smt/solver/pattern-inference.ts +2 -3
  346. package/src/prover/smt/solver/pb-rewriter.ts +14 -20
  347. package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
  348. package/src/prover/smt/solver/poly-rewriter.ts +2 -3
  349. package/src/prover/smt/solver/probes.ts +4 -7
  350. package/src/prover/smt/solver/propagate-values.ts +4 -1
  351. package/src/prover/smt/solver/proto-model.ts +6 -7
  352. package/src/prover/smt/solver/pull-quant.ts +0 -1
  353. package/src/prover/smt/solver/purify-arith.ts +50 -16
  354. package/src/prover/smt/solver/qe-arith-plugin.ts +4 -7
  355. package/src/prover/smt/solver/qe-lite-der.ts +0 -1
  356. package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
  357. package/src/prover/smt/solver/qe-lite.ts +0 -1
  358. package/src/prover/smt/solver/qe-mbp.ts +13 -24
  359. package/src/prover/smt/solver/qe.ts +48 -57
  360. package/src/prover/smt/solver/qel.ts +0 -1
  361. package/src/prover/smt/solver/qi-queue.ts +0 -1
  362. package/src/prover/smt/solver/qsat.ts +70 -91
  363. package/src/prover/smt/solver/quant-hoist.ts +0 -1
  364. package/src/prover/smt/solver/quant-tactics.ts +0 -1
  365. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  366. package/src/prover/smt/solver/quantifier-manager.ts +14 -10
  367. package/src/prover/smt/solver/quasi-macros.ts +9 -20
  368. package/src/prover/smt/solver/random-gen.ts +0 -1
  369. package/src/prover/smt/solver/rational.ts +17 -1
  370. package/src/prover/smt/solver/recfun-decl-plugin.ts +35 -21
  371. package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
  372. package/src/prover/smt/solver/reduce-args.ts +0 -1
  373. package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
  374. package/src/prover/smt/solver/ref-vector.ts +0 -1
  375. package/src/prover/smt/solver/relevancy.ts +0 -1
  376. package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
  377. package/src/prover/smt/solver/rewriter.ts +1 -2
  378. package/src/prover/smt/solver/rlimit.ts +13 -1
  379. package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
  380. package/src/prover/smt/solver/sat/big.ts +0 -1
  381. package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
  382. package/src/prover/smt/solver/sat/clause.ts +1 -6
  383. package/src/prover/smt/solver/sat/cleaner.ts +0 -2
  384. package/src/prover/smt/solver/sat/config.ts +4 -7
  385. package/src/prover/smt/solver/sat/consequences.ts +1 -2
  386. package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
  387. package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
  388. package/src/prover/smt/solver/sat/inc-sat-solver.ts +4 -13
  389. package/src/prover/smt/solver/sat/model-converter.ts +2 -18
  390. package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
  391. package/src/prover/smt/solver/sat/pb-solver.ts +50 -26
  392. package/src/prover/smt/solver/sat/probing.ts +22 -21
  393. package/src/prover/smt/solver/sat/sat-tactic.ts +2 -2
  394. package/src/prover/smt/solver/sat/sat2goal.ts +9 -12
  395. package/src/prover/smt/solver/sat/scc.ts +0 -1
  396. package/src/prover/smt/solver/sat/simplifier.ts +16 -60
  397. package/src/prover/smt/solver/sat/solver.ts +45 -68
  398. package/src/prover/smt/solver/sat/var-queue.ts +0 -2
  399. package/src/prover/smt/solver/sat/watch-list.ts +7 -3
  400. package/src/prover/smt/solver/search-tree.ts +0 -1
  401. package/src/prover/smt/solver/seq-axioms.ts +20 -36
  402. package/src/prover/smt/solver/seq-decl-plugin.ts +7 -8
  403. package/src/prover/smt/solver/seq-derive.ts +9 -15
  404. package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
  405. package/src/prover/smt/solver/seq-eq-solver.ts +9 -10
  406. package/src/prover/smt/solver/seq-factory.ts +0 -1
  407. package/src/prover/smt/solver/seq-monadic.ts +7 -7
  408. package/src/prover/smt/solver/seq-range-predicate.ts +14 -3
  409. package/src/prover/smt/solver/seq-re-rewriter.ts +3 -12
  410. package/src/prover/smt/solver/seq-re-util.ts +2 -5
  411. package/src/prover/smt/solver/seq-regex-bisim.ts +2 -3
  412. package/src/prover/smt/solver/seq-regex-live.ts +6 -8
  413. package/src/prover/smt/solver/seq-rewriter.ts +31 -34
  414. package/src/prover/smt/solver/seq-skolem.ts +0 -24
  415. package/src/prover/smt/solver/seq-subset.ts +0 -1
  416. package/src/prover/smt/solver/seq-view-witness.ts +4 -6
  417. package/src/prover/smt/solver/smt-consequences.ts +0 -2
  418. package/src/prover/smt/solver/smt-kernel.ts +8 -3
  419. package/src/prover/smt/solver/smt-logics.ts +0 -1
  420. package/src/prover/smt/solver/smt-setup.ts +18 -14
  421. package/src/prover/smt/solver/smt2-printer.ts +0 -2
  422. package/src/prover/smt/solver/smtlib-parser.ts +1187 -592
  423. package/src/prover/smt/solver/smtlib-script.ts +957 -750
  424. package/src/prover/smt/solver/solve-eqs.ts +11 -19
  425. package/src/prover/smt/solver/solver.ts +1 -2
  426. package/src/prover/smt/solver/static-features.ts +0 -2
  427. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  428. package/src/prover/smt/solver/tactic.ts +77 -18
  429. package/src/prover/smt/solver/term-enumeration.ts +0 -1
  430. package/src/prover/smt/solver/theory-array.ts +25 -60
  431. package/src/prover/smt/solver/theory-bv.ts +15 -54
  432. package/src/prover/smt/solver/theory-char.ts +0 -1
  433. package/src/prover/smt/solver/theory-datatype.ts +0 -1
  434. package/src/prover/smt/solver/theory-finite-set.ts +2 -2
  435. package/src/prover/smt/solver/theory-fpa.ts +46 -79
  436. package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
  437. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
  438. package/src/prover/smt/solver/theory-lra-final-check.ts +0 -2
  439. package/src/prover/smt/solver/theory-lra-internalize.ts +8 -1
  440. package/src/prover/smt/solver/theory-lra-model.ts +0 -1
  441. package/src/prover/smt/solver/theory-lra-propagate.ts +0 -3
  442. package/src/prover/smt/solver/theory-lra-state.ts +0 -1
  443. package/src/prover/smt/solver/theory-lra.ts +0 -2
  444. package/src/prover/smt/solver/theory-pb.ts +12 -11
  445. package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
  446. package/src/prover/smt/solver/theory-recfun.ts +2 -3
  447. package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
  448. package/src/prover/smt/solver/theory-seq-solve.ts +6 -8
  449. package/src/prover/smt/solver/theory-seq-state.ts +8 -26
  450. package/src/prover/smt/solver/theory-seq.ts +32 -55
  451. package/src/prover/smt/solver/theory.ts +16 -2
  452. package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
  453. package/src/prover/smt/solver/var-subst.ts +2 -3
  454. package/src/prover/smt/table.ts +3 -2
  455. package/src/prover/zenon/decide.ts +9 -13
  456. package/src/prover/zenon/encode.ts +0 -2
  457. package/src/prover/zenon/eqrel.ts +0 -2
  458. package/src/prover/zenon/equality-rules.ts +24 -2
  459. package/src/prover/zenon/expr.ts +21 -2
  460. package/src/prover/zenon/index-table.ts +7 -4
  461. package/src/prover/zenon/isar-case.ts +1 -3
  462. package/src/prover/zenon/isar.ts +2 -4
  463. package/src/prover/zenon/llproof.ts +0 -2
  464. package/src/prover/zenon/mltoll.ts +0 -2
  465. package/src/prover/zenon/node.ts +12 -13
  466. package/src/prover/zenon/parse.ts +0 -2
  467. package/src/prover/zenon/phrase.ts +1 -3
  468. package/src/prover/zenon/proof.ts +0 -2
  469. package/src/prover/zenon/propositional-rules.ts +0 -2
  470. package/src/prover/zenon/rules.ts +2 -3
  471. package/src/prover/zenon/search.ts +0 -2
  472. package/src/prover/zenon/tla/functions.ts +0 -2
  473. package/src/prover/zenon/tla/llproof.ts +0 -2
  474. package/src/prover/zenon/tla/records.ts +0 -2
  475. package/src/prover/zenon/tla/rewrites.ts +0 -2
  476. package/src/prover/zenon/tla/sets.ts +1 -3
  477. package/src/prover/zenon/tla/terms.ts +0 -2
  478. package/src/prover/zenon/tla/tla.ts +0 -2
  479. package/src/resolve.ts +264 -77
  480. package/src/runtime.ts +6 -0
  481. package/src/sany/generation.ts +1 -13
  482. package/src/sany/generator-definitions.ts +2 -1
  483. package/src/sany/generator-expressions.ts +30 -27
  484. package/src/sany/generator-proofs.ts +1 -1
  485. package/src/sany/generator.ts +2 -1
  486. package/src/sany/levels.ts +0 -2
  487. package/src/sany/linter.ts +0 -2
  488. package/src/sany/nodes.ts +1 -1
  489. package/src/sany/selectors.ts +6 -5
  490. package/src/search.ts +198 -45
  491. package/src/simulate.ts +3 -0
  492. package/src/standard-definitions.ts +4 -0
  493. package/src/state-graph.ts +0 -2
  494. package/src/subexpressions.ts +165 -78
  495. package/src/successors.ts +1 -1
  496. package/src/symmetry.ts +2 -2
  497. package/src/tableau.ts +2 -2
  498. package/src/tlc/fingerprint.ts +81 -9
  499. package/src/tlc/jar-data.ts +12 -0
  500. package/src/tlc/order.ts +14 -3
  501. package/src/tlc/summary.ts +29 -14
  502. package/src/tlc/tlcext-operators.ts +61 -16
  503. package/src/tlc/trace-spec.ts +2 -3
  504. package/src/typed-tier.ts +6541 -0
  505. package/src/typescript/types.ts +2 -2
  506. package/src/values.ts +1 -1
  507. package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
  508. package/src/prover/smt/solver/z3-license.txt +0 -10
  509. package/src/prover/zenon/LICENSE +0 -32
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_quantifier.cpp), MIT license, see z3-license.txt.
2
1
  import { CHECK_MODEL_RESTART, CHECK_MODEL_SAT, CHECK_MODEL_UNKNOWN, type Context } from "./context";
3
2
  import { FC_CONTINUE, FC_DONE } from "./theory";
4
3
  import { Mam } from "./e-matching";
@@ -26,17 +25,21 @@ export class DefaultQuantifierManager {
26
25
  private lazyMatchingIndex = 0;
27
26
  private mbqi: Mbqi | null = null;
28
27
 
29
- constructor(
30
- private context: Context,
31
- isMbqi: boolean,
32
- ) {
28
+ constructor(private context: Context) {
33
29
  this.qiQueue = new QiQueue(context);
34
30
  const onMatch = (quantifier: number, bindings: Enode[], maxGeneration: number) =>
35
31
  this.addInstance(quantifier, bindings, maxGeneration);
36
32
  this.mam = new Mam(context, onMatch);
37
33
  this.lazyMam = new Mam(context, onMatch);
38
- if (!isMbqi) return;
34
+ this.updateParams();
35
+ }
36
+
37
+ // As in Z3, smt.mbqi is read each time the model finder would run.
38
+ updateParams() {
39
+ const context = this.context;
40
+ if (!context.params.isMbqi || this.mbqi !== null) return;
39
41
  const finder = new ModelFinder(context);
42
+ for (let level = 0; level < context.scopeLevel; level++) finder.pushScope();
40
43
  this.mbqi = { finder, checker: new ModelChecker(context, finder, this) };
41
44
  }
42
45
 
@@ -47,7 +50,7 @@ export class DefaultQuantifierManager {
47
50
  add(quantifier: number, generation: number) {
48
51
  this.quantifiers.push(quantifier);
49
52
  this.generations.set(quantifier, generation);
50
- this.mbqi?.finder.registerQuantifier(quantifier);
53
+ if (this.context.params.isMbqi) this.mbqi?.finder.registerQuantifier(quantifier);
51
54
  }
52
55
 
53
56
  del(quantifier: number) {
@@ -150,20 +153,21 @@ export class DefaultQuantifierManager {
150
153
  }
151
154
 
152
155
  restartEh() {
156
+ if (!this.context.params.isMbqi) return;
153
157
  this.mbqi?.finder.restartEh();
154
158
  this.mbqi?.checker.restartEh();
155
159
  }
156
160
 
157
161
  isModelBased() {
158
- return this.mbqi !== null;
162
+ return this.context.params.isMbqi;
159
163
  }
160
164
 
161
165
  adjustModel(model: ProtoModel) {
162
- this.mbqi?.finder.fixModel(model);
166
+ if (this.context.params.isMbqi) this.mbqi?.finder.fixModel(model);
163
167
  }
164
168
 
165
169
  checkModel(model: ProtoModel, root2value: Map<Enode, number>) {
166
- const checker = this.mbqi?.checker;
170
+ const checker = this.context.params.isMbqi ? this.mbqi?.checker : undefined;
167
171
  if (this.quantifiers.length === 0) return CHECK_MODEL_SAT;
168
172
  if (checker === undefined) return CHECK_MODEL_UNKNOWN;
169
173
  if (checker.check(model, root2value)) return CHECK_MODEL_SAT;
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/ast/macros/quasi_macros.cpp, src/tactic/ufbv/quasi_macros_tactic.cpp), MIT
2
- // license, see z3-license.txt.
3
1
  import {
4
2
  type AstManager,
5
3
  FAMILY_USER,
@@ -15,6 +13,7 @@ import {
15
13
  } from "./ast";
16
14
  import type { Goal } from "./goal";
17
15
  import { MacroManager } from "./macro-finder";
16
+ import { hasSubterm } from "./recfun-decl-plugin";
18
17
  import { RefVector } from "./ref-vector";
19
18
  import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
20
19
 
@@ -24,25 +23,10 @@ interface QuasiMacro {
24
23
  }
25
24
 
26
25
  const isNonGroundUninterp = (manager: AstManager, expr: number) =>
27
- !manager.isGround(expr) &&
26
+ !manager.isGroundApp(expr) &&
28
27
  manager.kinds[expr] === KIND_APP &&
29
28
  manager.funcDecls[manager.decls[expr]].family === FAMILY_USER;
30
29
 
31
- const isDependingOn = (manager: AstManager, expr: number, decl: number) => {
32
- const visited = new Set<number>();
33
- const todo = [expr];
34
- for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
35
- if (visited.has(current)) continue;
36
- if (manager.kinds[current] === KIND_APP) {
37
- if (manager.decls[current] === decl) return true;
38
- for (let index = manager.getNumArgs(current); index > 0; index--)
39
- todo.push(manager.getArg(current, index - 1));
40
- }
41
- visited.add(current);
42
- }
43
- return false;
44
- };
45
-
46
30
  const isFullyDependingOn = (manager: AstManager, app: number, numDecls: number) => {
47
31
  const isUsed = Array.from({ length: numDecls }, () => false);
48
32
  for (const arg of manager.getArgs(app))
@@ -96,7 +80,12 @@ class QuasiMacros {
96
80
  return (
97
81
  isNonGroundUninterp(manager, lhs) &&
98
82
  this.isUnique(manager.decls[lhs]) &&
99
- !isDependingOn(manager, rhs, manager.decls[lhs]) &&
83
+ !hasSubterm(
84
+ manager,
85
+ [rhs],
86
+ (expr) => manager.kinds[expr] === KIND_APP && manager.decls[expr] === manager.decls[lhs],
87
+ false,
88
+ ) &&
100
89
  isFullyDependingOn(manager, lhs, numDecls)
101
90
  );
102
91
  }
@@ -145,7 +134,7 @@ class QuasiMacros {
145
134
  let numSeen = 0;
146
135
  for (const [index, arg] of manager.getArgs(macro.head).entries()) {
147
136
  const isVar = manager.kinds[arg] === KIND_VAR;
148
- if (!isVar && !manager.isGround(arg)) return -1;
137
+ if (!isVar && !manager.isGroundApp(arg)) return -1;
149
138
  if (isVar && !isSeen[manager.values[arg]]) {
150
139
  this.newVars.push(arg);
151
140
  isSeen[manager.values[arg]] = true;
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/util.h), MIT license, see z3-license.txt.
2
1
  export class RandomGen {
3
2
  constructor(private seed: number) {}
4
3
 
@@ -1,4 +1,4 @@
1
- // Ported from Z3 (src/util/rational.h), MIT license, see z3-license.txt.
1
+ import { SmtInvariantError } from "../../../errors";
2
2
 
3
3
  export const getGcd = (first: bigint, second: bigint) => {
4
4
  let left = first < 0n ? -first : first;
@@ -63,6 +63,21 @@ const getIntRoot = (value: bigint, degree: number): bigint | undefined => {
63
63
  return low ** exponent === value ? low : undefined;
64
64
  };
65
65
 
66
+ // rational::mult_inverse: the inverse of the value modulo 2^bits, which only an odd value has.
67
+ export const getMultInverse = (value: bigint, bits: number) => {
68
+ if (value === 1n) return 1n;
69
+ if (value % 2n === 0n) return undefined;
70
+ const modulus = 1n << BigInt(bits);
71
+ let [oldRemainder, remainder] = [((value % modulus) + modulus) % modulus, modulus];
72
+ let [oldCoefficient, coefficient] = [1n, 0n];
73
+ while (remainder !== 0n) {
74
+ const quotient = oldRemainder / remainder;
75
+ [oldRemainder, remainder] = [remainder, oldRemainder - quotient * remainder];
76
+ [oldCoefficient, coefficient] = [coefficient, oldCoefficient - quotient * coefficient];
77
+ }
78
+ return ((oldCoefficient % modulus) + modulus) % modulus;
79
+ };
80
+
66
81
  export class Rational {
67
82
  static readonly zero = new Rational(0n, 1n);
68
83
  static readonly one = new Rational(1n, 1n);
@@ -85,6 +100,7 @@ export class Rational {
85
100
  }
86
101
 
87
102
  static fromDouble(value: number) {
103
+ if (!Number.isFinite(value)) throw new SmtInvariantError(`${value} is not a rational number`);
88
104
  let den = 1n;
89
105
  let scaled = value;
90
106
  while (!Number.isInteger(scaled)) {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/recfun_decl_plugin.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  KIND_APP,
@@ -10,6 +9,7 @@ import {
10
9
  SORT_BOOL,
11
10
  } from "./ast";
12
11
  import { ExprSafeReplace } from "./expr-safe-replace";
12
+ import { ObjMap } from "./hashtable";
13
13
 
14
14
  const getChildren = (manager: AstManager, expr: number, isUnderQuantifiers: boolean) =>
15
15
  manager.kinds[expr] === KIND_QUANTIFIER
@@ -32,28 +32,43 @@ export const getSubterms = (manager: AstManager, expr: number, isUnderQuantifier
32
32
  return [...visited];
33
33
  };
34
34
 
35
- export const isDefinedApp = (manager: AstManager, expr: number) =>
36
- manager.getOp(expr) === OP_FUN_DEFINED;
37
-
38
- const hasPredicate = (
35
+ // Whether a subterm of the roots satisfies the predicate, which the walk calls in no particular
36
+ // order.
37
+ export const hasSubterm = (
39
38
  manager: AstManager,
40
- expr: number,
39
+ roots: readonly number[],
41
40
  predicate: (term: number) => boolean,
42
- isUnderQuantifiers = false,
43
- ) => getSubterms(manager, expr, isUnderQuantifiers).some(predicate);
41
+ isUnderQuantifiers = true,
42
+ ) => {
43
+ const visited = new Set<number>();
44
+ const todo = [...roots];
45
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
46
+ if (visited.has(current)) continue;
47
+ visited.add(current);
48
+ if (predicate(current)) return true;
49
+ if (manager.kinds[current] === KIND_APP) manager.pushArgs(current, todo);
50
+ else if (isUnderQuantifiers && manager.kinds[current] === KIND_QUANTIFIER)
51
+ todo.push(manager.getQuantifier(current).body);
52
+ }
53
+ return false;
54
+ };
55
+
56
+ export const isDefinedApp = (manager: AstManager, expr: number) =>
57
+ manager.getOp(expr) === OP_FUN_DEFINED;
44
58
 
45
59
  export const containsDef = (manager: AstManager, expr: number) =>
46
- hasPredicate(manager, expr, (term) => isDefinedApp(manager, term));
60
+ hasSubterm(manager, [expr], (term) => isDefinedApp(manager, term), false);
47
61
 
48
62
  // An ite on a condition without a defined function, with one in a branch.
49
63
  const containsIte = (manager: AstManager, expr: number) =>
50
- hasPredicate(
64
+ hasSubterm(
51
65
  manager,
52
- expr,
66
+ [expr],
53
67
  (term) =>
54
68
  manager.getOp(term) === OP_ITE &&
55
69
  !containsDef(manager, manager.getArg(term, 0)) &&
56
70
  containsDef(manager, term),
71
+ false,
57
72
  );
58
73
 
59
74
  interface ChoiceList {
@@ -134,10 +149,11 @@ const computeCases = (manager: AstManager, def: RecFunDef, isMacro: boolean, rhs
134
149
  }
135
150
  if (branch.toSplit !== null) {
136
151
  const ite = branch.toSplit.expr;
152
+ const toSplit = branch.toSplit.next;
137
153
  const condition = manager.getArg(ite, 0);
138
154
  const mkBranch = (isPositive: boolean): Branch => ({
139
155
  path: { ite, isPositive, next: branch.path },
140
- toSplit: branch.toSplit!.next,
156
+ toSplit,
141
157
  toUnfold: {
142
158
  expr: condition,
143
159
  next: { expr: manager.getArg(ite, isPositive ? 1 : 2), next: branch.toUnfold },
@@ -153,12 +169,7 @@ const computeCases = (manager: AstManager, def: RecFunDef, isMacro: boolean, rhs
153
169
  const caseRhs = subst.apply(rhs);
154
170
  const guards = conditions.map((condition) => subst.apply(condition));
155
171
  subst.release();
156
- const isImmediate = !hasPredicate(
157
- manager,
158
- caseRhs,
159
- (term) => isDefinedApp(manager, term),
160
- true,
161
- );
172
+ const isImmediate = !hasSubterm(manager, [caseRhs], (term) => isDefinedApp(manager, term));
162
173
  addCase(manager, def, guards, caseRhs, isImmediate);
163
174
  manager.decRef(caseRhs);
164
175
  for (const guard of guards) manager.decRef(guard);
@@ -168,7 +179,8 @@ const computeCases = (manager: AstManager, def: RecFunDef, isMacro: boolean, rhs
168
179
  }
169
180
  };
170
181
 
171
- // compute_scores: the number of ites on the paths from the root to each subterm.
182
+ // compute_scores: the number of ites on the paths from the root to each subterm. The scores are in
183
+ // an obj_map, whose order decides which of the ites with the highest score redirect_ite takes.
172
184
  const computeScores = (manager: AstManager, expr: number) => {
173
185
  const parents = new Map<number, number[]>([[expr, []]]);
174
186
  const byDepth = new Map<number, number[]>();
@@ -182,7 +194,8 @@ const computeScores = (manager: AstManager, expr: number) => {
182
194
  const depth = manager.depths[term];
183
195
  byDepth.set(depth, [...(byDepth.get(depth) ?? []), term]);
184
196
  }
185
- const scores = new Map<number, number>([[expr, 0]]);
197
+ const scores = new ObjMap<number>((term) => manager.hashes[term]);
198
+ scores.set(expr, 0);
186
199
  for (let depth = manager.depths[expr]; depth > 0; depth--)
187
200
  for (const term of byDepth.get(depth) ?? []) {
188
201
  const score = (parents.get(term) ?? []).reduce(
@@ -211,8 +224,9 @@ const redirectIte = (manager: AstManager, def: RecFunDef, rhs: number) => {
211
224
  maxScore = score;
212
225
  }
213
226
  if (maxScore <= 4) break;
227
+ // mk_fresh_id gives the id after the increment.
214
228
  const decl = manager.mkRecFuncDecl(
215
- `fold-rec-${manager.mkFreshId()}`,
229
+ `fold-rec-${manager.mkFreshId() + 1}`,
216
230
  domain,
217
231
  manager.sorts[maxExpr],
218
232
  );
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/recfun_rewriter.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  FAMILY_USER,
@@ -97,7 +96,7 @@ export const mkRecFunApp = (
97
96
  args.some(
98
97
  (arg, position) =>
99
98
  manager.getOp(arg) === OP_DT_CONSTRUCTOR &&
100
- isDecreasingArg(manager, decl, position, manager.isGround(arg)),
99
+ isDecreasingArg(manager, decl, position, manager.isGroundApp(arg)),
101
100
  ));
102
101
  if (!isSafe) return undefined;
103
102
  const subst = new VarSubst(manager, true);
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/tactic/core/reduce_args_tactic.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtTacticError } from "../../../errors";
3
2
  import {
4
3
  type AstManager,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/tactic/bv/bv_size_reduction_tactic.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtTacticError } from "../../../errors";
3
2
  import { type AstManager, OP_CONCAT, OP_SIGN_EXT, OP_SLEQ } from "./ast";
4
3
  import { mkBvApp } from "./bv-decl-plugin";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/ref_vector.h), MIT license, see z3-license.txt.
2
1
  import type { AstManager } from "./ast";
3
2
 
4
3
  export class RefVector {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_relevancy.h, src/smt/smt_relevancy.cpp), MIT license, see z3-license.txt.
2
1
  import { type AstManager, KIND_APP, OP_AND, OP_IMPLIES, OP_ITE, OP_OR } from "./ast";
3
2
  import type { Enode } from "./enode";
4
3
  import { shrink } from "./array";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/rewriter.h, rewriter.cpp, rewriter_def.h), MIT license, see z3-license.txt.
2
1
  import { ActCache } from "./act-cache";
3
2
  import { KIND_APP, KIND_QUANTIFIER, KIND_VAR, OP_ITE, type AstManager } from "./ast";
4
3
  import { grow, shrink } from "./array";
@@ -193,13 +192,15 @@ abstract class VarShifterCore extends RewriterCore {
193
192
  frame.childIndex++;
194
193
  if (!this.visit(child)) return;
195
194
  }
196
- // A rewritten no-pattern is not a pattern, so Z3 drops it.
197
195
  const result = frame.hasNewChild
198
196
  ? manager.mkQuantifier({
199
197
  ...data,
200
198
  body: this.resultStack[frame.spos],
201
199
  patterns: this.resultStack.slice(frame.spos + 1, frame.spos + 1 + data.patterns.length),
202
- noPatterns: [],
200
+ noPatterns: this.resultStack.slice(
201
+ frame.spos + 1 + data.patterns.length,
202
+ frame.spos + children.length,
203
+ ),
203
204
  })
204
205
  : expr;
205
206
  this.finish(expr, frame, result);
@@ -385,6 +386,7 @@ class RewriterEngine extends SubstCore {
385
386
  }
386
387
 
387
388
  release() {
389
+ this.setLastResult(-1);
388
390
  this.invShifter.release();
389
391
  this.shifter.release();
390
392
  this.releaseCaches();
@@ -855,6 +857,7 @@ export class BetaReducer extends SubstCore {
855
857
  }
856
858
 
857
859
  release() {
860
+ this.setLastResult(-1);
858
861
  this.shifter.release();
859
862
  this.releaseCaches();
860
863
  }
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/th_rewriter.cpp, bool_rewriter.cpp, arith_rewriter.cpp), MIT license, see z3-license.txt.
2
1
  import { mkArrayApp } from "./array-decl-plugin";
3
2
  import { ArrayRewriter } from "./array-rewriter";
4
3
  import { mkRecFunApp } from "./recfun-rewriter";
@@ -270,7 +269,7 @@ export class Rewriter extends RewriterTpl {
270
269
  !isLambda &&
271
270
  data.patterns.length + data.noPatterns.length === 0 &&
272
271
  nested.patterns.length + nested.noPatterns.length === 0;
273
- if (!isMerging && isLambda && manager.isGround(body))
272
+ if (!isMerging && isLambda && manager.isGroundApp(body))
274
273
  return mkArrayApp(manager, OP_CONST_ARRAY, [body], [manager.sorts[expr]]);
275
274
  if (!isMerging && isLambda) {
276
275
  const reduced = this.array.mkLambdaCore(expr, body);
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/rlimit.h, src/util/rlimit.cpp, src/util/memory_manager.cpp), MIT license, see z3-license.txt.
2
1
  import type { GCProfiler } from "node:v8";
3
2
  import { SmtCanceledError } from "../../../errors";
4
3
 
@@ -44,6 +43,19 @@ export class ResourceLimit {
44
43
  this.isCanceled = false;
45
44
  }
46
45
 
46
+ pushChild(child: ResourceLimit) {
47
+ child.limit = Math.min(child.limit, this.limit - Math.min(this.limit, this.count));
48
+ child.count = 0;
49
+ child.deadline = this.deadline;
50
+ child.signal = this.signal;
51
+ }
52
+
53
+ popChild(child: ResourceLimit) {
54
+ this.count += child.count;
55
+ child.count = 0;
56
+ child.release();
57
+ }
58
+
47
59
  restart(deadline: number) {
48
60
  this.deadline = deadline;
49
61
  this.isCanceled = false;
@@ -1,13 +1,10 @@
1
- // Ported from Z3 (src/sat/sat_asymm_branch.h, src/sat/sat_asymm_branch.cpp,
2
- // src/sat/sat_asymm_branch_params.pyg), MIT license, see z3-license.txt.
3
1
  import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
4
2
  import { RandomGen } from "../random-gen";
5
3
  import { Big } from "./big";
4
+ import { UINT_MAX } from "./clause";
6
5
  import { getBool, getNumber, type SatParams } from "./config";
7
6
  import type { Solver } from "./solver";
8
7
 
9
- const UINT_MAX = 4294967295;
10
-
11
8
  export class AsymmBranch {
12
9
  private counter = 0;
13
10
  private rand = new RandomGen(0);
@@ -68,22 +65,30 @@ export class AsymmBranch {
68
65
  clauses.sort((first, second) => solver.arena.size[second] - solver.arena.size[first]);
69
66
  this.counter -= clauses.length;
70
67
  let next = 0;
71
- for (let index = 0; index < clauses.length; index++) {
72
- const clause = clauses[index];
73
- if (solver.isInconsistent) {
74
- for (; index < clauses.length; index++) clauses[next++] = clauses[index];
75
- break;
76
- }
77
- if (this.counter < limit || solver.arena.wasRemoved(clause)) {
68
+ let index = 0;
69
+ try {
70
+ for (; index < clauses.length; index++) {
71
+ const clause = clauses[index];
72
+ if (solver.isInconsistent) {
73
+ for (; index < clauses.length; index++) clauses[next++] = clauses[index];
74
+ break;
75
+ }
76
+ if (this.counter < limit || solver.arena.wasRemoved(clause)) {
77
+ clauses[next++] = clause;
78
+ continue;
79
+ }
80
+ solver.checkpoint();
81
+ if (big === undefined ? !this.processClause(clause) : !this.processSampled(big, clause))
82
+ continue;
78
83
  clauses[next++] = clause;
79
- continue;
80
84
  }
81
- solver.checkpoint();
82
- if (big === undefined ? !this.processClause(clause) : !this.processSampled(big, clause))
83
- continue;
84
- clauses[next++] = clause;
85
+ clauses.length = next;
86
+ } catch (error) {
87
+ for (; index < clauses.length; index++) clauses[next++] = clauses[index];
88
+ clauses.length = next;
89
+ this.counter = -this.counter;
90
+ throw error;
85
91
  }
86
- clauses.length = next;
87
92
  }
88
93
 
89
94
  run(isForced: boolean) {
@@ -101,38 +106,40 @@ export class AsymmBranch {
101
106
  const wasProbing = solver.isProbing;
102
107
  solver.isProbing = true;
103
108
  let isChanged = true;
104
- for (let count = 0; isChanged && count < 2; count++) {
105
- isChanged = false;
106
- solver.touchIndex++;
107
- if (this.isSampled && this.processBig(new Big(solver.rand), true)) isChanged = true;
108
- if (this.isSampled && this.processBig(new Big(solver.rand), false)) isChanged = true;
109
- if (this.isEnabled) {
110
- this.counter = 0;
111
- const elim = this.elimLiterals;
112
- this.processClauses(undefined, solver.clauses);
113
- solver.propagate(false);
114
- if (this.elimLiterals > elim) isChanged = true;
115
- this.counter = -this.counter;
109
+ try {
110
+ for (let count = 0; isChanged && count < 2; count++) {
111
+ isChanged = false;
112
+ solver.touchIndex++;
113
+ if (this.isSampled && this.processBig(new Big(solver.rand), true)) isChanged = true;
114
+ if (this.isSampled && this.processBig(new Big(solver.rand), false)) isChanged = true;
115
+ if (this.isEnabled) {
116
+ this.counter = 0;
117
+ const elim = this.elimLiterals;
118
+ this.processClauses(undefined, solver.clauses);
119
+ solver.propagate(false);
120
+ if (this.elimLiterals > elim) isChanged = true;
121
+ this.counter = -this.counter;
122
+ }
123
+ this.touchIndex = solver.touchIndex;
116
124
  }
117
- this.touchIndex = solver.touchIndex;
125
+ } finally {
126
+ solver.isProbing = wasProbing;
118
127
  }
119
128
  for (let index = 0; index < savedPhase.length; index++) solver.phase[index] = savedPhase[index];
120
- solver.isProbing = wasProbing;
121
129
  this.limit = Math.min(2 * this.limit, UINT_MAX);
122
130
  }
123
131
 
124
132
  private processAll(clause: number) {
125
133
  this.detachScoped(clause);
126
- let result = true;
127
- for (let index = this.solver.arena.size[clause]; index-- > 0;) {
128
- const newSize = this.flipLiteralAt(clause, index);
129
- if (newSize !== -1) {
130
- result = this.cleanup(clause, index, newSize);
131
- break;
134
+ try {
135
+ for (let index = this.solver.arena.size[clause]; index-- > 0;) {
136
+ const newSize = this.flipLiteralAt(clause, index);
137
+ if (newSize !== -1) return this.cleanup(clause, index, newSize);
132
138
  }
139
+ return true;
140
+ } finally {
141
+ this.attachScoped(clause);
133
142
  }
134
- this.attachScoped(clause);
135
- return result;
136
143
  }
137
144
 
138
145
  private sort(big: Big, clause: number) {
@@ -286,10 +293,12 @@ export class AsymmBranch {
286
293
 
287
294
  private processSampled(big: Big, clause: number) {
288
295
  this.detachScoped(clause);
289
- this.sort(big, clause);
290
- const result = this.isHiddenTautology(big) || this.eliminateHiddenLiterals(big, clause);
291
- this.attachScoped(clause);
292
- return result;
296
+ try {
297
+ this.sort(big, clause);
298
+ return this.isHiddenTautology(big) || this.eliminateHiddenLiterals(big, clause);
299
+ } finally {
300
+ this.attachScoped(clause);
301
+ }
293
302
  }
294
303
 
295
304
  private processClause(clause: number) {
@@ -305,10 +314,12 @@ export class AsymmBranch {
305
314
  this.counter -= size;
306
315
  if (this.isAll) return this.processAll(clause);
307
316
  this.detachScoped(clause);
308
- const flipIndex = this.rand.next() % size;
309
- const newSize = this.flipLiteralAt(clause, flipIndex);
310
- const result = newSize === -1 || this.cleanup(clause, flipIndex, newSize);
311
- this.attachScoped(clause);
312
- return result;
317
+ try {
318
+ const flipIndex = this.rand.next() % size;
319
+ const newSize = this.flipLiteralAt(clause, flipIndex);
320
+ return newSize === -1 || this.cleanup(clause, flipIndex, newSize);
321
+ } finally {
322
+ this.attachScoped(clause);
323
+ }
313
324
  }
314
325
  }
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/sat/sat_big.h, src/sat/sat_big.cpp), MIT license, see z3-license.txt.
2
1
  import type { RandomGen } from "../random-gen";
3
2
  import { NULL_LITERAL } from "./clause";
4
3
  import type { Solver } from "./solver";
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/sat/sat_clause_use_list.h, src/sat/sat_clause_use_list.cpp,
2
- // src/sat/sat_simplifier.h, src/sat/sat_simplifier.cpp), MIT license, see z3-license.txt.
3
1
  import { type ClauseArena, NULL_LITERAL } from "./clause";
4
2
 
5
3
  export class UseList {
@@ -46,12 +44,6 @@ export class UseList {
46
44
  this.numRedundant[arena.get(clause, index)]++;
47
45
  }
48
46
 
49
- unblock(clause: number) {
50
- const arena = this.arena;
51
- for (let index = 0; index < arena.size[clause]; index++)
52
- this.numRedundant[arena.get(clause, index)]--;
53
- }
54
-
55
47
  erase(clause: number, exceptLit = NULL_LITERAL) {
56
48
  const arena = this.arena;
57
49
  const isLearned = arena.isLearned(clause);
@@ -1,8 +1,6 @@
1
- // Ported from Z3 (src/sat/sat_clause.h, src/sat/sat_clause.cpp), MIT license, see
2
- // z3-license.txt.
3
-
4
1
  export const NULL_LITERAL = -2;
5
2
  export const NULL_BOOL_VAR = -1;
3
+ export const UINT_MAX = 4294967295;
6
4
 
7
5
  const STRENGTHENED = 1;
8
6
  const REMOVED = 2;
@@ -31,7 +29,6 @@ export class ClauseArena {
31
29
  private numIds = 0;
32
30
  start = new Int32Array(64);
33
31
  size = new Int32Array(64);
34
- capacity = new Int32Array(64);
35
32
  flags = new Int32Array(64);
36
33
  approx = new Int32Array(64);
37
34
  inactRounds = new Int32Array(64);
@@ -44,7 +41,6 @@ export class ClauseArena {
44
41
  const length = this.start.length * 2;
45
42
  this.start = grow(this.start, length);
46
43
  this.size = grow(this.size, length);
47
- this.capacity = grow(this.capacity, length);
48
44
  this.flags = grow(this.flags, length);
49
45
  this.approx = grow(this.approx, length);
50
46
  this.inactRounds = grow(this.inactRounds, length);
@@ -61,7 +57,6 @@ export class ClauseArena {
61
57
  this.start[id] = this.top;
62
58
  this.top += numLits;
63
59
  this.size[id] = numLits;
64
- this.capacity[id] = numLits;
65
60
  this.flags[id] = isLearned ? LEARNED : 0;
66
61
  this.inactRounds[id] = 0;
67
62
  this.glue[id] = 255;
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/sat/sat_cleaner.h, src/sat/sat_cleaner.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
4
2
  import type { Solver } from "./solver";
5
3
  import { WATCH_EXT_CONSTRAINT } from "./watch-list";