tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545

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 (538) 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 +58 -54
  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 +45 -44
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +43 -40
  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 +336 -88
  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/dependencies.ts +23 -2
  36. package/src/dfid.ts +9 -2
  37. package/src/environment.ts +27 -5
  38. package/src/errors.ts +30 -3
  39. package/src/evaluate.ts +9 -3
  40. package/src/exit-codes.ts +5 -2
  41. package/src/instances.ts +1 -1
  42. package/src/levels.ts +3 -2
  43. package/src/lexer.ts +5 -3
  44. package/src/liveness-checker.ts +572 -204
  45. package/src/liveness.ts +47 -32
  46. package/src/obligations/action.ts +10 -6
  47. package/src/obligations/anonymize.ts +33 -14
  48. package/src/obligations/enabled-axioms.ts +218 -0
  49. package/src/obligations/equality.ts +1 -3
  50. package/src/obligations/expression.ts +18 -6
  51. package/src/obligations/format.ts +0 -2
  52. package/src/obligations/generate.ts +22 -17
  53. package/src/obligations/index.ts +36 -6
  54. package/src/obligations/levels.ts +24 -11
  55. package/src/obligations/module.ts +1 -3
  56. package/src/obligations/normalize.ts +24 -13
  57. package/src/obligations/operators.ts +0 -2
  58. package/src/obligations/pragma.ts +53 -16
  59. package/src/obligations/printer.ts +43 -13
  60. package/src/obligations/proof.ts +3 -2
  61. package/src/obligations/regroup.ts +0 -2
  62. package/src/obligations/simplify.ts +17 -7
  63. package/src/obligations/source.ts +71 -17
  64. package/src/obligations/subexpression.ts +45 -18
  65. package/src/obligations/substitution.ts +1 -3
  66. package/src/obligations/temporal.ts +0 -2
  67. package/src/obligations/tuples.ts +0 -2
  68. package/src/parallel-worker.ts +8 -2
  69. package/src/parallel.ts +7 -2
  70. package/src/parser.ts +633 -186
  71. package/src/pretty-print.ts +1 -1
  72. package/src/prover/deciders.ts +11 -8
  73. package/src/prover/isabelle/decide.ts +3 -25
  74. package/src/prover/isabelle/encode.ts +71 -41
  75. package/src/prover/isabelle/isar/attrib.ts +250 -0
  76. package/src/prover/isabelle/isar/context.ts +335 -0
  77. package/src/prover/isabelle/isar/induct.ts +382 -0
  78. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  79. package/src/prover/isabelle/isar/method.ts +506 -198
  80. package/src/prover/isabelle/isar/proof.ts +570 -14
  81. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  82. package/src/prover/isabelle/isar/theory.ts +479 -69
  83. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  84. package/src/prover/isabelle/isar/type-check.ts +83 -8
  85. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  91. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  92. package/src/prover/isabelle/provers/classical.ts +45 -20
  93. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  94. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  95. package/src/prover/isabelle/pure/consts.ts +0 -2
  96. package/src/prover/isabelle/pure/conv.ts +0 -2
  97. package/src/prover/isabelle/pure/drule.ts +63 -4
  98. package/src/prover/isabelle/pure/envir.ts +0 -2
  99. package/src/prover/isabelle/pure/goal.ts +1 -3
  100. package/src/prover/isabelle/pure/logic.ts +0 -2
  101. package/src/prover/isabelle/pure/name.ts +0 -2
  102. package/src/prover/isabelle/pure/net.ts +0 -2
  103. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  104. package/src/prover/isabelle/pure/pattern.ts +0 -2
  105. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  106. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  107. package/src/prover/isabelle/pure/search.ts +0 -2
  108. package/src/prover/isabelle/pure/seq.ts +0 -2
  109. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  110. package/src/prover/isabelle/pure/table.ts +0 -2
  111. package/src/prover/isabelle/pure/tactic.ts +0 -2
  112. package/src/prover/isabelle/pure/tactical.ts +0 -2
  113. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  114. package/src/prover/isabelle/pure/term.ts +0 -2
  115. package/src/prover/isabelle/pure/thm.ts +0 -2
  116. package/src/prover/isabelle/pure/type.ts +0 -2
  117. package/src/prover/isabelle/pure/unify.ts +0 -2
  118. package/src/prover/isabelle/pure/variable.ts +0 -2
  119. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  120. package/src/prover/isabelle/tla/context.ts +51 -9
  121. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  122. package/src/prover/isabelle/tla/logic.ts +40 -1
  123. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  124. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  125. package/src/prover/ocaml.ts +4 -1
  126. package/src/prover/prep/action.ts +19 -12
  127. package/src/prover/prep/enabled-axioms.ts +11 -2
  128. package/src/prover/prep/methods.ts +159 -50
  129. package/src/prover/prep/normalize.ts +38 -9
  130. package/src/prover/prove.ts +343 -65
  131. package/src/prover/ptl/decide.ts +95 -50
  132. package/src/prover/ptl/encode.ts +2 -3
  133. package/src/prover/ptl/tableau.ts +28 -2
  134. package/src/prover/smt/arithmetic.ts +310 -0
  135. package/src/prover/smt/axioms.ts +12 -8
  136. package/src/prover/smt/context.ts +42 -6
  137. package/src/prover/smt/data.ts +191 -84
  138. package/src/prover/smt/encode.ts +122 -43
  139. package/src/prover/smt/extensionality.ts +5 -3
  140. package/src/prover/smt/flatten.ts +4 -6
  141. package/src/prover/smt/format.ts +28 -4
  142. package/src/prover/smt/instances.ts +7 -1
  143. package/src/prover/smt/layout.ts +91 -0
  144. package/src/prover/smt/rewrite.ts +483 -116
  145. package/src/prover/smt/simplify.ts +441 -0
  146. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  147. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  148. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  149. package/src/prover/smt/solver/act-cache.ts +0 -1
  150. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  151. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  152. package/src/prover/smt/solver/aig.ts +889 -0
  153. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  154. package/src/prover/smt/solver/arith-terms.ts +121 -0
  155. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  156. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  157. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  158. package/src/prover/smt/solver/ast-lt.ts +165 -11
  159. package/src/prover/smt/solver/ast-util.ts +160 -2
  160. package/src/prover/smt/solver/ast.ts +1448 -41
  161. package/src/prover/smt/solver/auf-solver.ts +0 -1
  162. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  163. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  164. package/src/prover/smt/solver/bound-manager.ts +196 -0
  165. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  166. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  167. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  168. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  169. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  170. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  171. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  172. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  173. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  174. package/src/prover/smt/solver/card2bv.ts +109 -0
  175. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  176. package/src/prover/smt/solver/cg-table.ts +39 -25
  177. package/src/prover/smt/solver/check-logic.ts +330 -0
  178. package/src/prover/smt/solver/clause.ts +0 -1
  179. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  180. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  181. package/src/prover/smt/solver/context.ts +533 -114
  182. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  183. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  184. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  185. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  186. package/src/prover/smt/solver/demodulator.ts +786 -0
  187. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  188. package/src/prover/smt/solver/der.ts +38 -10
  189. package/src/prover/smt/solver/diff-neq.ts +205 -0
  190. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  191. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  192. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  193. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  194. package/src/prover/smt/solver/e-matching.ts +6 -7
  195. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  196. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  197. package/src/prover/smt/solver/enode.ts +100 -3
  198. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  199. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  200. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  201. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  202. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  203. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  204. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  205. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  206. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  207. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  208. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  209. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  210. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  211. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  212. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  213. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  214. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  215. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  216. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  217. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  218. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  219. package/src/prover/smt/solver/expr-ref.ts +0 -1
  220. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  221. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  222. package/src/prover/smt/solver/factor.ts +163 -0
  223. package/src/prover/smt/solver/fd-solver.ts +267 -0
  224. package/src/prover/smt/solver/fingerprints.ts +15 -15
  225. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  226. package/src/prover/smt/solver/flat-literals.ts +0 -1
  227. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  228. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  229. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  230. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  231. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  232. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  233. package/src/prover/smt/solver/goal.ts +177 -15
  234. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  235. package/src/prover/smt/solver/guard-set.ts +219 -0
  236. package/src/prover/smt/solver/hash.ts +0 -1
  237. package/src/prover/smt/solver/hashtable.ts +30 -16
  238. package/src/prover/smt/solver/inf-eps.ts +63 -0
  239. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  240. package/src/prover/smt/solver/internalizer.ts +109 -36
  241. package/src/prover/smt/solver/lackr.ts +381 -0
  242. package/src/prover/smt/solver/lbool.ts +0 -1
  243. package/src/prover/smt/solver/lia2card.ts +268 -0
  244. package/src/prover/smt/solver/lia2pb.ts +154 -0
  245. package/src/prover/smt/solver/literal.ts +0 -1
  246. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  247. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  248. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  249. package/src/prover/smt/solver/lp/containers.ts +7 -2
  250. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  251. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  252. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  253. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  254. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  255. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  256. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  257. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  259. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  260. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  261. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  262. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  263. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  264. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  265. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  266. package/src/prover/smt/solver/lp/nex.ts +2 -2
  267. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  268. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  269. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  270. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  271. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  272. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  274. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  278. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  281. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  282. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  283. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  284. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  286. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  287. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  288. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  289. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  290. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  291. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  292. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  293. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  294. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  295. package/src/prover/smt/solver/macro-finder.ts +530 -0
  296. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  297. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  298. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  299. package/src/prover/smt/solver/max-cliques.ts +105 -0
  300. package/src/prover/smt/solver/maxcore.ts +309 -0
  301. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  302. package/src/prover/smt/solver/maxlex.ts +115 -0
  303. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  304. package/src/prover/smt/solver/maxsmt.ts +92 -0
  305. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  306. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  307. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  308. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  309. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  310. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  311. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  312. package/src/prover/smt/solver/model-checker.ts +17 -26
  313. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  314. package/src/prover/smt/solver/model-finder.ts +0 -1
  315. package/src/prover/smt/solver/model-generator.ts +59 -30
  316. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  317. package/src/prover/smt/solver/model-printer.ts +214 -0
  318. package/src/prover/smt/solver/mpf.ts +709 -0
  319. package/src/prover/smt/solver/mus.ts +50 -0
  320. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  321. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  322. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  323. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  324. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  325. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  326. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  327. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  328. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  329. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  330. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  331. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  332. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  333. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  334. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  335. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  336. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  337. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  338. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  339. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  340. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  341. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  342. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  343. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  344. package/src/prover/smt/solver/nlqsat.ts +484 -0
  345. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  346. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  347. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  348. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  349. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  350. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  351. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  352. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  353. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  354. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  355. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  356. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  357. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  358. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  359. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  360. package/src/prover/smt/solver/nnf.ts +105 -23
  361. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  362. package/src/prover/smt/solver/occf.ts +97 -0
  363. package/src/prover/smt/solver/opt-context.ts +792 -0
  364. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  365. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  366. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  367. package/src/prover/smt/solver/opt-solver.ts +311 -0
  368. package/src/prover/smt/solver/opt-value.ts +55 -0
  369. package/src/prover/smt/solver/optsmt.ts +692 -0
  370. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  371. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  372. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  373. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  374. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  375. package/src/prover/smt/solver/probes.ts +511 -0
  376. package/src/prover/smt/solver/propagate-values.ts +37 -21
  377. package/src/prover/smt/solver/proto-model.ts +650 -17
  378. package/src/prover/smt/solver/pull-quant.ts +28 -12
  379. package/src/prover/smt/solver/purify-arith.ts +632 -0
  380. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  381. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  382. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  383. package/src/prover/smt/solver/qe-lite.ts +37 -17
  384. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  385. package/src/prover/smt/solver/qe.ts +1499 -0
  386. package/src/prover/smt/solver/qel.ts +25 -0
  387. package/src/prover/smt/solver/qi-queue.ts +0 -1
  388. package/src/prover/smt/solver/qsat.ts +814 -0
  389. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  390. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  391. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  392. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  393. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  394. package/src/prover/smt/solver/random-gen.ts +0 -1
  395. package/src/prover/smt/solver/rational.ts +45 -1
  396. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  397. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  398. package/src/prover/smt/solver/reduce-args.ts +225 -0
  399. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  400. package/src/prover/smt/solver/ref-vector.ts +0 -1
  401. package/src/prover/smt/solver/relevancy.ts +1 -2
  402. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  403. package/src/prover/smt/solver/rewriter.ts +475 -36
  404. package/src/prover/smt/solver/rlimit.ts +38 -2
  405. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  406. package/src/prover/smt/solver/sat/big.ts +177 -0
  407. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  408. package/src/prover/smt/solver/sat/clause.ts +203 -0
  409. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  410. package/src/prover/smt/solver/sat/config.ts +122 -0
  411. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  412. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  413. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  414. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  415. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  416. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  417. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  418. package/src/prover/smt/solver/sat/probing.ts +170 -0
  419. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  420. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  421. package/src/prover/smt/solver/sat/scc.ts +142 -0
  422. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  423. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  424. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  425. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  426. package/src/prover/smt/solver/search-tree.ts +284 -0
  427. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  428. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  429. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  430. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  431. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  432. package/src/prover/smt/solver/seq-factory.ts +89 -0
  433. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  434. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  435. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  436. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  437. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  438. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  439. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  440. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  441. package/src/prover/smt/solver/seq-subset.ts +165 -0
  442. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  443. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  444. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  445. package/src/prover/smt/solver/smt-logics.ts +66 -0
  446. package/src/prover/smt/solver/smt-setup.ts +496 -0
  447. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  448. package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
  449. package/src/prover/smt/solver/smtlib-script.ts +1702 -0
  450. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  451. package/src/prover/smt/solver/solver.ts +113 -22
  452. package/src/prover/smt/solver/static-features.ts +314 -0
  453. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  454. package/src/prover/smt/solver/tactic.ts +1995 -0
  455. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  456. package/src/prover/smt/solver/theory-array.ts +1240 -0
  457. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  458. package/src/prover/smt/solver/theory-char.ts +355 -0
  459. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  460. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  461. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  462. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  463. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  464. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  465. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  466. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  467. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  468. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  469. package/src/prover/smt/solver/theory-lra.ts +188 -2
  470. package/src/prover/smt/solver/theory-pb.ts +933 -0
  471. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  472. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  473. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  474. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  475. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  476. package/src/prover/smt/solver/theory-seq.ts +961 -0
  477. package/src/prover/smt/solver/theory.ts +189 -0
  478. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  479. package/src/prover/smt/solver/var-subst.ts +36 -14
  480. package/src/prover/smt/table.ts +3 -2
  481. package/src/prover/smt/types.ts +146 -0
  482. package/src/prover/tlapm/cache.ts +29 -8
  483. package/src/prover/tlapm-library.ts +3208 -0
  484. package/src/prover/verdict.ts +2 -0
  485. package/src/prover/zenon/decide.ts +10 -7
  486. package/src/prover/zenon/encode.ts +0 -2
  487. package/src/prover/zenon/eqrel.ts +0 -2
  488. package/src/prover/zenon/equality-rules.ts +24 -2
  489. package/src/prover/zenon/expr.ts +21 -2
  490. package/src/prover/zenon/index-table.ts +7 -4
  491. package/src/prover/zenon/isar-case.ts +1 -3
  492. package/src/prover/zenon/isar.ts +2 -4
  493. package/src/prover/zenon/llproof.ts +0 -2
  494. package/src/prover/zenon/mltoll.ts +0 -2
  495. package/src/prover/zenon/node.ts +20 -5
  496. package/src/prover/zenon/parse.ts +6 -2
  497. package/src/prover/zenon/phrase.ts +1 -3
  498. package/src/prover/zenon/proof.ts +0 -2
  499. package/src/prover/zenon/propositional-rules.ts +0 -2
  500. package/src/prover/zenon/rules.ts +2 -3
  501. package/src/prover/zenon/search.ts +7 -5
  502. package/src/prover/zenon/tla/functions.ts +0 -2
  503. package/src/prover/zenon/tla/llproof.ts +0 -2
  504. package/src/prover/zenon/tla/records.ts +0 -2
  505. package/src/prover/zenon/tla/rewrites.ts +0 -2
  506. package/src/prover/zenon/tla/sets.ts +7 -8
  507. package/src/prover/zenon/tla/terms.ts +0 -2
  508. package/src/prover/zenon/tla/tla.ts +0 -2
  509. package/src/resolve.ts +72 -36
  510. package/src/runtime.ts +6 -0
  511. package/src/sany/generation.ts +1 -13
  512. package/src/sany/generator-definitions.ts +1 -1
  513. package/src/sany/generator-expressions.ts +9 -17
  514. package/src/sany/generator-proofs.ts +1 -1
  515. package/src/sany/generator.ts +1 -1
  516. package/src/sany/levels.ts +0 -2
  517. package/src/sany/linter.ts +0 -2
  518. package/src/search.ts +198 -45
  519. package/src/simulate.ts +3 -0
  520. package/src/standard-definitions.ts +4 -0
  521. package/src/state-graph.ts +0 -2
  522. package/src/subexpressions.ts +4 -2
  523. package/src/successors.ts +1 -1
  524. package/src/symmetry.ts +2 -2
  525. package/src/tableau.ts +2 -2
  526. package/src/tlc/fingerprint.ts +81 -9
  527. package/src/tlc/jar-data.ts +12 -0
  528. package/src/tlc/order.ts +14 -3
  529. package/src/tlc/summary.ts +29 -14
  530. package/src/tlc/tlcext-operators.ts +61 -16
  531. package/src/tlc/trace-spec.ts +2 -3
  532. package/src/typed-tier.ts +6541 -0
  533. package/src/typescript/types.ts +2 -2
  534. package/src/values.ts +1 -1
  535. package/src/prover/isabelle/isar/statement.ts +0 -52
  536. package/src/prover/smt/solver/z3-license.txt +0 -10
  537. package/src/prover/tlaps-module.ts +0 -510
  538. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,196 @@
