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,480 @@
1
+ import { SmtCanceledError, SmtTacticError } from "../../../../errors";
2
+ import { type AstManager, OP_AND, OP_EQ, OP_IMPLIES, OP_NOT, OP_OR, SORT_BOOL } from "../ast";
3
+ import { mkNot } from "../ast-util";
4
+ import { BitBlasterRewriter } from "../bit-blast-tactic";
5
+ import { Goal, mkDependencyLeaf } from "../goal";
6
+ import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
7
+ import { ProtoModel } from "../proto-model";
8
+ import { RefVector } from "../ref-vector";
9
+ import {
10
+ DEFAULT_PRINT_OPTIONS,
11
+ formatSort,
12
+ getQuotedName,
13
+ mkSeq1,
14
+ mkSeq5,
15
+ mkText,
16
+ renderFormat,
17
+ } from "../smt2-printer";
18
+ import type { ThSolverFactory } from "../euf/euf-solver";
19
+ import {
20
+ applyDefinitions,
21
+ convertModel,
22
+ mkIncSatEufPreprocess,
23
+ mkIncSatPreprocess,
24
+ } from "../tactic";
25
+ import type { SatParams } from "./config";
26
+ import { Goal2Sat } from "./goal2sat";
27
+ import { getConsequences } from "./consequences";
28
+ import { isLiteral, Sat2GoalConverter, sat2goal } from "./sat2goal";
29
+ import { Solver } from "./solver";
30
+
31
+ const BIT_BLAST_PARAMS = {
32
+ isBlastingMul: true,
33
+ isBlastingAdd: true,
34
+ isBlastingQuant: false,
35
+ isBlastingFull: false,
36
+ };
37
+
38
+ interface Scope {
39
+ readonly converters: Goal["converters"];
40
+ readonly fmlsSize: number;
41
+ readonly fmlsHead: number;
42
+ readonly namesSize: number;
43
+ readonly hasUninterpreted: boolean;
44
+ }
45
+
46
+ export class IncSatSolver {
47
+ private readonly solver: Solver;
48
+ private readonly goal2sat: Goal2Sat;
49
+ private readonly fmls: RefVector;
50
+ private fmlsHead = 0;
51
+ private readonly names: RefVector;
52
+ private isCnf = true;
53
+ private readonly core: RefVector;
54
+ private dep2asm = new Map<number, number>();
55
+ private asms: number[] = [];
56
+ private bitBlaster: BitBlasterRewriter | undefined;
57
+ // m_mcs.back(), the model converters of the preprocessed goals.
58
+ private readonly converters: Goal;
59
+ private readonly satConverter: Sat2GoalConverter;
60
+ private isInternalizedConverted = false;
61
+ private readonly internalized: RefVector;
62
+ private hasUninterpreted = false;
63
+ private models: ProtoModel[] = [];
64
+ private subgoals: Goal[] = [];
65
+ private scopes: Scope[] = [];
66
+ reasonUnknown = "no reason given";
67
+ wasUnknown = false;
68
+
69
+ // A theory factory runs the solver in sat.euf mode, with the euf solver as its extension.
70
+ constructor(
71
+ private readonly manager: AstManager,
72
+ params: SatParams,
73
+ isIncremental = true,
74
+ mkThSolver: ThSolverFactory | null = null,
75
+ ) {
76
+ this.solver = new Solver(params, manager.limit, isIncremental);
77
+ this.goal2sat = new Goal2Sat(
78
+ manager,
79
+ this.solver,
80
+ params.get("ite_extra") !== false,
81
+ mkThSolver,
82
+ );
83
+ if (mkThSolver !== null) this.goal2sat.ensureEuf();
84
+ this.fmls = new RefVector(manager);
85
+ this.names = new RefVector(manager);
86
+ this.core = new RefVector(manager);
87
+ this.converters = new Goal(manager);
88
+ this.satConverter = new Sat2GoalConverter(manager);
89
+ this.internalized = new RefVector(manager);
90
+ }
91
+
92
+ private isClause(expr: number): boolean {
93
+ const manager = this.manager;
94
+ if (manager.depths[expr] > 4) return false;
95
+ if (isLiteral(manager, expr)) return true;
96
+ if (!manager.isApp(expr)) return false;
97
+ const op = manager.getOp(expr);
98
+ const isConnective =
99
+ op === OP_OR ||
100
+ op === OP_AND ||
101
+ op === OP_IMPLIES ||
102
+ op === OP_NOT ||
103
+ (op === OP_EQ && manager.isBool(manager.getArg(expr, 0)));
104
+ return isConnective && manager.getArgs(expr).every((arg) => this.isClause(arg));
105
+ }
106
+
107
+ assertExpr(expr: number) {
108
+ this.isCnf &&= this.isClause(expr);
109
+ this.fmls.push(expr);
110
+ }
111
+
112
+ assertNamed(expr: number, name: number) {
113
+ const manager = this.manager;
114
+ this.names.push(name);
115
+ if (this.isCnf && isLiteral(manager, expr) && isLiteral(manager, name))
116
+ return this.assertExpr(manager.mkApp(OP_OR, [mkNot(manager, name), expr], SORT_BOOL));
117
+ if (
118
+ this.isCnf &&
119
+ manager.getOp(expr) === OP_OR &&
120
+ this.isClause(expr) &&
121
+ isLiteral(manager, name)
122
+ )
123
+ return this.assertExpr(
124
+ manager.mkApp(OP_OR, [mkNot(manager, name), ...manager.getArgs(expr)], SORT_BOOL),
125
+ );
126
+ this.isCnf = false;
127
+ this.assertExpr(manager.mkApp(OP_IMPLIES, [name, expr], SORT_BOOL));
128
+ }
129
+
130
+ push() {
131
+ try {
132
+ this.internalizeFormulas();
133
+ } finally {
134
+ this.goal2sat.push();
135
+ this.solver.userPush();
136
+ this.bitBlaster?.push();
137
+ this.scopes.push({
138
+ converters: this.converters.converters,
139
+ fmlsSize: this.fmls.size,
140
+ fmlsHead: this.fmlsHead,
141
+ namesSize: this.names.size,
142
+ hasUninterpreted: this.hasUninterpreted,
143
+ });
144
+ }
145
+ }
146
+
147
+ pop(numScopes: number) {
148
+ const count = Math.min(numScopes, this.scopes.length);
149
+ this.bitBlaster?.pop(count);
150
+ this.goal2sat.pop(count);
151
+ this.solver.userPop(count);
152
+ for (let index = 0; index < count; index++) {
153
+ const scope = this.scopes.pop() as Scope;
154
+ this.converters.converters = scope.converters;
155
+ this.fmlsHead = scope.fmlsHead;
156
+ this.fmls.shrink(scope.fmlsSize);
157
+ this.names.shrink(scope.namesSize);
158
+ this.hasUninterpreted = scope.hasUninterpreted;
159
+ }
160
+ }
161
+
162
+ private getBitBlaster() {
163
+ const bitBlaster = (this.bitBlaster ??= new BitBlasterRewriter(this.manager, BIT_BLAST_PARAMS));
164
+ while (bitBlaster.getNumScopes() < this.scopes.length) bitBlaster.push();
165
+ return bitBlaster;
166
+ }
167
+
168
+ private checkUninterpreted() {
169
+ if (this.goal2sat.unhandledFuns.length === 0) return L_TRUE;
170
+ this.hasUninterpreted = true;
171
+ const manager = this.manager;
172
+ const funs = this.goal2sat.unhandledFuns.map((fun) => {
173
+ const declaration = mkSeq1(
174
+ [
175
+ mkText(getQuotedName(manager.funcDecls[fun.decl].name)),
176
+ mkSeq5(fun.domain.map((sort) => formatSort(manager, sort))),
177
+ formatSort(manager, fun.range),
178
+ ],
179
+ "declare-fun",
180
+ );
181
+ return `${renderFormat(declaration, DEFAULT_PRINT_OPTIONS)}\n`;
182
+ });
183
+ this.reasonUnknown = `(sat.giveup interpreted functions sent to SAT solver ${funs.join("")})`;
184
+ return L_UNDEF;
185
+ }
186
+
187
+ private internalizeForms(forms: readonly number[]) {
188
+ this.solver.popToBaseLevel();
189
+ if (this.solver.isInconsistent) return L_FALSE;
190
+ this.goal2sat.run(forms);
191
+ return this.checkUninterpreted();
192
+ }
193
+
194
+ private internalizeGoal(goal: Goal) {
195
+ this.solver.popToBaseLevel();
196
+ if (this.solver.isInconsistent) return L_FALSE;
197
+ this.resetSubgoals();
198
+ const bitBlaster = this.getBitBlaster();
199
+ const subgoals = (() => {
200
+ if (this.isCnf) return [goal];
201
+ try {
202
+ const goals = (
203
+ this.goal2sat.euf === null
204
+ ? mkIncSatPreprocess(this.manager, bitBlaster)
205
+ : mkIncSatEufPreprocess(this.manager)
206
+ )(goal);
207
+ this.isCnf = true;
208
+ return goals;
209
+ } catch (error) {
210
+ this.releaseBitBlaster();
211
+ if (!(error instanceof SmtTacticError || error instanceof SmtCanceledError)) throw error;
212
+ // The tactics of the preprocessing report a limit that stops their rewriters as a tactic_exception.
213
+ this.reasonUnknown =
214
+ error instanceof SmtCanceledError ? this.manager.limit.getCancelMessage() : error.message;
215
+ return undefined;
216
+ }
217
+ })();
218
+ this.subgoals = subgoals ?? [];
219
+ if (!this.subgoals.includes(goal)) goal.reset();
220
+ if (subgoals?.length !== 1) return L_UNDEF;
221
+ const subgoal = subgoals[0];
222
+ this.converters.converters = [...this.converters.converters, ...subgoal.converters];
223
+ this.goal2sat.runGoal(subgoal, this.dep2asm);
224
+ return this.checkUninterpreted();
225
+ }
226
+
227
+ private internalizeFormulas() {
228
+ if (this.fmlsHead === this.fmls.size) return L_TRUE;
229
+ const pending = this.fmls.items.slice(this.fmlsHead);
230
+ const result = (() => {
231
+ if (this.isCnf) return this.internalizeForms(pending);
232
+ const goal = new Goal(this.manager);
233
+ for (const form of pending) goal.assert(form);
234
+ return this.internalizeGoal(goal);
235
+ })();
236
+ if (result !== L_UNDEF) this.fmlsHead = this.fmls.size;
237
+ this.isInternalizedConverted = false;
238
+ return result;
239
+ }
240
+
241
+ private internalizeAssumptions(assumptions: readonly number[]) {
242
+ const manager = this.manager;
243
+ const all = [...assumptions, ...this.names.items];
244
+ this.asms = [];
245
+ if (all.length === 0) return L_TRUE;
246
+ this.isCnf &&= all.every((assumption) => isLiteral(manager, assumption));
247
+ if (this.isCnf) this.goal2sat.assumptions(all, this.dep2asm);
248
+ else {
249
+ const goal = new Goal(manager);
250
+ goal.isCoresEnabled = true;
251
+ for (const assumption of all) goal.assert(assumption, mkDependencyLeaf(assumption));
252
+ const result = this.internalizeGoal(goal);
253
+ if (result !== L_TRUE) return result;
254
+ }
255
+ const seen = new Set<number>();
256
+ for (const assumption of all) {
257
+ const lit = this.dep2asm.get(assumption);
258
+ if (lit === undefined || seen.has(lit)) continue;
259
+ seen.add(lit);
260
+ this.asms.push(lit);
261
+ }
262
+ return L_TRUE;
263
+ }
264
+
265
+ check(assumptions: readonly number[] = []) {
266
+ const manager = this.manager;
267
+ this.solver.popToBaseLevel();
268
+ this.core.reset();
269
+ if (this.solver.isInconsistent) return L_FALSE;
270
+ const literals: number[] = [];
271
+ const asm2fml = new Map<number, number>();
272
+ for (const assumption of assumptions) {
273
+ if (isLiteral(this.manager, assumption)) {
274
+ literals.push(assumption);
275
+ asm2fml.set(assumption, assumption);
276
+ continue;
277
+ }
278
+ const fresh = manager.mkFreshConst("s", SORT_BOOL);
279
+ this.assertExpr(manager.mkEq(fresh, assumption));
280
+ literals.push(fresh);
281
+ asm2fml.set(fresh, assumption);
282
+ }
283
+ this.dep2asm = new Map();
284
+ const internalized = this.internalizeFormulas();
285
+ if (internalized !== L_TRUE) return internalized;
286
+ const internalizedAssumptions = this.internalizeAssumptions(literals);
287
+ if (internalizedAssumptions !== L_TRUE) return internalizedAssumptions;
288
+ this.reasonUnknown = "no reason given";
289
+ this.isInternalizedConverted = false;
290
+ const result = (() => {
291
+ try {
292
+ return this.solver.check(this.asms);
293
+ } catch (error) {
294
+ if (!(error instanceof SmtCanceledError)) throw error;
295
+ // check_sat_core counts a step to see whether the limit stopped the search.
296
+ manager.limit.inc();
297
+ return L_UNDEF;
298
+ }
299
+ })();
300
+ if (result === L_TRUE && this.hasUninterpreted) {
301
+ this.reasonUnknown = "(sat.giveup has-uninterpreted)";
302
+ return L_UNDEF;
303
+ }
304
+ if (result === L_FALSE && this.asms.length > 0) this.extractCore(asm2fml);
305
+ if (result === L_UNDEF) this.reasonUnknown = this.solver.reasonUnknown;
306
+ if (result !== L_FALSE) this.core.reset();
307
+ return result;
308
+ }
309
+
310
+ // internalize_var: the variables of a constant's bits, undefined for a bit the solver lacks.
311
+ private internalizeVar(expr: number) {
312
+ const manager = this.manager;
313
+ if (!manager.isUninterpretedConst(expr)) return [undefined];
314
+ if (manager.isBool(expr)) return [this.goal2sat.atoms.get(expr)];
315
+ const bits = this.bitBlaster?.getConstBits(manager.decls[expr]);
316
+ if (bits === undefined) return [undefined];
317
+ return manager.getArgs(bits).map((bit) => this.goal2sat.atoms.get(bit));
318
+ }
319
+
320
+ private getValue(expr: number, value: readonly number[]) {
321
+ const manager = this.manager;
322
+ if (manager.isBool(expr)) return value[0] & 1 ? manager.mkNot(expr) : expr;
323
+ const numeral = value.reduce(
324
+ (sum, lit, index) => (lit & 1 ? sum : sum + (1n << BigInt(index))),
325
+ 0n,
326
+ );
327
+ return manager.mkEq(expr, manager.mkBvNumeral(numeral, value.length));
328
+ }
329
+
330
+ getConsequences(assumptions: readonly number[], vars: readonly number[]) {
331
+ const manager = this.manager;
332
+ this.getBitBlaster();
333
+ this.dep2asm = new Map();
334
+ this.solver.popToBaseLevel();
335
+ const consequences: number[] = [];
336
+ const internalized = this.internalizeFormulas();
337
+ if (internalized !== L_TRUE) return { result: internalized, consequences };
338
+ const boolVars = vars.flatMap((expr) =>
339
+ this.internalizeVar(expr).filter((boolVar) => boolVar !== undefined),
340
+ );
341
+ const internalizedAssumptions = this.internalizeAssumptions(assumptions);
342
+ if (internalizedAssumptions !== L_TRUE)
343
+ return { result: internalizedAssumptions, consequences };
344
+ const found = getConsequences(this.solver, this.asms, boolVars);
345
+ if (found.result === L_FALSE && this.asms.length > 0) this.extractCore(new Map());
346
+ if (found.result === L_FALSE) return { result: found.result, consequences };
347
+ const boolVar2conseq = new Map<number, number[]>();
348
+ for (const consequence of found.consequences)
349
+ boolVar2conseq.set(consequence[0] >> 1, consequence);
350
+ const asm2dep = new Map<number, number>();
351
+ for (const [dep, lit] of this.dep2asm) asm2dep.set(lit, dep);
352
+ for (const expr of vars) {
353
+ const boolVars = this.internalizeVar(expr);
354
+ const fixed = boolVars
355
+ .map((boolVar) => (boolVar === undefined ? undefined : boolVar2conseq.get(boolVar)))
356
+ .filter((consequence) => consequence !== undefined);
357
+ if (fixed.length < boolVars.length) continue;
358
+ const value: number[] = [];
359
+ const premises = new Set<number>();
360
+ for (const consequence of fixed) {
361
+ value.push(consequence[0]);
362
+ for (const lit of consequence.slice(1)) premises.add(lit);
363
+ }
364
+ // Z3 pops the premises, the last inserted first.
365
+ const conjuncts = [...premises].reverse().map((lit) => asm2dep.get(lit) as number);
366
+ consequences.push(
367
+ manager.mkApp(
368
+ OP_IMPLIES,
369
+ [manager.mkAnd(conjuncts), this.getValue(expr, value)],
370
+ SORT_BOOL,
371
+ ),
372
+ );
373
+ }
374
+ return { result: found.result, consequences };
375
+ }
376
+
377
+ private extractCore(asm2fml: Map<number, number>) {
378
+ const asm2dep = new Map<number, number>();
379
+ for (const [dep, lit] of this.dep2asm) asm2dep.set(lit, dep);
380
+ const core = this.solver.core.map((lit) => {
381
+ const dep = asm2dep.get(lit) as number;
382
+ return asm2fml.get(dep) ?? dep;
383
+ });
384
+ this.core.reset();
385
+ for (const expr of core) this.core.push(expr);
386
+ }
387
+
388
+ getUnsatCore() {
389
+ return this.core.items;
390
+ }
391
+
392
+ mkModel() {
393
+ const manager = this.manager;
394
+ if (!this.solver.isModelCurrent || this.fmls.size > this.fmlsHead) return null;
395
+ const euf = this.goal2sat.euf;
396
+ const model = new ProtoModel(manager).mkModel();
397
+ for (const [expr, boolVar] of this.goal2sat.atoms) {
398
+ if (!manager.isUninterpretedConst(expr)) continue;
399
+ const value = this.solver.model[boolVar];
400
+ if (value === L_TRUE) model.registerConst(manager.decls[expr], manager.trueExpr);
401
+ else if (value === L_FALSE) model.registerConst(manager.decls[expr], manager.falseExpr);
402
+ }
403
+ if (this.satConverter.entries.length > 0) applyDefinitions(this.satConverter.entries, model);
404
+ return convertModel(this.converters, euf === null ? model : euf.updateModel(model));
405
+ }
406
+
407
+ getModel() {
408
+ const model = this.mkModel();
409
+ if (model === null) return null;
410
+ model.incRef();
411
+ this.models.push(model);
412
+ return model;
413
+ }
414
+
415
+ findMutexes(vars: readonly number[]) {
416
+ const manager = this.manager;
417
+ const lit2expr = new Map<number, number>();
418
+ const lits: number[] = [];
419
+ for (const expr of vars) {
420
+ const isNot = manager.isNot(expr);
421
+ const boolVar = this.goal2sat.atoms.get(isNot ? manager.getArg(expr, 0) : expr);
422
+ if (boolVar === undefined) continue;
423
+ const lit = 2 * boolVar + (isNot ? 1 : 0);
424
+ lit2expr.set(lit, expr);
425
+ lits.push(lit);
426
+ }
427
+ return this.solver
428
+ .findMutexes(lits)
429
+ .map((mutex) => mutex.map((lit) => lit2expr.get(lit) as number));
430
+ }
431
+
432
+ // convert_internalized: the formulas the SAT solver holds, or the asserted ones while they are
433
+ // not internalized.
434
+ getAssertions() {
435
+ this.solver.popToBaseLevel();
436
+ if (this.fmlsHead !== this.fmls.size && this.fmlsHead > 0) this.internalizeFormulas();
437
+ if (this.fmlsHead !== this.fmls.size) return this.fmls.items;
438
+ if (this.isInternalizedConverted) return this.internalized.items;
439
+ const goal = new Goal(this.manager);
440
+ sat2goal(this.manager, this.solver, this.goal2sat.atoms, goal, this.satConverter);
441
+ this.internalized.reset();
442
+ for (const form of goal.forms.items) this.internalized.push(form);
443
+ goal.reset();
444
+ this.isInternalizedConverted = true;
445
+ return this.internalized.items;
446
+ }
447
+
448
+ // get_model_converter: the converters of the preprocessed goals and sat2goal's, once the
449
+ // asserted formulas are internalized.
450
+ getConverters(): Goal["converters"] {
451
+ this.getAssertions();
452
+ return this.isInternalizedConverted
453
+ ? [...this.converters.converters, { definitions: this.satConverter.copyEntries() }]
454
+ : [];
455
+ }
456
+
457
+ private resetSubgoals() {
458
+ for (const subgoal of this.subgoals) subgoal.reset();
459
+ this.subgoals = [];
460
+ }
461
+
462
+ release() {
463
+ for (const model of this.models) model.decRef();
464
+ this.models = [];
465
+ this.resetSubgoals();
466
+ this.fmls.reset();
467
+ this.names.reset();
468
+ this.core.reset();
469
+ this.internalized.reset();
470
+ this.satConverter.release();
471
+ this.releaseBitBlaster();
472
+ this.goal2sat.release();
473
+ }
474
+
475
+ private releaseBitBlaster() {
476
+ this.bitBlaster?.releaseCfg();
477
+ this.bitBlaster?.release();
478
+ this.bitBlaster = undefined;
479
+ }
480
+ }
@@ -0,0 +1,136 @@
1
+ import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
2
+ import { NULL_BOOL_VAR, NULL_LITERAL } from "./clause";
3
+
4
+ export const MC_ELIM_VAR = 0;
5
+ export const MC_BCE = 1;
6
+ export const MC_CCE = 2;
7
+ export const MC_ACCE = 3;
8
+ export const MC_ABCE = 4;
9
+ const MC_ATE = 5;
10
+
11
+ export interface McEntry {
12
+ boolVar: number;
13
+ kind: number;
14
+ clauses: number[];
15
+ elimStacks: (number[] | undefined)[];
16
+ }
17
+
18
+ const getLitValue = (lit: number, model: Int8Array) => {
19
+ const value = model[lit >> 1];
20
+ return (lit & 1) === 1 ? -value : value;
21
+ };
22
+
23
+ export class ModelConverter {
24
+ entries: McEntry[] = [];
25
+ exposedLim = 0;
26
+ elimStack: number[] = [];
27
+
28
+ private processStack(model: Int8Array, clause: number[], stack: number[]) {
29
+ for (let index = stack.length; (index -= 2) >= 0;) {
30
+ const size = stack[index];
31
+ const lit = stack[index + 1];
32
+ let isSat = false;
33
+ for (let position = 0; !isSat && position < size; position++)
34
+ isSat = getLitValue(clause[position], model) === L_TRUE;
35
+ if (!isSat) model[lit >> 1] = (lit & 1) === 1 ? L_FALSE : L_TRUE;
36
+ }
37
+ }
38
+
39
+ apply(model: Int8Array) {
40
+ const clause: number[] = [];
41
+ for (let entryIndex = this.entries.length; entryIndex-- > this.exposedLim;) {
42
+ const entry = this.entries[entryIndex];
43
+ const firstVar = entry.boolVar;
44
+ let isSat = false;
45
+ let isVarNegated = false;
46
+ let index = 0;
47
+ clause.length = 0;
48
+ for (const lit of entry.clauses) {
49
+ if (lit === NULL_LITERAL) {
50
+ if (!isSat && entry.kind !== MC_ATE && firstVar !== NULL_BOOL_VAR)
51
+ model[firstVar] = isVarNegated ? L_FALSE : L_TRUE;
52
+ const stack = entry.elimStacks[index];
53
+ if (stack !== undefined) this.processStack(model, clause, stack);
54
+ isSat = false;
55
+ index++;
56
+ clause.length = 0;
57
+ continue;
58
+ }
59
+ clause.push(lit);
60
+ if (isSat) continue;
61
+ const boolVar = lit >> 1;
62
+ if (boolVar === firstVar) isVarNegated = (lit & 1) === 1;
63
+ if (getLitValue(lit, model) === L_TRUE) isSat = true;
64
+ else if (boolVar !== firstVar && model[boolVar] === L_UNDEF) {
65
+ model[boolVar] = (lit & 1) === 1 ? L_FALSE : L_TRUE;
66
+ isSat = true;
67
+ }
68
+ }
69
+ }
70
+ }
71
+
72
+ mk(kind: number, boolVar: number) {
73
+ const entry: McEntry = { boolVar, kind, clauses: [], elimStacks: [] };
74
+ this.entries.push(entry);
75
+ return entry;
76
+ }
77
+
78
+ addAte(lits: number[]) {
79
+ if (this.elimStack.length === 0) return;
80
+ this.insert(this.mk(MC_ATE, NULL_BOOL_VAR), lits);
81
+ }
82
+
83
+ private addElimStack(entry: McEntry) {
84
+ entry.elimStacks.push(this.elimStack.length === 0 ? undefined : this.elimStack);
85
+ this.elimStack = [];
86
+ }
87
+
88
+ insert(entry: McEntry, lits: number[]) {
89
+ entry.clauses.push(...lits, NULL_LITERAL);
90
+ this.addElimStack(entry);
91
+ }
92
+
93
+ flush(source: ModelConverter) {
94
+ this.entries.push(...source.entries);
95
+ this.exposedLim += source.exposedLim;
96
+ source.entries = [];
97
+ source.exposedLim = 0;
98
+ }
99
+
100
+ private swap(boolVar: number, size: number, clause: number[]) {
101
+ for (let index = 0; index < size; index++)
102
+ if (clause[index] >> 1 === boolVar) {
103
+ [clause[0], clause[index]] = [clause[index], clause[0]];
104
+ return;
105
+ }
106
+ }
107
+
108
+ expand(updateStack: number[]) {
109
+ const clause: number[] = [];
110
+ for (let entryIndex = this.exposedLim; entryIndex < this.entries.length; entryIndex++) {
111
+ const entry = this.entries[entryIndex];
112
+ let index = 0;
113
+ clause.length = 0;
114
+ for (const lit of entry.clauses) {
115
+ if (lit !== NULL_LITERAL) {
116
+ clause.push(lit);
117
+ continue;
118
+ }
119
+ const stack = entry.elimStacks[index];
120
+ if (stack !== undefined)
121
+ for (let position = 0; position < stack.length; position += 2) {
122
+ const size = stack[position];
123
+ this.swap(stack[position + 1] >> 1, size, clause);
124
+ updateStack.push(...clause.slice(0, size), NULL_LITERAL);
125
+ }
126
+ if (entry.boolVar !== NULL_BOOL_VAR) {
127
+ this.swap(entry.boolVar, clause.length, clause);
128
+ updateStack.push(...clause, NULL_LITERAL);
129
+ }
130
+ clause.length = 0;
131
+ index++;
132
+ }
133
+ }
134
+ this.exposedLim = this.entries.length;
135
+ }
136
+ }