tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479

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