tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.37a75eb5b

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 (574) 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 +57 -53
  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.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +43 -42
  15. package/dist/run.js +45 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +43 -40
  19. package/dist/transfer.js +42 -39
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -36
  24. package/src/bags.ts +47 -28
  25. package/src/builtins.ts +4 -13
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +476 -590
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/runtime-invariants.ts +20 -56
  31. package/src/cli/shared.ts +1 -1
  32. package/src/cli/tlapm.ts +433 -70
  33. package/src/cli/tlc-arguments.ts +224 -212
  34. package/src/cli/tlc-output.ts +686 -0
  35. package/src/cli/tlc-usage.ts +1 -2
  36. package/src/cli/tlc.ts +60 -708
  37. package/src/cli/xml-exporter.ts +23 -33
  38. package/src/codegen.ts +5 -10
  39. package/src/coverage.ts +3 -10
  40. package/src/dependencies.ts +30 -14
  41. package/src/dfid.ts +25 -18
  42. package/src/environment-config.ts +315 -0
  43. package/src/environment.ts +73 -338
  44. package/src/errors.ts +33 -5
  45. package/src/evaluate.ts +14 -7
  46. package/src/exit-codes.ts +3 -0
  47. package/src/fingerprints.ts +65 -1
  48. package/src/instances.ts +47 -10
  49. package/src/java-hash.ts +7 -0
  50. package/src/json.ts +4 -7
  51. package/src/levels.ts +42 -44
  52. package/src/lexer.ts +5 -3
  53. package/src/liveness-checker.ts +597 -240
  54. package/src/liveness.ts +94 -86
  55. package/src/obligations/action.ts +14 -17
  56. package/src/obligations/anonymize.ts +37 -16
  57. package/src/obligations/enabled-axioms.ts +218 -0
  58. package/src/obligations/equality.ts +1 -3
  59. package/src/obligations/expression.ts +36 -8
  60. package/src/obligations/format.ts +0 -2
  61. package/src/obligations/generate.ts +66 -54
  62. package/src/obligations/index.ts +38 -8
  63. package/src/obligations/levels.ts +24 -11
  64. package/src/obligations/module.ts +28 -41
  65. package/src/obligations/normalize.ts +26 -14
  66. package/src/obligations/operators.ts +0 -2
  67. package/src/obligations/pragma.ts +53 -16
  68. package/src/obligations/printer.ts +43 -13
  69. package/src/obligations/proof.ts +3 -2
  70. package/src/obligations/regroup.ts +0 -2
  71. package/src/obligations/simplify.ts +55 -50
  72. package/src/obligations/source.ts +118 -74
  73. package/src/obligations/subexpression.ts +45 -18
  74. package/src/obligations/substitution.ts +1 -3
  75. package/src/obligations/temporal.ts +5 -7
  76. package/src/obligations/tuples.ts +0 -2
  77. package/src/parallel-worker.ts +17 -31
  78. package/src/parallel.ts +29 -47
  79. package/src/parser.ts +652 -220
  80. package/src/pretty-print.ts +1 -1
  81. package/src/prover/decide-pool.ts +3 -3
  82. package/src/prover/deciders.ts +12 -9
  83. package/src/prover/isabelle/decide.ts +3 -25
  84. package/src/prover/isabelle/encode.ts +72 -42
  85. package/src/prover/isabelle/isar/attrib.ts +250 -0
  86. package/src/prover/isabelle/isar/context.ts +335 -0
  87. package/src/prover/isabelle/isar/induct.ts +382 -0
  88. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  89. package/src/prover/isabelle/isar/method.ts +509 -212
  90. package/src/prover/isabelle/isar/proof.ts +570 -14
  91. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  92. package/src/prover/isabelle/isar/theory.ts +487 -76
  93. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  94. package/src/prover/isabelle/isar/type-check.ts +89 -14
  95. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  96. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  97. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  98. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  99. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  101. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  102. package/src/prover/isabelle/provers/classical.ts +45 -20
  103. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  104. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  105. package/src/prover/isabelle/pure/consts.ts +0 -2
  106. package/src/prover/isabelle/pure/conv.ts +2 -10
  107. package/src/prover/isabelle/pure/drule.ts +72 -6
  108. package/src/prover/isabelle/pure/envir.ts +0 -2
  109. package/src/prover/isabelle/pure/goal.ts +1 -3
  110. package/src/prover/isabelle/pure/logic.ts +1 -3
  111. package/src/prover/isabelle/pure/name.ts +0 -2
  112. package/src/prover/isabelle/pure/net.ts +0 -2
  113. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  114. package/src/prover/isabelle/pure/pattern.ts +0 -2
  115. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  116. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  117. package/src/prover/isabelle/pure/search.ts +0 -2
  118. package/src/prover/isabelle/pure/seq.ts +0 -2
  119. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  120. package/src/prover/isabelle/pure/table.ts +2 -3
  121. package/src/prover/isabelle/pure/tactic.ts +0 -2
  122. package/src/prover/isabelle/pure/tactical.ts +42 -37
  123. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  124. package/src/prover/isabelle/pure/term.ts +0 -2
  125. package/src/prover/isabelle/pure/thm.ts +14 -13
  126. package/src/prover/isabelle/pure/type.ts +0 -2
  127. package/src/prover/isabelle/pure/unify.ts +0 -2
  128. package/src/prover/isabelle/pure/variable.ts +0 -2
  129. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  130. package/src/prover/isabelle/tla/context.ts +58 -11
  131. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  132. package/src/prover/isabelle/tla/logic.ts +49 -21
  133. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  134. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  135. package/src/prover/ocaml.ts +4 -1
  136. package/src/prover/prep/action.ts +30 -31
  137. package/src/prover/prep/enabled-axioms.ts +11 -2
  138. package/src/prover/prep/fingerprint.ts +2 -5
  139. package/src/prover/prep/methods.ts +181 -51
  140. package/src/prover/prep/normalize.ts +38 -9
  141. package/src/prover/prove.ts +395 -94
  142. package/src/prover/ptl/decide.ts +95 -50
  143. package/src/prover/ptl/encode.ts +2 -3
  144. package/src/prover/ptl/tableau.ts +28 -2
  145. package/src/prover/smt/arithmetic.ts +310 -0
  146. package/src/prover/smt/axioms.ts +12 -8
  147. package/src/prover/smt/context.ts +43 -8
  148. package/src/prover/smt/data.ts +498 -379
  149. package/src/prover/smt/encode.ts +148 -57
  150. package/src/prover/smt/extensionality.ts +5 -3
  151. package/src/prover/smt/flatten.ts +4 -6
  152. package/src/prover/smt/format.ts +28 -4
  153. package/src/prover/smt/instances.ts +7 -1
  154. package/src/prover/smt/layout.ts +91 -0
  155. package/src/prover/smt/rewrite.ts +1021 -618
  156. package/src/prover/smt/simplify.ts +441 -0
  157. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  158. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  159. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  160. package/src/prover/smt/solver/act-cache.ts +0 -1
  161. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  162. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  163. package/src/prover/smt/solver/aig.ts +889 -0
  164. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  165. package/src/prover/smt/solver/arith-terms.ts +121 -0
  166. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  167. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  168. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  169. package/src/prover/smt/solver/ast-lt.ts +166 -12
  170. package/src/prover/smt/solver/ast-util.ts +160 -2
  171. package/src/prover/smt/solver/ast.ts +1427 -41
  172. package/src/prover/smt/solver/auf-solver.ts +2 -6
  173. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  174. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  175. package/src/prover/smt/solver/bound-manager.ts +196 -0
  176. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  177. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  178. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  179. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  180. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  181. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  182. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  183. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  184. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  185. package/src/prover/smt/solver/card2bv.ts +110 -0
  186. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  187. package/src/prover/smt/solver/cg-table.ts +39 -25
  188. package/src/prover/smt/solver/check-logic.ts +330 -0
  189. package/src/prover/smt/solver/clause.ts +0 -1
  190. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  191. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  192. package/src/prover/smt/solver/context.ts +536 -117
  193. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  194. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  195. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  196. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  197. package/src/prover/smt/solver/demodulator.ts +786 -0
  198. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  199. package/src/prover/smt/solver/der.ts +38 -10
  200. package/src/prover/smt/solver/diff-neq.ts +206 -0
  201. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  202. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  203. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  204. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  205. package/src/prover/smt/solver/e-matching.ts +7 -8
  206. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  207. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  208. package/src/prover/smt/solver/enode.ts +100 -3
  209. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  210. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  211. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  212. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  213. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  214. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  215. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  216. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  217. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  218. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  219. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  220. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  221. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  222. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  223. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  224. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  225. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  226. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  227. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  228. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  229. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  230. package/src/prover/smt/solver/expr-ref.ts +0 -1
  231. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  232. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  233. package/src/prover/smt/solver/factor.ts +163 -0
  234. package/src/prover/smt/solver/fd-solver.ts +267 -0
  235. package/src/prover/smt/solver/fingerprints.ts +15 -15
  236. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  237. package/src/prover/smt/solver/flat-literals.ts +0 -1
  238. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  239. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  240. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  241. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  242. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  243. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  244. package/src/prover/smt/solver/goal.ts +177 -15
  245. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  246. package/src/prover/smt/solver/guard-set.ts +219 -0
  247. package/src/prover/smt/solver/hash.ts +0 -1
  248. package/src/prover/smt/solver/hashtable.ts +30 -16
  249. package/src/prover/smt/solver/inf-eps.ts +63 -0
  250. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  251. package/src/prover/smt/solver/internalizer.ts +110 -38
  252. package/src/prover/smt/solver/lackr.ts +381 -0
  253. package/src/prover/smt/solver/lbool.ts +0 -1
  254. package/src/prover/smt/solver/lia2card.ts +268 -0
  255. package/src/prover/smt/solver/lia2pb.ts +154 -0
  256. package/src/prover/smt/solver/literal.ts +0 -1
  257. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  258. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  259. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  260. package/src/prover/smt/solver/lp/containers.ts +7 -2
  261. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  262. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  263. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  264. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  265. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  266. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  267. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  268. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  269. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  270. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  271. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  272. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  273. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  274. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  275. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  276. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  277. package/src/prover/smt/solver/lp/nex.ts +2 -2
  278. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  280. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  281. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  282. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  283. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
  285. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  288. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  289. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  292. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  295. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  297. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  298. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  299. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  300. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  301. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  302. package/src/prover/smt/solver/lp/pdd.ts +725 -289
  303. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  304. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  305. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  306. package/src/prover/smt/solver/macro-finder.ts +530 -0
  307. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  308. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  309. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  310. package/src/prover/smt/solver/max-cliques.ts +105 -0
  311. package/src/prover/smt/solver/maxcore.ts +309 -0
  312. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  313. package/src/prover/smt/solver/maxlex.ts +115 -0
  314. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  315. package/src/prover/smt/solver/maxsmt.ts +92 -0
  316. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  317. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  318. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  319. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  320. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  321. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  322. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  323. package/src/prover/smt/solver/model-checker.ts +18 -27
  324. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  325. package/src/prover/smt/solver/model-finder.ts +12 -18
  326. package/src/prover/smt/solver/model-generator.ts +56 -29
  327. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  328. package/src/prover/smt/solver/model-printer.ts +214 -0
  329. package/src/prover/smt/solver/mpf.ts +711 -0
  330. package/src/prover/smt/solver/mus.ts +51 -0
  331. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  332. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  333. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  334. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  335. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  336. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  337. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  338. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  339. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  340. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  341. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  342. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  343. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  344. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  345. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  346. package/src/prover/smt/solver/muz/spacer-context.ts +1407 -0
  347. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  348. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  349. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  350. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  351. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  352. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  353. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  354. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  355. package/src/prover/smt/solver/nlqsat.ts +484 -0
  356. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -97
  357. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  358. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  359. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  360. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  361. package/src/prover/smt/solver/nlsat/levelwise.ts +464 -246
  362. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  363. package/src/prover/smt/solver/nlsat/polynomial.ts +2410 -683
  364. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  365. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  366. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  367. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  368. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  369. package/src/prover/smt/solver/nlsat/upolynomial.ts +40 -19
  370. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  371. package/src/prover/smt/solver/nnf.ts +105 -23
  372. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  373. package/src/prover/smt/solver/occf.ts +97 -0
  374. package/src/prover/smt/solver/opt-context.ts +792 -0
  375. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  376. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  377. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  378. package/src/prover/smt/solver/opt-solver.ts +311 -0
  379. package/src/prover/smt/solver/opt-value.ts +55 -0
  380. package/src/prover/smt/solver/optsmt.ts +692 -0
  381. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  382. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  383. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  384. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  385. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  386. package/src/prover/smt/solver/probes.ts +512 -0
  387. package/src/prover/smt/solver/propagate-values.ts +37 -21
  388. package/src/prover/smt/solver/proto-model.ts +648 -19
  389. package/src/prover/smt/solver/pull-quant.ts +28 -12
  390. package/src/prover/smt/solver/purify-arith.ts +632 -0
  391. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  392. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  393. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  394. package/src/prover/smt/solver/qe-lite.ts +37 -17
  395. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  396. package/src/prover/smt/solver/qe.ts +1498 -0
  397. package/src/prover/smt/solver/qel.ts +25 -0
  398. package/src/prover/smt/solver/qi-queue.ts +0 -1
  399. package/src/prover/smt/solver/qsat.ts +814 -0
  400. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  401. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  402. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  403. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  404. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  405. package/src/prover/smt/solver/random-gen.ts +0 -1
  406. package/src/prover/smt/solver/rational.ts +45 -1
  407. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  408. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  409. package/src/prover/smt/solver/reduce-args.ts +225 -0
  410. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  411. package/src/prover/smt/solver/ref-vector.ts +0 -1
  412. package/src/prover/smt/solver/relevancy.ts +1 -2
  413. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  414. package/src/prover/smt/solver/rewriter.ts +475 -36
  415. package/src/prover/smt/solver/rlimit.ts +38 -2
  416. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  417. package/src/prover/smt/solver/sat/big.ts +177 -0
  418. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  419. package/src/prover/smt/solver/sat/clause.ts +203 -0
  420. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  421. package/src/prover/smt/solver/sat/config.ts +122 -0
  422. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  423. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  424. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  425. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  426. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  427. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  428. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  429. package/src/prover/smt/solver/sat/probing.ts +170 -0
  430. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  431. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  432. package/src/prover/smt/solver/sat/scc.ts +142 -0
  433. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  434. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  435. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  436. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  437. package/src/prover/smt/solver/search-tree.ts +284 -0
  438. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  439. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  440. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  441. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  442. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  443. package/src/prover/smt/solver/seq-factory.ts +89 -0
  444. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  445. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  446. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  447. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  448. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  449. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  450. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  451. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  452. package/src/prover/smt/solver/seq-subset.ts +165 -0
  453. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  454. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  455. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  456. package/src/prover/smt/solver/smt-logics.ts +66 -0
  457. package/src/prover/smt/solver/smt-setup.ts +496 -0
  458. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  459. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  460. package/src/prover/smt/solver/smtlib-script.ts +1704 -0
  461. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  462. package/src/prover/smt/solver/solver.ts +113 -22
  463. package/src/prover/smt/solver/static-features.ts +314 -0
  464. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  465. package/src/prover/smt/solver/tactic.ts +1995 -0
  466. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  467. package/src/prover/smt/solver/theory-array.ts +1240 -0
  468. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  469. package/src/prover/smt/solver/theory-char.ts +355 -0
  470. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  471. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  472. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  473. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  474. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  475. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  476. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  477. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  478. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  479. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  480. package/src/prover/smt/solver/theory-lra.ts +188 -1
  481. package/src/prover/smt/solver/theory-pb.ts +934 -0
  482. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  483. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  484. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  485. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  486. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  487. package/src/prover/smt/solver/theory-seq.ts +961 -0
  488. package/src/prover/smt/solver/theory.ts +189 -0
  489. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  490. package/src/prover/smt/solver/var-subst.ts +36 -14
  491. package/src/prover/smt/table.ts +3 -2
  492. package/src/prover/smt/types.ts +146 -0
  493. package/src/prover/tlapm/cache.ts +50 -19
  494. package/src/prover/tlapm/tlapm.ts +15 -9
  495. package/src/prover/tlapm-library.ts +3208 -0
  496. package/src/prover/verdict.ts +9 -0
  497. package/src/prover/zenon/check/check.ts +1 -2
  498. package/src/prover/zenon/check/records.ts +1 -1
  499. package/src/prover/zenon/check/relations.ts +2 -1
  500. package/src/prover/zenon/check/rewrites.ts +2 -15
  501. package/src/prover/zenon/check/sets.ts +40 -58
  502. package/src/prover/zenon/check/terms.ts +1 -2
  503. package/src/prover/zenon/decide.ts +10 -7
  504. package/src/prover/zenon/encode.ts +0 -2
  505. package/src/prover/zenon/eqrel.ts +2 -2
  506. package/src/prover/zenon/equality-rules.ts +24 -2
  507. package/src/prover/zenon/expr.ts +28 -2
  508. package/src/prover/zenon/index-table.ts +11 -21
  509. package/src/prover/zenon/isar-case.ts +0 -2
  510. package/src/prover/zenon/isar.ts +35 -37
  511. package/src/prover/zenon/llproof.ts +2 -13
  512. package/src/prover/zenon/mltoll.ts +12 -30
  513. package/src/prover/zenon/node.ts +20 -5
  514. package/src/prover/zenon/parse.ts +9 -8
  515. package/src/prover/zenon/phrase.ts +0 -2
  516. package/src/prover/zenon/proof.ts +0 -2
  517. package/src/prover/zenon/propositional-rules.ts +0 -2
  518. package/src/prover/zenon/rules.ts +2 -3
  519. package/src/prover/zenon/search.ts +11 -19
  520. package/src/prover/zenon/tla/functions.ts +2 -4
  521. package/src/prover/zenon/tla/llproof.ts +9 -13
  522. package/src/prover/zenon/tla/records.ts +1 -8
  523. package/src/prover/zenon/tla/rewrites.ts +0 -2
  524. package/src/prover/zenon/tla/sets.ts +22 -22
  525. package/src/prover/zenon/tla/terms.ts +0 -2
  526. package/src/prover/zenon/tla/tla.ts +7 -8
  527. package/src/resolve.ts +127 -108
  528. package/src/runtime.ts +6 -0
  529. package/src/sany/generation.ts +382 -0
  530. package/src/sany/generator-def-entries.ts +210 -0
  531. package/src/sany/generator-definitions.ts +686 -0
  532. package/src/sany/generator-expressions.ts +1092 -0
  533. package/src/sany/generator-proofs.ts +662 -0
  534. package/src/sany/generator.ts +155 -2625
  535. package/src/sany/levels.ts +0 -2
  536. package/src/sany/lexer.ts +17 -16
  537. package/src/sany/linter.ts +0 -2
  538. package/src/sany/nodes.ts +6 -13
  539. package/src/sany/report.ts +3 -6
  540. package/src/sany/selectors.ts +35 -38
  541. package/src/sany/xml.ts +23 -55
  542. package/src/search.ts +243 -52
  543. package/src/simulate.ts +160 -133
  544. package/src/spec-description.ts +33 -48
  545. package/src/standard-definitions.ts +4 -0
  546. package/src/standard-modules.ts +16 -32
  547. package/src/state-graph.ts +2 -9
  548. package/src/subexpressions.ts +3 -1
  549. package/src/substitution-levels.ts +5 -4
  550. package/src/successors.ts +6 -8
  551. package/src/symmetry.ts +2 -2
  552. package/src/tableau.ts +2 -2
  553. package/src/tlc/fingerprint.ts +81 -9
  554. package/src/tlc/jar-data.ts +12 -0
  555. package/src/tlc/messages.ts +20 -15
  556. package/src/tlc/order.ts +16 -12
  557. package/src/tlc/random.ts +4 -4
  558. package/src/tlc/replay.ts +8 -15
  559. package/src/tlc/summary.ts +29 -14
  560. package/src/tlc/tlc-operators.ts +2 -3
  561. package/src/tlc/tlcext-operators.ts +61 -16
  562. package/src/tlc/trace-spec.ts +26 -47
  563. package/src/typed-tier.ts +6535 -0
  564. package/src/typescript/actions.ts +2 -4
  565. package/src/typescript/collections.ts +34 -20
  566. package/src/typescript/compile.ts +1 -3
  567. package/src/typescript/formula.ts +5 -3
  568. package/src/typescript/model.ts +4 -5
  569. package/src/typescript/steps.ts +20 -18
  570. package/src/values.ts +63 -158
  571. package/src/prover/isabelle/isar/statement.ts +0 -52
  572. package/src/prover/smt/solver/z3-license.txt +0 -10
  573. package/src/prover/tlaps-module.ts +0 -510
  574. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,814 @@
