tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

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 (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +109 -10
  8. package/dist/index.d.ts +109 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -1,43 +1,182 @@
1
- // Ported from Z3 (src/tactic/goal.cpp), MIT license, see z3-license.txt. The formulas that a tactic
2
- // transforms, kept split into conjuncts. Like Z3's goal, it holds a reference to each formula.
3
1
  import { OP_AND, OP_NOT, OP_OR, SORT_BOOL, type AstManager } from "./ast";
2
+ import type { ProtoModel } from "./proto-model";
4
3
  import { RefVector } from "./ref-vector";
5
4
 
5
+ // A dependency is a leaf, which holds an expression, or the join of two dependencies.
6
+ export interface Dependency {
7
+ value: number;
8
+ children: Dependency[];
9
+ }
10
+
11
+ export const mkDependencyLeaf = (value: number): Dependency => ({ value, children: [] });
12
+
13
+ export const joinDependencies = (
14
+ first: Dependency | undefined,
15
+ second: Dependency | undefined,
16
+ ): Dependency | undefined =>
17
+ first === undefined
18
+ ? second
19
+ : second === undefined || first === second
20
+ ? first
21
+ : { value: -1, children: [first, second] };
22
+
23
+ // Breadth first and once per node, so a value that two leaves hold is listed twice.
24
+ export const getDependencyValues = (dependency: Dependency | undefined) => {
25
+ if (dependency === undefined) return [];
26
+ const todo = [dependency];
27
+ const marked = new Set(todo);
28
+ const values: number[] = [];
29
+ for (let head = 0; head < todo.length; head++) {
30
+ const current = todo[head];
31
+ if (current.children.length === 0) values.push(current.value);
32
+ for (const child of current.children)
33
+ if (!marked.has(child)) {
34
+ marked.add(child);
35
+ todo.push(child);
36
+ }
37
+ }
38
+ return values;
39
+ };
40
+
6
41
  interface Polarized {
7
42
  expr: number;
8
43
  isPositive: boolean;
9
44
  }
10
45
 
46
+ export const PRECISE = 0;
47
+ export const UNDER = 1;
48
+ export const OVER = 2;
49
+ const UNDER_OVER = 3;
50
+
51
+ export const PRECISION_NAMES = ["precise", "under", "over", "under-over"];
52
+
53
+ const getPrecisionUnion = (first: number, second: number) =>
54
+ first === PRECISE ? second : second === PRECISE || first === second ? first : UNDER_OVER;
55
+
56
+ // A definition of -1 hides the declaration.
57
+ export interface Definition {
58
+ decl: number;
59
+ def: number;
60
+ }
61
+
62
+ interface HiddenDecl {
63
+ decl: number;
64
+ }
65
+
66
+ interface Definitions {
67
+ definitions: Definition[];
68
+ }
69
+
70
+ interface ModelConversion {
71
+ convert: (model: ProtoModel) => ProtoModel;
72
+ }
73
+
11
74
  export class Goal {
12
75
  readonly forms: RefVector;
76
+ // Kept only while unsat cores are enabled.
77
+ dependencies: (Dependency | undefined)[] = [];
13
78
  isInconsistent = false;
79
+ depth = 0;
80
+ precision = PRECISE;
81
+ converters: (HiddenDecl | Definitions | ModelConversion)[] = [];
82
+ model: ProtoModel | undefined;
83
+ isProofsEnabled = false;
84
+ isCoresEnabled = false;
14
85
 
15
- constructor(private manager: AstManager) {
86
+ constructor(readonly manager: AstManager) {
16
87
  this.forms = new RefVector(manager);
17
88
  }
18
89
 
19
- // push_back: a false formula replaces the whole goal.
20
- private pushBack(form: number) {
90
+ copy() {
91
+ const copied = new Goal(this.manager);
92
+ copied.copyFrom(this);
93
+ return copied;
94
+ }
95
+
96
+ copyFrom(source: Goal) {
97
+ if (source === this) return;
98
+ this.forms.reset();
99
+ for (const form of source.forms.items) this.forms.push(form);
100
+ this.dependencies = [...source.dependencies];
101
+ this.depth = Math.max(this.depth, source.depth);
102
+ this.isInconsistent = source.isInconsistent;
103
+ this.precision = getPrecisionUnion(source.precision, this.precision);
104
+ this.converters = source.converters;
105
+ this.isProofsEnabled = source.isProofsEnabled;
106
+ this.isCoresEnabled = source.isCoresEnabled;
107
+ }
108
+
109
+ reset() {
110
+ this.forms.reset();
111
+ this.dependencies = [];
112
+ this.isInconsistent = false;
113
+ }
114
+
115
+ resetAll() {
116
+ this.reset();
117
+ this.depth = 0;
118
+ this.precision = PRECISE;
119
+ }
120
+
121
+ updatePrecision(precision: number) {
122
+ this.precision = getPrecisionUnion(this.precision, precision);
123
+ }
124
+
125
+ addConverter(decl: number) {
126
+ this.manager.incDeclRef(decl);
127
+ this.converters = [...this.converters, { decl }];
128
+ }
129
+
130
+ addDefinitions(definitions: Definition[]) {
131
+ for (const definition of definitions) {
132
+ this.manager.incDeclRef(definition.decl);
133
+ if (definition.def !== -1) this.manager.incRef(definition.def);
134
+ }
135
+ this.converters = [...this.converters, { definitions }];
136
+ }
137
+
138
+ addModelConversion(convert: (model: ProtoModel) => ProtoModel) {
139
+ this.converters = [...this.converters, { convert }];
140
+ }
141
+
142
+ getDependency(index: number) {
143
+ return this.dependencies[index];
144
+ }
145
+
146
+ isDecidedSat() {
147
+ return this.forms.size === 0 && (this.precision === PRECISE || this.precision === UNDER);
148
+ }
149
+
150
+ isDecidedUnsat() {
151
+ return this.isInconsistent && (this.precision === PRECISE || this.precision === OVER);
152
+ }
153
+
154
+ isDecided() {
155
+ return this.isDecidedSat() || this.isDecidedUnsat();
156
+ }
157
+
158
+ private pushBack(form: number, dependency: Dependency | undefined) {
21
159
  const manager = this.manager;
22
160
  if (manager.isTrue(form)) return;
23
161
  if (manager.isFalse(form)) {
24
162
  this.forms.reset();
163
+ this.dependencies = [];
25
164
  this.isInconsistent = true;
26
165
  }
27
166
  this.forms.push(form);
167
+ if (this.isCoresEnabled) this.dependencies.push(dependency);
28
168
  }
29
169
 
30
- // quick_process: splits conjunctions and negated disjunctions in order. With isSavingFirst, the
31
- // first conjunct is returned instead of added. The formula comes with a reference, and so does
32
- // the result. The negations it creates are held until it returns.
33
- private quickProcess(form: number, isSavingFirst: boolean) {
170
+ // The formula comes with a reference, and so does the result. The negations it creates are held
171
+ // until it returns.
172
+ private quickProcess(form: number, isSavingFirst: boolean, dependency: Dependency | undefined) {
34
173
  const manager = this.manager;
35
174
  const op = manager.getOp(form);
36
175
  if (
37
176
  op !== OP_AND &&
38
177
  !(manager.isNot(form) && manager.getOp(manager.getArg(form, 0)) === OP_OR)
39
178
  ) {
40
- if (!isSavingFirst) this.pushBack(form);
179
+ if (!isSavingFirst) this.pushBack(form, dependency);
41
180
  return form;
42
181
  }
43
182
  let first = form;
@@ -59,58 +198,61 @@ export class Goal {
59
198
  manager.decRef(first);
60
199
  first = leaf;
61
200
  isSaving = false;
62
- } else this.pushBack(leaf);
201
+ } else this.pushBack(leaf, dependency);
63
202
  }
64
203
  }
65
204
  created.reset();
66
205
  return first;
67
206
  }
68
207
 
69
- // assert_expr.
70
- assert(form: number) {
208
+ assert(form: number, dependency?: Dependency) {
71
209
  const manager = this.manager;
72
210
  manager.incRef(form);
73
211
  if (!this.isInconsistent) {
74
212
  manager.incRef(form);
75
- manager.decRef(this.quickProcess(form, false));
213
+ manager.decRef(this.quickProcess(form, false, dependency));
76
214
  }
77
215
  manager.decRef(form);
78
216
  }
79
217
 
80
- // update: the first conjunct replaces the formula and the others are added at the end. When the
81
- // first conjunct is false, Z3 adds the whole formula (goal.cpp:312), and this adds false, so the
82
- // goal becomes inconsistent.
83
- update(index: number, form: number) {
218
+ // When the first conjunct is false, Z3 adds the whole formula (goal.cpp:312), where this adds false.
219
+ update(index: number, form: number, dependency?: Dependency) {
84
220
  const manager = this.manager;
85
221
  if (this.isInconsistent) return;
86
222
  manager.incRef(form);
87
- const first = this.quickProcess(form, true);
223
+ const first = this.quickProcess(form, true, dependency);
88
224
  if (!this.isInconsistent) {
89
- if (manager.isFalse(first)) this.pushBack(first);
90
- else this.forms.set(index, first);
225
+ if (manager.isFalse(first)) this.pushBack(first, dependency);
226
+ else {
227
+ this.forms.set(index, first);
228
+ if (this.isCoresEnabled) this.dependencies[index] = dependency;
229
+ }
91
230
  }
92
231
  manager.decRef(first);
93
232
  }
94
233
 
95
- // shrink: drops the formulas from size on, the last one first.
96
234
  private shrink(size: number) {
97
235
  while (this.forms.size > size) this.forms.pop();
236
+ this.dependencies.length = Math.min(this.dependencies.length, size);
98
237
  }
99
238
 
100
- // elim_true.
101
239
  elimTrue() {
102
240
  const manager = this.manager;
103
241
  let kept = 0;
104
242
  for (const [index, form] of [...this.forms.items].entries()) {
105
243
  if (manager.isTrue(form)) continue;
106
- if (index !== kept) this.forms.set(kept, form);
244
+ if (index !== kept) this.move(index, kept, form);
107
245
  kept++;
108
246
  }
109
247
  this.shrink(kept);
110
248
  }
111
249
 
112
- // elim_redundancies: drops true and repeated literals, and finds a complementary pair. The marks
113
- // hold the literals until it returns.
250
+ private move(from: number, to: number, form: number) {
251
+ this.forms.set(to, form);
252
+ if (this.isCoresEnabled) this.dependencies[to] = this.dependencies[from];
253
+ }
254
+
255
+ // The marks hold the literals until it returns.
114
256
  elimRedundancies() {
115
257
  const manager = this.manager;
116
258
  if (this.isInconsistent) return;
@@ -124,11 +266,17 @@ export class Goal {
124
266
  const same = isNegated ? negatives : positives;
125
267
  if (same.items.includes(atom)) continue;
126
268
  if ((isNegated ? positives : negatives).items.includes(atom)) {
127
- this.pushBack(manager.falseExpr);
269
+ const complement = this.forms.items.findIndex((other) =>
270
+ isNegated ? other === atom : manager.isNot(other) && manager.getArg(other, 0) === atom,
271
+ );
272
+ this.pushBack(
273
+ manager.falseExpr,
274
+ joinDependencies(this.dependencies[complement], this.dependencies[index]),
275
+ );
128
276
  break;
129
277
  }
130
278
  same.push(atom);
131
- if (index !== kept) this.forms.set(kept, form);
279
+ if (index !== kept) this.move(index, kept, form);
132
280
  kept++;
133
281
  }
134
282
  if (!this.isInconsistent) this.shrink(kept);
@@ -0,0 +1,189 @@
1
+ import { SmtTacticError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_ARITH,
5
+ FAMILY_BASIC,
6
+ KIND_APP,
7
+ OP_AND,
8
+ OP_ATAN2,
9
+ OP_DISTINCT,
10
+ OP_EQ,
11
+ OP_FALSE,
12
+ OP_GE,
13
+ OP_IMPLIES,
14
+ OP_ITE,
15
+ OP_LE,
16
+ OP_NOT,
17
+ OP_OR,
18
+ OP_PI,
19
+ OP_TRUE,
20
+ OP_XOR,
21
+ SORT_BOOL,
22
+ SORT_INT,
23
+ SORT_REAL,
24
+ } from "./ast";
25
+ import { toPolynomial } from "./expr2polynomial";
26
+ import { getLcm } from "./rational";
27
+ import { flipKind } from "./nlsat/atoms";
28
+ import type { NlsatSolver } from "./nlsat/solver";
29
+ import { TRANSCENDENTAL_OPS } from "./nlsat/transcendental-eval";
30
+ import type { IneqKind } from "./nlsat/types";
31
+
32
+ export const goal2nlsat = (
33
+ manager: AstManager,
34
+ forms: readonly number[],
35
+ solver: NlsatSolver,
36
+ t2x: Map<number, number>,
37
+ a2b: Map<number, number>,
38
+ assumption: number | null,
39
+ isFactoring = true,
40
+ ) => {
41
+ const pm = solver.pm;
42
+
43
+ const mkVar = (term: number) => {
44
+ let variable = t2x.get(term);
45
+ if (variable === undefined) {
46
+ variable = solver.mkVar(manager.sorts[term] === SORT_INT);
47
+ t2x.set(term, variable);
48
+ }
49
+ return variable;
50
+ };
51
+
52
+ const processIneq = (atom: number, kind: IneqKind) => {
53
+ const lhs = toPolynomial(manager, pm, manager.getArg(atom, 0), mkVar);
54
+ const rhs = toPolynomial(manager, pm, manager.getArg(atom, 1), mkVar);
55
+ const lcm = getLcm(lhs.denominator, rhs.denominator);
56
+ const polynomial = pm.addmul(
57
+ lcm / lhs.denominator,
58
+ lhs.polynomial,
59
+ -(lcm / rhs.denominator),
60
+ rhs.polynomial,
61
+ );
62
+ if (pm.isConst(polynomial)) {
63
+ const sign = pm.isZero(polynomial) ? 0 : polynomial.as[0] > 0n ? 1 : -1;
64
+ const isTrue = kind === "EQ" ? sign === 0 : kind === "LT" ? sign < 0 : sign > 0;
65
+ return isTrue ? 0 : 1;
66
+ }
67
+ if (!isFactoring) return solver.mkIneqLiteral(kind, [polynomial], [false]);
68
+ const factors = pm.factor(polynomial);
69
+ return solver.mkIneqLiteral(
70
+ factors.constant < 0n ? flipKind(kind) : kind,
71
+ factors.factors,
72
+ factors.degrees.map((degree) => degree % 2 === 0),
73
+ );
74
+ };
75
+
76
+ const processBoolVar = (atom: number) => {
77
+ const existing = a2b.get(atom);
78
+ if (existing !== undefined) return 2 * existing;
79
+ const boolVar = solver.mkBoolVar();
80
+ a2b.set(atom, boolVar);
81
+ return 2 * boolVar;
82
+ };
83
+
84
+ const processAtom = (atom: number) => {
85
+ if (manager.kinds[atom] !== KIND_APP) return processBoolVar(atom);
86
+ const op = manager.getOp(atom);
87
+ const family = manager.getFamily(atom);
88
+ if (op === OP_EQ) {
89
+ const sort = manager.sorts[manager.getArg(atom, 0)];
90
+ return sort === SORT_INT || sort === SORT_REAL
91
+ ? processIneq(atom, "EQ")
92
+ : processBoolVar(atom);
93
+ }
94
+ if (op === OP_LE) return processIneq(atom, "GT") ^ 1;
95
+ if (op === OP_GE) return processIneq(atom, "LT") ^ 1;
96
+ if (family === FAMILY_BASIC) {
97
+ if (op === OP_TRUE || op === OP_FALSE)
98
+ throw new SmtTacticError("apply simplify before applying nlsat");
99
+ if ([OP_AND, OP_OR, OP_XOR, OP_NOT, OP_IMPLIES, OP_ITE].includes(op))
100
+ throw new SmtTacticError("convert goal into cnf before applying nlsat");
101
+ if (op === OP_DISTINCT)
102
+ throw new SmtTacticError(
103
+ "eliminate distinct operator (use tactic '(using-params simplify :blast-distinct true)') before applying nlsat",
104
+ );
105
+ }
106
+ if (family === FAMILY_ARITH)
107
+ throw new SmtTacticError("apply purify-arith before applying nlsat");
108
+ return processBoolVar(atom);
109
+ };
110
+
111
+ const processLiteral = (form: number) => {
112
+ let atom = form;
113
+ let isNeg = false;
114
+ while (manager.isNot(atom)) {
115
+ atom = manager.getArg(atom, 0);
116
+ isNeg = !isNeg;
117
+ }
118
+ const literal = processAtom(atom);
119
+ return isNeg ? literal ^ 1 : literal;
120
+ };
121
+
122
+ if (forms.some((form) => hasTermIte(manager, form)))
123
+ throw new SmtTacticError("eliminate term-ite before applying nlsat");
124
+ for (const form of forms) {
125
+ const literals = manager.getOp(form) === OP_OR ? manager.getArgs(form) : [form];
126
+ solver.mkExternalClause(literals.map(processLiteral), assumption);
127
+ }
128
+
129
+ // The polynomial conversion treats a transcendental application, argument included, as one
130
+ // variable, so its argument gets a variable here, through an equation unless it is one already.
131
+ const mkArgVar = (term: number) => {
132
+ const result = toPolynomial(manager, pm, term, mkVar);
133
+ const polynomial = result.polynomial;
134
+ const monomial = polynomial.ms[0];
135
+ if (
136
+ result.denominator === 1n &&
137
+ polynomial.ms.length === 1 &&
138
+ polynomial.as[0] === 1n &&
139
+ monomial.size === 1 &&
140
+ monomial.degrees[0] === 1
141
+ )
142
+ return monomial.vars[0];
143
+ const variable = solver.mkVar(false);
144
+ const equation = pm.addmul(result.denominator, pm.mkVar(variable), -1n, polynomial);
145
+ solver.mkExternalClause([solver.mkIneqLiteral("EQ", [equation], [false])], null);
146
+ return variable;
147
+ };
148
+
149
+ // An argument can bring in applications nested inside it, so this repeats to a fixed point.
150
+ const seen = new Set<number>();
151
+ let piVar: number | undefined;
152
+ for (let isChanged = true; isChanged;) {
153
+ const found = [...t2x].filter(
154
+ (entry) =>
155
+ !seen.has(entry[0]) &&
156
+ manager.kinds[entry[0]] === KIND_APP &&
157
+ manager.getFamily(entry[0]) === FAMILY_ARITH,
158
+ );
159
+ const atan2Found = found.filter((entry) => manager.getOp(entry[0]) === OP_ATAN2);
160
+ piVar = found.find((entry) => manager.getOp(entry[0]) === OP_PI)?.[1] ?? piVar;
161
+ isChanged = false;
162
+ for (const [term, variable] of found) {
163
+ const op = TRANSCENDENTAL_OPS.get(manager.getOp(term));
164
+ if (op === undefined) continue;
165
+ seen.add(term);
166
+ solver.transcendentals.add(op, mkArgVar(manager.getArg(term, 0)), variable);
167
+ isChanged = true;
168
+ }
169
+ for (const [term, variable] of atan2Found) {
170
+ seen.add(term);
171
+ const y = mkArgVar(manager.getArg(term, 0));
172
+ solver.transcendentals.addAtan2(y, mkArgVar(manager.getArg(term, 1)), variable);
173
+ isChanged = true;
174
+ }
175
+ }
176
+ if (piVar !== undefined) solver.transcendentals.addPi(piVar);
177
+ };
178
+
179
+ const hasTermIte = (manager: AstManager, form: number) => {
180
+ const seen = new Set<number>();
181
+ const todo = [form];
182
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
183
+ if (seen.has(expr) || manager.kinds[expr] !== KIND_APP) continue;
184
+ seen.add(expr);
185
+ if (manager.getOp(expr) === OP_ITE && manager.sorts[expr] !== SORT_BOOL) return true;
186
+ manager.pushArgs(expr, todo);
187
+ }
188
+ return false;
189
+ };
@@ -0,0 +1,219 @@
1
+ import {
2
+ type AstManager,
3
+ OP_AND,
4
+ OP_EQ,
5
+ OP_NOT,
6
+ OP_OR,
7
+ SORT_BOOL,
8
+ SORT_INT,
9
+ SORT_REAL,
10
+ } from "./ast";
11
+ import { assign, release } from "./expr-ref";
12
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
13
+ import { Rational } from "./rational";
14
+ import { RefVector } from "./ref-vector";
15
+ import {
16
+ type RangePredicate,
17
+ guardToRangePredicate,
18
+ intersectRanges,
19
+ mkTopRange,
20
+ } from "./seq-range-predicate";
21
+
22
+ export interface GuardSetEval {
23
+ status: number;
24
+ witness: number;
25
+ }
26
+
27
+ export class GuardSetCache {
28
+ private ranges = new Map<number, RangePredicate | undefined>();
29
+ private trail: RefVector;
30
+
31
+ constructor(manager: AstManager) {
32
+ this.trail = new RefVector(manager);
33
+ }
34
+
35
+ reset() {
36
+ this.ranges.clear();
37
+ this.trail.reset();
38
+ }
39
+
40
+ maybeReset(cap: number) {
41
+ if (this.ranges.size > cap) this.reset();
42
+ }
43
+
44
+ has(guard: number) {
45
+ return this.ranges.has(guard);
46
+ }
47
+
48
+ get(guard: number) {
49
+ return this.ranges.get(guard);
50
+ }
51
+
52
+ insert(guard: number, ranges: RangePredicate | undefined) {
53
+ this.trail.push(guard);
54
+ this.ranges.set(guard, ranges);
55
+ }
56
+ }
57
+
58
+ export class GuardSet {
59
+ private isChar: boolean;
60
+ private isOk = true;
61
+ private ranges: RangePredicate;
62
+ private guard = -1;
63
+
64
+ constructor(
65
+ private manager: AstManager,
66
+ private sort: number,
67
+ private variable: number,
68
+ private cache?: GuardSetCache,
69
+ ) {
70
+ this.isChar = manager.isCharSort(sort);
71
+ this.ranges = this.isChar ? mkTopRange(manager) : [];
72
+ if (!this.isChar) this.guard = assign(manager, -1, manager.trueExpr);
73
+ }
74
+
75
+ release() {
76
+ release(this.manager, this.guard);
77
+ this.guard = -1;
78
+ }
79
+
80
+ clone() {
81
+ const copy = new GuardSet(this.manager, this.sort, this.variable, this.cache);
82
+ copy.isOk = this.isOk;
83
+ copy.ranges = this.ranges;
84
+ if (!this.isChar) copy.guard = assign(this.manager, copy.guard, this.guard);
85
+ return copy;
86
+ }
87
+
88
+ conjoin(guard: number) {
89
+ const manager = this.manager;
90
+ if (!this.isOk) return;
91
+ if (!this.isChar) {
92
+ this.guard = assign(
93
+ manager,
94
+ this.guard,
95
+ manager.mkApp(OP_AND, [this.guard, guard], SORT_BOOL),
96
+ );
97
+ return;
98
+ }
99
+ const cache = this.cache;
100
+ if (cache !== undefined) {
101
+ if (!cache.has(guard))
102
+ cache.insert(guard, guardToRangePredicate(manager, this.variable, guard));
103
+ const cached = cache.get(guard);
104
+ if (cached === undefined) {
105
+ this.isOk = false;
106
+ return;
107
+ }
108
+ this.ranges = intersectRanges(this.ranges, cached);
109
+ return;
110
+ }
111
+ const ranges = guardToRangePredicate(manager, this.variable, guard);
112
+ if (ranges === undefined) this.isOk = false;
113
+ else this.ranges = intersectRanges(this.ranges, ranges);
114
+ }
115
+
116
+ eval(isWitnessWanted: boolean): GuardSetEval {
117
+ if (!this.isOk) return { status: L_UNDEF, witness: -1 };
118
+ if (!this.isChar) return this.evalGeneric(isWitnessWanted);
119
+ if (this.ranges.length === 0) return { status: L_FALSE, witness: -1 };
120
+ return {
121
+ status: L_TRUE,
122
+ witness: isWitnessWanted ? this.manager.mkChar(this.ranges[0]) : -1,
123
+ };
124
+ }
125
+
126
+ private collectConsts(guard: number, consts: number[]) {
127
+ const manager = this.manager;
128
+ const op = manager.getOp(guard);
129
+ if (op === OP_AND || op === OP_OR) {
130
+ for (const arg of manager.getArgs(guard)) this.collectConsts(arg, consts);
131
+ return;
132
+ }
133
+ if (op === OP_NOT) {
134
+ this.collectConsts(manager.getArg(guard, 0), consts);
135
+ return;
136
+ }
137
+ if (op !== OP_EQ) return;
138
+ const first = manager.getArg(guard, 0);
139
+ const second = manager.getArg(guard, 1);
140
+ if (first === this.variable && second !== this.variable) consts.push(second);
141
+ else if (second === this.variable && first !== this.variable) consts.push(first);
142
+ }
143
+
144
+ private evalAt(guard: number, candidate: number): number {
145
+ const manager = this.manager;
146
+ if (manager.isTrue(guard)) return L_TRUE;
147
+ if (manager.isFalse(guard)) return L_FALSE;
148
+ const op = manager.getOp(guard);
149
+ if (op === OP_NOT) return -this.evalAt(manager.getArg(guard, 0), candidate);
150
+ if (op === OP_AND || op === OP_OR) {
151
+ const absorbing = op === OP_AND ? L_FALSE : L_TRUE;
152
+ let result = -absorbing;
153
+ for (const arg of manager.getArgs(guard)) {
154
+ const value = this.evalAt(arg, candidate);
155
+ if (value === absorbing) return absorbing;
156
+ if (value === L_UNDEF) result = L_UNDEF;
157
+ }
158
+ return result;
159
+ }
160
+ if (op !== OP_EQ) return L_UNDEF;
161
+ const first = manager.getArg(guard, 0);
162
+ const second = manager.getArg(guard, 1);
163
+ const other = first === this.variable ? second : second === this.variable ? first : -1;
164
+ if (other === -1) return L_UNDEF;
165
+ if (other === this.variable) return L_TRUE;
166
+ return candidate === other ? L_TRUE : L_FALSE;
167
+ }
168
+
169
+ private mkFresh(consts: number[]) {
170
+ const manager = this.manager;
171
+ const sort = this.sort;
172
+ if (sort === SORT_BOOL) {
173
+ if (!consts.some((expr) => manager.isTrue(expr))) return manager.trueExpr;
174
+ if (!consts.some((expr) => manager.isFalse(expr))) return manager.falseExpr;
175
+ return -1;
176
+ }
177
+ if (sort === SORT_INT || sort === SORT_REAL) {
178
+ let max: Rational | undefined;
179
+ for (const expr of consts) {
180
+ if (!manager.isNumeral(expr)) continue;
181
+ const value = manager.getRationalValue(expr);
182
+ if (max === undefined || value.compare(max) > 0) max = value;
183
+ }
184
+ return manager.mkNumeralOfSort(
185
+ max === undefined ? Rational.zero : max.add(Rational.one),
186
+ sort,
187
+ );
188
+ }
189
+ if (!manager.isBvSort(sort)) return -1;
190
+ const width = manager.getBvSize(sort);
191
+ for (let candidate = 0n; candidate <= BigInt(consts.length); candidate++)
192
+ if (
193
+ !consts.some(
194
+ (expr) => manager.isBvNumeral(expr) && manager.getBvNumeralValue(expr) === candidate,
195
+ )
196
+ )
197
+ return manager.mkBvNumeral(candidate, width);
198
+ return -1;
199
+ }
200
+
201
+ private evalGeneric(isWitnessWanted: boolean): GuardSetEval {
202
+ const consts: number[] = [];
203
+ this.collectConsts(this.guard, consts);
204
+ let isUndefined = false;
205
+ for (const candidate of consts) {
206
+ const value = this.evalAt(this.guard, candidate);
207
+ if (value === L_TRUE) return { status: L_TRUE, witness: isWitnessWanted ? candidate : -1 };
208
+ if (value === L_UNDEF) isUndefined = true;
209
+ }
210
+ const fresh = this.mkFresh(consts);
211
+ if (fresh === -1) isUndefined = true;
212
+ else {
213
+ const value = this.evalAt(this.guard, fresh);
214
+ if (value === L_TRUE) return { status: L_TRUE, witness: isWitnessWanted ? fresh : -1 };
215
+ if (value === L_UNDEF) isUndefined = true;
216
+ }
217
+ return { status: isUndefined ? L_UNDEF : L_FALSE, witness: -1 };
218
+ }
219
+ }