1
+ import {
2
+ type AstManager,
3
+ KIND_APP,
4
+ KIND_QUANTIFIER,
5
+ OP_AND,
6
+ OP_EQ,
7
+ OP_IMPLIES,
8
+ OP_ITE,
9
+ OP_OR,
10
+ SORT_BOOL,
11
+ QUANTIFIER_FORALL,
12
+ QUANTIFIER_LAMBDA,
13
+ } from "./ast";
14
+ import { isAppOf } from "./ast-util";
15
+ import { RefVector } from "./ref-vector";
16
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
17
+ import { ExprSafeReplace } from "./expr-safe-replace";
18
+ import { InvVarShifter } from "./rewriter-tpl";
19
+ import { VarSubst } from "./var-subst";
20
+
21
+ const Q_FORALL_POS = 0x10;
22
+ const Q_EXISTS_POS = 0x20;
23
+ const Q_NONE_POS = 0x40;
24
+ const Q_FORALL_NEG = 0x11;
25
+ const Q_EXISTS_NEG = 0x21;
26
+ const Q_NONE_NEG = 0x41;
27
+
28
+ interface QuantifierType {
29
+ value: number;
30
+ }
31
+
32
+ const negate = (type: QuantifierType) => {
33
+ type.value ^= 0x1;
34
+ return type;
35
+ };
36
+
37
+ const isCompatible = (type: number, isForall: boolean) =>
38
+ type === Q_FORALL_POS || type === Q_EXISTS_NEG
39
+ ? isForall
40
+ : type === Q_EXISTS_POS || type === Q_FORALL_NEG
41
+ ? !isForall
42
+ : true;
43
+
44
+ const setQuantifierType = (type: QuantifierType, isForall: boolean) => {
45
+ if (type.value === Q_NONE_POS) type.value = isForall ? Q_FORALL_POS : Q_EXISTS_POS;
46
+ else if (type.value === Q_NONE_NEG) type.value = isForall ? Q_EXISTS_NEG : Q_FORALL_NEG;
47
+ };
48
+
49
+ // Brings the quantifiers of one kind into prenex form, with fresh constants for their variables.
50
+ export class QuantifierHoister {
51
+ private rewriter: Rewriter;
52
+ private trail: RefVector;
53
+
54
+ constructor(private manager: AstManager) {
55
+ this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
56
+ this.trail = new RefVector(manager);
57
+ }
58
+
59
+ release() {
60
+ this.rewriter.release();
61
+ this.trail.reset();
62
+ }
63
+
64
+ // The result comes with a reference, which the caller releases.
65
+ pullQuantifier(isForall: boolean, formula: number, vars: RefVector) {
66
+ const result = this.pull(formula, { value: isForall ? Q_FORALL_POS : Q_EXISTS_POS }, vars);
67
+ this.manager.incRef(result);
68
+ this.trail.reset();
69
+ return result;
70
+ }
71
+
72
+ // The overload with sorts and names: the variables of the pulled quantifiers stay bound, numbered
73
+ // after the free ones, and their sorts and names go in front of those of the prefix. The result
74
+ // comes with a reference, which the caller releases.
75
+ pullQuantifierBound(isForall: boolean, formula: number, sorts: number[], names: string[]) {
76
+ const manager = this.manager;
77
+ let index = manager.freeVarBounds[formula];
78
+ let current = formula;
79
+ while (
80
+ manager.kinds[current] === KIND_QUANTIFIER &&
81
+ (manager.getQuantifier(current).kind === QUANTIFIER_FORALL) === isForall
82
+ ) {
83
+ const data = manager.getQuantifier(current);
84
+ index += data.sorts.length;
85
+ names.push(...data.names.map(String));
86
+ sorts.push(...data.sorts);
87
+ current = data.body;
88
+ }
89
+ if (!manager.hasQuantifierFlags[current]) {
90
+ manager.incRef(current);
91
+ return current;
92
+ }
93
+ const vars = new RefVector(manager);
94
+ const pulled = this.pullQuantifier(isForall, current, vars);
95
+ if (vars.size === 0) {
96
+ vars.reset();
97
+ return pulled;
98
+ }
99
+ const replace = new ExprSafeReplace(manager);
100
+ for (const variable of vars.items)
101
+ replace.insert(variable, manager.mkVar(index++, manager.sorts[variable]));
102
+ const result = replace.apply(pulled);
103
+ replace.release();
104
+ manager.decRef(pulled);
105
+ names.unshift(...vars.items.map((variable) => manager.getDeclName(variable)).reverse());
106
+ sorts.unshift(...vars.items.map((variable) => manager.sorts[variable]).reverse());
107
+ vars.reset();
108
+ return result;
109
+ }
110
+
111
+ private pin(expr: number) {
112
+ this.trail.push(expr);
113
+ return expr;
114
+ }
115
+
116
+ private pinOwned(expr: number) {
117
+ this.trail.pushOwned(expr);
118
+ return expr;
119
+ }
120
+
121
+ private extractQuantifier(quantifier: number, vars: RefVector) {
122
+ const manager = this.manager;
123
+ const data = manager.getQuantifier(quantifier);
124
+ const fresh = data.sorts.map((sort, index) =>
125
+ this.pin(manager.mkFreshConst(String(data.names[index]), sort)),
126
+ );
127
+ for (const expr of fresh) vars.push(expr);
128
+ const subst = new VarSubst(manager, true);
129
+ const substituted = this.pinOwned(subst.apply(data.body, fresh));
130
+ subst.release();
131
+ const shifter = new InvVarShifter(manager);
132
+ const result = this.pinOwned(shifter.shift(substituted, fresh.length));
133
+ shifter.release();
134
+ return result;
135
+ }
136
+
137
+ private pull(formula: number, type: QuantifierType, vars: RefVector): number {
138
+ const manager = this.manager;
139
+ if (!manager.hasQuantifierFlags[formula]) return formula;
140
+ const kind = manager.kinds[formula];
141
+ if (kind === KIND_QUANTIFIER) {
142
+ const data = manager.getQuantifier(formula);
143
+ if (data.kind === QUANTIFIER_LAMBDA) return formula;
144
+ if (!isCompatible(type.value, data.kind === QUANTIFIER_FORALL)) return formula;
145
+ setQuantifierType(type, data.kind === QUANTIFIER_FORALL);
146
+ return this.pull(this.extractQuantifier(formula, vars), type, vars);
147
+ }
148
+ if (kind !== KIND_APP) return formula;
149
+ const args = manager.getArgs(formula);
150
+ const mkNot = (expr: number) => this.pin(manager.mkNot(expr));
151
+ const mkOr = (first: number, second: number) => this.pin(manager.mkOr([first, second]));
152
+ if (isAppOf(manager, formula, OP_AND) || isAppOf(manager, formula, OP_OR)) {
153
+ const pulled = args.map((arg) => this.pull(arg, type, vars));
154
+ const isAnd = isAppOf(manager, formula, OP_AND);
155
+ return this.pinOwned(
156
+ manager.withTemporaries(() =>
157
+ isAnd ? this.rewriter.mkAnd(pulled) : this.rewriter.mkOr(pulled),
158
+ ),
159
+ );
160
+ }
161
+ if (manager.isNot(formula)) {
162
+ const pulled = this.pull(args[0], negate(type), vars);
163
+ negate(type);
164
+ return mkNot(pulled);
165
+ }
166
+ if (isAppOf(manager, formula, OP_IMPLIES)) {
167
+ const premise = this.pull(args[0], negate(type), vars);
168
+ negate(type);
169
+ const conclusion = this.pull(args[1], type, vars);
170
+ return this.pin(manager.mkApp(OP_IMPLIES, [premise, conclusion], SORT_BOOL));
171
+ }
172
+ if (isAppOf(manager, formula, OP_ITE)) {
173
+ const [condition, thenExpr, elseExpr] = args;
174
+ const pulledThen = this.pull(thenExpr, type, vars);
175
+ const pulledElse = this.pull(elseExpr, type, vars);
176
+ if (!manager.hasQuantifierFlags[condition])
177
+ return this.pin(
178
+ manager.mkApp(OP_ITE, [condition, pulledThen, pulledElse], manager.sorts[formula]),
179
+ );
180
+ const pulledCondition = this.pull(condition, type, vars);
181
+ const pulledNegated = this.pull(mkNot(condition), type, vars);
182
+ return this.pin(
183
+ manager.mkAnd([mkOr(pulledNegated, pulledThen), mkOr(pulledCondition, pulledElse)]),
184
+ );
185
+ }
186
+ if (isAppOf(manager, formula, OP_EQ) && manager.sorts[args[0]] === SORT_BOOL) {
187
+ const pulled1 = this.pull(args[0], type, vars);
188
+ const pulled2 = this.pull(args[1], type, vars);
189
+ const negated1 = this.pull(mkNot(args[0]), type, vars);
190
+ const negated2 = this.pull(mkNot(args[1]), type, vars);
191
+ return this.pin(manager.mkAnd([mkOr(negated1, pulled2), mkOr(negated2, pulled1)]));
192
+ }
193
+ // The formula has a quantifier, but out of reach.
194
+ return formula;
195
+ }
196
+ }
@@ -1,51 +1,36 @@
1
- // Ported from Z3 (src/tactic/smtlogics/quant_tactics.cpp, src/tactic/core/simplify_tactic.cpp), MIT license, see z3-license.txt.
2
- import { type AstManager, KIND_APP, KIND_QUANTIFIER } from "./ast";
1
+ // This strategy skips elim-uncnstr's elimination and the simplifier's local_ctx option, as they
2
+ // change almost none of tlapm's obligations.
3
+ import type { AstManager } from "./ast";
3
4
  import { ctxSimplify } from "./ctx-simplify";
