tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.c92e6a4ea

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 (586) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +37 -0
  8. package/dist/index.d.ts +37 -0
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +45 -44
  15. package/dist/run.js +45 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +44 -41
  19. package/dist/transfer.js +45 -42
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +578 -757
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +27 -62
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +246 -240
  35. package/src/cli/tlc-output.ts +686 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +59 -707
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +73 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +34 -107
  47. package/src/exit-codes.ts +3 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +634 -306
  57. package/src/liveness.ts +104 -120
  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 +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  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 +118 -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 +55 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  310. package/src/prover/smt/solver/lp/pdd.ts +725 -289
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -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 +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -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 +814 -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 +8 -16
  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 +261 -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 +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  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 +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -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 +2127 -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 +1010 -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 +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  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 +1986 -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 +1200 -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 +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +17 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +244 -53
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +36 -50
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +70 -29
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -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/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,142 @@
1
+ import { L_FALSE, L_TRUE } from "../lbool";
2
+ import { NULL_LITERAL } from "./clause";
3
+ import { MC_ELIM_VAR } from "./model-converter";
4
+ import type { Solver } from "./solver";
5
+
6
+ const norm = (roots: number[], lit: number) => roots[lit >> 1] ^ (lit & 1);
7
+
8
+ export class ElimEqs {
9
+ constructor(private solver: Solver) {}
10
+
11
+ private cleanupBinWatches(roots: number[]) {
12
+ const solver = this.solver;
13
+ const newBins: number[] = [];
14
+ for (let index = 0; index < solver.watches.length; index++) {
15
+ const wlist = solver.watches[index];
16
+ const first = index ^ 1;
17
+ const firstRoot = norm(roots, first);
18
+ let next = 0;
19
+ for (let position = 0; position < wlist.size; position++) {
20
+ if (wlist.isBinary(position)) {
21
+ const second = wlist.getLiteral(position);
22
+ const secondRoot = norm(roots, second);
23
+ if (firstRoot === secondRoot) {
24
+ solver.assignUnit(firstRoot);
25
+ if (solver.isInconsistent) {
26
+ for (position++; position < wlist.size; position++) wlist.copy(next++, position);
27
+ wlist.setEnd(next);
28
+ return;
29
+ }
30
+ continue;
31
+ }
32
+ if (firstRoot === (secondRoot ^ 1)) continue;
33
+ if (first !== firstRoot || second !== secondRoot) {
34
+ if (firstRoot < secondRoot)
35
+ newBins.push(firstRoot, secondRoot, wlist.isLearned(position) ? 1 : 0);
36
+ continue;
37
+ }
38
+ }
39
+ wlist.copy(next++, position);
40
+ }
41
+ wlist.setEnd(next);
42
+ }
43
+ for (let index = 0; index < newBins.length; index += 3)
44
+ solver.mkBinClause(newBins[index], newBins[index + 1], newBins[index + 2] === 1);
45
+ }
46
+
47
+ private cleanupClauses(roots: number[], clauses: number[]) {
48
+ const solver = this.solver;
49
+ const arena = solver.arena;
50
+ let target = 0;
51
+ for (let clauseIndex = 0; clauseIndex < clauses.length; clauseIndex++) {
52
+ const clause = clauses[clauseIndex];
53
+ const size = arena.size[clause];
54
+ let index = 0;
55
+ while (index < size && arena.get(clause, index) === norm(roots, arena.get(clause, index)))
56
+ index++;
57
+ if (index === size) {
58
+ clauses[target++] = clause;
59
+ continue;
60
+ }
61
+ if (!arena.isFrozen(clause)) solver.detachClause(clause);
62
+ for (index = 0; index < size; index++)
63
+ arena.set(clause, index, norm(roots, arena.get(clause, index)));
64
+ const start = arena.start[clause];
65
+ arena.lits.subarray(start, start + size).sort();
66
+ let next = 0;
67
+ let previous = NULL_LITERAL;
68
+ for (index = 0; index < size; index++) {
69
+ const lit = arena.get(clause, index);
70
+ if (lit === (previous ^ 1)) break;
71
+ if (lit === previous) continue;
72
+ previous = lit;
73
+ const value = solver.value(lit);
74
+ if (value === L_TRUE) break;
75
+ if (value === L_FALSE) continue;
76
+ arena.set(clause, next++, lit);
77
+ }
78
+ if (index < size) {
79
+ arena.setRemoved(clause, true);
80
+ solver.delClause(clause);
81
+ continue;
82
+ }
83
+ switch (next) {
84
+ case 0:
85
+ solver.setConflict();
86
+ for (; clauseIndex < clauses.length; clauseIndex++)
87
+ clauses[target++] = clauses[clauseIndex];
88
+ clauses.length = target;
89
+ return;
90
+ case 1:
91
+ solver.assignUnit(arena.get(clause, 0));
92
+ arena.setRemoved(clause, true);
93
+ solver.delClause(clause);
94
+ break;
95
+ case 2:
96
+ solver.mkBinClause(arena.get(clause, 0), arena.get(clause, 1), arena.isLearned(clause));
97
+ arena.setRemoved(clause, true);
98
+ solver.delClause(clause);
99
+ break;
100
+ default:
101
+ if (next < size) arena.shrink(clause, next);
102
+ else arena.updateApprox(clause);
103
+ clauses[target++] = clause;
104
+ if (!arena.isFrozen(clause)) solver.attachClause(clause);
105
+ }
106
+ }
107
+ clauses.length = target;
108
+ }
109
+
110
+ private saveElim(roots: number[], toElim: number[]) {
111
+ const solver = this.solver;
112
+ for (const boolVar of toElim) {
113
+ const lit = 2 * boolVar;
114
+ const root = roots[boolVar];
115
+ const isRootSet = solver.ext === null || solver.ext.setRoot(lit, root);
116
+ if (
117
+ solver.isAssumption(boolVar) ||
118
+ (solver.isExternal(boolVar) && (solver.isIncremental() || !isRootSet))
119
+ ) {
120
+ solver.mkBinClause(lit ^ 1, root, false);
121
+ solver.mkBinClause(lit, root ^ 1, false);
122
+ continue;
123
+ }
124
+ const entry = solver.mc.mk(MC_ELIM_VAR, boolVar);
125
+ solver.setEliminated(boolVar, true);
126
+ solver.mc.insert(entry, [lit ^ 1, root]);
127
+ solver.mc.insert(entry, [lit, root ^ 1]);
128
+ }
129
+ solver.ext?.flushRoots();
130
+ }
131
+
132
+ run(roots: number[], toElim: number[]) {
133
+ const solver = this.solver;
134
+ this.cleanupBinWatches(roots);
135
+ this.cleanupClauses(roots, solver.clauses);
136
+ if (solver.isInconsistent) return;
137
+ this.cleanupClauses(roots, solver.learned);
138
+ if (solver.isInconsistent) return;
139
+ this.saveElim(roots, toElim);
140
+ solver.propagate(false);
141
+ }
142
+ }
@@ -0,0 +1,526 @@
1
+ import { SmtCanceledError, SmtTacticError } from "../../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_BASIC,
5
+ FAMILY_PB,
6
+ OP_AND,
7
+ OP_DISTINCT,
8
+ OP_EQ,
9
+ OP_FALSE,
10
+ OP_IMPLIES,
11
+ OP_ITE,
12
+ OP_NOT,
13
+ OP_OR,
14
+ OP_TRUE,
15
+ OP_XOR,
16
+ } from "../ast";
17
+ import { EufSolver, type EufInternalizer, type ThSolverFactory } from "../euf/euf-solver";
18
+ import { DEFAULT_PRINT_OPTIONS, printExpr } from "../smt2-printer";
19
+ import { NULL_LITERAL } from "./clause";
20
+ import { PbSolver, type SatInternalizer } from "./pb-solver";
21
+ import type { Solver } from "./solver";
22
+
23
+ const PRINT_ENVIRONMENT = {
24
+ options: DEFAULT_PRINT_OPTIONS,
25
+ isUsed: () => false,
26
+ isClashing: () => false,
27
+ };
28
+
29
+ interface Frame {
30
+ expr: number;
31
+ isRoot: boolean;
32
+ isSign: boolean;
33
+ index: number;
34
+ }
35
+
36
+ export class Goal2Sat implements SatInternalizer, EufInternalizer {
37
+ readonly atoms = new Map<number, number>();
38
+ readonly unhandledFuns: number[] = [];
39
+ private frames: Frame[] = [];
40
+ private results: number[] = [];
41
+ private app2lit = new Map<number, number>();
42
+ private lit2app = new Map<number, number>();
43
+ private cacheTrail: number[] = [];
44
+ private cacheLim: number[] = [];
45
+ private recentAtoms: number[] = [];
46
+ private atomsLim: number[] = [];
47
+ private numScopes = 0;
48
+ private expr2varReplay: Map<number, number> | null = null;
49
+ euf: EufSolver | null = null;
50
+
51
+ // A theory factory puts goal2sat in sat.euf mode, where atoms go to the euf solver.
52
+ constructor(
53
+ private manager: AstManager,
54
+ private solver: Solver,
55
+ private isIteExtra: boolean,
56
+ private mkThSolver: ThSolverFactory | null = null,
57
+ ) {}
58
+
59
+ ensureEuf() {
60
+ if (this.euf !== null) return this.euf;
61
+ const solver = this.solver;
62
+ if (solver.ext !== null) throw new SmtTacticError("cannot convert to euf");
63
+ const euf = new EufSolver(this.manager, this, solver, this.mkThSolver as ThSolverFactory);
64
+ solver.ext = euf;
65
+ this.euf = euf;
66
+ return euf;
67
+ }
68
+
69
+ private convertEuf(expr: number, isRoot: boolean, isSign: boolean) {
70
+ const lit = this.ensureEuf().internalize(expr, isSign, isRoot);
71
+ if (lit === NULL_LITERAL) return;
72
+ if (isRoot) this.mkClause([lit]);
73
+ else this.results.push(lit);
74
+ }
75
+
76
+ private forcePush() {
77
+ for (; this.numScopes > 0; this.numScopes--) {
78
+ this.atomsLim.push(this.recentAtoms.length);
79
+ this.cacheLim.push(this.cacheTrail.length);
80
+ }
81
+ }
82
+
83
+ push() {
84
+ this.numScopes++;
85
+ }
86
+
87
+ pop(numScopes: number) {
88
+ if (numScopes <= this.numScopes) {
89
+ this.numScopes -= numScopes;
90
+ return;
91
+ }
92
+ const remaining = numScopes - this.numScopes;
93
+ this.numScopes = 0;
94
+ const manager = this.manager;
95
+ const atomsLim = this.atomsLim[this.atomsLim.length - remaining];
96
+ for (let index = this.recentAtoms.length; index-- > atomsLim;) {
97
+ const expr = this.recentAtoms[index];
98
+ this.atoms.delete(expr);
99
+ manager.decRef(expr);
100
+ }
101
+ this.recentAtoms.length = atomsLim;
102
+ this.atomsLim.length -= remaining;
103
+ const cacheLim = this.cacheLim[this.cacheLim.length - remaining];
104
+ for (let index = this.cacheTrail.length; index-- > cacheLim;) {
105
+ const expr = this.cacheTrail[index];
106
+ const lit = this.app2lit.get(expr);
107
+ if (lit === undefined) continue;
108
+ this.app2lit.delete(expr);
109
+ this.lit2app.delete(lit);
110
+ }
111
+ this.cacheTrail.length = cacheLim;
112
+ this.cacheLim.length -= remaining;
113
+ }
114
+
115
+ private insertAtom(expr: number, boolVar: number) {
116
+ this.atoms.set(expr, boolVar);
117
+ if (this.mkThSolver === null) return;
118
+ this.manager.incRef(expr);
119
+ this.recentAtoms.push(expr);
120
+ }
121
+
122
+ uncache(lit: number) {
123
+ const expr = this.lit2app.get(lit);
124
+ if (expr === undefined) return;
125
+ this.lit2app.delete(lit);
126
+ this.app2lit.delete(expr);
127
+ }
128
+
129
+ isCached(expr: number, lit: number) {
130
+ return this.app2lit.get(expr) === lit;
131
+ }
132
+
133
+ setExpr2VarReplay(replay: Map<number, number> | null) {
134
+ this.expr2varReplay = replay;
135
+ }
136
+
137
+ toBoolVar(expr: number) {
138
+ const boolVar = this.atoms.get(expr);
139
+ if (boolVar !== undefined) return boolVar;
140
+ const lit = this.app2lit.get(expr);
141
+ return lit !== undefined && (lit & 1) === 0 ? lit >> 1 : -1;
142
+ }
143
+
144
+ addBoolVar(expr: number) {
145
+ this.forcePush();
146
+ const boolVar = this.atoms.get(expr);
147
+ if (boolVar === undefined) return this.mkBoolVar(expr);
148
+ this.solver.setExternal(boolVar);
149
+ return boolVar;
150
+ }
151
+
152
+ isBoolOp(expr: number) {
153
+ const manager = this.manager;
154
+ if (!manager.isApp(expr)) return false;
155
+ if (manager.getFamily(expr) === FAMILY_BASIC)
156
+ switch (manager.getOp(expr)) {
157
+ case OP_OR:
158
+ case OP_AND:
159
+ case OP_TRUE:
160
+ case OP_FALSE:
161
+ case OP_NOT:
162
+ case OP_IMPLIES:
163
+ case OP_XOR:
164
+ return true;
165
+ case OP_ITE:
166
+ case OP_EQ:
167
+ return manager.isBool(manager.getArg(expr, 1));
168
+ default:
169
+ return false;
170
+ }
171
+ return this.mkThSolver === null && manager.getFamily(expr) === FAMILY_PB;
172
+ }
173
+
174
+ private throwOpNotHandled(expr: number) {
175
+ throw new SmtTacticError(
176
+ `operator ${printExpr(this.manager, PRINT_ENVIRONMENT, expr)} not supported, apply simplifier before invoking translator`,
177
+ );
178
+ }
179
+
180
+ private mkClause(lits: number[]) {
181
+ this.solver.mkClause(lits);
182
+ }
183
+
184
+ private addVar(isExternal: boolean, expr: number) {
185
+ const replayed = this.expr2varReplay?.get(expr);
186
+ return replayed ?? this.solver.mkVar(isExternal);
187
+ }
188
+
189
+ private mkBoolVar(expr: number) {
190
+ this.forcePush();
191
+ const boolVar = this.addVar(true, expr);
192
+ this.insertAtom(expr, boolVar);
193
+ return boolVar;
194
+ }
195
+
196
+ private convertAtom(expr: number, isRoot: boolean, isSign: boolean) {
197
+ const manager = this.manager;
198
+ const boolVar = this.atoms.get(expr);
199
+ let lit: number;
200
+ if (boolVar !== undefined) {
201
+ lit = 2 * boolVar + (isSign ? 1 : 0);
202
+ this.solver.setEliminated(boolVar, false);
203
+ } else if (manager.isTrue(expr)) {
204
+ const trueLit = 2 * this.mkBoolVar(expr);
205
+ this.mkClause([trueLit]);
206
+ lit = isSign ? trueLit ^ 1 : trueLit;
207
+ } else if (manager.isFalse(expr)) {
208
+ const falseLit = 2 * this.mkBoolVar(expr);
209
+ this.mkClause([falseLit ^ 1]);
210
+ lit = isSign ? falseLit ^ 1 : falseLit;
211
+ } else if (this.mkThSolver !== null) {
212
+ this.convertEuf(expr, isRoot, isSign);
213
+ return;
214
+ } else {
215
+ if (!manager.isUninterpretedConst(expr)) {
216
+ if (!manager.isApp(expr)) this.throwOpNotHandled(expr);
217
+ this.unhandledFuns.push(manager.decls[expr]);
218
+ }
219
+ lit = 2 * this.mkBoolVar(expr) + (isSign ? 1 : 0);
220
+ }
221
+ if (isRoot) this.mkClause([lit]);
222
+ else this.results.push(lit);
223
+ }
224
+
225
+ private processCached(expr: number, isRoot: boolean, isSign: boolean) {
226
+ const cached = this.app2lit.get(expr);
227
+ if (cached === undefined) return false;
228
+ const lit = isSign ? cached ^ 1 : cached;
229
+ if (isRoot) this.mkClause([lit]);
230
+ else this.results.push(lit);
231
+ return true;
232
+ }
233
+
234
+ private visit(expr: number, isRoot: boolean, isSign: boolean) {
235
+ const manager = this.manager;
236
+ if (!manager.isApp(expr)) {
237
+ this.convertAtom(expr, isRoot, isSign);
238
+ return true;
239
+ }
240
+ if (this.processCached(expr, isRoot, isSign)) return true;
241
+ if (manager.getFamily(expr) === FAMILY_PB && this.mkThSolver === null) {
242
+ this.frames.push({ expr, isRoot, isSign, index: 0 });
243
+ return false;
244
+ }
245
+ if (manager.getFamily(expr) !== FAMILY_BASIC) {
246
+ this.convertAtom(expr, isRoot, isSign);
247
+ return true;
248
+ }
249
+ switch (manager.getOp(expr)) {
250
+ case OP_NOT:
251
+ case OP_OR:
252
+ case OP_AND:
253
+ case OP_ITE:
254
+ case OP_XOR:
255
+ case OP_IMPLIES:
256
+ this.frames.push({ expr, isRoot, isSign, index: 0 });
257
+ return false;
258
+ case OP_EQ:
259
+ if (manager.isBool(manager.getArg(expr, 1))) {
260
+ this.frames.push({ expr, isRoot, isSign, index: 0 });
261
+ return false;
262
+ }
263
+ this.convertAtom(expr, isRoot, isSign);
264
+ return true;
265
+ case OP_DISTINCT:
266
+ if (this.mkThSolver === null) return this.throwOpNotHandled(expr);
267
+ this.convertEuf(expr, isRoot, isSign);
268
+ return true;
269
+ default:
270
+ this.convertAtom(expr, isRoot, isSign);
271
+ return true;
272
+ }
273
+ }
274
+
275
+ private mkTseitinVar(expr: number) {
276
+ const lit = 2 * this.addVar(false, expr);
277
+ this.cache(expr, lit);
278
+ return lit;
279
+ }
280
+
281
+ private convertOr(expr: number, isRoot: boolean, isSign: boolean) {
282
+ const results = this.results;
283
+ const num = this.manager.getNumArgs(expr);
284
+ const oldSize = results.length - num;
285
+ if (isRoot) {
286
+ if (isSign) for (let index = 0; index < num; index++) this.mkClause([results[index] ^ 1]);
287
+ else this.mkClause(results.slice());
288
+ results.length = oldSize;
289
+ return;
290
+ }
291
+ if (this.processCached(expr, isRoot, isSign)) return;
292
+ const lit = this.mkTseitinVar(expr);
293
+ for (let index = oldSize; index < oldSize + num; index++)
294
+ this.mkClause([results[index] ^ 1, lit]);
295
+ this.mkClause([...results.slice(oldSize), lit ^ 1]);
296
+ this.solver.setPhaseLiteral(lit ^ 1);
297
+ results.length = oldSize;
298
+ results.push(isSign ? lit ^ 1 : lit);
299
+ }
300
+
301
+ private convertAnd(expr: number, isRoot: boolean, isSign: boolean) {
302
+ const results = this.results;
303
+ const num = this.manager.getNumArgs(expr);
304
+ const oldSize = results.length - num;
305
+ if (isRoot) {
306
+ if (isSign) this.mkClause(results.slice(0, num).map((lit) => lit ^ 1));
307
+ else for (let index = 0; index < num; index++) this.mkClause([results[index]]);
308
+ results.length = oldSize;
309
+ return;
310
+ }
311
+ if (this.processCached(expr, isRoot, isSign)) return;
312
+ const lit = this.mkTseitinVar(expr);
313
+ for (let index = oldSize; index < oldSize + num; index++)
314
+ this.mkClause([lit ^ 1, results[index]]);
315
+ this.mkClause([...results.slice(oldSize).map((arg) => arg ^ 1), lit]);
316
+ this.solver.setPhaseLiteral(lit);
317
+ results.length = oldSize;
318
+ results.push(isSign ? lit ^ 1 : lit);
319
+ }
320
+
321
+ private convertIte(expr: number, isRoot: boolean, isSign: boolean) {
322
+ const results = this.results;
323
+ const size = results.length;
324
+ const condition = results[size - 3];
325
+ const thenLit = results[size - 2];
326
+ const elseLit = results[size - 1];
327
+ results.length = size - 3;
328
+ if (isRoot) {
329
+ if (isSign) {
330
+ this.mkClause([condition ^ 1, thenLit ^ 1]);
331
+ this.mkClause([condition, elseLit ^ 1]);
332
+ } else {
333
+ this.mkClause([condition ^ 1, thenLit]);
334
+ this.mkClause([condition, elseLit]);
335
+ }
336
+ return;
337
+ }
338
+ if (this.processCached(expr, isRoot, isSign)) return;
339
+ const lit = this.mkTseitinVar(expr);
340
+ this.mkClause([lit ^ 1, condition ^ 1, thenLit]);
341
+ this.mkClause([lit ^ 1, condition, elseLit]);
342
+ this.mkClause([lit, condition ^ 1, thenLit ^ 1]);
343
+ this.mkClause([lit, condition, elseLit ^ 1]);
344
+ if (this.isIteExtra) {
345
+ this.mkClause([thenLit ^ 1, elseLit ^ 1, lit]);
346
+ this.mkClause([thenLit, elseLit, lit ^ 1]);
347
+ }
348
+ results.push(isSign ? lit ^ 1 : lit);
349
+ }
350
+
351
+ private convertNot(expr: number, isRoot: boolean, isSign: boolean) {
352
+ const results = this.results;
353
+ const arg = results.pop() as number;
354
+ if (isRoot) {
355
+ this.mkClause([isSign ? arg : arg ^ 1]);
356
+ return;
357
+ }
358
+ if (this.processCached(expr, isRoot, isSign)) return;
359
+ const lit = this.mkTseitinVar(expr);
360
+ this.mkClause([arg, lit]);
361
+ this.mkClause([arg ^ 1, lit ^ 1]);
362
+ results.push(isSign ? lit ^ 1 : lit);
363
+ }
364
+
365
+ private convertImplies(expr: number, isRoot: boolean, isSign: boolean) {
366
+ const results = this.results;
367
+ const second = results.pop() as number;
368
+ const first = results.pop() as number;
369
+ if (isRoot) {
370
+ if (isSign) {
371
+ this.mkClause([first]);
372
+ this.mkClause([second ^ 1]);
373
+ } else this.mkClause([first ^ 1, second]);
374
+ return;
375
+ }
376
+ if (this.processCached(expr, isRoot, isSign)) return;
377
+ const lit = this.mkTseitinVar(expr);
378
+ this.mkClause([lit ^ 1, first ^ 1, second]);
379
+ this.mkClause([first, lit]);
380
+ this.mkClause([second ^ 1, lit]);
381
+ results.push(isSign ? lit ^ 1 : lit);
382
+ }
383
+
384
+ private convertIff(expr: number, isRoot: boolean, isSign: boolean) {
385
+ const manager = this.manager;
386
+ if (manager.getNumArgs(expr) !== 2)
387
+ throw new SmtTacticError(
388
+ `unexpected number of arguments to ${printExpr(manager, PRINT_ENVIRONMENT, expr)}`,
389
+ );
390
+ const results = this.results;
391
+ const isXor = manager.getOp(expr) === OP_XOR;
392
+ let first = results.pop() as number;
393
+ const second = results.pop() as number;
394
+ if (isRoot) {
395
+ if (isSign !== isXor) {
396
+ this.mkClause([first, second]);
397
+ this.mkClause([first ^ 1, second ^ 1]);
398
+ } else {
399
+ this.mkClause([first, second ^ 1]);
400
+ this.mkClause([first ^ 1, second]);
401
+ }
402
+ return;
403
+ }
404
+ if (this.processCached(expr, isRoot, isSign)) return;
405
+ const lit = 2 * this.addVar(false, expr);
406
+ if (isXor) first ^= 1;
407
+ this.mkClause([lit ^ 1, first, second ^ 1]);
408
+ this.mkClause([lit ^ 1, first ^ 1, second]);
409
+ this.mkClause([lit, first, second]);
410
+ this.mkClause([lit, first ^ 1, second ^ 1]);
411
+ this.cache(expr, lit);
412
+ results.push(isSign ? lit ^ 1 : lit);
413
+ }
414
+
415
+ private convertBa(expr: number, isRoot: boolean, isSign: boolean) {
416
+ const solver = this.solver;
417
+ if (solver.ext === null) {
418
+ const ext = new PbSolver(this.manager, this, solver);
419
+ solver.ext = ext;
420
+ for (let index = 0; index < solver.scopeLvl; index++) ext.push();
421
+ }
422
+ const lit = (solver.ext as PbSolver).internalize(expr, isSign, isRoot);
423
+ this.results.length -= this.manager.getNumArgs(expr);
424
+ if (lit === NULL_LITERAL) return;
425
+ if (isRoot) this.mkClause([lit]);
426
+ else this.results.push(lit);
427
+ }
428
+
429
+ private convert(expr: number, isRoot: boolean, isSign: boolean) {
430
+ if (this.manager.getFamily(expr) === FAMILY_PB) return this.convertBa(expr, isRoot, isSign);
431
+ switch (this.manager.getOp(expr)) {
432
+ case OP_OR:
433
+ return this.convertOr(expr, isRoot, isSign);
434
+ case OP_AND:
435
+ return this.convertAnd(expr, isRoot, isSign);
436
+ case OP_ITE:
437
+ return this.convertIte(expr, isRoot, isSign);
438
+ case OP_EQ:
439
+ case OP_XOR:
440
+ return this.convertIff(expr, isRoot, isSign);
441
+ case OP_IMPLIES:
442
+ return this.convertImplies(expr, isRoot, isSign);
443
+ default:
444
+ return this.convertNot(expr, isRoot, isSign);
445
+ }
446
+ }
447
+
448
+ private process(form: number, isRoot: boolean) {
449
+ const manager = this.manager;
450
+ const frames = this.frames;
451
+ const baseSize = frames.length;
452
+ if (this.visit(form, isRoot, false)) return;
453
+ loop: while (frames.length > baseSize) {
454
+ if (!manager.limit.inc()) throw new SmtCanceledError();
455
+ const size = frames.length;
456
+ const frame = frames[size - 1];
457
+ const expr = frame.expr;
458
+ if (frame.index === 0 && this.processCached(expr, frame.isRoot, frame.isSign)) {
459
+ frames.pop();
460
+ continue;
461
+ }
462
+ if (
463
+ manager.isNot(expr) &&
464
+ (frame.isRoot || (!manager.isNot(manager.getArg(expr, 0)) && size !== baseSize + 1))
465
+ ) {
466
+ frames.pop();
467
+ this.visit(manager.getArg(expr, 0), frame.isRoot, !frame.isSign);
468
+ continue;
469
+ }
470
+ const num = manager.getNumArgs(expr);
471
+ while (frame.index < num) {
472
+ const arg = manager.getArg(expr, frame.index);
473
+ frame.index++;
474
+ if (!this.visit(arg, false, false)) continue loop;
475
+ }
476
+ this.convert(expr, frame.isRoot, frame.isSign);
477
+ frames.pop();
478
+ }
479
+ }
480
+
481
+ internalize(expr: number) {
482
+ const manager = this.manager;
483
+ const isNot = manager.isNot(expr);
484
+ const atom = isNot ? manager.getArg(expr, 0) : expr;
485
+ this.process(atom, false);
486
+ const result = this.results.pop() as number;
487
+ if ((result & 1) === 0 && !this.atoms.has(atom)) {
488
+ this.forcePush();
489
+ this.insertAtom(atom, result >> 1);
490
+ this.solver.setExternal(result >> 1);
491
+ }
492
+ return isNot ? result ^ 1 : result;
493
+ }
494
+
495
+ getCached(expr: number) {
496
+ return this.app2lit.get(expr) ?? NULL_LITERAL;
497
+ }
498
+
499
+ cache(expr: number, lit: number) {
500
+ this.forcePush();
501
+ this.app2lit.set(expr, lit);
502
+ this.lit2app.set(lit, expr);
503
+ this.cacheTrail.push(expr);
504
+ }
505
+
506
+ // insert_dep on an assumption, an uninterpreted constant or its negation.
507
+ getAssumptionLit(assumption: number) {
508
+ const manager = this.manager;
509
+ const isNot = manager.isNot(assumption);
510
+ this.convertAtom(isNot ? manager.getArg(assumption, 0) : assumption, false, false);
511
+ const lit = this.results.pop() as number;
512
+ return isNot ? lit ^ 1 : lit;
513
+ }
514
+
515
+ run(forms: readonly number[]) {
516
+ if (this.mkThSolver !== null) this.ensureEuf();
517
+ try {
518
+ for (const form of forms) this.process(form, true);
519
+ } finally {
520
+ this.frames = [];
521
+ this.results = [];
522
+ this.app2lit = new Map();
523
+ this.lit2app = new Map();
524
+ }
525
+ }
526
+ }