tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0

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 (631) hide show
  1. package/README.md +8 -0
  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 +121 -12
  8. package/dist/index.d.ts +121 -12
  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 +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -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 +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  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 +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  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 +121 -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 +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  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 +226 -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 +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  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 +34 -77
  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 +4 -47
  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 +26 -31
  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 +1021 -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 +626 -56
  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 +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -1,68 +1,159 @@
1
- // Ported from Z3 (src/smt/smt_solver.cpp, src/smt/smt_kernel.cpp, src/smt/smt_setup.cpp), MIT
2
- // license, see z3-license.txt. Decides an SMT-LIB problem the way `z3 -smt2 AUTO_CONFIG=false
3
- // smt.MBQI=true` does for tlapm's UFNIA obligations.
4
- import { isStackOverflow, SmtCanceledError, SmtUnsupportedError } from "../../../errors";
1
+ // The solver decides like `z3 -smt2 AUTO_CONFIG=false smt.MBQI=true`.
2
+ import {
3
+ isStackOverflow,
4
+ SmtCanceledError,
5
+ type SmtParseError,
6
+ SmtUnsupportedError,
7
+ } from "../../../errors";
5
8
  import type { DecideOptions, Verdict } from "../../verdict";
6
9
  import { AssertedFormulas } from "./asserted-formulas";
7
10
  import { AstManager } from "./ast";
8
- import { Context } from "./context";
9
- import { L_FALSE, L_TRUE } from "./lbool";
11
+ import { Context, MBQI_MAX_ITERATIONS } from "./context";
12
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
10
13
  import { applyUfniaTactic } from "./quant-tactics";
11
14
  import { ResourceLimit } from "./rlimit";
12
15
  import { parseSmtlib } from "./smtlib-parser";
16
+ import type { SmtSetup } from "./smt-setup";
17
+
18
+ export interface KernelParams {
19
+ isMbqi: boolean;
20
+ mbqiMaxIterations: number;
21
+ isFindingMacros: boolean;
22
+ relevancyLevel?: 0 | 2;
23
+ isCoreMinimizing?: boolean;
24
+ randomSeed?: number;
25
+ // A kernel without a setup runs as with auto_config false.
26
+ setup?: SmtSetup;
27
+ }
28
+
29
+ const DEFAULT_KERNEL_PARAMS: KernelParams = {
30
+ isMbqi: true,
31
+ mbqiMaxIterations: MBQI_MAX_ITERATIONS,
32
+ isFindingMacros: false,
33
+ };
34
+
35
+ const assertForms = (context: Context, asserted: AssertedFormulas, forms: number[]) => {
36
+ for (const form of forms) if (!context.checkCanceled()) asserted.assertExpr(form);
37
+ return !context.checkCanceled();
38
+ };
13
39
 
14
40
  interface SmtCheck {
15
41
  verdict: Verdict;
16
42
  numInstances: number;
17
43
  }
18
44
 