5
+ import { collectUnconstrained, disableQuantified } from "./elim-uncnstr";
4
6
  import { Goal } from "./goal";
5
7
  import { propagateValues } from "./propagate-values";
6
8
  import { applyQeLite } from "./qe-lite";
7
- import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
9
+ import { Rewriter, type RewriterOptions, TACTIC_REWRITER_OPTIONS } from "./rewriter";
10
+ import { RefVector } from "./ref-vector";
8
11
  import { RewriterTpl } from "./rewriter-tpl";
9
12
 
10
- const simplify = (manager: AstManager, goal: Goal, isPullingCheapIte = false) => {
13
+ export const simplifyGoal = (manager: AstManager, goal: Goal, options: RewriterOptions) => {
14
+ goal.depth++;
11
15
  if (goal.isInconsistent) return;
12
- const rewriter = new Rewriter(manager, { ...TACTIC_REWRITER_OPTIONS, isPullingCheapIte });
16
+ const rewriter = new Rewriter(manager, options);
13
17
  const size = goal.forms.size;
14
18
  let rewritten = -1;
15
19
  for (let index = 0; index < size && !goal.isInconsistent; index++) {
16
20
  const result = rewriter.rewrite(goal.forms.items[index]);
17
21
  if (rewritten !== -1) manager.decRef(rewritten);
18
22
  rewritten = result;
19
- goal.update(index, rewritten);
23
+ goal.update(index, rewritten, goal.getDependency(index));
20
24
  }
21
25
  if (rewritten !== -1) manager.decRef(rewritten);
22
26
  goal.elimRedundancies();
23
27
  rewriter.release();
24
28
  };
25
29
 
26
- const hasUnconstrainedConst = (manager: AstManager, goal: Goal) => {
27
- const visited = new Set<number>();
28
- const consts: number[] = [];
29
- const repeated = new Set<number>();
30
- const todo = [...goal.forms.items];
31
- for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
32
- const isConst = manager.isUninterpretedConst(expr);
33
- if (visited.has(expr)) {
34
- if (isConst) repeated.add(expr);
35
- continue;
36
- }
37
- visited.add(expr);
38
- if (isConst) consts.push(expr);
39
- else if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
40
- else if (manager.kinds[expr] === KIND_QUANTIFIER) todo.push(manager.getQuantifier(expr).body);
41
- }
42
- return consts.some((expr) => !repeated.has(expr));
43
- };
44
-
45
30
  // Z3's elim_uncnstr rewriter runs twice over the formulas and counts its steps, though the elimination is not ported.
