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

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