1
+ import { SmtInvariantError, SmtTacticError, SmtUnsupportedError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_BASIC,
5
+ KIND_APP,
6
+ KIND_QUANTIFIER,
7
+ KIND_VAR,
8
+ OP_DISTINCT,
9
+ OP_EQ,
10
+ SORT_BOOL,
11
+ QUANTIFIER_EXISTS,
12
+ QUANTIFIER_FORALL,
13
+ } from "./ast";
14
+ import { hasUninterpreted, isAppOf, pushNotOwned } from "./ast-util";
15
+ import { MBQI_MAX_ITERATIONS } from "./context";
16
+ import { extractVars, mkQuantifierOfConsts } from "./qe";
17
+ import type { Goal } from "./goal";
18
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
19
+ import type { ProtoModel } from "./proto-model";
20
+ import { Mbproj } from "./qe-mbp";
21
+ import { QuantifierHoister } from "./quant-hoist";
22
+ import { hasSubterm } from "./recfun-decl-plugin";
23
+ import { RefVector } from "./ref-vector";
24
+ import { SmtKernel } from "./smt-kernel";
25
+
26
+ export const NO_LEVEL = -1;
27
+
28
+ export interface MaxLevel {
29
+ ex: number;
30
+ fa: number;
31
+ }
32
+
33
+ const getMax = (first: number, second: number) =>
34
+ first === NO_LEVEL ? second : second === NO_LEVEL ? first : Math.max(first, second);
35
+
36
+ export const getMaxLevel = (level: MaxLevel) => getMax(level.ex, level.fa);
37
+
38
+ export const mkLevel = (): MaxLevel => ({ ex: NO_LEVEL, fa: NO_LEVEL });
39
+
40
+ export const mergeLevel = (level: MaxLevel, other: MaxLevel) => {
41
+ level.ex = getMax(level.ex, other.ex);
42
+ level.fa = getMax(level.fa, other.fa);
43
+ };
44
+
45
+ export const QSAT_QE = 0;
46
+ export const QSAT_QE_REC = 1;
47
+ export const QSAT_SAT = 2;
48
+
49
+ const hasQuantifiedUninterpreted = (manager: AstManager, expr: number) => {
50
+ const visited = new Set<number>();
51
+ const todo = [expr];
52
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
53
+ if (visited.has(current) || !manager.hasQuantifierFlags[current]) continue;
54
+ visited.add(current);
55
+ if (manager.kinds[current] === KIND_QUANTIFIER) {
56
+ const body = manager.getQuantifier(current).body;
57
+ if (hasUninterpreted(manager, body)) return true;
58
+ todo.push(body);
59
+ } else if (manager.kinds[current] === KIND_APP) manager.pushArgs(current, todo);
60
+ }
61
+ return false;
62
+ };
63
+
64
+ // pred_abs::get_free_vars: the uninterpreted constants of a formula.
65
+ export const getFreeVars = (manager: AstManager, formula: number, vars: RefVector) => {
66
+ const marked = new Set<number>();
67
+ const todo = [formula];
68
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
69
+ if (marked.has(current) || manager.kinds[current] === KIND_VAR) continue;
70
+ marked.add(current);
71
+ if (manager.kinds[current] === KIND_QUANTIFIER) {
72
+ todo.push(manager.getQuantifier(current).body);
73
+ continue;
74
+ }
75
+ if (manager.isUninterpretedConst(current)) vars.push(current);
76
+ manager.pushArgs(current, todo);
77
+ }
78
+ };
79
+
80
+ // The propositional abstraction: atoms become fresh predicates, each with a level.
81
+ class PredAbs {
82
+ private preds: number[][] = [];
83
+ readonly asms: RefVector;
84
+ private asmsLim: number[] = [];
85
+ readonly pred2Lit = new Map<number, number>();
86
+ private lit2Pred = new Map<number, number>();
87
+ readonly elevel = new Map<number, MaxLevel>();
88
+ private trail: RefVector;
89
+ // The declarations that the model converter hides.
90
+ readonly hidden: number[] = [];
91
+
92
+ constructor(private manager: AstManager) {
93
+ this.asms = new RefVector(manager);
94
+ this.trail = new RefVector(manager);
95
+ }
96
+
97
+ reset() {
98
+ this.trail.reset();
99
+ this.pred2Lit.clear();
100
+ this.lit2Pred.clear();
101
+ this.elevel.clear();
102
+ this.asms.reset();
103
+ this.asmsLim = [];
104
+ this.preds = [];
105
+ }
106
+
107
+ private pin(expr: number) {
108
+ this.trail.push(expr);
109
+ return expr;
110
+ }
111
+
112
+ computeLevel(expr: number) {
113
+ const manager = this.manager;
114
+ const todo = [expr];
115
+ while (todo.length > 0) {
116
+ const current = todo[todo.length - 1];
117
+ if (this.elevel.has(current)) {
118
+ todo.pop();
119
+ continue;
120
+ }
121
+ const level = mkLevel();
122
+ let hasNew = false;
123
+ for (const arg of manager.getArgs(current)) {
124
+ if (manager.kinds[arg] !== KIND_APP) throw new SmtTacticError("atom is non-ground");
125
+ const argLevel = this.elevel.get(arg);
126
+ if (argLevel !== undefined) mergeLevel(level, argLevel);
127
+ else {
128
+ todo.push(arg);
129
+ hasNew = true;
130
+ }
131
+ }
132
+ if (!hasNew) {
133
+ this.pin(current);
134
+ this.elevel.set(current, level);
135
+ todo.pop();
136
+ }
137
+ }
138
+ return this.elevel.get(expr) as MaxLevel;
139
+ }
140
+
141
+ addPred(pred: number, lit: number) {
142
+ this.pin(pred);
143
+ this.pin(lit);
144
+ this.pred2Lit.set(pred, lit);
145
+ if (!this.lit2Pred.has(lit)) this.lit2Pred.set(lit, pred);
146
+ }
147
+
148
+ push() {
149
+ this.asmsLim.push(this.asms.size);
150
+ }
151
+
152
+ pop(numScopes: number) {
153
+ const level = this.asmsLim.length - numScopes;
154
+ this.asms.shrink(this.asmsLim[level]);
155
+ this.asmsLim.length = level;
156
+ }
157
+
158
+ private insert(pred: number, level: MaxLevel) {
159
+ const max = getMaxLevel(level);
160
+ const index = max === NO_LEVEL ? 0 : max;
161
+ while (this.preds.length <= index) this.preds.push([]);
162
+ this.preds[index].push(pred);
163
+ }
164
+
165
+ getAssumptions(model: ProtoModel | undefined, asms: RefVector) {
166
+ const manager = this.manager;
167
+ const level = Math.min(this.asmsLim.length, this.preds.length);
168
+ if (model === undefined) {
169
+ for (const asm of this.asms.items) asms.push(asm);
170
+ return;
171
+ }
172
+ if (level === 0) return;
173
+ const isFalseIn = (pred: number) => {
174
+ const value = model.eval(pred, true);
175
+ const isFalse = manager.isFalse(value);
176
+ manager.decRef(value);
177
+ return isFalse;
178
+ };
179
+ for (let index = 0; index <= level - 1; index++)
180
+ for (const pred of this.preds[index]) {
181
+ const isFalse = isFalseIn(pred);
182
+ if (!manager.limit.inc()) return;
183
+ this.asms.push(isFalse ? this.pin(manager.mkNot(pred)) : pred);
184
+ }
185
+ for (const asm of this.asms.items) asms.push(asm);
186
+ for (let index = level + 1; index < this.preds.length; index += 2)
187
+ for (const pred of this.preds[index]) {
188
+ if (!manager.limit.inc()) return;
189
+ const predLevel = this.elevel.get(pred) as MaxLevel;
190
+ const isUsed =
191
+ (predLevel.fa === index && (predLevel.ex === NO_LEVEL || predLevel.ex < level)) ||
192
+ (predLevel.ex === index && (predLevel.fa === NO_LEVEL || predLevel.fa < level));
193
+ if (isUsed) asms.push(isFalseIn(pred) ? this.pin(manager.mkNot(pred)) : pred);
194
+ }
195
+ }
196
+
197
+ ensureExprLevel(variable: number, level: number) {
198
+ if (this.elevel.has(variable)) return;
199
+ this.pin(variable);
200
+ this.elevel.set(
201
+ variable,
202
+ level % 2 === 0 ? { ex: level, fa: NO_LEVEL } : { ex: NO_LEVEL, fa: level },
203
+ );
204
+ }
205
+
206
+ setExprLevel(expr: number, level: MaxLevel) {
207
+ this.pin(expr);
208
+ this.elevel.set(expr, level);
209
+ }
210
+
211
+ // Replaces the atoms of a quantifier-free formula by fresh predicates, with their definitions
212
+ // in defs.
213
+ abstractAtoms(formula: number, level: MaxLevel, defs: RefVector) {
214
+ const manager = this.manager;
215
+ const marked = new Set<number>();
216
+ const todo = [formula];
217
+ this.pin(formula);
218
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
219
+ if (marked.has(current)) continue;
220
+ marked.add(current);
221
+ const pred = this.lit2Pred.get(current);
222
+ if (pred !== undefined) {
223
+ mergeLevel(level, this.elevel.get(pred) as MaxLevel);
224
+ continue;
225
+ }
226
+ if (manager.isUninterpretedConst(current) && manager.sorts[current] === SORT_BOOL) {
227
+ const constLevel = this.elevel.get(current) as MaxLevel;
228
+ mergeLevel(level, constLevel);
229
+ if (!this.pred2Lit.has(current)) {
230
+ this.addPred(current, current);
231
+ this.insert(current, constLevel);
232
+ }
233
+ continue;
234
+ }
235
+ for (const arg of manager.getArgs(current)) if (!marked.has(arg)) todo.push(arg);
236
+ const isBoolOp =
237
+ manager.getFamily(current) === FAMILY_BASIC &&
238
+ (!isAppOf(manager, current, OP_EQ) ||
239
+ manager.sorts[manager.getArg(current, 0)] === SORT_BOOL) &&
240
+ (!isAppOf(manager, current, OP_DISTINCT) ||
241
+ manager.getNumArgs(current) === 0 ||
242
+ manager.sorts[manager.getArg(current, 0)] === SORT_BOOL);
243
+ if (!isBoolOp && manager.sorts[current] === SORT_BOOL) {
244
+ const fresh = this.freshBool("p");
245
+ const atomLevel = this.computeLevel(current);
246
+ this.addPred(fresh, current);
247
+ this.elevel.set(fresh, atomLevel);
248
+ defs.push(this.pin(manager.mkEq(fresh, current)));
249
+ this.insert(fresh, atomLevel);
250
+ mergeLevel(level, atomLevel);
251
+ }
252
+ }
253
+ }
254
+
255
+ freshBool(name: string) {
256
+ const manager = this.manager;
257
+ const result = this.pin(manager.mkFreshConst(name, SORT_BOOL));
258
+ this.hidden.push(manager.decls[result]);
259
+ return result;
260
+ }
261
+
262
+ // Replaces the atoms by their predicates, so that the SMT core works on the abstraction only.
263
+ mkAbstract(formula: number) {
264
+ return this.mkConcrete([formula], this.lit2Pred)[0];
265
+ }
266
+
267
+ private mkConcrete(fmls: readonly number[], map: Map<number, number>) {
268
+ const manager = this.manager;
269
+ const cache = new Map<number, number>();
270
+ const todo = [...fmls];
271
+ while (todo.length > 0) {
272
+ const current = todo[todo.length - 1];
273
+ if (cache.has(current)) {
274
+ todo.pop();
275
+ continue;
276
+ }
277
+ const mapped = map.get(current);
278
+ if (mapped !== undefined) {
279
+ cache.set(current, mapped);
280
+ todo.pop();
281
+ continue;
282
+ }
283
+ const args: number[] = [];
284
+ let isDifferent = false;
285
+ const size = manager.getNumArgs(current);
286
+ for (const arg of manager.getArgs(current)) {
287
+ const cached = cache.get(arg);
288
+ if (cached === undefined) todo.push(arg);
289
+ else {
290
+ args.push(cached);
291
+ isDifferent ||= cached !== arg;
292
+ }
293
+ }
294
+ if (args.length !== size) continue;
295
+ cache.set(
296
+ current,
297
+ isDifferent
298
+ ? this.pin(manager.mkApp(manager.decls[current], args, manager.sorts[current]))
299
+ : current,
300
+ );
301
+ todo.pop();
302
+ }
303
+ return fmls.map((formula) => cache.get(formula) as number);
304
+ }
305
+
306
+ pred2LitVector(fmls: RefVector) {
307
+ const concrete = this.mkConcrete(fmls.items, this.pred2Lit);
308
+ concrete.forEach((formula, index) => fmls.set(index, formula));
309
+ }
310
+ }
311
+
312
+ class Kernel {
313
+ private kernel: SmtKernel | undefined;
314
+ private lastAssert = -1;
315
+ private trail: RefVector;
316
+
317
+ constructor(private manager: AstManager) {
318
+ this.trail = new RefVector(manager);
319
+ }
320
+
321
+ init() {
322
+ this.kernel = new SmtKernel(this.manager, {
323
+ isMbqi: true,
324
+ mbqiMaxIterations: MBQI_MAX_ITERATIONS,
325
+ isFindingMacros: false,
326
+ relevancyLevel: 0,
327
+ });
328
+ this.lastAssert = -1;
329
+ this.trail.reset();
330
+ }
331
+
332
+ get solver() {
333
+ return this.kernel as SmtKernel;
334
+ }
335
+
336
+ assertExpr(expr: number) {
337
+ if (this.manager.isTrue(expr)) return;
338
+ this.trail.push(expr);
339
+ this.solver.assertExpr(expr);
340
+ }
341
+
342
+ assertBlockingFml(expr: number) {
343
+ const manager = this.manager;
344
+ if (manager.isTrue(expr)) return;
345
+ if (this.lastAssert !== -1 && expr === this.lastAssert && !manager.isFalse(expr))
346
+ throw new SmtInvariantError("qsat asserted the same blocking formula twice in a row");
347
+ this.lastAssert = expr;
348
+ this.trail.push(expr);
349
+ this.solver.assertExpr(expr);
350
+ }
351
+
352
+ getCore(core: RefVector) {
353
+ core.reset();
354
+ for (const expr of this.solver.context.unsatCore) core.push(expr);
355
+ }
356
+
357
+ reasonUnknown() {
358
+ return this.solver.context.getLastFailureMessage();
359
+ }
360
+
361
+ release() {
362
+ this.trail.reset();
363
+ this.kernel = undefined;
364
+ }
365
+ }
366
+
367
+ class Qsat {
368
+ private mbp: Mbproj;
369
+ private fa: Kernel;
370
+ private ex: Kernel;
371
+ private predAbs: PredAbs;
372
+ private answer: RefVector;
373
+ private asms: RefVector;
374
+ // The variables of the alternating prefixes, existential at even levels.
375
+ private vars: RefVector[] = [];
376
+ private level = 0;
377
+ private model: ProtoModel | undefined;
378
+ private modelSave: ProtoModel | undefined;
379
+ private avars: RefVector;
380
+ private freeVars: RefVector;
381
+ private trail: RefVector;
382
+
383
+ constructor(
384
+ private manager: AstManager,
385
+ private mode: number,
386
+ ) {
387
+ this.mbp = new Mbproj(manager);
388
+ this.fa = new Kernel(manager);
389
+ this.ex = new Kernel(manager);
390
+ this.predAbs = new PredAbs(manager);
391
+ this.answer = new RefVector(manager);
392
+ this.asms = new RefVector(manager);
393
+ this.avars = new RefVector(manager);
394
+ this.freeVars = new RefVector(manager);
395
+ this.trail = new RefVector(manager);
396
+ }
397
+
398
+ private pin(expr: number) {
399
+ this.trail.push(expr);
400
+ return expr;
401
+ }
402
+
403
+ private pinOwned(expr: number) {
404
+ this.trail.pushOwned(expr);
405
+ return expr;
406
+ }
407
+
408
+ private setModel(model: ProtoModel | undefined) {
409
+ model?.incRef();
410
+ this.model?.decRef();
411
+ this.model = model;
412
+ }
413
+
414
+ private setModelSave(model: ProtoModel | undefined) {
415
+ model?.incRef();
416
+ this.modelSave?.decRef();
417
+ this.modelSave = model;
418
+ }
419
+
420
+ // Checks alternating satisfiability, with existential even levels and universal odd ones.
421
+ private checkSat() {
422
+ const manager = this.manager;
423
+ for (;;) {
424
+ manager.limit.checkpoint();
425
+ const asms = new RefVector(manager);
426
+ try {
427
+ for (const asm of this.asms.items) asms.push(asm);
428
+ this.predAbs.getAssumptions(this.model, asms);
429
+ const kernel = this.getKernel(this.level).solver;
430
+ const result = kernel.check(asms.items);
431
+ if (result === L_TRUE) {
432
+ this.setModel(kernel.context.getModel());
433
+ if (this.level === 0) this.setModelSave(this.model);
434
+ this.push();
435
+ } else if (result === L_FALSE) {
436
+ if (this.level === 0) return L_FALSE;
437
+ if (this.level === 1 && this.mode === QSAT_SAT) return L_TRUE;
438
+ if (this.model === undefined) this.pop(1);
439
+ else if (this.level === 1) this.projectQe(asms);
440
+ else if (!this.project(asms)) return L_UNDEF;
441
+ } else return result;
442
+ } finally {
443
+ asms.reset();
444
+ }
445
+ }
446
+ }
447
+
448
+ private getKernel(level: number) {
449
+ return level % 2 === 0 ? this.ex : this.fa;
450
+ }
451
+
452
+ private push() {
453
+ this.level++;
454
+ this.predAbs.push();
455
+ }
456
+
457
+ private pop(numScopes: number) {
458
+ this.setModel(undefined);
459
+ this.predAbs.pop(numScopes);
460
+ this.level -= numScopes;
461
+ }
462
+
463
+ private clear() {
464
+ this.level = 0;
465
+ this.answer.reset();
466
+ this.asms.reset();
467
+ this.predAbs.reset();
468
+ for (const vars of this.vars) vars.reset();
469
+ this.vars = [];
470
+ this.setModel(undefined);
471
+ this.freeVars.reset();
472
+ this.fa.release();
473
+ this.ex.release();
474
+ }
475
+
476
+ private reset() {
477
+ this.clear();
478
+ this.fa.init();
479
+ this.ex.init();
480
+ }
481
+
482
+ release() {
483
+ this.clear();
484
+ this.setModelSave(undefined);
485
+ this.avars.reset();
486
+ this.trail.reset();
487
+ this.mbp.release();
488
+ }
489
+
490
+ // Brings the formula into a quantifier prefix form.
491
+ private hoist(formula: number) {
492
+ const manager = this.manager;
493
+ if (hasQuantifiedUninterpreted(manager, formula))
494
+ throw new SmtTacticError("formula contains uninterpreted functions");
495
+ if (manager.hasLabelFlags[formula]) throw new SmtUnsupportedError("labels under qsat");
496
+ const hoister = new QuantifierHoister(manager);
497
+ const freeVars = new RefVector(manager);
498
+ getFreeVars(manager, formula, freeVars);
499
+ this.vars.push(freeVars);
500
+ let result = formula;
501
+ let isForall = false;
502
+ const pullInto = (target: RefVector) => {
503
+ result = this.pinOwned(hoister.pullQuantifier(isForall, result, target));
504
+ };
505
+ try {
506
+ if (this.mode !== QSAT_SAT) {
507
+ isForall = true;
508
+ const vars = new RefVector(manager);
509
+ pullInto(vars);
510
+ this.vars.push(vars);
511
+ this.filterVars(vars);
512
+ } else {
513
+ const vars = new RefVector(manager);
514
+ pullInto(vars);
515
+ for (const innerVar of vars.items) freeVars.push(innerVar);
516
+ this.filterVars(vars);
517
+ vars.reset();
518
+ }
519
+ for (;;) {
520
+ isForall = !isForall;
521
+ const vars = new RefVector(manager);
522
+ pullInto(vars);
523
+ this.vars.push(vars);
524
+ this.filterVars(vars);
525
+ if (vars.size === 0) break;
526
+ }
527
+ } finally {
528
+ hoister.release();
529
+ }
530
+ this.initializeLevels();
531
+ return result;
532
+ }
533
+
534
+ private filterVars(vars: RefVector) {
535
+ const manager = this.manager;
536
+ for (const innerVar of vars.items) this.predAbs.hidden.push(manager.decls[innerVar]);
537
+ for (const innerVar of vars.items)
538
+ if (manager.isUninterpretedSort(manager.sorts[innerVar]))
539
+ throw new SmtTacticError("qsat does not apply to uninterpreted sorts");
540
+ }
541
+
542
+ private initializeLevels() {
543
+ for (const [index, vars] of this.vars.entries()) {
544
+ const level = index % 2 === 0 ? { ex: index, fa: NO_LEVEL } : { ex: NO_LEVEL, fa: index };
545
+ for (const innerVar of vars.items) this.predAbs.setExprLevel(innerVar, { ...level });
546
+ }
547
+ }
548
+
549
+ private getCore(core: RefVector, level: number) {
550
+ this.getKernel(level).getCore(core);
551
+ this.predAbs.pred2LitVector(core);
552
+ }
553
+
554
+ private addAssumption(formula: number) {
555
+ const manager = this.manager;
556
+ const fresh = this.predAbs.freshBool("b");
557
+ this.asms.push(fresh);
558
+ const eq = this.pin(manager.mkEq(fresh, formula));
559
+ this.ex.assertExpr(eq);
560
+ this.fa.assertExpr(eq);
561
+ this.predAbs.addPred(fresh, formula);
562
+ this.predAbs.setExprLevel(fresh, mkLevel());
563
+ }
564
+
565
+ private negateCore(core: RefVector) {
566
+ const manager = this.manager;
567
+ return this.pinOwned(pushNotOwned(manager, this.pin(manager.mkAnd(core.items))));
568
+ }
569
+
570
+ private projectQe(core: RefVector) {
571
+ const model = this.model as ProtoModel;
572
+ this.getCore(core, this.level);
573
+ this.getVars(this.level);
574
+ this.mbp.apply(this.mode !== QSAT_QE_REC, this.avars, model, core);
575
+ const formula = this.negateCore(core);
576
+ this.addAssumption(formula);
577
+ this.answer.push(formula);
578
+ for (const innerVar of this.avars.items) this.freeVars.push(innerVar);
579
+ this.pop(1);
580
+ }
581
+
582
+ private project(core: RefVector) {
583
+ const manager = this.manager;
584
+ const model = this.model as ProtoModel;
585
+ this.getCore(core, this.level);
586
+ this.getVars(this.level - 1);
587
+ this.mbp.apply(this.mode !== QSAT_QE_REC, this.avars, model, core);
588
+ for (const innerVar of this.avars.items) this.predAbs.ensureExprLevel(innerVar, this.level - 1);
589
+ for (const innerVar of this.avars.items) this.freeVars.push(innerVar);
590
+ let formula = this.negateCore(core);
591
+ const level = mkLevel();
592
+ const defs = new RefVector(manager);
593
+ this.predAbs.abstractAtoms(formula, level, defs);
594
+ const conjunction = this.pin(manager.mkAnd(defs.items));
595
+ this.ex.assertExpr(conjunction);
596
+ this.fa.assertExpr(conjunction);
597
+ defs.reset();
598
+ const max = getMaxLevel(level);
599
+ let numScopes = 0;
600
+ if (max === NO_LEVEL) numScopes = 2 * Math.floor(this.level / 2);
601
+ // This can happen.
602
+ else if (max + 2 > this.level) return false;
603
+ else {
604
+ numScopes = this.level - max;
605
+ if (numScopes % 2 !== 0) numScopes--;
606
+ }
607
+ this.pop(numScopes);
608
+ if (this.level === 0 && this.mode !== QSAT_SAT) this.addAssumption(formula);
609
+ else {
610
+ formula = this.predAbs.mkAbstract(formula);
611
+ this.getKernel(this.level).assertBlockingFml(formula);
612
+ }
613
+ return true;
614
+ }
615
+
616
+ private getVars(level: number) {
617
+ this.avars.reset();
618
+ for (const vars of this.vars.slice(level))
619
+ for (const innerVar of vars.items) this.avars.push(innerVar);
620
+ }
621
+
622
+ private elimRec(formula: number): number {
623
+ const manager = this.manager;
624
+ const visited = new Map<number, number>();
625
+ const todo = [formula];
626
+ while (todo.length > 0) {
627
+ manager.limit.checkpoint();
628
+ const expr = todo[todo.length - 1];
629
+ if (visited.has(expr)) {
630
+ todo.pop();
631
+ continue;
632
+ }
633
+ const kind = manager.kinds[expr];
634
+ if (kind === KIND_APP) {
635
+ const args: number[] = [];
636
+ let isAllVisited = true;
637
+ for (const arg of manager.getArgs(expr)) {
638
+ const result = visited.get(arg);
639
+ if (result !== undefined) args.push(result);
640
+ else {
641
+ todo.push(arg);
642
+ isAllVisited = false;
643
+ }
644
+ }
645
+ if (isAllVisited) {
646
+ todo.pop();
647
+ const isChanged = args.some((arg, index) => arg !== manager.getArg(expr, index));
648
+ visited.set(
649
+ expr,
650
+ isChanged
651
+ ? this.pin(manager.mkApp(manager.decls[expr], args, manager.sorts[expr]))
652
+ : expr,
653
+ );
654
+ }
655
+ continue;
656
+ }
657
+ if (kind !== KIND_QUANTIFIER) throw new SmtInvariantError("qsat met a free variable");
658
+ const data = manager.getQuantifier(expr);
659
+ const vars = new RefVector(manager);
660
+ let body = this.elimRec(this.pinOwned(extractVars(manager, expr, vars)));
661
+ if (data.kind === QUANTIFIER_FORALL) body = this.pinOwned(pushNotOwned(manager, body));
662
+ const eliminated = this.elim(vars, body);
663
+ vars.reset();
664
+ todo.pop();
665
+ if (eliminated === -1) {
666
+ visited.set(expr, expr);
667
+ continue;
668
+ }
669
+ visited.set(
670
+ expr,
671
+ data.kind === QUANTIFIER_FORALL
672
+ ? this.pinOwned(pushNotOwned(manager, eliminated))
673
+ : eliminated,
674
+ );
675
+ }
676
+ return visited.get(formula) as number;
677
+ }
678
+
679
+ // Solves exists vars . formula.
680
+ private elim(vars: RefVector, formula: number) {
681
+ const manager = this.manager;
682
+ if (manager.hasQuantifierFlags[formula]) return -1;
683
+ this.reset();
684
+ const exists = this.pin(
685
+ mkQuantifierOfConsts(
686
+ manager,
687
+ QUANTIFIER_EXISTS,
688
+ vars.items,
689
+ this.abstractVars(vars, formula),
690
+ 0,
691
+ ),
692
+ );
693
+ const hoisted = this.hoist(this.pinOwned(pushNotOwned(manager, exists)));
694
+ this.assertFormula(hoisted);
695
+ if (this.checkSat() !== L_FALSE) return -1;
696
+ let result = this.pin(manager.mkAnd(this.answer.items));
697
+ const freeVars = this.freeVars.items.filter((innerVar) =>
698
+ hasSubterm(manager, [result], (expr) => expr === innerVar),
699
+ );
700
+ if (freeVars.length > 0) {
701
+ const subVars = new RefVector(manager);
702
+ for (const innerVar of freeVars) subVars.push(innerVar);
703
+ result = this.pin(
704
+ mkQuantifierOfConsts(
705
+ manager,
706
+ QUANTIFIER_EXISTS,
707
+ freeVars,
708
+ this.abstractVars(subVars, result),
709
+ 0,
710
+ ),
711
+ );
712
+ subVars.reset();
713
+ }
714
+ return result;
715
+ }
716
+
717
+ // expr_abstract: (:var i) for the i-th constant from the end.
718
+ private abstractVars(vars: RefVector, formula: number) {
719
+ const manager = this.manager;
720
+ const subst = new Map<number, number>();
721
+ vars.items.forEach((innerVar, index) =>
722
+ subst.set(innerVar, this.pin(manager.mkVar(vars.size - 1 - index, manager.sorts[innerVar]))),
723
+ );
724
+ const cache = new Map<number, number>();
725
+ const visit = (expr: number): number => {
726
+ const cached = cache.get(expr);
727
+ if (cached !== undefined) return cached;
728
+ const replaced = subst.get(expr);
729
+ const result =
730
+ replaced !== undefined
731
+ ? replaced
732
+ : manager.kinds[expr] === KIND_APP && manager.getNumArgs(expr) > 0
733
+ ? this.pin(
734
+ manager.mkApp(
735
+ manager.decls[expr],
736
+ manager.getArgs(expr).map(visit),
737
+ manager.sorts[expr],
738
+ ),
739
+ )
740
+ : expr;
741
+ cache.set(expr, result);
742
+ return result;
743
+ };
744
+ return visit(formula);
745
+ }
746
+
747
+ private assertFormula(formula: number) {
748
+ const manager = this.manager;
749
+ if (!manager.isGroundApp(formula)) throw new SmtTacticError("formula is not hoistable");
750
+ const defs = new RefVector(manager);
751
+ this.predAbs.abstractAtoms(formula, mkLevel(), defs);
752
+ const abstracted = this.predAbs.mkAbstract(formula);
753
+ const conjunction = this.pin(manager.mkAnd(defs.items));
754
+ defs.reset();
755
+ this.ex.assertExpr(conjunction);
756
+ this.fa.assertExpr(conjunction);
757
+ this.ex.assertExpr(abstracted);
758
+ this.fa.assertExpr(this.pin(manager.mkNot(abstracted)));
759
+ }
760
+
761
+ apply(goal: Goal) {
762
+ const manager = this.manager;
763
+ let formula = this.pin(manager.mkAnd(goal.forms.items));
764
+ const mode = this.mode;
765
+ // qe and qe2 over a quantifier-free formula decide its satisfiability.
766
+ if ((mode === QSAT_QE || mode === QSAT_QE_REC) && !manager.hasQuantifierFlags[formula])
767
+ this.mode = QSAT_SAT;
768
+ try {
769
+ if (this.mode === QSAT_QE_REC) {
770
+ formula = this.elimRec(formula);
771
+ goal.reset();
772
+ goal.depth++;
773
+ goal.assert(formula);
774
+ return [goal];
775
+ }
776
+ this.reset();
777
+ if (this.mode !== QSAT_SAT) formula = this.pinOwned(pushNotOwned(manager, formula));
778
+ formula = this.hoist(formula);
779
+ this.assertFormula(formula);
780
+ const result = this.checkSat();
781
+ if (result === L_FALSE) {
782
+ goal.reset();
783
+ goal.depth++;
784
+ goal.assert(
785
+ this.mode === QSAT_QE ? this.pin(manager.mkAnd(this.answer.items)) : manager.falseExpr,
786
+ );
787
+ return [goal];
788
+ }
789
+ if (result === L_TRUE) {
790
+ goal.reset();
791
+ goal.depth++;
792
+ const model = this.modelSave as ProtoModel;
793
+ model.incRef();
794
+ goal.model = model;
795
+ for (const decl of this.predAbs.hidden) goal.addConverter(decl);
796
+ return [goal];
797
+ }
798
+ let reason = this.ex.reasonUnknown();
799
+ if (reason === "ok" || reason === "unknown") reason = this.fa.reasonUnknown();
800
+ throw new SmtTacticError(reason);
801
+ } finally {
802
+ this.mode = mode;
803
+ }
804
+ }
805
+ }
806
+
807
+ export const runQsat = (manager: AstManager, mode: number) => (goal: Goal) => {
808
+ const qsat = new Qsat(manager, mode);
809
+ try {
810
+ return qsat.apply(goal);
811
+ } finally {
812
+ qsat.release();
813
+ }
814
+ };