tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.68b2c4968

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 (542) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +45 -41
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +4 -1
  8. package/dist/index.d.ts +4 -1
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +44 -43
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +1 -1
  20. package/dist/transfer.cjs +44 -41
  21. package/dist/transfer.js +43 -40
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +3 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +349 -91
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/codegen.ts +6 -2
  36. package/src/dependencies.ts +72 -11
  37. package/src/dfid.ts +9 -2
  38. package/src/environment.ts +27 -5
  39. package/src/errors.ts +38 -3
  40. package/src/evaluate.ts +92 -32
  41. package/src/exit-codes.ts +5 -2
  42. package/src/instances.ts +1 -1
  43. package/src/levels.ts +134 -86
  44. package/src/lexer.ts +5 -3
  45. package/src/liveness-checker.ts +572 -204
  46. package/src/liveness.ts +47 -32
  47. package/src/obligations/action.ts +10 -6
  48. package/src/obligations/anonymize.ts +33 -14
  49. package/src/obligations/enabled-axioms.ts +218 -0
  50. package/src/obligations/equality.ts +1 -3
  51. package/src/obligations/expression.ts +18 -6
  52. package/src/obligations/format.ts +0 -2
  53. package/src/obligations/generate.ts +22 -17
  54. package/src/obligations/index.ts +36 -6
  55. package/src/obligations/levels.ts +24 -11
  56. package/src/obligations/module.ts +1 -3
  57. package/src/obligations/normalize.ts +24 -13
  58. package/src/obligations/operators.ts +0 -2
  59. package/src/obligations/pragma.ts +53 -16
  60. package/src/obligations/printer.ts +43 -13
  61. package/src/obligations/proof.ts +3 -2
  62. package/src/obligations/regroup.ts +0 -2
  63. package/src/obligations/simplify.ts +17 -7
  64. package/src/obligations/source.ts +71 -17
  65. package/src/obligations/subexpression.ts +45 -18
  66. package/src/obligations/substitution.ts +1 -3
  67. package/src/obligations/temporal.ts +0 -2
  68. package/src/obligations/tuples.ts +0 -2
  69. package/src/parallel-worker.ts +8 -2
  70. package/src/parallel.ts +7 -2
  71. package/src/parser.ts +634 -186
  72. package/src/pretty-print.ts +1 -1
  73. package/src/prover/deciders.ts +11 -8
  74. package/src/prover/isabelle/decide.ts +3 -25
  75. package/src/prover/isabelle/encode.ts +71 -41
  76. package/src/prover/isabelle/isar/attrib.ts +250 -0
  77. package/src/prover/isabelle/isar/context.ts +335 -0
  78. package/src/prover/isabelle/isar/induct.ts +382 -0
  79. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  80. package/src/prover/isabelle/isar/method.ts +506 -198
  81. package/src/prover/isabelle/isar/proof.ts +570 -14
  82. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  83. package/src/prover/isabelle/isar/theory.ts +479 -69
  84. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  85. package/src/prover/isabelle/isar/type-check.ts +83 -8
  86. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  91. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  92. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  93. package/src/prover/isabelle/provers/classical.ts +45 -20
  94. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  95. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  96. package/src/prover/isabelle/pure/consts.ts +0 -2
  97. package/src/prover/isabelle/pure/conv.ts +0 -2
  98. package/src/prover/isabelle/pure/drule.ts +63 -4
  99. package/src/prover/isabelle/pure/envir.ts +0 -2
  100. package/src/prover/isabelle/pure/goal.ts +1 -3
  101. package/src/prover/isabelle/pure/logic.ts +0 -2
  102. package/src/prover/isabelle/pure/name.ts +0 -2
  103. package/src/prover/isabelle/pure/net.ts +0 -2
  104. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  105. package/src/prover/isabelle/pure/pattern.ts +0 -2
  106. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  107. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  108. package/src/prover/isabelle/pure/search.ts +0 -2
  109. package/src/prover/isabelle/pure/seq.ts +0 -2
  110. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  111. package/src/prover/isabelle/pure/table.ts +0 -2
  112. package/src/prover/isabelle/pure/tactic.ts +0 -2
  113. package/src/prover/isabelle/pure/tactical.ts +0 -2
  114. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  115. package/src/prover/isabelle/pure/term.ts +0 -2
  116. package/src/prover/isabelle/pure/thm.ts +0 -2
  117. package/src/prover/isabelle/pure/type.ts +0 -2
  118. package/src/prover/isabelle/pure/unify.ts +0 -2
  119. package/src/prover/isabelle/pure/variable.ts +0 -2
  120. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  121. package/src/prover/isabelle/tla/context.ts +51 -9
  122. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  123. package/src/prover/isabelle/tla/logic.ts +40 -1
  124. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  125. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  126. package/src/prover/ocaml.ts +4 -1
  127. package/src/prover/prep/action.ts +19 -12
  128. package/src/prover/prep/enabled-axioms.ts +11 -2
  129. package/src/prover/prep/methods.ts +159 -50
  130. package/src/prover/prep/normalize.ts +38 -9
  131. package/src/prover/prove.ts +343 -65
  132. package/src/prover/ptl/decide.ts +95 -50
  133. package/src/prover/ptl/encode.ts +2 -3
  134. package/src/prover/ptl/tableau.ts +28 -2
  135. package/src/prover/smt/arithmetic.ts +310 -0
  136. package/src/prover/smt/axioms.ts +12 -8
  137. package/src/prover/smt/context.ts +42 -6
  138. package/src/prover/smt/data.ts +191 -84
  139. package/src/prover/smt/encode.ts +122 -43
  140. package/src/prover/smt/extensionality.ts +5 -3
  141. package/src/prover/smt/flatten.ts +4 -6
  142. package/src/prover/smt/format.ts +28 -4
  143. package/src/prover/smt/instances.ts +7 -1
  144. package/src/prover/smt/layout.ts +91 -0
  145. package/src/prover/smt/rewrite.ts +483 -116
  146. package/src/prover/smt/simplify.ts +441 -0
  147. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  148. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  149. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  150. package/src/prover/smt/solver/act-cache.ts +0 -1
  151. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  152. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  153. package/src/prover/smt/solver/aig.ts +889 -0
  154. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  155. package/src/prover/smt/solver/arith-terms.ts +121 -0
  156. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  157. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  158. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  159. package/src/prover/smt/solver/ast-lt.ts +165 -11
  160. package/src/prover/smt/solver/ast-util.ts +160 -2
  161. package/src/prover/smt/solver/ast.ts +1449 -41
  162. package/src/prover/smt/solver/auf-solver.ts +0 -1
  163. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  164. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  165. package/src/prover/smt/solver/bound-manager.ts +196 -0
  166. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  167. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  168. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  169. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  170. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  171. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  172. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  173. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  174. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  175. package/src/prover/smt/solver/card2bv.ts +109 -0
  176. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  177. package/src/prover/smt/solver/cg-table.ts +39 -25
  178. package/src/prover/smt/solver/check-logic.ts +330 -0
  179. package/src/prover/smt/solver/clause.ts +0 -1
  180. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  181. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  182. package/src/prover/smt/solver/context.ts +533 -114
  183. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  184. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  185. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  186. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  187. package/src/prover/smt/solver/demodulator.ts +786 -0
  188. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  189. package/src/prover/smt/solver/der.ts +38 -10
  190. package/src/prover/smt/solver/diff-neq.ts +205 -0
  191. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  192. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  193. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  194. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  195. package/src/prover/smt/solver/e-matching.ts +6 -7
  196. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  197. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  198. package/src/prover/smt/solver/enode.ts +100 -3
  199. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  200. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  201. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  202. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  203. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  204. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  205. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  206. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  207. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  208. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  209. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  210. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  211. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  212. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  213. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  214. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  215. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  216. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  217. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  218. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  219. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  220. package/src/prover/smt/solver/expr-ref.ts +0 -1
  221. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  222. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  223. package/src/prover/smt/solver/factor.ts +163 -0
  224. package/src/prover/smt/solver/fd-solver.ts +267 -0
  225. package/src/prover/smt/solver/fingerprints.ts +15 -15
  226. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  227. package/src/prover/smt/solver/flat-literals.ts +0 -1
  228. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  229. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  230. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  231. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  232. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  233. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  234. package/src/prover/smt/solver/goal.ts +177 -15
  235. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  236. package/src/prover/smt/solver/guard-set.ts +219 -0
  237. package/src/prover/smt/solver/hash.ts +0 -1
  238. package/src/prover/smt/solver/hashtable.ts +30 -16
  239. package/src/prover/smt/solver/inf-eps.ts +63 -0
  240. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  241. package/src/prover/smt/solver/internalizer.ts +109 -36
  242. package/src/prover/smt/solver/lackr.ts +381 -0
  243. package/src/prover/smt/solver/lbool.ts +0 -1
  244. package/src/prover/smt/solver/lia2card.ts +268 -0
  245. package/src/prover/smt/solver/lia2pb.ts +154 -0
  246. package/src/prover/smt/solver/literal.ts +0 -1
  247. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  248. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  249. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  250. package/src/prover/smt/solver/lp/containers.ts +7 -2
  251. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  252. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  253. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  254. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  255. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  256. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  257. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  259. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  260. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  261. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  262. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  263. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  264. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  265. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  266. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  267. package/src/prover/smt/solver/lp/nex.ts +2 -2
  268. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  269. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  270. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  271. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  274. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  275. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  276. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  277. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  278. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  279. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  280. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  282. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  285. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  287. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  288. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  289. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  290. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  291. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  292. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  293. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  294. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  295. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  296. package/src/prover/smt/solver/macro-finder.ts +530 -0
  297. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  298. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  299. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  300. package/src/prover/smt/solver/max-cliques.ts +105 -0
  301. package/src/prover/smt/solver/maxcore.ts +309 -0
  302. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  303. package/src/prover/smt/solver/maxlex.ts +115 -0
  304. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  305. package/src/prover/smt/solver/maxsmt.ts +92 -0
  306. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  307. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  308. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  309. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  310. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  311. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  312. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  313. package/src/prover/smt/solver/model-checker.ts +17 -26
  314. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  315. package/src/prover/smt/solver/model-finder.ts +0 -1
  316. package/src/prover/smt/solver/model-generator.ts +59 -30
  317. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  318. package/src/prover/smt/solver/model-printer.ts +214 -0
  319. package/src/prover/smt/solver/mpf.ts +709 -0
  320. package/src/prover/smt/solver/mus.ts +50 -0
  321. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  322. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  323. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  324. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  325. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  326. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  327. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  328. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  329. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  330. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  331. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  332. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  333. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  334. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  335. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  336. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  337. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  338. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  339. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  340. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  341. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  342. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  343. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  344. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  345. package/src/prover/smt/solver/nlqsat.ts +484 -0
  346. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  347. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  348. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  349. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  350. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  351. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  352. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  353. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  354. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  355. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  356. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  357. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  358. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  359. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  360. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  361. package/src/prover/smt/solver/nnf.ts +105 -23
  362. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  363. package/src/prover/smt/solver/occf.ts +97 -0
  364. package/src/prover/smt/solver/opt-context.ts +792 -0
  365. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  366. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  367. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  368. package/src/prover/smt/solver/opt-solver.ts +311 -0
  369. package/src/prover/smt/solver/opt-value.ts +55 -0
  370. package/src/prover/smt/solver/optsmt.ts +692 -0
  371. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  372. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  373. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  374. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  375. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  376. package/src/prover/smt/solver/probes.ts +511 -0
  377. package/src/prover/smt/solver/propagate-values.ts +37 -21
  378. package/src/prover/smt/solver/proto-model.ts +650 -17
  379. package/src/prover/smt/solver/pull-quant.ts +28 -12
  380. package/src/prover/smt/solver/purify-arith.ts +632 -0
  381. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  382. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  383. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  384. package/src/prover/smt/solver/qe-lite.ts +37 -17
  385. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  386. package/src/prover/smt/solver/qe.ts +1499 -0
  387. package/src/prover/smt/solver/qel.ts +25 -0
  388. package/src/prover/smt/solver/qi-queue.ts +0 -1
  389. package/src/prover/smt/solver/qsat.ts +814 -0
  390. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  391. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  392. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  393. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  394. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  395. package/src/prover/smt/solver/random-gen.ts +0 -1
  396. package/src/prover/smt/solver/rational.ts +45 -1
  397. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  398. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  399. package/src/prover/smt/solver/reduce-args.ts +225 -0
  400. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  401. package/src/prover/smt/solver/ref-vector.ts +0 -1
  402. package/src/prover/smt/solver/relevancy.ts +1 -2
  403. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  404. package/src/prover/smt/solver/rewriter.ts +475 -36
  405. package/src/prover/smt/solver/rlimit.ts +38 -2
  406. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  407. package/src/prover/smt/solver/sat/big.ts +177 -0
  408. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  409. package/src/prover/smt/solver/sat/clause.ts +203 -0
  410. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  411. package/src/prover/smt/solver/sat/config.ts +122 -0
  412. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  413. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  414. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  415. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  416. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  417. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  418. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  419. package/src/prover/smt/solver/sat/probing.ts +170 -0
  420. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  421. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  422. package/src/prover/smt/solver/sat/scc.ts +142 -0
  423. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  424. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  425. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  426. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  427. package/src/prover/smt/solver/search-tree.ts +284 -0
  428. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  429. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  430. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  431. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  432. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  433. package/src/prover/smt/solver/seq-factory.ts +89 -0
  434. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  435. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  436. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  437. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  438. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  439. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  440. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  441. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  442. package/src/prover/smt/solver/seq-subset.ts +165 -0
  443. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  444. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  445. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  446. package/src/prover/smt/solver/smt-logics.ts +66 -0
  447. package/src/prover/smt/solver/smt-setup.ts +544 -0
  448. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  449. package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
  450. package/src/prover/smt/solver/smtlib-script.ts +1843 -0
  451. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  452. package/src/prover/smt/solver/solver.ts +113 -22
  453. package/src/prover/smt/solver/static-features.ts +314 -0
  454. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  455. package/src/prover/smt/solver/tactic.ts +2012 -0
  456. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  457. package/src/prover/smt/solver/theory-array.ts +1240 -0
  458. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  459. package/src/prover/smt/solver/theory-char.ts +355 -0
  460. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  461. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  462. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  463. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  464. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  465. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  466. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  467. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  468. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  469. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  470. package/src/prover/smt/solver/theory-lra.ts +188 -2
  471. package/src/prover/smt/solver/theory-pb.ts +933 -0
  472. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  473. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  474. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  475. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  476. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  477. package/src/prover/smt/solver/theory-seq.ts +961 -0
  478. package/src/prover/smt/solver/theory.ts +189 -0
  479. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  480. package/src/prover/smt/solver/var-subst.ts +36 -14
  481. package/src/prover/smt/table.ts +3 -2
  482. package/src/prover/smt/types.ts +146 -0
  483. package/src/prover/tlapm/cache.ts +29 -8
  484. package/src/prover/tlapm-library.ts +3208 -0
  485. package/src/prover/verdict.ts +2 -0
  486. package/src/prover/zenon/decide.ts +10 -7
  487. package/src/prover/zenon/encode.ts +0 -2
  488. package/src/prover/zenon/eqrel.ts +0 -2
  489. package/src/prover/zenon/equality-rules.ts +24 -2
  490. package/src/prover/zenon/expr.ts +21 -2
  491. package/src/prover/zenon/index-table.ts +7 -4
  492. package/src/prover/zenon/isar-case.ts +1 -3
  493. package/src/prover/zenon/isar.ts +2 -4
  494. package/src/prover/zenon/llproof.ts +0 -2
  495. package/src/prover/zenon/mltoll.ts +0 -2
  496. package/src/prover/zenon/node.ts +20 -5
  497. package/src/prover/zenon/parse.ts +6 -2
  498. package/src/prover/zenon/phrase.ts +1 -3
  499. package/src/prover/zenon/proof.ts +0 -2
  500. package/src/prover/zenon/propositional-rules.ts +0 -2
  501. package/src/prover/zenon/rules.ts +2 -3
  502. package/src/prover/zenon/search.ts +7 -5
  503. package/src/prover/zenon/tla/functions.ts +0 -2
  504. package/src/prover/zenon/tla/llproof.ts +0 -2
  505. package/src/prover/zenon/tla/records.ts +0 -2
  506. package/src/prover/zenon/tla/rewrites.ts +0 -2
  507. package/src/prover/zenon/tla/sets.ts +7 -8
  508. package/src/prover/zenon/tla/terms.ts +0 -2
  509. package/src/prover/zenon/tla/tla.ts +0 -2
  510. package/src/resolve.ts +264 -77
  511. package/src/runtime.ts +6 -0
  512. package/src/sany/generation.ts +1 -13
  513. package/src/sany/generator-definitions.ts +2 -1
  514. package/src/sany/generator-expressions.ts +30 -27
  515. package/src/sany/generator-proofs.ts +1 -1
  516. package/src/sany/generator.ts +2 -1
  517. package/src/sany/levels.ts +0 -2
  518. package/src/sany/linter.ts +0 -2
  519. package/src/sany/nodes.ts +1 -1
  520. package/src/sany/selectors.ts +6 -5
  521. package/src/search.ts +209 -56
  522. package/src/simulate.ts +3 -0
  523. package/src/spec-description.ts +2 -2
  524. package/src/standard-definitions.ts +4 -0
  525. package/src/state-graph.ts +0 -2
  526. package/src/subexpressions.ts +165 -78
  527. package/src/successors.ts +2 -1
  528. package/src/symmetry.ts +2 -2
  529. package/src/tableau.ts +2 -2
  530. package/src/tlc/fingerprint.ts +81 -9
  531. package/src/tlc/jar-data.ts +12 -0
  532. package/src/tlc/order.ts +14 -3
  533. package/src/tlc/summary.ts +29 -14
  534. package/src/tlc/tlcext-operators.ts +61 -16
  535. package/src/tlc/trace-spec.ts +2 -3
  536. package/src/typed-tier.ts +6541 -0
  537. package/src/typescript/types.ts +2 -2
  538. package/src/values.ts +42 -23
  539. package/src/prover/isabelle/isar/statement.ts +0 -52
  540. package/src/prover/smt/solver/z3-license.txt +0 -10
  541. package/src/prover/tlaps-module.ts +0 -510
  542. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,225 @@
