tla-ts 0.0.9 → 0.0.10-dev.094b9b512

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