46
31
  const elimUncnstr = (manager: AstManager, goal: Goal) => {
47
- const isRewriting = hasUnconstrainedConst(manager, goal);
48
- pinQuantifierBodies(manager, goal);
32
+ const isRewriting = collectUnconstrained(manager, goal).size > 0;
33
+ disableQuantified(manager, goal, new RefVector(manager));
49
34
  if (!isRewriting) return;
50
35
  const rewriter = new RewriterTpl(manager);
51
36
  for (let round = 0; round < 2; round++) {
@@ -55,41 +40,16 @@ const elimUncnstr = (manager: AstManager, goal: Goal) => {
55
40
  rewriter.release();
56
41
  };
57
42
 
58
- const pinQuantifierBodies = (manager: AstManager, goal: Goal) => {
59
- const visited = new Set<number>();
60
- const disabled = new Set<number>();
61
- const disable = (body: number) => {
62
- if (disabled.has(body)) return;
63
- manager.incRef(body);
64
- const todo = [body];
65
- for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
66
- if (disabled.has(expr)) continue;
67
- disabled.add(expr);
68
- if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
69
- }
70
- };
71
- const todo = [...goal.forms.items];
72
- for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
73
- if (visited.has(expr)) continue;
74
- visited.add(expr);
75
- if (manager.kinds[expr] === KIND_QUANTIFIER) {
76
- const body = manager.getQuantifier(expr).body;
77
- disable(body);
78
- todo.push(body);
79
- } else if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
80
- }
81
- };
82
-
83
43
  export const applyUfniaTactic = (manager: AstManager, assertions: number[]) => {
84
44
  const goal = new Goal(manager);
85
45
  for (const assertion of assertions) goal.assert(assertion);
86
- simplify(manager, goal);
46
+ simplifyGoal(manager, goal, TACTIC_REWRITER_OPTIONS);
87
47
  const steps = [
88
48
  () => propagateValues(manager, goal),
89
- () => ctxSimplify(manager, goal),
90
- () => simplify(manager, goal, true),
49
+ () => ctxSimplify(manager, goal, 30, 5000000),
50
+ () => simplifyGoal(manager, goal, { ...TACTIC_REWRITER_OPTIONS, isPullingCheapIte: true }),
91
51
  () => elimUncnstr(manager, goal),
92
- () => simplify(manager, goal),
52
+ () => simplifyGoal(manager, goal, TACTIC_REWRITER_OPTIONS),
93
53
  () => applyQeLite(manager, goal),
94
54
  ];
95
55
  for (const step of steps) {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_model_finder.cpp, src/ast/macros/quantifier_macro_info.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  KIND_APP,
4
3
  KIND_VAR,
@@ -232,7 +231,7 @@ export class QuantifierAnalyzer {
232
231
 
233
232
  private isVarPlusGround(expr: number) {
234
233
  const manager = this.manager;
235
- if (manager.getOp(expr) !== OP_ADD || manager.isGround(expr)) return undefined;
234
+ if (manager.getOp(expr) !== OP_ADD || manager.isGroundApp(expr)) return undefined;
236
235
  const args: number[] = [];
237
236
  let variable: number | undefined;
238
237
  let isInverted = false;
@@ -247,7 +246,7 @@ export class QuantifierAnalyzer {
247
246
  isStopped = true;
248
247
  }
249
248
  const negated = this.manager.getTimesMinusOneArg(arg);
250
- if (this.manager.isGround(arg)) args.push(arg);
249
+ if (this.manager.isGroundApp(arg)) args.push(arg);
251
250
  else if (this.isVar(arg)) {
252
251
  if (variable !== undefined) return undefined;
253
252
  variable = arg;
@@ -267,12 +266,12 @@ export class QuantifierAnalyzer {
267
266
  }
268
267
 
269
268
  private isVarAndGround(lhs: number, rhs: number) {
270
- if (this.isVar(lhs) && this.manager.isGround(rhs))
269
+ if (this.isVar(lhs) && this.manager.isGroundApp(rhs))
271
270
  return { variable: lhs, term: rhs, isInverted: false };
272
- if (this.isVar(rhs) && this.manager.isGround(lhs))
271
+ if (this.isVar(rhs) && this.manager.isGroundApp(lhs))
273
272
  return { variable: rhs, term: lhs, isInverted: false };
274
273
  const left = this.isVarPlusGround(lhs);
275
- if (left !== undefined && this.manager.isGround(rhs))
274
+ if (left !== undefined && this.manager.isGroundApp(rhs))
276
275
  return {
277
276
  variable: left.variable,
278
277
  term: left.isInverted
@@ -281,7 +280,7 @@ export class QuantifierAnalyzer {
281
280
  isInverted: left.isInverted,
282
281
  };
283
282
  const right = this.isVarPlusGround(rhs);
284
- if (right !== undefined && this.manager.isGround(lhs))
283
+ if (right !== undefined && this.manager.isGroundApp(lhs))
285
284
  return {
286
285
  variable: right.variable,
287
286
  term: right.isInverted
@@ -337,7 +336,7 @@ export class QuantifierAnalyzer {
337
336
  }
338
337
 
339
338
  private visitFormula(expr: number, polarity: Polarity) {
340
- if (this.manager.isGround(expr)) return;
339
+ if (this.manager.isGroundApp(expr)) return;
341
340
  const cache = polarity === "pos" ? this.posCache : this.negCache;
342
341
  if (cache.has(expr)) return;
343
342
  this.ftodo.push([expr, polarity]);
@@ -345,7 +344,7 @@ export class QuantifierAnalyzer {
345
344
  }
346
345
 
347
346
  private visitTerm(expr: number) {
348
- if (this.manager.isGround(expr) || this.posCache.has(expr)) return;
347
+ if (this.manager.isGroundApp(expr) || this.posCache.has(expr)) return;
349
348
  this.ttodo.push(expr);
350
349
  this.posCache.add(expr);
351
350
  }
@@ -531,7 +530,7 @@ export class QuantifierAnalyzer {
531
530
  for (const literal of literals) {
532
531
  const isNegated = manager.isNot(literal);
533
532
  const atom = isNegated ? manager.getArg(literal, 0) : literal;
534
- if (!this.manager.isGround(atom)) this.processLiteral(atom, isNegated);
533
+ if (!this.manager.isGroundApp(atom)) this.processLiteral(atom, isNegated);
535
534
  }
536
535
  } else this.visitFormula(body, "pos");
537
536
  while (this.ftodo.length > 0 || this.ttodo.length > 0) {
@@ -1,15 +1,7 @@
1
- // Ported from Z3 (src/smt/smt_quantifier.cpp), MIT license, see z3-license.txt.
2
- import {
3
- CHECK_MODEL_RESTART,
4
- CHECK_MODEL_SAT,
5
- CHECK_MODEL_UNKNOWN,
6
- FC_CONTINUE,
7
- FC_DONE,
8
- type Context,
9
- } from "./context";
1
+ import { CHECK_MODEL_RESTART, CHECK_MODEL_SAT, CHECK_MODEL_UNKNOWN, type Context } from "./context";
2
+ import { FC_CONTINUE, FC_DONE } from "./theory";
10
3
  import { Mam } from "./e-matching";
11
4
  import type { Enode } from "./enode";
12
- import { FingerprintSet } from "./fingerprints";
13
5
  import { ModelChecker } from "./model-checker";
14
6
  import { ModelFinder } from "./model-finder";
15
7
  import type { ProtoModel } from "./proto-model";
@@ -29,23 +21,25 @@ export class DefaultQuantifierManager {
29
21
  private qiQueue: QiQueue;
30
22
  private mam: Mam;
31
23
  private lazyMam: Mam;
32
- private fingerprints: FingerprintSet;
33
24
  private isActive = false;
34
25
  private lazyMatchingIndex = 0;
35
26
  private mbqi: Mbqi | null = null;
36
27
 
37
- constructor(
38
- private context: Context,
39
- isMbqi: boolean,
40
- ) {
28
+ constructor(private context: Context) {
41
29
  this.qiQueue = new QiQueue(context);
42
- this.fingerprints = new FingerprintSet(context.manager);
43
30
  const onMatch = (quantifier: number, bindings: Enode[], maxGeneration: number) =>
44
31
  this.addInstance(quantifier, bindings, maxGeneration);
45
32
  this.mam = new Mam(context, onMatch);
46
33
  this.lazyMam = new Mam(context, onMatch);
47
- if (!isMbqi) return;
34
+ this.updateParams();
35
+ }
36
+
37
+ // As in Z3, smt.mbqi is read each time the model finder would run.
38
+ updateParams() {
39
+ const context = this.context;
40
+ if (!context.params.isMbqi || this.mbqi !== null) return;
48
41
  const finder = new ModelFinder(context);
42
+ for (let level = 0; level < context.scopeLevel; level++) finder.pushScope();
49
43
  this.mbqi = { finder, checker: new ModelChecker(context, finder, this) };
50
44
  }
51
45
 
@@ -56,7 +50,7 @@ export class DefaultQuantifierManager {
56
50
  add(quantifier: number, generation: number) {
57
51
  this.quantifiers.push(quantifier);
58
52
  this.generations.set(quantifier, generation);
59
- this.mbqi?.finder.registerQuantifier(quantifier);
53
+ if (this.context.params.isMbqi) this.mbqi?.finder.registerQuantifier(quantifier);
60
54
  }
61
55
 
62
56
  del(quantifier: number) {
@@ -64,6 +58,10 @@ export class DefaultQuantifierManager {
64
58
  this.generations.delete(quantifier);
65
59
  }
66
60
 
61
+ hasQuantifiers() {
62
+ return this.quantifiers.length > 0;
63
+ }
64
+
67
65
  getGeneration(quantifier: number) {
68
66
  return this.generations.get(quantifier) ?? 0;
69
67
  }
@@ -105,7 +103,6 @@ export class DefaultQuantifierManager {
105
103
  this.lazyMam.pushScope();
106
104
  this.mbqi?.finder.pushScope();
107
105
  this.qiQueue.push();
108
- this.fingerprints.push();
109
106
  }
110
107
 
111
108
  pop(numScopes: number) {
@@ -113,7 +110,6 @@ export class DefaultQuantifierManager {
113
110
  this.lazyMam.popScope(numScopes);
114
111
  this.mbqi?.finder.popScope(numScopes);
115
112
  this.qiQueue.pop(numScopes);
116
- this.fingerprints.pop(numScopes);
117
113
  }
118
114
 
119
115
  canPropagate() {
@@ -127,7 +123,11 @@ export class DefaultQuantifierManager {
127
123
 
128
124
  addInstance(quantifier: number, bindings: Enode[], maxGeneration: number) {
129
125
  const generation = Math.max(maxGeneration, this.getGeneration(quantifier));
130
- const roots = this.fingerprints.insert(quantifier, bindings);
126
+ const roots = this.context.fingerprints.insert(
127
+ quantifier,
128
+ this.context.manager.ids[quantifier],
129
+ bindings,
130
+ );
131
131
  if (roots !== null) this.qiQueue.insert(quantifier, roots, generation);
132
132
  }
133
133
 
@@ -153,20 +153,21 @@ export class DefaultQuantifierManager {
153
153
  }
154
154
 
155
155
  restartEh() {
156
+ if (!this.context.params.isMbqi) return;
156
157
  this.mbqi?.finder.restartEh();
157
158
  this.mbqi?.checker.restartEh();
158
159
  }
159
160
 
160
161
  isModelBased() {
161
- return this.mbqi !== null;
162
+ return this.context.params.isMbqi;
162
163
  }
163
164
 
164
165
  adjustModel(model: ProtoModel) {
165
- this.mbqi?.finder.fixModel(model);
166
+ if (this.context.params.isMbqi) this.mbqi?.finder.fixModel(model);
166
167
  }
167
168
 
168
169
  checkModel(model: ProtoModel, root2value: Map<Enode, number>) {
169
- const checker = this.mbqi?.checker;
170
+ const checker = this.context.params.isMbqi ? this.mbqi?.checker : undefined;
170
171
  if (this.quantifiers.length === 0) return CHECK_MODEL_SAT;
171
172
  if (checker === undefined) return CHECK_MODEL_UNKNOWN;
172
173
  if (checker.check(model, root2value)) return CHECK_MODEL_SAT;