1
+ import { SmtTacticError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_USER,
5
+ KIND_APP,
6
+ KIND_QUANTIFIER,
7
+ OP_AS_ARRAY,
8
+ OP_BADD,
9
+ OP_BV_NUM,
10
+ OP_ITE,
11
+ } from "./ast";
12
+ import type { Definition, Goal } from "./goal";
13
+ import { combineHash, hashU } from "./hash";
14
+ import { ObjMap } from "./hashtable";
15
+ import { RewriterTpl } from "./rewriter-tpl";
16
+
17
+ const GOLDEN_RATIO = 0x9e3779b9;
18
+
19
+ interface ArgFuncs {
20
+ byKey: Map<string, number>;
21
+ funcs: ObjMap<number>;
22
+ }
23
+
24
+ const forEachSubterm = (manager: AstManager, goal: Goal, visit: (expr: number) => void) => {
25
+ const visited = new Set<number>();
26
+ for (const form of goal.forms.items) {
27
+ manager.limit.checkpoint();
28
+ const todo = [form];
29
+ while (todo.length > 0) {
30
+ const expr = todo[todo.length - 1];
31
+ if (visited.has(expr)) {
32
+ todo.pop();
33
+ continue;
34
+ }
35
+ const children =
36
+ manager.kinds[expr] === KIND_QUANTIFIER
37
+ ? [
38
+ manager.getQuantifier(expr).body,
39
+ ...manager.getQuantifier(expr).patterns,
40
+ ...manager.getQuantifier(expr).noPatterns,
41
+ ]
42
+ : manager.kinds[expr] === KIND_APP
43
+ ? manager.getArgs(expr)
44
+ : [];
45
+ const pending = children.filter((child) => !visited.has(child));
46
+ if (pending.length > 0) {
47
+ todo.push(...pending.toReversed());
48
+ continue;
49
+ }
50
+ todo.pop();
51
+ visited.add(expr);
52
+ visit(expr);
53
+ }
54
+ }
55
+ };
56
+
57
+ // may_be_unique: the base of a bit-vector offset, or the term itself, is null for a unique value.
58
+ const getUniqueBase = (manager: AstManager, expr: number) => {
59
+ if (manager.isUniqueValue(expr)) return null;
60
+ const isOffset =
61
+ manager.getOp(expr) === OP_BADD &&
62
+ manager.getNumArgs(expr) === 2 &&
63
+ manager.getOp(manager.getArg(expr, 0)) === OP_BV_NUM;
64
+ const base = isOffset ? manager.getArg(expr, 1) : expr;
65
+ return manager.isGround(base) ? base : undefined;
66
+ };
67
+
68
+ const isUserApp = (manager: AstManager, expr: number) =>
69
+ manager.kinds[expr] === KIND_APP &&
70
+ manager.getNumArgs(expr) > 0 &&
71
+ manager.funcDecls[manager.decls[expr]].family === FAMILY_USER;
72
+
73
+ const getArgsHash = (manager: AstManager, app: number, bits: boolean[]) => {
74
+ let hash = GOLDEN_RATIO;
75
+ for (const [index, arg] of manager.getArgs(app).entries())
76
+ if (bits[index]) hash = combineHash(hashU(hash), hashU(manager.ids[arg]));
77
+ return hash;
78
+ };
79
+
80
+ class ReduceArgsRewriter extends RewriterTpl {
81
+ readonly declToArgFuncs: ObjMap<ArgFuncs>;
82
+
83
+ constructor(
84
+ manager: AstManager,
85
+ private declToArgs: Map<number, boolean[]>,
86
+ ) {
87
+ super(manager);
88
+ this.declToArgFuncs = new ObjMap((decl) => manager.getDeclHash(decl));
89
+ }
90
+
91
+ checkMaxSteps() {
92
+ this.manager.limit.checkpoint();
93
+ }
94
+
95
+ reduceApp(decl: number, args: number[], sort: number) {
96
+ const manager = this.manager;
97
+ const funcDecl = manager.funcDecls[decl];
98
+ if (funcDecl.domain.length === 0 || funcDecl.family !== FAMILY_USER) return -1;
99
+ const bits = this.declToArgs.get(decl);
100
+ if (bits === undefined) return -1;
101
+ let argFuncs = this.declToArgFuncs.get(decl);
102
+ if (argFuncs === undefined) {
103
+ argFuncs = {
104
+ byKey: new Map(),
105
+ funcs: new ObjMap((app) => getArgsHash(manager, app, bits)),
106
+ };
107
+ this.declToArgFuncs.set(decl, argFuncs);
108
+ }
109
+ const app = manager.mkApp(decl, args, sort);
110
+ manager.incRef(app);
111
+ const key = args.filter((_arg, index) => bits[index]).join(",");
112
+ const representative = argFuncs.byKey.get(key);
113
+ const newDecl =
114
+ representative === undefined
115
+ ? manager.mkFreshFuncDecl(
116
+ funcDecl.name,
117
+ funcDecl.domain.filter((_sort, index) => !bits[index]),
118
+ funcDecl.range,
119
+ )
120
+ : (argFuncs.funcs.get(representative) as number);
121
+ if (representative === undefined) {
122
+ argFuncs.byKey.set(key, app);
123
+ argFuncs.funcs.set(app, newDecl);
124
+ manager.incRef(app);
125
+ manager.incDeclRef(newDecl);
126
+ }
127
+ const result = manager.mkApp(
128
+ newDecl,
129
+ args.filter((_arg, index) => !bits[index]),
130
+ sort,
131
+ );
132
+ manager.incRef(result);
133
+ manager.decRef(app);
134
+ return result;
135
+ }
136
+ }
137
+
138
+ const getDefinitions = (
139
+ manager: AstManager,
140
+ declToArgs: Map<number, boolean[]>,
141
+ declToArgFuncs: ObjMap<ArgFuncs>,
142
+ ) => {
143
+ const definitions: Definition[] = [];
144
+ for (const argFuncs of declToArgFuncs.entries())
145
+ for (const newDecl of argFuncs[1].funcs.entries())
146
+ definitions.push({ decl: newDecl[1], def: -1 });
147
+ for (const [decl, argFuncs] of declToArgFuncs.entries()) {
148
+ const funcDecl = manager.funcDecls[decl];
149
+ const bits = declToArgs.get(decl) as boolean[];
150
+ const vars = funcDecl.domain.map((sort, index) => manager.mkVar(index, sort));
151
+ const newArgs = vars.filter((_var, index) => !bits[index]);
152
+ let def = -1;
153
+ for (const [app, newDecl] of argFuncs.funcs.entries()) {
154
+ const newApp = manager.mkApp(newDecl, newArgs, funcDecl.range);
155
+ if (def === -1) {
156
+ def = newApp;
157
+ continue;
158
+ }
159
+ const eqs = vars.flatMap((variable, index) =>
160
+ bits[index] ? [manager.mkEq(variable, manager.getArg(app, index))] : [],
161
+ );
162
+ def = manager.mkApp(OP_ITE, [manager.mkAnd(eqs), newApp, def], funcDecl.range);
163
+ }
164
+ definitions.push({ decl, def });
165
+ }
166
+ return definitions;
167
+ };
168
+
169
+ const reduce = (manager: AstManager, goal: Goal) => {
170
+ if (goal.isInconsistent) return;
171
+ const nonCandidates = new Set<number>();
172
+ forEachSubterm(manager, goal, (expr) => {
173
+ if (manager.kinds[expr] !== KIND_APP) return;
174
+ if (manager.getOp(expr) === OP_AS_ARRAY) {
175
+ nonCandidates.add(manager.funcDecls[manager.decls[expr]].parameters[0]);
176
+ return;
177
+ }
178
+ if (!isUserApp(manager, expr) || nonCandidates.has(manager.decls[expr])) return;
179
+ if (manager.getArgs(expr).some((arg) => getUniqueBase(manager, arg) !== undefined)) return;
180
+ nonCandidates.add(manager.decls[expr]);
181
+ });
182
+ const declToArgs = new Map<number, boolean[]>();
183
+ const declToBases = new Map<number, (number | null | undefined)[]>();
184
+ forEachSubterm(manager, goal, (expr) => {
185
+ if (!isUserApp(manager, expr) || nonCandidates.has(manager.decls[expr])) return;
186
+ const decl = manager.decls[expr];
187
+ const bases = manager.getArgs(expr).map((arg) => getUniqueBase(manager, arg));
188
+ const bits = declToArgs.get(decl);
189
+ if (bits === undefined) {
190
+ declToArgs.set(
191
+ decl,
192
+ bases.map((base) => base !== undefined),
193
+ );
194
+ declToBases.set(decl, bases);
195
+ return;
196
+ }
197
+ const firstBases = declToBases.get(decl) as (number | null | undefined)[];
198
+ for (const [index, base] of bases.entries())
199
+ bits[index] = bits[index] && base !== undefined && firstBases[index] === base;
200
+ });
201
+ for (const [decl, bits] of declToArgs) if (!bits.includes(true)) declToArgs.delete(decl);
202
+ if (declToArgs.size === 0) return;
203
+ const rewriter = new ReduceArgsRewriter(manager, declToArgs);
204
+ const end = goal.forms.size;
205
+ for (let index = 0; index < end && !goal.isInconsistent; index++) {
206
+ const rewritten = rewriter.rewrite(goal.forms.items[index]);
207
+ goal.update(index, rewritten);
208
+ manager.decRef(rewritten);
209
+ }
210
+ const definitions = getDefinitions(manager, declToArgs, rewriter.declToArgFuncs);
211
+ goal.addDefinitions(definitions);
212
+ rewriter.release();
213
+ for (const argFuncs of rewriter.declToArgFuncs.entries())
214
+ for (const [app, newDecl] of argFuncs[1].funcs.entries()) {
215
+ manager.decRef(app);
216
+ manager.decDeclRef(newDecl);
217
+ }
218
+ };
219
+
220
+ export const reduceArgs = (manager: AstManager, goal: Goal) => {
221
+ if (goal.isCoresEnabled)
222
+ throw new SmtTacticError("reduce-args does not support unsat core production");
223
+ if (!goal.isProofsEnabled) reduce(manager, goal);
224
+ goal.depth++;
225
+ };
@@ -0,0 +1,119 @@
1
+ import { SmtTacticError } from "../../../errors";
2
+ import { type AstManager, OP_CONCAT, OP_SIGN_EXT, OP_SLEQ } from "./ast";
3
+ import { mkBvApp } from "./bv-decl-plugin";
4
+ import type { Definition, Goal } from "./goal";
5
+ import { ObjMap } from "./hashtable";
6
+ import { SubstReplacer } from "./solve-eqs";
7
+
8
+ const getSigned = (value: bigint, size: number) => {
9
+ const modulus = 1n << BigInt(size);
10
+ const reduced = ((value % modulus) + modulus) % modulus;
11
+ return reduced >= modulus >> 1n ? reduced - modulus : reduced;
12
+ };
13
+
14
+ const getNumBits = (value: bigint) => value.toString(2).length;
15
+
16
+ const collectBounds = (manager: AstManager, goal: Goal) => {
17
+ const getHash = (expr: number) => manager.hashes[expr];
18
+ const lowers = new ObjMap<bigint>(getHash);
19
+ const uppers = new ObjMap<bigint>(getHash);
20
+ const setLower = (variable: number, value: bigint) => {
21
+ const old = lowers.get(variable);
22
+ lowers.set(variable, old === undefined || old < value ? value : old);
23
+ };
24
+ const setUpper = (variable: number, value: bigint) => {
25
+ const old = uppers.get(variable);
26
+ uppers.set(variable, old === undefined || value < old ? value : old);
27
+ };
28
+ for (const form of goal.forms.items) {
29
+ const isNegated = manager.isNot(form);
30
+ const atom = isNegated ? manager.getArg(form, 0) : form;
31
+ if (manager.getOp(atom) !== OP_SLEQ) continue;
32
+ const lhs = manager.getArg(atom, 0);
33
+ const rhs = manager.getArg(atom, 1);
34
+ const size = manager.getBvSize(manager.sorts[lhs]);
35
+ if (manager.isUninterpretedConst(lhs) && manager.isBvNumeral(rhs)) {
36
+ const value = getSigned(manager.getBvNumeralValue(rhs), size);
37
+ if (!isNegated) setUpper(lhs, value);
38
+ else if (getSigned(value + 1n, size) === value + 1n) setLower(lhs, value + 1n);
39
+ } else if (manager.isUninterpretedConst(rhs) && manager.isBvNumeral(lhs)) {
40
+ const value = getSigned(manager.getBvNumeralValue(lhs), size);
41
+ if (!isNegated) setLower(rhs, value);
42
+ else if (getSigned(value - 1n, size) === value - 1n) setUpper(rhs, value - 1n);
43
+ }
44
+ }
45
+ return { lowers, uppers };
46
+ };
47
+
48
+ // Z3 also keeps unsigned bounds, but only code it compiles out collects them.
49
+ export const runReduceBvSize = (manager: AstManager) => (goal: Goal) => {
50
+ if (goal.isProofsEnabled)
51
+ throw new SmtTacticError("bv-size-reduction does not support proof production");
52
+ if (goal.isCoresEnabled)
53
+ throw new SmtTacticError("bv-size-reduction does not support unsat core production");
54
+ goal.depth++;
55
+ if (goal.isInconsistent) return [goal];
56
+ const bounds = collectBounds(manager, goal);
57
+ const substitution = new ObjMap<number>((expr) => manager.hashes[expr]);
58
+ const definitions: Definition[] = [];
59
+ const hidden: Definition[] = [];
60
+ const replacer = new SubstReplacer(manager, substitution);
61
+ let isInfeasible = false;
62
+ if (bounds.lowers.size > 0 && bounds.uppers.size > 0)
63
+ for (const [variable, lower] of bounds.lowers) {
64
+ const upper = bounds.uppers.get(variable);
65
+ if (upper === undefined) continue;
66
+ if (lower > upper) {
67
+ isInfeasible = true;
68
+ break;
69
+ }
70
+ const size = manager.getBvSize(manager.sorts[variable]);
71
+ const width =
72
+ lower >= 0n
73
+ ? getNumBits(upper)
74
+ : upper < 0n
75
+ ? getNumBits(-lower)
76
+ : Math.max(getNumBits(-lower), getNumBits(upper)) + 1;
77
+ const fresh =
78
+ lower === upper || width >= size ? -1 : manager.mkFreshConst(null, manager.mkBvSort(width));
79
+ if (fresh !== -1) hidden.push({ decl: manager.decls[fresh], def: -1 });
80
+ const def =
81
+ lower === upper
82
+ ? manager.mkBvNumeral(lower, size)
83
+ : fresh === -1
84
+ ? -1
85
+ : lower < 0n && upper >= 0n
86
+ ? mkBvApp(manager, OP_SIGN_EXT, [fresh], [size - width])
87
+ : mkBvApp(manager, OP_CONCAT, [
88
+ manager.mkBvNumeral(lower < 0n ? -1n : 0n, size - width),
89
+ fresh,
90
+ ]);
91
+ if (def === -1) continue;
92
+ manager.incRef(variable);
93
+ manager.incRef(def);
94
+ substitution.set(variable, def);
95
+ definitions.push({ decl: manager.decls[variable], def });
96
+ }
97
+ if (isInfeasible) goal.assert(manager.falseExpr);
98
+ else if (substitution.size > 0) {
99
+ let rewritten = -1;
100
+ const size = goal.forms.size;
101
+ for (let index = 0; index < size && !goal.isInconsistent; index++) {
102
+ const next = replacer.rewrite(goal.forms.items[index]);
103
+ if (rewritten !== -1) manager.decRef(rewritten);
104
+ rewritten = next;
105
+ goal.update(index, rewritten);
106
+ }
107
+ if (!goal.isInconsistent) {
108
+ if (hidden.length > 0) goal.addDefinitions(hidden);
109
+ goal.addDefinitions(definitions);
110
+ }
111
+ if (rewritten !== -1) manager.decRef(rewritten);
112
+ }
113
+ for (const [variable, def] of substitution) {
114
+ manager.decRef(variable);
115
+ manager.decRef(def);
116
+ }
117
+ replacer.release();
118
+ return [goal];
119
+ };
@@ -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";
@@ -30,7 +29,7 @@ export class RelevancyPropagator {
30
29
 
31
30
  constructor(
32
31
  private context: RelevancyContext,
33
- readonly isEnabled: boolean,
32
+ public isEnabled: boolean,
34
33
  ) {}
35
34
 
36
35
  isRelevant(expr: number) {
@@ -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";
@@ -125,6 +124,17 @@ class RewriterCore {
125
124
  protected releaseCaches() {
126
125
  for (const cache of this.caches) cache.reset();
127
126
  }
127
+
128
+ protected cleanupCore() {
129
+ this.releaseCaches();
130
+ this.shrinkResults(0);
131
+ this.caches = [new ActCache(this.manager, this.manager.getNumAsts())];
132
+ this.frames = [];
133
+ this.numFrames = 0;
134
+ this.scopes = [];
135
+ this.root = -1;
136
+ this.numQvars = 0;
137
+ }
128
138
  }
129
139
 
130
140
  abstract class VarShifterCore extends RewriterCore {
@@ -176,7 +186,7 @@ abstract class VarShifterCore extends RewriterCore {
176
186
  this.numQvars += data.sorts.length;
177
187
  this.root = data.body;
178
188
  }
179
- const children = [data.body, ...data.patterns];
189
+ const children = [data.body, ...data.patterns, ...data.noPatterns];
180
190
  while (frame.childIndex < children.length) {
181
191
  const child = children[frame.childIndex];
182
192
  frame.childIndex++;
@@ -186,7 +196,11 @@ abstract class VarShifterCore extends RewriterCore {
186
196
  ? manager.mkQuantifier({
187
197
  ...data,
188
198
  body: this.resultStack[frame.spos],
189
- patterns: this.resultStack.slice(frame.spos + 1),
199
+ patterns: this.resultStack.slice(frame.spos + 1, frame.spos + 1 + data.patterns.length),
200
+ noPatterns: this.resultStack.slice(
201
+ frame.spos + 1 + data.patterns.length,
202
+ frame.spos + children.length,
203
+ ),
190
204
  })
191
205
  : expr;
192
206
  this.finish(expr, frame, result);
@@ -228,6 +242,10 @@ abstract class VarShifterCore extends RewriterCore {
228
242
  this.resetCore();
229
243
  }
230
244
 
245
+ cleanup() {
246
+ this.cleanupCore();
247
+ }
248
+
231
249
  release() {
232
250
  this.releaseCaches();
233
251
  }
@@ -324,6 +342,9 @@ class RewriterEngine extends SubstCore {
324
342
  blocked = new Set<number>();
325
343
  private isSubstituting: boolean;
326
344
  private isExpandingMacros: boolean;
345
+ private isCheckingSteps: boolean;
346
+ private isPreVisiting: boolean;
347
+ private isReducingVars: boolean;
327
348
  // HACK: the hooks are read once, since a call through config at each site goes megamorphic in V8.
328
349
  private reduceAppHook: RewriterTpl["reduceApp"];
329
350
  private isFlatAssocHook: RewriterTpl["isFlatAssoc"];
@@ -337,6 +358,9 @@ class RewriterEngine extends SubstCore {
337
358
  super(manager);
338
359
  this.isSubstituting = config.getSubst !== RewriterTpl.prototype.getSubst;
339
360
  this.isExpandingMacros = config.getMacro !== RewriterTpl.prototype.getMacro;
361
+ this.isCheckingSteps = config.checkMaxSteps !== RewriterTpl.prototype.checkMaxSteps;
362
+ this.isPreVisiting = config.preVisit !== RewriterTpl.prototype.preVisit;
363
+ this.isReducingVars = config.reduceVar !== RewriterTpl.prototype.reduceVar;
340
364
  this.reduceAppHook = config.reduceApp;
341
365
  this.isFlatAssocHook = config.isFlatAssoc;
342
366
  this.getMacroHook = config.getMacro;
@@ -353,7 +377,16 @@ class RewriterEngine extends SubstCore {
353
377
  this.invShifter.reset();
354
378
  }
355
379
 
380
+ cleanup() {
381
+ this.cleanupCore();
382
+ this.bindings = [];
383
+ this.shifter.cleanup();
384
+ this.invShifter.cleanup();
385
+ this.shifts = [];
386
+ }
387
+
356
388
  release() {
389
+ this.setLastResult(-1);
357
390
  this.invShifter.release();
358
391
  this.shifter.release();
359
392
  this.releaseCaches();
@@ -374,6 +407,7 @@ class RewriterEngine extends SubstCore {
374
407
  if (!this.visit(expr, Infinity))
375
408
  while (this.numFrames > 0) {
376
409
  manager.limit.checkpoint();
410
+ if (this.isCheckingSteps) this.config.checkMaxSteps();
377
411
  const frame = this.frames[this.numFrames - 1];
378
412
  const curr = frame.curr;
379
413
  if (frame.childIndex === 0 && frame.state === PROCESS_CHILDREN && frame.isCaching) {
@@ -430,6 +464,10 @@ class RewriterEngine extends SubstCore {
430
464
  return true;
431
465
  }
432
466
  }
467
+ if (this.isPreVisiting && !this.config.preVisit(expr)) {
468
+ this.pushResult(expr);
469
+ return true;
470
+ }
433
471
  const kind = manager.kinds[expr];
434
472
  if (kind === KIND_VAR) {
435
473
  this.processVar(expr);
@@ -500,6 +538,13 @@ class RewriterEngine extends SubstCore {
500
538
 
501
539
  private processVar(variable: number) {
502
540
  const manager = this.manager;
541
+ const reduced = this.isReducingVars ? this.config.reduceVar(variable) : -1;
542
+ if (reduced !== -1) {
543
+ this.pushResult(reduced);
544
+ manager.decRef(reduced);
545
+ this.setNewChildFlag(variable, -1);
546
+ return;
547
+ }
503
548
  const index = manager.values[variable];
504
549
  const position = this.bindings.length - index - 1;
505
550
  const binding = index < this.bindings.length ? this.bindings[position] : -1;
@@ -676,19 +721,24 @@ class RewriterEngine extends SubstCore {
676
721
  this.numQvars += numDecls;
677
722
  }
678
723
  const isRewritingPatterns = this.config.isRewritingPatterns();
679
- const children = isRewritingPatterns ? [data.body, ...data.patterns] : [data.body];
724
+ const children = isRewritingPatterns
725
+ ? [data.body, ...data.patterns, ...data.noPatterns]
726
+ : [data.body];
680
727
  while (frame.childIndex < children.length) {
681
728
  const child = children[frame.childIndex];
682
729
  frame.childIndex++;
683
730
  if (!this.visit(child, frame.maxDepth)) return;
684
731
  }
685
732
  const body = this.resultStack[frame.spos];
686
- const patterns = isRewritingPatterns ? this.resultStack.slice(frame.spos + 1) : data.patterns;
733
+ const patterns = isRewritingPatterns
734
+ ? this.resultStack.slice(frame.spos + 1, frame.spos + 1 + data.patterns.length)
735
+ : data.patterns;
687
736
  for (const pattern of patterns) manager.incRef(pattern);
688
737
  const reduced = this.config.reduceQuantifier(expr, body, patterns);
738
+ const noPatterns = isRewritingPatterns ? [] : data.noPatterns;
689
739
  if (reduced === -1)
690
740
  this.setLastResult(
691
- frame.hasNewChild ? manager.mkQuantifier({ ...data, body, patterns }) : expr,
741
+ frame.hasNewChild ? manager.mkQuantifier({ ...data, body, patterns, noPatterns }) : expr,
692
742
  );
693
743
  else {
694
744
  this.setLastResult(reduced);
@@ -727,10 +777,17 @@ export class RewriterTpl {
727
777
  return undefined;
728
778
  }
729
779
 
780
+ preVisit(_expr: number) {
781
+ return true;
782
+ }
783
+
730
784
  reduceApp(_decl: number, _args: number[], _sort: number): number | Rewrite {
731
785
  return -1;
732
786
  }
733
787
 
788
+ // check_max_steps: Z3 asks the config at each step, which may count a step of the resource limit.
789
+ checkMaxSteps() {}
790
+
734
791
  getMacro(_decl: number) {
735
792
  return -1;
736
793
  }
@@ -743,6 +800,10 @@ export class RewriterTpl {
743
800
  return -1;
744
801
  }
745
802
 
803
+ reduceVar(_variable: number) {
804
+ return -1;
805
+ }
806
+
746
807
  mkNested(): RewriterTpl {
747
808
  return new RewriterTpl(this.manager);
748
809
  }
@@ -751,6 +812,10 @@ export class RewriterTpl {
751
812
  this.engine.reset();
752
813
  }
753
814
 
815
+ cleanup() {
816
+ this.engine.cleanup();
817
+ }
818
+
754
819
  release() {
755
820
  this.engine.release();
756
821
  }
@@ -792,6 +857,7 @@ export class BetaReducer extends SubstCore {
792
857
  }
793
858
 
794
859
  release() {
860
+ this.setLastResult(-1);
795
861
  this.shifter.release();
796
862
  this.releaseCaches();
797
863
  }
@@ -986,18 +1052,19 @@ export class BetaReducer extends SubstCore {
986
1052
  }
987
1053
  this.numQvars += numDecls;
988
1054
  }
989
- while (this.frameChildIndexes[top] <= data.patterns.length) {
1055
+ const children = [data.body, ...data.patterns, ...data.noPatterns];
1056
+ while (this.frameChildIndexes[top] < children.length) {
990
1057
  const childIndex = this.frameChildIndexes[top];
991
1058
  this.frameChildIndexes[top] = childIndex + 1;
992
- if (!this.visit(childIndex === 0 ? data.body : data.patterns[childIndex - 1])) return;
1059
+ if (!this.visit(children[childIndex])) return;
993
1060
  }
994
1061
  const spos = this.frameStarts[top];
995
1062
  const body = this.resultStack[spos];
996
- const patterns = this.resultStack.slice(spos + 1);
1063
+ const patterns = this.resultStack.slice(spos + 1, spos + 1 + data.patterns.length);
997
1064
  for (const pattern of patterns) manager.incRef(pattern);
998
1065
  this.setLastResult(
999
1066
  this.frameFlags[top] & FRAME_NEW_CHILD
1000
- ? manager.mkQuantifier({ ...data, body, patterns })
1067
+ ? manager.mkQuantifier({ ...data, body, patterns, noPatterns: [] })
1001
1068
  : expr,
1002
1069
  );
1003
1070
  const result = this.lastResult;