19
- // The verdict, and the number of quantifier instances the search made.
20
- export const checkSmt = (text: string, options: DecideOptions): SmtCheck => {
45
+ // The context makes its asserted formulas first, and asserts the formulas. It makes the theories
46
+ // next, before the formulas are reduced.
47
+ export const solveGoal = (manager: AstManager, forms: number[], params: KernelParams) => {
48
+ const asserted = new AssertedFormulas(manager, params.isFindingMacros);
49
+ const context = new Context(manager, {
50
+ isMbqi: params.isMbqi,
51
+ mbqiMaxIterations: params.mbqiMaxIterations,
52
+ relevancyLevel: 2,
53
+ randomSeed: params.randomSeed,
54
+ });
55
+ if (!assertForms(context, asserted, forms)) {
56
+ manager.limit.release();
57
+ return { result: L_UNDEF, context, reasonUnknown: "canceled" };
58
+ }
59
+ context.setupContext(params.setup, true, asserted);
60
+ context.internalizeAssertions(asserted);
61
+ const theoryAssumptions: number[] = [];
62
+ context.addTheoryAssumptions(theoryAssumptions);
63
+ const result =
64
+ theoryAssumptions.length === 0 ? context.search() : context.checkResearching(asserted, []);
65
+ manager.limit.release();
66
+ return { result, context };
67
+ };
68
+
69
+ export const solveAssertions = (
70
+ manager: AstManager,
71
+ assertions: number[],
72
+ params = DEFAULT_KERNEL_PARAMS,
73
+ ) => {
74
+ const goal = applyUfniaTactic(manager, assertions);
75
+ if (goal.isInconsistent || goal.forms.size === 0) {
76
+ manager.limit.release();
77
+ return { result: goal.isInconsistent ? L_FALSE : L_TRUE, context: undefined };
78
+ }
79
+ return solveGoal(manager, goal.forms.items, params);
80
+ };
81
+
82
+ // combined_solver searches with its incremental smt kernel, without the tactic, once the check has
83
+ // assumptions.
84
+ export const solveAssuming = (
85
+ manager: AstManager,
86
+ assertions: number[],
87
+ assumptions: number[],
88
+ params = DEFAULT_KERNEL_PARAMS,
89
+ ) => {
90
+ const asserted = new AssertedFormulas(manager, params.isFindingMacros);
91
+ const context = new Context(manager, {
92
+ isMbqi: params.isMbqi,
93
+ mbqiMaxIterations: params.mbqiMaxIterations,
94
+ relevancyLevel: 2,
95
+ randomSeed: params.randomSeed,
96
+ });
97
+ if (!assertForms(context, asserted, assertions)) {
98
+ manager.limit.release();
99
+ return { result: L_UNDEF, context, reasonUnknown: "canceled" };
100
+ }
101
+ context.setupContext(params.setup, false, asserted);
102
+ context.internalizeAssertions(asserted);
103
+ const result = context.checkResearching(asserted, assumptions);
104
+ manager.limit.release();
105
+ return { result, context };
106
+ };
107
+
108
+ export const getVerdict = (result: number): Verdict =>
109
+ result === L_FALSE ? "unsat" : result === L_TRUE ? "sat" : "unknown";
110
+
111
+ const rethrow = (error: SmtParseError) => {
112
+ throw error;
113
+ };
114
+
115
+ export const checkSmt = (
116
+ text: string,
117
+ options: DecideOptions,
118
+ report: (error: SmtParseError) => void = rethrow,
119
+ ): SmtCheck => {
21
120
  const manager = new AstManager(
22
121
  new ResourceLimit(Date.now() + options.timeLimitMs, options.signal),
23
122
  );
24
- // The limit stops watching the collector however the check ends, as an unsupported input or a
25
- // problem without check-sat ends it early.
26
123
  try {
27
- // combined_solver gives each assertion to the incremental smt kernel as well, which rewrites it
28
- // when it is asserted and keeps it, though check-sat then runs the tactic on the assertions. The
29
- // kernel's model finder counts a step of the resource limit when it is made, and
30
- // solver::assert_expr counts one for each assertion.
31
124
  const incremental = new AssertedFormulas(manager);
32
125
  manager.limit.inc();
33
- const problem = parseSmtlib(text, manager, (assertion) => {
34
- manager.limit.inc();
35
- incremental.assertExpr(assertion);
36
- });
126
+ const problem = parseSmtlib(
127
+ text,
128
+ manager,
129
+ (assertion) => {
130
+ manager.limit.inc();
131
+ incremental.assertExpr(assertion);
132
+ },
133
+ report,
134
+ );
37
135
  if (!problem.hasCheckSat) return { verdict: "unknown", numInstances: 0 };
38
- const goal = applyUfniaTactic(manager, problem.assertions);
39
- // and_then runs smt_tactic only on a goal that the preprocessing left undecided.
40
- if (goal.isInconsistent || goal.forms.size === 0) {
41
- return { verdict: goal.isInconsistent ? "unsat" : "sat", numInstances: 0 };
42
- }
43
- // smt_tactic makes the context, which makes its asserted formulas first, and asserts the goal.
44
- // setup_context then makes the theories, before the formulas are reduced.
45
- const asserted = new AssertedFormulas(manager);
46
- const context = new Context(manager, { isMbqi: true, relevancyLevel: 2 });
47
- for (const assertion of goal.forms.items) asserted.assertExpr(assertion);
48
- context.setupContext();
49
- context.internalizeAssertions(asserted);
50
- const result = context.search();
136
+ // cmd_context::check_sat bounds the steps of the search by the rlimit from the count so far.
137
+ manager.limit.push(problem.rlimit);
138
+ const solved = solveAssertions(manager, problem.assertions);
51
139
  return {
52
- verdict: result === L_FALSE ? "unsat" : result === L_TRUE ? "sat" : "unknown",
53
- numInstances: context.qmanager.getNumInstances(),
140
+ verdict: getVerdict(solved.result),
141
+ numInstances: solved.context?.qmanager.getNumInstances() ?? 0,
54
142
  };
55
143
  } finally {
56
144
  manager.limit.release();
57
145
  }
58
146
  };
59
147
 
60
- // Throws SmtParseError on malformed input. Input outside the subset the solver supports is unknown,
61
- // and so is a search that runs past the time limit, that the signal aborts, or that exhausts the
62
- // heap or the stack.
63
- export const decideSmt = (text: string, options: DecideOptions): Verdict => {
148
+ // report gets each SmtParseError, and Z3 goes on past one only when report returns. Anything else
149
+ // it cannot decide is unknown.
150
+ export const decideSmt = (
151
+ text: string,
152
+ options: DecideOptions,
153
+ report: (error: SmtParseError) => void = rethrow,
154
+ ): Verdict => {
64
155
  try {
65
- return checkSmt(text, options).verdict;
156
+ return checkSmt(text, options, report).verdict;
66
157
  } catch (error) {
67
158
  if (
68
159
  error instanceof SmtUnsupportedError ||
@@ -1,6 +1,4 @@
1
- // Array.prototype.sort copies its array before sorting, which makes most of the garbage of short
2
- // clauses and disjunctions. Insertion sort is stable like it and sorts a short array in place, so
3
- // both give the same order.
1
+ // Array.prototype.sort copies its array before sorting, so a short array is insertion sorted in place, which is stable too.
4
2
  const MAX_INSERTION_SORT_LENGTH = 16;
5
3
 
6
4
  export const sortByKey = (values: number[], getKey: (value: number) => number) => {
@@ -18,8 +16,6 @@ export const sortByKey = (values: number[], getKey: (value: number) => number) =
18
16
  }
19
17
  };
20
18
 
21
- // std::sort of literals: sortByKey with the number as its key, which a call site of its own keeps
22
- // cheap.
23
19
  export const sortNumbers = (values: number[]) => {
24
20
  if (values.length > MAX_INSERTION_SORT_LENGTH) {
25
21
  values.sort((first, second) => first - second);
@@ -0,0 +1,314 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_ARITH,
4
+ FAMILY_ARRAY,
5
+ FAMILY_BASIC,
6
+ FAMILY_BV,
7
+ FAMILY_FPA,
8
+ FAMILY_LABEL,
9
+ FAMILY_MODEL_VALUE,
10
+ FAMILY_USER,
11
+ OP_ADD,
12
+ OP_AND,
13
+ OP_DIV,
14
+ OP_EQ,
15
+ OP_GE,
16
+ OP_IDIV,
17
+ OP_IMPLIES,
18
+ OP_ITE,
19
+ OP_LE,
20
+ OP_MOD,
21
+ OP_MUL,
22
+ OP_NOT,
23
+ OP_OR,
24
+ OP_REM,
25
+ OP_SELECT,
26
+ OP_STORE,
27
+ OP_XOR,
28
+ SORT_INT,
29
+ SORT_REAL,
30
+ } from "./ast";
31
+ import { Rational } from "./rational";
32
+
33
+ export interface StaticFeatures {
34
+ isCnf: boolean;
35
+ numClauses: number;
36
+ numBinClauses: number;
37
+ numUnits: number;
38
+ numQuantifiers: number;
39
+ numQuantifiersWithPatterns: number;
40
+ numBoolConstants: number;
41
+ maxIteTreeDepth: number;
42
+ numIteTerms: number;
43
+ numUninterpretedConstants: number;
44
+ numUninterpretedFunctions: number;
45
+ hasRational: boolean;
46
+ hasInt: boolean;
47
+ hasReal: boolean;
48
+ hasBv: boolean;
49
+ hasFpa: boolean;
50
+ hasArrays: boolean;
51
+ hasExtArrays: boolean;
52
+ arithKSum: Rational;
53
+ numArithTerms: number;
54
+ numArithEqs: number;
55
+ numArithIneqs: number;
56
+ numDiffTerms: number;
57
+ numDiffEqs: number;
58
+ numDiffIneqs: number;
59
+ numNonLinear: number;
60
+ numTheories: number;
61
+ }
62
+
63
+ interface ToProcess {
64
+ expr: number;
65
+ isIteContext: boolean;
66
+ }
67
+
68
+ const MINUS_ONE = Rational.of(-1n);
69
+ const GATE_OPS = new Set([OP_ITE, OP_AND, OP_OR, OP_XOR, OP_IMPLIES, OP_EQ]);
70
+ const DIV_OPS = new Set([OP_DIV, OP_IDIV, OP_REM, OP_MOD]);
71
+ const BUILTIN_FAMILIES = new Set([FAMILY_BASIC, FAMILY_USER, FAMILY_MODEL_VALUE, FAMILY_LABEL]);
72
+
73
+ export const isDense = (features: StaticFeatures) =>
74
+ features.numUninterpretedConstants < 1000 &&
75
+ features.numArithEqs + features.numArithIneqs > features.numUninterpretedConstants * 9;
76
+
77
+ export const collectStaticFeatures = (
78
+ manager: AstManager,
79
+ formulas: readonly number[],
80
+ ): StaticFeatures => {
81
+ const features = {
82
+ isCnf: true,
83
+ numClauses: 0,
84
+ numBinClauses: 0,
85
+ numUnits: 0,
86
+ numQuantifiers: 0,
87
+ numQuantifiersWithPatterns: 0,
88
+ numBoolConstants: 0,
89
+ maxIteTreeDepth: 0,
90
+ numIteTerms: 0,
91
+ numUninterpretedConstants: 0,
92
+ numUninterpretedFunctions: 0,
93
+ hasRational: false,
94
+ hasInt: false,
95
+ hasReal: false,
96
+ hasBv: false,
97
+ hasFpa: false,
98
+ hasArrays: false,
99
+ hasExtArrays: false,
100
+ arithKSum: Rational.zero,
101
+ numArithTerms: 0,
102
+ numArithEqs: 0,
103
+ numArithIneqs: 0,
104
+ numDiffTerms: 0,
105
+ numDiffEqs: 0,
106
+ numDiffIneqs: 0,
107
+ numNonLinear: 0,
108
+ };
109
+ const theories = new Set<number>();
110
+ const markTheory = (family: number) => {
111
+ if (!BUILTIN_FAMILIES.has(family)) theories.add(family);
112
+ };
113
+ const isArithExpr = (expr: number) =>
114
+ manager.isApp(expr) && manager.getFamily(expr) === FAMILY_ARITH;
115
+ const isIte = (expr: number) => manager.getOp(expr) === OP_ITE;
116
+ const isBinary = (expr: number, op: number) =>
117
+ manager.getOp(expr) === op && manager.getNumArgs(expr) === 2;
118
+ const isGate = (expr: number) =>
119
+ manager.isApp(expr) &&
120
+ manager.getFamily(expr) === FAMILY_BASIC &&
121
+ GATE_OPS.has(manager.getOp(expr));
122
+ const accNum = (value: Rational) => {
123
+ features.arithKSum = features.arithKSum.add(value.abs());
124
+ };
125
+ const accNumeral = (expr: number) => {
126
+ if (manager.isNumeral(expr)) accNum(manager.getRationalValue(expr));
127
+ };
128
+ // is_diff_term: a term x or (+ k x), with the k it adds.
129
+ const getDiffTermConstant = (expr: number) => {
130
+ if (!isArithExpr(expr)) return Rational.zero;
131
+ if (manager.isNumeral(expr)) return manager.getRationalValue(expr);
132
+ if (!isBinary(expr, OP_ADD)) return undefined;
133
+ const constant = manager.getArg(expr, 0);
134
+ const term = manager.getArg(expr, 1);
135
+ return manager.isNumeral(constant) && !isArithExpr(term) && !isIte(term)
136
+ ? manager.getRationalValue(constant)
137
+ : undefined;
138
+ };
139
+ const isMinusOneTimes = (term: number, other: number) => {
140
+ if (isArithExpr(other) || !isBinary(term, OP_MUL)) return false;
141
+ const coefficient = manager.getArg(term, 0);
142
+ const factor = manager.getArg(term, 1);
143
+ return (
144
+ manager.isNumeral(coefficient) &&
145
+ manager.getRationalValue(coefficient).equals(MINUS_ONE) &&
146
+ !isArithExpr(factor) &&
147
+ !isIte(factor)
148
+ );
149
+ };
150
+ // An atom x <= k, x = k or x - y <= k, with the subtraction written as (+ x (* -1 y)).
151
+ const isDiffAtom = (expr: number) => {
152
+ const lhs = manager.getArg(expr, 0);
153
+ const rhs = manager.getArg(expr, 1);
154
+ if (!isArithExpr(lhs) && !isArithExpr(rhs) && !isIte(lhs) && !isIte(rhs)) return true;
155
+ if (!manager.isNumeral(rhs)) return false;
156
+ if (!isArithExpr(lhs) && !isIte(lhs)) return true;
157
+ if (!isBinary(lhs, OP_ADD)) return false;
158
+ const first = manager.getArg(lhs, 0);
159
+ const second = manager.getArg(lhs, 1);
160
+ return isMinusOneTimes(second, first) || isMinusOneTimes(first, second);
161
+ };
162
+ const countArithTerm = (expr: number) => {
163
+ features.numArithTerms++;
164
+ const constant = getDiffTermConstant(expr);
165
+ if (constant === undefined) return;
166
+ features.numDiffTerms++;
167
+ accNum(constant);
168
+ };
169
+ const updateSort = (sort: number) => {
170
+ const family = manager.getSortFamily(sort);
171
+ markTheory(family);
172
+ features.hasInt ||= sort === SORT_INT;
173
+ features.hasReal ||= sort === SORT_REAL;
174
+ features.hasBv ||= family === FAMILY_BV;
175
+ features.hasFpa ||= family === FAMILY_FPA;
176
+ if (family !== FAMILY_ARRAY) return;
177
+ features.hasArrays = true;
178
+ for (const parameter of manager.getSortParameters(sort)) updateSort(parameter);
179
+ };
180
+ const uninterpretedDecls = new Set<number>();
181
+ const update = (expr: number) => {
182
+ const sort = manager.sorts[expr];
183
+ updateSort(sort);
184
+ const op = manager.getOp(expr);
185
+ const family = manager.getFamily(expr);
186
+ const isBool = manager.isBool(expr);
187
+ const isExprGate = isGate(expr);
188
+ if (isExprGate) features.isCnf = false;
189
+ if (op === OP_ITE && !isBool) {
190
+ features.numIteTerms++;
191
+ for (const arg of [manager.getArg(expr, 1), manager.getArg(expr, 2)]) {
192
+ accNumeral(arg);
193
+ if (manager.getSortFamily(manager.sorts[arg]) === FAMILY_ARITH) countArithTerm(arg);
194
+ }
195
+ }
196
+ if (isBool && manager.isApp(expr) && manager.getNumArgs(expr) === 0)
197
+ features.numBoolConstants++;
198
+ features.hasExtArrays ||=
199
+ manager.getSortFamily(sort) === FAMILY_ARRAY && op !== OP_SELECT && op !== OP_STORE;
200
+ if (!manager.isApp(expr)) {
201
+ features.numQuantifiers++;
202
+ if (manager.getQuantifier(expr).patterns.length > 0) features.numQuantifiersWithPatterns++;
203
+ return;
204
+ }
205
+ if (family === FAMILY_ARITH && (op === OP_LE || op === OP_GE)) {
206
+ features.numArithIneqs++;
207
+ if (isDiffAtom(expr)) features.numDiffIneqs++;
208
+ accNumeral(manager.getArg(expr, 1));
209
+ }
210
+ if (manager.isNumeral(expr) && !manager.getRationalValue(expr).isInt())
211
+ features.hasRational = true;
212
+ if (op === OP_EQ && manager.isNumeral(manager.getArg(expr, 1))) {
213
+ accNumeral(manager.getArg(expr, 1));
214
+ features.numArithEqs++;
215
+ if (isDiffAtom(expr)) features.numDiffEqs++;
216
+ }
217
+ markTheory(family);
218
+ if (
219
+ family === FAMILY_ARITH &&
220
+ op === OP_MUL &&
221
+ (!manager.isNumeral(manager.getArg(expr, 0)) || manager.getNumArgs(expr) > 2)
222
+ )
223
+ features.numNonLinear++;
224
+ if (family === FAMILY_ARITH && DIV_OPS.has(op)) {
225
+ const divisor = manager.getArg(expr, 1);
226
+ if (!manager.isNumeral(divisor) || manager.getRationalValue(divisor).isZero()) {
227
+ features.numUninterpretedFunctions++;
228
+ features.numNonLinear++;
229
+ }
230
+ }
231
+ if (family === FAMILY_USER && manager.getNumArgs(expr) === 0)
232
+ features.numUninterpretedConstants++;
233
+ if (family === FAMILY_USER && manager.getNumArgs(expr) > 0) {
234
+ const decl = manager.getDeclId(expr);
235
+ if (!uninterpretedDecls.has(decl)) features.numUninterpretedFunctions++;
236
+ uninterpretedDecls.add(decl);
237
+ }
238
+ // An argument of another theory is an alien term.
239
+ if (isExprGate || family === FAMILY_ARITH) return;
240
+ for (const arg of manager.getArgs(expr))
241
+ if (manager.getSortFamily(manager.sorts[arg]) === FAMILY_ARITH) countArithTerm(arg);
242
+ };
243
+ const stripNot = (expr: number) =>
244
+ manager.getOp(expr) === OP_NOT ? manager.getArg(expr, 0) : expr;
245
+ const preProcessed = new Set<number>();
246
+ const postProcessed = new Set<number>();
247
+ const iteDepths = new Map<number, number>();
248
+ const todo: ToProcess[] = [];
249
+ // pre_process: whether every child is done, so that the expression can be post-processed.
250
+ const preProcess = (expr: number) => {
251
+ if (postProcessed.has(expr) || preProcessed.has(expr)) return true;
252
+ preProcessed.add(expr);
253
+ if (manager.isVar(expr)) {
254
+ postProcessed.add(expr);
255
+ return true;
256
+ }
257
+ update(expr);
258
+ if (!manager.isApp(expr)) {
259
+ const body = manager.getQuantifier(expr).body;
260
+ if (postProcessed.has(body)) return true;
261
+ todo.push({ expr: body, isIteContext: false });
262
+ return false;
263
+ }
264
+ const isIteContext = isIte(expr);
265
+ let isAllProcessed = true;
266
+ for (const arg of manager.getArgs(expr)) {
267
+ const child = stripNot(arg);
268
+ if (postProcessed.has(child)) continue;
269
+ todo.push({ expr: child, isIteContext });
270
+ isAllProcessed = false;
271
+ }
272
+ return isAllProcessed;
273
+ };
274
+ const postProcess = (expr: number, isIteContext: boolean) => {
275
+ if (postProcessed.has(expr)) return;
276
+ postProcessed.add(expr);
277
+ if (!manager.isApp(expr) || !isIte(expr)) return;
278
+ const depth =
279
+ Math.max(0, ...manager.getArgs(expr).map((arg) => iteDepths.get(stripNot(arg)) ?? 0)) + 1;
280
+ if (!isIteContext) features.maxIteTreeDepth = Math.max(features.maxIteTreeDepth, depth);
281
+ iteDepths.set(expr, depth);
282
+ };
283
+ const processAll = () => {
284
+ for (let top = todo.at(-1); top !== undefined; top = todo.at(-1)) {
285
+ if (postProcessed.has(top.expr)) {
286
+ todo.pop();
287
+ continue;
288
+ }
289
+ if (!preProcess(top.expr)) continue;
290
+ postProcess(top.expr, top.isIteContext);
291
+ todo.pop();
292
+ }
293
+ };
294
+ for (const root of formulas) {
295
+ if (postProcessed.has(root)) continue;
296
+ if (manager.getOp(root) === OP_OR) {
297
+ postProcessed.add(root);
298
+ features.numClauses++;
299
+ if (manager.getNumArgs(root) === 2) features.numBinClauses++;
300
+ for (const arg of manager.getArgs(root)) {
301
+ todo.push({ expr: stripNot(arg), isIteContext: false });
302
+ processAll();
303
+ }
304
+ continue;
305
+ }
306
+ if (!isGate(root)) {
307
+ features.numUnits++;
308
+ features.numClauses++;
309
+ }
310
+ todo.push({ expr: root, isIteContext: false });
311
+ processAll();
312
+ }
313
+ return { ...features, numTheories: theories.size };
314
+ };
@@ -1,8 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_context.cpp), MIT license, see z3-license.txt.
2
- // m_sticky_generation_updates: the generations that update_generation lowered, by node. Only a node
3
- // of the same declaration can be congruent to another, so the updates are grouped by declaration.
4
- // Each group keeps its updates in the order of insertion, as a Map does, in arrays that iterate
5
- // without allocating. A deleted update leaves a hole until holes are half of its group.
6
1
  import { shrink } from "./array";
7
2
  import type { Enode } from "./enode";
8
3
 
@@ -47,7 +42,6 @@ export class StickyGenerations {
47
42
  if (2 * group.numHoles > group.nodes.length) compact(group);
48
43
  }
49
44
 
50
- // The updates of the declaration in the order of insertion, where a deleted one is null.
51
45
  getGroup(decl: number): Readonly<Pick<Group, "nodes" | "generations">> | undefined {
52
46
  return this.groups.get(decl);
53
47
  }