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,333 @@
1
+ // Cores are subset cores: the port has no proofs to interpolate.
2
+ import { MBQI_MAX_ITERATIONS } from "../context";
3
+ import { type AstManager, KIND_APP, SORT_BOOL } from "../ast";
4
+ import { flattenAndVector } from "../ast-util";
5
+ import { L_FALSE, L_TRUE } from "../lbool";
6
+ import type { ProtoModel } from "../proto-model";
7
+ import { RandomGen } from "../random-gen";
8
+ import { RefVector } from "../ref-vector";
9
+ import { SmtKernel } from "../smt-kernel";
10
+ import type { SpacerManager } from "./spacer-manager";
11
+ import { INFTY_LEVEL, isInftyLevel, pin } from "./spacer-util";
12
+
13
+ class DefManager {
14
+ readonly expr2proxy = new Map<number, number>();
15
+ readonly proxy2def = new Map<number, number>();
16
+ }
17
+
18
+ const isUninterpretedConst = (manager: AstManager, expr: number) =>
19
+ manager.kinds[expr] === KIND_APP && manager.isUninterpretedConst(expr);
20
+
21
+ // A solver of the pool, with Z3's iuc_solver around it: the assumptions that are not literals of
22
+ // constants become proxy constants, and the background assumptions come first.
23
+ export class IucSolver {
24
+ private kernel: SmtKernel;
25
+ private proxies: number[] = [];
26
+ private numProxies = 0;
27
+ private defs: DefManager[] = [];
28
+ private baseDefs = new DefManager();
29
+ private assumptions: number[] = [];
30
+ private firstAssumption = 0;
31
+ private isProxied = false;
32
+ private lastModel: ProtoModel | undefined;
33
+ private lastCore: number[] = [];
34
+
35
+ constructor(
36
+ private manager: AstManager,
37
+ private spacerManager: SpacerManager,
38
+ ) {
39
+ this.kernel = new SmtKernel(manager, {
40
+ isMbqi: true,
41
+ isFindingMacros: false,
42
+ mbqiMaxIterations: MBQI_MAX_ITERATIONS,
43
+ });
44
+ }
45
+
46
+ assertExpr(expr: number) {
47
+ this.kernel.assertExpr(pin(this.manager, expr));
48
+ }
49
+
50
+ push() {
51
+ this.defs.push(new DefManager());
52
+ this.kernel.push();
53
+ }
54
+
55
+ pop(numScopes: number) {
56
+ this.kernel.pop(numScopes);
57
+ for (let index = 0; index < numScopes; index++) {
58
+ this.numProxies -= (this.defs.pop() as DefManager).proxy2def.size;
59
+ }
60
+ }
61
+
62
+ private freshProxy() {
63
+ if (this.numProxies === this.proxies.length)
64
+ this.proxies.push(
65
+ this.spacerManager.mkConst(`spacer_proxy!${this.proxies.length}`, SORT_BOOL),
66
+ );
67
+ return this.proxies[this.numProxies++];
68
+ }
69
+
70
+ private mkProxy(expr: number) {
71
+ const manager = this.manager;
72
+ const atom = manager.isNot(expr) ? manager.getArg(expr, 0) : expr;
73
+ if (isUninterpretedConst(manager, atom)) return expr;
74
+ const defs = this.defs.length > 0 ? this.defs[this.defs.length - 1] : this.baseDefs;
75
+ const existing = defs.expr2proxy.get(expr);
76
+ if (existing !== undefined) return existing;
77
+ const proxy = this.freshProxy();
78
+ const def = pin(manager, manager.mkOr([manager.mkNot(proxy), expr]));
79
+ defs.expr2proxy.set(expr, proxy);
80
+ defs.proxy2def.set(proxy, def);
81
+ this.assertExpr(def);
82
+ return proxy;
83
+ }
84
+
85
+ mkProxies(exprs: number[], from = 0) {
86
+ let isDirty = false;
87
+ for (let index = from; index < exprs.length; index++) {
88
+ const proxy = this.mkProxy(exprs[index]);
89
+ if (proxy !== exprs[index]) isDirty = true;
90
+ exprs[index] = proxy;
91
+ }
92
+ return isDirty;
93
+ }
94
+
95
+ private getProxyDef(expr: number) {
96
+ if (!isUninterpretedConst(this.manager, expr)) return undefined;
97
+ for (let index = this.defs.length - 1; index >= 0; index--) {
98
+ const def = this.defs[index].proxy2def.get(expr);
99
+ if (def !== undefined) return def;
100
+ }
101
+ return this.baseDefs.proxy2def.get(expr);
102
+ }
103
+
104
+ pushBg(expr: number) {
105
+ this.assumptions.length = this.firstAssumption;
106
+ this.assumptions.push(expr);
107
+ this.firstAssumption = this.assumptions.length;
108
+ }
109
+
110
+ popBg(count: number) {
111
+ if (count === 0) return;
112
+ this.assumptions.length = this.firstAssumption;
113
+ this.firstAssumption = this.firstAssumption > count ? this.firstAssumption - count : 0;
114
+ this.assumptions.length = this.firstAssumption;
115
+ }
116
+
117
+ getNumBg() {
118
+ return this.firstAssumption;
119
+ }
120
+
121
+ private run(clauses: readonly (readonly number[])[]) {
122
+ const kernel = this.kernel;
123
+ if (clauses.length > 0) {
124
+ kernel.push();
125
+ for (const clause of clauses)
126
+ kernel.assertExpr(pin(this.manager, this.manager.mkOr([...clause])));
127
+ }
128
+ const result = kernel.check(this.assumptions);
129
+ this.lastModel = undefined;
130
+ if (result === L_TRUE) {
131
+ this.lastModel = kernel.context.getModel();
132
+ this.lastModel.incRef();
133
+ }
134
+ this.lastCore = result === L_FALSE ? [...kernel.context.unsatCore] : [];
135
+ if (clauses.length > 0) kernel.pop(1);
136
+ return result;
137
+ }
138
+
139
+ checkSatCc(cube: readonly number[], clauses: readonly (readonly number[])[]) {
140
+ this.assumptions.length = this.firstAssumption;
141
+ this.mkProxies(this.assumptions);
142
+ this.firstAssumption = this.assumptions.length;
143
+ this.assumptions.push(...cube);
144
+ this.isProxied = this.mkProxies(this.assumptions, this.firstAssumption);
145
+ return this.run(clauses);
146
+ }
147
+
148
+ checkSat(cube: readonly number[]) {
149
+ return this.checkSatCc(cube, []);
150
+ }
151
+
152
+ getModel() {
153
+ return this.lastModel as ProtoModel;
154
+ }
155
+
156
+ getFullUnsatCore() {
157
+ return [...this.lastCore];
158
+ }
159
+
160
+ getUnsatCore() {
161
+ const background = new Set(this.assumptions.slice(0, this.firstAssumption));
162
+ const core: number[] = [];
163
+ for (const expr of this.lastCore) {
164
+ if (background.has(expr)) continue;
165
+ const def = this.isProxied ? this.getProxyDef(expr) : undefined;
166
+ core.push(def === undefined ? expr : this.manager.getArg(def, 1));
167
+ }
168
+ return core;
169
+ }
170
+
171
+ undoProxies(exprs: number[]) {
172
+ for (let index = 0; index < exprs.length; index++) {
173
+ const def = this.getProxyDef(exprs[index]);
174
+ if (def !== undefined) exprs[index] = this.manager.getArg(def, 1);
175
+ }
176
+ }
177
+ }
178
+
179
+ export class PropSolver {
180
+ private context: IucSolver;
181
+ private levelPreds: number[] = [];
182
+ private posLevelAtoms: number[] = [];
183
+ private negLevelAtoms: number[] = [];
184
+ private levelAtoms = new Set<number>();
185
+ private random: RandomGen;
186
+ core: number[] | undefined;
187
+ model: { value: ProtoModel | undefined } | undefined;
188
+ usesLevel = INFTY_LEVEL;
189
+ isInLevel = false;
190
+ currentLevel = 0;
191
+
192
+ constructor(
193
+ private manager: AstManager,
194
+ spacerManager: SpacerManager,
195
+ private name: string,
196
+ randomSeed: number,
197
+ ) {
198
+ this.context = new IucSolver(manager, spacerManager);
199
+ this.random = new RandomGen(randomSeed);
200
+ }
201
+
202
+ addLevel() {
203
+ const manager = this.manager;
204
+ const decl = manager.mkFreshFuncDecl(
205
+ `${this.name}#level_${this.levelPreds.length}`,
206
+ [],
207
+ SORT_BOOL,
208
+ );
209
+ manager.incDeclRef(decl);
210
+ this.levelPreds.push(decl);
211
+ const positive = pin(manager, manager.mkApp(decl, [], SORT_BOOL));
212
+ const negative = pin(manager, manager.mkNot(positive));
213
+ this.posLevelAtoms.push(positive);
214
+ this.negLevelAtoms.push(negative);
215
+ this.levelAtoms.add(positive);
216
+ this.levelAtoms.add(negative);
217
+ }
218
+
219
+ ensureLevel(level: number) {
220
+ if (isInftyLevel(level)) return;
221
+ while (level >= this.levelPreds.length) this.addLevel();
222
+ }
223
+
224
+ private assertLevelAtoms(level: number) {
225
+ for (let index = 0; index < this.levelPreds.length; index++)
226
+ this.context.pushBg(index >= level ? this.negLevelAtoms[index] : this.posLevelAtoms[index]);
227
+ }
228
+
229
+ assertExpr(form: number, level = INFTY_LEVEL) {
230
+ if (isInftyLevel(level)) {
231
+ this.context.assertExpr(form);
232
+ return;
233
+ }
234
+ this.ensureLevel(level);
235
+ this.context.assertExpr(this.manager.mkOr([form, this.posLevelAtoms[level]]));
236
+ }
237
+
238
+ // prop_solver::maxsmt: the soft literals in the core are dropped one at a time.
239
+ private maxsmt(hard: number[], soft: number[], clauses: readonly (readonly number[])[]) {
240
+ const context = this.context;
241
+ context.mkProxies(hard);
242
+ const hardSize = hard.length;
243
+ hard.push(...soft);
244
+ let result = context.checkSatCc(hard, clauses);
245
+ if (result !== L_FALSE || soft.length === 0) {
246
+ hard.length = hardSize;
247
+ return result;
248
+ }
249
+ soft.length = 0;
250
+ let core = context.getUnsatCore();
251
+ while (hard.length > hardSize) {
252
+ const index = hard.findIndex((expr, position) => position >= hardSize && core.includes(expr));
253
+ if (index === -1) {
254
+ hard.length = hardSize;
255
+ return L_FALSE;
256
+ }
257
+ hard[index] = hard[hard.length - 1];
258
+ hard.pop();
259
+ result = context.checkSatCc(hard, clauses);
260
+ if (result !== L_FALSE) break;
261
+ core = context.getUnsatCore();
262
+ }
263
+ if (result === L_TRUE) soft.push(...hard.slice(hardSize));
264
+ hard.length = hardSize;
265
+ return result;
266
+ }
267
+
268
+ private internalCheckAssumptions(
269
+ hard: number[],
270
+ soft: number[],
271
+ clauses: readonly (readonly number[])[],
272
+ ) {
273
+ const context = this.context;
274
+ if (this.isInLevel) this.assertLevelAtoms(this.currentLevel);
275
+ const result = this.maxsmt(hard, soft, clauses);
276
+ if (result !== L_FALSE && this.model !== undefined) this.model.value = context.getModel();
277
+ if (result === L_FALSE) {
278
+ this.usesLevel = INFTY_LEVEL;
279
+ for (const expr of context.getFullUnsatCore()) {
280
+ if (!this.levelAtoms.has(expr)) continue;
281
+ const size = Math.min(this.usesLevel, this.negLevelAtoms.length);
282
+ for (let index = 0; index < size; index++)
283
+ if (this.negLevelAtoms[index] === expr) {
284
+ this.usesLevel = index;
285
+ break;
286
+ }
287
+ }
288
+ if (this.core !== undefined) {
289
+ const core = context.getUnsatCore();
290
+ context.undoProxies(core);
291
+ this.core.length = 0;
292
+ this.core.push(...core);
293
+ }
294
+ }
295
+ return result;
296
+ }
297
+
298
+ checkAssumptions(
299
+ hardAtoms: readonly number[],
300
+ soft: number[],
301
+ clause: readonly number[],
302
+ background: readonly number[],
303
+ ) {
304
+ const manager = this.manager;
305
+ const flat = new RefVector(manager);
306
+ for (const atom of hardAtoms) flat.push(atom);
307
+ flattenAndVector(manager, flat);
308
+ const hard = flat.items.map((atom) => pin(manager, atom));
309
+ flat.reset();
310
+ for (let size = hard.length; size > 1;) {
311
+ const other = this.random.next() % size;
312
+ size--;
313
+ [hard[size], hard[other]] = [hard[other], hard[size]];
314
+ }
315
+ const context = this.context;
316
+ const numBg = context.getNumBg();
317
+ for (const expr of background) context.pushBg(expr);
318
+ const result = this.internalCheckAssumptions(hard, soft, clause.length === 0 ? [] : [clause]);
319
+ if (context.getNumBg() > numBg) context.popBg(context.getNumBg() - numBg);
320
+ this.core = undefined;
321
+ this.model = undefined;
322
+ return result;
323
+ }
324
+
325
+ withLevel<T>(level: number, body: () => T) {
326
+ const saved = this.isInLevel;
327
+ this.isInLevel = true;
328
+ this.currentLevel = level;
329
+ const result = body();
330
+ this.isInLevel = saved;
331
+ return result;
332
+ }
333
+ }
@@ -0,0 +1,282 @@
1
+ import { SmtUnsupportedError } from "../../../../errors";
2
+ import {
3
+ type AstManager,
4
+ isArithSort,
5
+ KIND_APP,
6
+ OP_AND,
7
+ OP_DISTINCT,
8
+ OP_EQ,
9
+ OP_IMPLIES,
10
+ OP_ITE,
11
+ OP_LT,
12
+ OP_NOT,
13
+ OP_OR,
14
+ OP_XOR,
15
+ FAMILY_BASIC,
16
+ SORT_BOOL,
17
+ } from "../ast";
18
+ import { flattenAndVector } from "../ast-util";
19
+ import { pickEquality, MbpContext } from "../mbp/mbp-plugin";
20
+ import type { ProtoModel } from "../proto-model";
21
+ import { Mbproj } from "../qe-mbp";
22
+ import { RefVector } from "../ref-vector";
23
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "../rewriter";
24
+
25
+ export const INFTY_LEVEL = 0xffffffff;
26
+
27
+ export const isInftyLevel = (level: number) => level >= 65535;
28
+
29
+ export const nextLevel = (level: number) => (isInftyLevel(level) ? level : level + 1);
30
+
31
+ export const prevLevel = (level: number) =>
32
+ isInftyLevel(level) ? INFTY_LEVEL : level === 0 ? 0 : level - 1;
33
+
34
+ // Spacer keeps the expressions it makes alive until it is done.
35
+ export const pin = (manager: AstManager, expr: number) => {
36
+ manager.incRef(expr);
37
+ return expr;
38
+ };
39
+
40
+ export const mkAndOf = (manager: AstManager, exprs: readonly number[]) =>
41
+ pin(manager, manager.mkAnd([...exprs]));
42
+
43
+ export const mkOrOf = (manager: AstManager, exprs: readonly number[]) =>
44
+ pin(manager, manager.mkOr([...exprs]));
45
+
46
+ export const flattenAnd = (manager: AstManager, exprs: readonly number[]) => {
47
+ const conjs = new RefVector(manager);
48
+ for (const expr of exprs) conjs.push(expr);
49
+ flattenAndVector(manager, conjs);
50
+ const result = conjs.items.map((conj) => pin(manager, conj));
51
+ conjs.reset();
52
+ return result;
53
+ };
54
+
55
+ // std::sort under ast_lt_proc, which orders by id.
56
+ export const sortByAstLt = (manager: AstManager, exprs: number[]) =>
57
+ exprs.sort((first, second) => manager.ids[first] - manager.ids[second]);
58
+
59
+ export const isTrueIn = (model: ProtoModel, expr: number) =>
60
+ model.manager.isTrue(model.eval(pin(model.manager, expr), false));
61
+
62
+ export const isFalseIn = (model: ProtoModel, expr: number) =>
63
+ model.manager.isFalse(model.eval(pin(model.manager, expr), false));
64
+
65
+ export class SpacerNormalizer {
66
+ private rewriter: Rewriter;
67
+
68
+ constructor(private manager: AstManager) {
69
+ this.rewriter = new Rewriter(manager, {
70
+ ...TACTIC_REWRITER_OPTIONS,
71
+ arith: {
72
+ ...TACTIC_REWRITER_OPTIONS.arith,
73
+ isSortSums: true,
74
+ isGcdRounding: true,
75
+ isArithIneqLhs: true,
76
+ isSom: true,
77
+ isFlat: true,
78
+ isHoistMul: false,
79
+ },
80
+ });
81
+ }
82
+
83
+ normalize(expr: number, isSimplifyingBounds = true) {
84
+ const manager = this.manager;
85
+ const result = this.rewriter.rewrite(pin(manager, expr));
86
+ if (manager.getOp(result) !== OP_AND) return result;
87
+ const conjs = flattenAnd(manager, [result]);
88
+ if (conjs.length <= 1) return result;
89
+ if (isSimplifyingBounds)
90
+ throw new SmtUnsupportedError("simplifying the bounds of a spacer cube");
91
+ return mkAndOf(manager, sortByAstLt(manager, conjs));
92
+ }
93
+ }
94
+
95
+ class ImplicantPicker {
96
+ private todo: number[] = [];
97
+ private visited = new Set<number>();
98
+
99
+ constructor(
100
+ private manager: AstManager,
101
+ private model: ProtoModel,
102
+ ) {}
103
+
104
+ private eval(expr: number) {
105
+ return this.model.eval(pin(this.manager, expr), false);
106
+ }
107
+
108
+ private addLiteral(expr: number, out: number[]) {
109
+ const manager = this.manager;
110
+ let result = manager.isFalse(this.eval(expr)) ? pin(manager, manager.mkNot(expr)) : expr;
111
+ if (manager.getOp(result) === OP_DISTINCT && manager.getNumArgs(result) === 2)
112
+ result = pin(
113
+ manager,
114
+ manager.mkNot(manager.mkEq(manager.getArg(result, 0), manager.getArg(result, 1))),
115
+ );
116
+ if (manager.isNot(result)) {
117
+ const negated = manager.getArg(result, 0);
118
+ const op = manager.getOp(negated);
119
+ if (op === OP_XOR && manager.getNumArgs(negated) === 2)
120
+ result = pin(manager, manager.mkEq(manager.getArg(negated, 0), manager.getArg(negated, 1)));
121
+ else if (op === OP_EQ && isArithSort(manager.sorts[manager.getArg(negated, 0)])) {
122
+ const left = manager.getArg(negated, 0);
123
+ const right = manager.getArg(negated, 1);
124
+ result = pin(manager, manager.mkApp(OP_LT, [left, right], SORT_BOOL));
125
+ if (!isTrueIn(this.model, result))
126
+ result = pin(manager, manager.mkApp(OP_LT, [right, left], SORT_BOOL));
127
+ }
128
+ }
129
+ out.push(result);
130
+ }
131
+
132
+ private processApp(app: number, out: number[]) {
133
+ const manager = this.manager;
134
+ const model = this.model;
135
+ if (this.visited.has(app)) return;
136
+ const value = this.eval(app);
137
+ const isTrue = manager.isTrue(value);
138
+ if (!isTrue && !manager.isFalse(value)) return;
139
+ const op = manager.getOp(app);
140
+ const args = manager.getArgs(app);
141
+ if (manager.isTrue(app) || manager.isFalse(app)) return;
142
+ if (manager.getFamily(app) !== FAMILY_BASIC || manager.isUninterpretedConst(app)) {
143
+ this.addLiteral(app, out);
144
+ return;
145
+ }
146
+ switch (op) {
147
+ case OP_NOT:
148
+ this.todo.push(args[0]);
149
+ return;
150
+ case OP_DISTINCT: {
151
+ if (!isTrue) {
152
+ const context = new MbpContext(manager, model);
153
+ this.todo.push(pin(manager, pickEquality(context, app)));
154
+ context.release();
155
+ } else if (args.length === 2) this.addLiteral(app, out);
156
+ else {
157
+ const expanded: number[] = [];
158
+ for (let first = 0; first < args.length; first++)
159
+ for (let second = first + 1; second < args.length; second++)
160
+ expanded.push(manager.mkNot(manager.mkEq(args[first], args[second])));
161
+ this.todo.push(mkAndOf(manager, expanded));
162
+ }
163
+ return;
164
+ }
165
+ case OP_AND:
166
+ if (isTrue) this.todo.push(...args);
167
+ else {
168
+ const falseArg = args.find((arg) => isFalseIn(model, arg));
169
+ if (falseArg !== undefined) this.todo.push(falseArg);
170
+ }
171
+ return;
172
+ case OP_OR:
173
+ if (!isTrue) this.todo.push(...args);
174
+ else {
175
+ const trueArg = args.find((arg) => isTrueIn(model, arg));
176
+ if (trueArg !== undefined) this.todo.push(trueArg);
177
+ }
178
+ return;
179
+ case OP_EQ: {
180
+ const [left, right] = args;
181
+ if (left === right || manager.areDistinct(left, right)) return;
182
+ if (
183
+ manager.sorts[left] === SORT_BOOL &&
184
+ (!manager.isUninterpretedConst(left) || !manager.isUninterpretedConst(right))
185
+ )
186
+ this.todo.push(...args);
187
+ else this.addLiteral(app, out);
188
+ return;
189
+ }
190
+ case OP_ITE: {
191
+ const [condition, thenExpr, elseExpr] = args;
192
+ if (thenExpr === elseExpr) this.todo.push(thenExpr);
193
+ else if (isTrueIn(model, thenExpr) && isTrueIn(model, elseExpr))
194
+ this.todo.push(thenExpr, elseExpr);
195
+ else if (isFalseIn(model, thenExpr) && isFalseIn(model, elseExpr))
196
+ this.todo.push(thenExpr, elseExpr);
197
+ else if (isTrueIn(model, condition)) this.todo.push(condition, thenExpr);
198
+ else if (isFalseIn(model, condition)) this.todo.push(condition, elseExpr);
199
+ return;
200
+ }
201
+ case OP_XOR:
202
+ this.todo.push(...args);
203
+ return;
204
+ case OP_IMPLIES:
205
+ if (!isTrue) this.todo.push(...args);
206
+ else if (isTrueIn(model, args[1])) this.todo.push(args[1]);
207
+ else if (isFalseIn(model, args[0])) this.todo.push(args[0]);
208
+ return;
209
+ default:
210
+ throw new SmtUnsupportedError("picking an implicant of this Boolean operator");
211
+ }
212
+ }
213
+
214
+ private pickLiterals(expr: number, out: number[]) {
215
+ const manager = this.manager;
216
+ if (this.visited.has(expr) || manager.kinds[expr] !== KIND_APP) return;
217
+ this.todo = [expr];
218
+ for (let current = this.todo.pop(); current !== undefined; current = this.todo.pop()) {
219
+ if (manager.kinds[current] !== KIND_APP) continue;
220
+ this.processApp(current, out);
221
+ this.visited.add(current);
222
+ }
223
+ }
224
+
225
+ pick(formula: readonly number[], out: number[]) {
226
+ this.visited.clear();
227
+ const isTrue = formula.every((expr) => isTrueIn(this.model, expr));
228
+ for (const expr of formula)
229
+ if (isTrue || isTrueIn(this.model, expr)) this.pickLiterals(expr, out);
230
+ this.visited.clear();
231
+ }
232
+ }
233
+
234
+ export const computeImplicantLiterals = (model: ProtoModel, formula: readonly number[]) => {
235
+ const manager = model.manager;
236
+ const flat = flattenAnd(manager, formula);
237
+ const result: number[] = [];
238
+ if (flat.length > 0) new ImplicantPicker(manager, model).pick(flat, result);
239
+ return result;
240
+ };
241
+
242
+ // qe_project with spacer.native_mbp: the variables that remain come back in vars.
243
+ export const qeProject = (
244
+ manager: AstManager,
245
+ vars: number[],
246
+ fml: number,
247
+ model: ProtoModel,
248
+ isDontSub: boolean,
249
+ ) => {
250
+ if (vars.length === 0) return fml;
251
+ const varVector = new RefVector(manager);
252
+ for (const variable of vars) varVector.push(variable);
253
+ const fmls = new RefVector(manager);
254
+ fmls.push(fml);
255
+ const mbproj = new Mbproj(manager);
256
+ mbproj.apply(!isDontSub, varVector, model, fmls);
257
+ mbproj.release();
258
+ const result = mkAndOf(manager, fmls.items);
259
+ vars.length = 0;
260
+ for (const variable of varVector.items) vars.push(pin(manager, variable));
261
+ fmls.reset();
262
+ varVector.reset();
263
+ return result;
264
+ };
265
+
266
+ export class ZkConsts {
267
+ constructor(private manager: AstManager) {}
268
+
269
+ has(expr: number) {
270
+ const manager = this.manager;
271
+ const visited = new Set<number>();
272
+ const todo = [expr];
273
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
274
+ if (visited.has(current) || manager.kinds[current] !== KIND_APP) continue;
275
+ visited.add(current);
276
+ if (manager.getNumArgs(current) === 0 && manager.getDeclName(current).startsWith("sk!"))
277
+ return true;
278
+ manager.pushArgs(current, todo);
279
+ }
280
+ return false;
281
+ }
282
+ }