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
@@ -0,0 +1,2141 @@
1
+ import {
2
+ SmtCanceledError,
3
+ SmtParseError,
4
+ SmtDefaultError,
5
+ SmtTacticError,
6
+ SmtUnsupportedError,
7
+ } from "../../../errors";
8
+ import { type AstManager, OP_DIV0, OP_IDIV0, OP_MOD0, OP_OR, OP_POWER0, SORT_BOOL } from "./ast";
9
+ import { createQfufbvAckrTactic, runAckermannizeBv } from "./ackermannize-bv-tactic";
10
+ import { createAigTactic } from "./aig-tactic";
11
+ import { blastTermIte } from "./blast-term-ite";
12
+ import { card2bv } from "./card2bv";
13
+ import { type Context, MBQI_MAX_ITERATIONS } from "./context";
14
+ import { ctxSimplify } from "./ctx-simplify";
15
+ import { createCtxSolverSimplify } from "./ctx-solver-simplify";
16
+ import {
17
+ type Definition,
18
+ type Dependency,
19
+ Goal,
20
+ getDependencyValues,
21
+ joinDependencies,
22
+ mkDependencyLeaf,
23
+ } from "./goal";
24
+ import type { AckrSolver } from "./lackr";
25
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
26
+ import { DerRewriter } from "./der";
27
+ import { finishSimplifier, runSimplifier } from "./dependent-expr-state";
28
+ import { fixDlVar } from "./fix-dl-var";
29
+ import { runFpa2Bv } from "./fpa2bv-tactic";
30
+ import { type BitBlasterRewriter, runBitBlast } from "./bit-blast-tactic";
31
+ import { runMaxBvSharing } from "./max-bv-sharing-tactic";
32
+ import { runBvBoundChk } from "./bv-bound-chk";
33
+ import { runBvDivremBounds } from "./bv-divrem-bounds";
34
+ import { runBv1Blast } from "./bv1-blast";
35
+ import { runReduceBvSize } from "./reduce-bv-size";
36
+ import { createSatTactic } from "./sat/sat-tactic";
37
+ import { mkThSolver } from "./euf/th-solvers";
38
+ import { createFdTactic } from "./fd-solver";
39
+ import { elimUncnstr } from "./elim-uncnstr";
40
+ import { runElimTermIte } from "./elim-term-ite-tactic";
41
+ import { rewriteUfbv } from "./demodulator";
42
+ import { distributeForall } from "./distribute-forall";
43
+ import { createDt2BvTactic } from "./dt2bv-tactic";
44
+ import { createEq2BvTactic } from "./eq2bv-tactic";
45
+ import { runElimSmallBv } from "./elim-small-bv-tactic";
46
+ import { domSimplify } from "./dom-simplify";
47
+ import { factor } from "./factor";
48
+ import { findGoalMacros } from "./macro-finder";
49
+ import { findQuasiMacros } from "./quasi-macros";
50
+ import { reduceArgs } from "./reduce-args";
51
+ import { DefinedNames, NNF_FULL, NNF_QUANT, NNF_SKOLEM, Nnf } from "./nnf";
52
+ import { normalizeBounds } from "./normalize-bounds";
53
+ import { propagateIneqs } from "./bound-simplifier";
54
+ import { diffNeq } from "./diff-neq";
55
+ import { lia2pb } from "./lia2pb";
56
+ import { runPb2Bv } from "./pb2bv-tactic";
57
+ import { fm } from "./fm-tactic";
58
+ import { addBounds } from "./add-bounds-tactic";
59
+ import { cofactorTermIte } from "./cofactor-elim-term-ite";
60
+ import { nla2bv } from "./nla2bv-tactic";
61
+ import { Rational } from "./rational";
62
+ import { runNlsat } from "./nlsat-tactic";
63
+ import { runNlqsat } from "./nlqsat";
64
+ import { occf } from "./occf";
65
+ import { propagateValues } from "./propagate-values";
66
+ import { purifyArith } from "./purify-arith";
67
+ import { ModelEvaluator } from "./model-evaluator";
68
+ import { FuncInterp, ProtoModel } from "./proto-model";
69
+ import { SmtKernel } from "./smt-kernel";
70
+ import { isMbqiByFeatures, type SmtSetup } from "./smt-setup";
71
+ import { compileProbe, formatProbeValue, isQfufbv, type Probe } from "./probes";
72
+ import { runHorn } from "./muz/horn-tactic";
73
+ import { runQe } from "./qe";
74
+ import { applyQeLite } from "./qe-lite";
75
+ import { QSAT_QE, QSAT_QE_REC, QSAT_SAT, runQsat } from "./qsat";
76
+ import { simplifyGoal } from "./quant-tactics";
77
+ import { SolveEqs } from "./solve-eqs";
78
+ import { RefVector } from "./ref-vector";
79
+ import { type RewriterOptions, TACTIC_REWRITER_OPTIONS } from "./rewriter";
80
+ import { lia2card } from "./lia2card";
81
+ import { LOGIC_TACTICS, QFAUFBV, QFUFBV_ACKR_PREAMBLE } from "./logic-tactics";
82
+ import {
83
+ createCommandReader,
84
+ isSymbol,
85
+ isUnsigned,
86
+ type SExpr,
87
+ type SmtList,
88
+ type SmtToken,
89
+ } from "./smtlib-parser";
90
+ import { solveParallel } from "./parallel-tactic";
91
+ import { solveAssuming, solveGoal } from "./solver";
92
+ import { tseitinCnf } from "./tseitin-cnf";
93
+
94
+ const PARAM_BOOL = 0;
95
+ const PARAM_UINT = 1;
96
+ const PARAM_SYMBOL = 2;
97
+ const PARAM_NUMERAL = 3;
98
+
99
+ export type TacticParam = boolean | number | string;
100
+ export type TacticParams = ReadonlyMap<string, TacticParam>;
101
+
102
+ interface ParamDescr {
103
+ kind: number;
104
+ module: string;
105
+ defaultValue: TacticParam;
106
+ isPorted: boolean;
107
+ }
108
+
109
+ type ParamDescrs = ReadonlyMap<string, ParamDescr>;
110
+
111
+ export interface Tactic {
112
+ (goal: Goal): Goal[];
113
+ }
114
+
115
+ export interface TacticEnvironment {
116
+ manager: AstManager;
117
+ isMbqi: boolean;
118
+ mbqiMaxIterations: number;
119
+ isFindingMacros: boolean;
120
+ setup: SmtSetup;
121
+ write: (text: string, isDiagnostic: boolean) => void;
122
+ parameters: ReadonlyMap<string, string>;
123
+ hasDefinitions: () => boolean;
124
+ }
125
+
126
+ // A tactic that tracks dependencies keeps the dependency of every formula it changes, so the goal
127
+ // gets the assertion names only for those.
128
+ interface TacticBuilder {
129
+ descrs: ParamDescrs;
130
+ isRejectingUnknown: boolean;
131
+ isTrackingDependencies: boolean;
132
+ build: (params: TacticParams) => Tactic;
133
+ }
134
+
135
+ interface NamedTactic {
136
+ descrs: ParamDescrs;
137
+ isRejectingUnknown?: boolean;
138
+ isTrackingDependencies?: boolean;
139
+ build: (environment: TacticEnvironment, params: TacticParams) => Tactic;
140
+ }
141
+
142
+ const getDescrs = (module: string, entries: [string, number, TacticParam, boolean?][]) =>
143
+ new Map(
144
+ entries.map((entry) => [
145
+ entry[0],
146
+ { kind: entry[1], module, defaultValue: entry[2], isPorted: entry[3] ?? false },
147
+ ]),
148
+ );
149
+
150
+ const UINT_MAX = 4294967295;
151
+
152
+ const REWRITER_DESCRS = getDescrs("rewriter", [
153
+ ["ite_extra_rules", PARAM_BOOL, true],
154
+ ["flat", PARAM_BOOL, true, true],
155
+ ["flat_and_or", PARAM_BOOL, true, true],
156
+ ["sort_disjunctions", PARAM_BOOL, true],
157
+ ["elim_and", PARAM_BOOL, false, true],
158
+ ["elim_ite", PARAM_BOOL, true],
159
+ ["local_ctx", PARAM_BOOL, false, true],
160
+ ["local_ctx_limit", PARAM_UINT, UINT_MAX, true],
161
+ ["blast_distinct", PARAM_BOOL, false, true],
162
+ ["blast_distinct_threshold", PARAM_UINT, UINT_MAX, true],
163
+ ["som", PARAM_BOOL, false, true],
164
+ ["som_blowup", PARAM_UINT, 10],
165
+ ["hoist_mul", PARAM_BOOL, false, true],
166
+ ["hoist_ite", PARAM_BOOL, false, true],
167
+ ["algebraic_number_evaluator", PARAM_BOOL, true, true],
168
+ ["mul_to_power", PARAM_BOOL, false],
169
+ ["expand_power", PARAM_BOOL, false, true],
170
+ ["expand_tan", PARAM_BOOL, false, true],
171
+ ["max_degree", PARAM_UINT, 64, true],
172
+ ["sort_sums", PARAM_BOOL, false, true],
173
+ ["gcd_rounding", PARAM_BOOL, false, true],
174
+ ["arith_lhs", PARAM_BOOL, false, true],
175
+ ["arith_ineq_lhs", PARAM_BOOL, false, true],
176
+ ["elim_to_real", PARAM_BOOL, false],
177
+ ["push_to_real", PARAM_BOOL, true],
178
+ ["eq2ineq", PARAM_BOOL, false],
179
+ ["elim_rem", PARAM_BOOL, false],
180
+ ["split_concat_eq", PARAM_BOOL, false, true],
181
+ ["bit2bool", PARAM_BOOL, true],
182
+ ["blast_eq_value", PARAM_BOOL, false],
183
+ ["elim_sign_ext", PARAM_BOOL, true],
184
+ ["hi_div0", PARAM_BOOL, true, true],
185
+ ["mul2concat", PARAM_BOOL, false, true],
186
+ ["bv_sort_ac", PARAM_BOOL, true],
187
+ ["bv_extract_prop", PARAM_BOOL, false],
188
+ ["bv_not_simpl", PARAM_BOOL, false],
189
+ ["bv_ite2id", PARAM_BOOL, false],
190
+ ["bv_le_extra", PARAM_BOOL, false],
191
+ ["bv_le2extract", PARAM_BOOL, true],
192
+ ["expand_select_store", PARAM_BOOL, false],
193
+ ["blast_select_store", PARAM_BOOL, false],
194
+ ["expand_nested_stores", PARAM_BOOL, false],
195
+ ["expand_select_ite", PARAM_BOOL, false],
196
+ ["expand_store_eq", PARAM_BOOL, false],
197
+ ["sort_store", PARAM_BOOL, false, true],
198
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
199
+ ["max_steps", PARAM_UINT, UINT_MAX],
200
+ ["push_ite_arith", PARAM_BOOL, false],
201
+ ["push_ite_bv", PARAM_BOOL, false, true],
202
+ ["pull_cheap_ite", PARAM_BOOL, false, true],
203
+ ["bv_ineq_consistency_test_max", PARAM_UINT, 0, true],
204
+ ["unfold_recursive_functions", PARAM_BOOL, false],
205
+ ["cache_all", PARAM_BOOL, false],
206
+ ["enable_der", PARAM_BOOL, true],
207
+ ["rewrite_patterns", PARAM_BOOL, false],
208
+ ["ignore_patterns_on_ground_qbody", PARAM_BOOL, true],
209
+ ]);
210
+
211
+ const BOOL_REWRITER_PARAMS = [
212
+ "ite_extra_rules",
213
+ "flat_and_or",
214
+ "sort_disjunctions",
215
+ "elim_ite",
216
+ "local_ctx",
217
+ "local_ctx_limit",
218
+ "blast_distinct",
219
+ "blast_distinct_threshold",
220
+ ];
221
+
222
+ const getBool = (params: TacticParams, name: string, defaultValue: boolean) => {
223
+ const value = params.get(name);
224
+ return typeof value === "boolean" ? value : defaultValue;
225
+ };
226
+
227
+ const getUint = (params: TacticParams, name: string, defaultValue: number) => {
228
+ const value = params.get(name);
229
+ return typeof value === "number" ? value : defaultValue;
230
+ };
231
+
232
+ const getNumeral = (params: TacticParams, name: string, defaultValue: string) => {
233
+ const value = params.get(name);
234
+ const parts = (typeof value === "string" ? value : defaultValue).split(".");
235
+ const fraction = parts[1] ?? "";
236
+ return Rational.of(BigInt(parts[0] + fraction), 10n ** BigInt(fraction.length));
237
+ };
238
+
239
+ export const getRewriterOptions = (manager: AstManager, params: TacticParams): RewriterOptions => ({
240
+ ...TACTIC_REWRITER_OPTIONS,
241
+ isEliminatingAnd: getBool(params, "elim_and", false),
242
+ isFlatAndOr: getBool(params, "flat_and_or", true),
243
+ isSortingStore: getBool(params, "sort_store", false),
244
+ isPullingCheapIte: getBool(params, "pull_cheap_ite", false),
245
+ isPushingIteBv: getBool(params, "push_ite_bv", false),
246
+ isKeepingDistinct: !getBool(params, "blast_distinct", false),
247
+ blastDistinctThreshold: getUint(params, "blast_distinct_threshold", UINT_MAX),
248
+ localCtxLimit: getBool(params, "local_ctx", false)
249
+ ? getUint(params, "local_ctx_limit", UINT_MAX)
250
+ : undefined,
251
+ arith: {
252
+ isSom: getBool(params, "flat", true) && getBool(params, "som", false),
253
+ isSortSums: getBool(params, "sort_sums", false),
254
+ isArithLhs: getBool(params, "arith_lhs", false),
255
+ isArithIneqLhs: getBool(params, "arith_ineq_lhs", false),
256
+ isGcdRounding: getBool(params, "gcd_rounding", false),
257
+ isAnumSimp: getBool(params, "algebraic_number_evaluator", true),
258
+ isExpandPower: getBool(params, "expand_power", false),
259
+ isExpandTan: getBool(params, "expand_tan", false),
260
+ isHoistIte: getBool(params, "hoist_ite", false),
261
+ isHoistMul:
262
+ !(getBool(params, "flat", true) && getBool(params, "som", false)) &&
263
+ getBool(params, "hoist_mul", false),
264
+ isFlat: getBool(params, "flat", true),
265
+ isElimRem: getBool(params, "elim_rem", false),
266
+ maxDegree: getUint(params, "max_degree", 64),
267
+ },
268
+ bv: {
269
+ isHiDiv0: getBool(params, "hi_div0", manager.isHiDiv0),
270
+ isMul2concat: getBool(params, "mul2concat", false),
271
+ isSplitConcatEq: getBool(params, "split_concat_eq", false),
272
+ },
273
+ });
274
+
275
+ // arith.nl.rounds only bounds arith.solver 2, which the port does not use.
276
+ const SMT_DESCRS = getDescrs("smt", [
277
+ ["mbqi", PARAM_BOOL, true, true],
278
+ ["mbqi.max_iterations", PARAM_UINT, MBQI_MAX_ITERATIONS, true],
279
+ ["arith.nl.rounds", PARAM_UINT, 1024, true],
280
+ ["random_seed", PARAM_UINT, 0, true],
281
+ ["auto_config", PARAM_BOOL, true, true],
282
+ ]);
283
+
284
+ // The dependencies are assertion names, which are Boolean constants, so each one is its own
285
+ // assumption.
286
+ const getKernelParams = (environment: TacticEnvironment, params: TacticParams, goal: Goal) => {
287
+ const manager = environment.manager;
288
+ const hasQuantifiers = goal.forms.items.some((form) => manager.hasQuantifierFlags[form]);
289
+ // smt_params ands the auto_config of the tactic with the global one, which smt does not scope.
290
+ const setup = {
291
+ ...environment.setup,
292
+ isAutoConfig:
293
+ getBool(
294
+ params,
295
+ "auto_config",
296
+ getParameter(environment, "smt.auto_config", "true") !== "false",
297
+ ) && getParameter(environment, "auto_config", "true") !== "false",
298
+ };
299
+ return {
300
+ isMbqi: getBool(params, "mbqi", environment.isMbqi) || isMbqiByFeatures(setup, hasQuantifiers),
301
+ mbqiMaxIterations: getUint(params, "mbqi.max_iterations", environment.mbqiMaxIterations),
302
+ isFindingMacros: environment.isFindingMacros,
303
+ setup,
304
+ randomSeed: getUint(
305
+ params,
306
+ "random_seed",
307
+ Number(getParameter(environment, "smt.random_seed", "0")),
308
+ ),
309
+ };
310
+ };
311
+
312
+ // extract_clauses_and_dependencies: each form's clause gets the negations of its dependencies.
313
+ const extractClauses = (manager: AstManager, goal: Goal) => {
314
+ const assumptions: number[] = [];
315
+ const clauses = new RefVector(manager);
316
+ for (const [index, form] of goal.forms.items.entries()) {
317
+ const values = getDependencyValues(goal.getDependency(index));
318
+ for (const value of values) if (!assumptions.includes(value)) assumptions.push(value);
319
+ clauses.pushOwned(
320
+ manager.withTemporaries(() =>
321
+ manager.mkOr([form, ...values.map((value) => manager.mkNot(value))]),
322
+ ),
323
+ );
324
+ }
325
+ return { clauses, assumptions };
326
+ };
327
+
328
+ const mkCoreDependency = (core: number[]) =>
329
+ core.reduce<Dependency | undefined>(
330
+ (dependency, value) => joinDependencies(dependency, mkDependencyLeaf(value)),
331
+ undefined,
332
+ );
333
+
334
+ export const getSatParams = (parameters: ReadonlyMap<string, string>) =>
335
+ new Map(
336
+ [...parameters]
337
+ .filter((entry) => entry[0].startsWith("sat."))
338
+ .map((entry) => {
339
+ const value = entry[1];
340
+ const number = Number(value);
341
+ return [
342
+ entry[0].slice(4),
343
+ value === "true"
344
+ ? true
345
+ : value === "false"
346
+ ? false
347
+ : Number.isNaN(number)
348
+ ? value
349
+ : number,
350
+ ];
351
+ }),
352
+ );
353
+
354
+ export const getSmtTacticFailure = (context: Context) =>
355
+ context.checkCanceled()
356
+ ? "canceled"
357
+ : `smt tactic failed to show goal to be sat/unsat ${context.getLastFailureMessage()}`;
358
+
359
+ // sat_params reads what using-params leaves unset from the sat module's global parameters.
360
+ const getSatTacticParams = (environment: TacticEnvironment, params: TacticParams) =>
361
+ new Map([...getSatParams(environment.parameters), ...params]);
362
+
363
+ const runSmt = (environment: TacticEnvironment, params: TacticParams) => (goal: Goal) => {
364
+ const manager = environment.manager;
365
+ // mk_smt_tactic: with sat.euf, the smt tactic is the sat tactic.
366
+ if (environment.parameters.get("sat.euf") === "true")
367
+ return createSatTactic(manager, getSatParams(environment.parameters), mkThSolver)(goal);
368
+ const kernelParams = getKernelParams(environment, params, goal);
369
+ const extracted = extractClauses(manager, goal);
370
+ const solved =
371
+ extracted.assumptions.length === 0
372
+ ? solveGoal(manager, goal.forms.items, kernelParams)
373
+ : solveAssuming(manager, extracted.clauses.items, extracted.assumptions, kernelParams);
374
+ extracted.clauses.reset();
375
+ if (solved.result === L_UNDEF)
376
+ throw new SmtTacticError(solved.reasonUnknown ?? getSmtTacticFailure(solved.context));
377
+ goal.reset();
378
+ if (solved.result === L_FALSE) {
379
+ goal.assert(environment.manager.falseExpr, mkCoreDependency(solved.context.unsatCore));
380
+ return [goal];
381
+ }
382
+ if (goal.isModelsEnabled) goal.model = solved.context.getModel();
383
+ if (solved.context.checkCanceled()) throw new SmtTacticError("canceled");
384
+ return [goal];
385
+ };
386
+
387
+ const getParameter = (environment: TacticEnvironment, name: string, defaultValue: string) =>
388
+ environment.parameters.get(name) ?? defaultValue;
389
+
390
+ const runParallelSmt = (environment: TacticEnvironment) => (goal: Goal) => {
391
+ if (goal.isProofsEnabled)
392
+ throw new SmtTacticError("parallel_tactic does not support proof production");
393
+ const manager = environment.manager;
394
+ const extracted = extractClauses(manager, goal);
395
+ const solved = solveParallel(
396
+ manager,
397
+ getKernelParams(environment, new Map(), goal),
398
+ {
399
+ threadsMax: Number(getParameter(environment, "parallel.threads.max", "10000")),
400
+ numBbThreads: Number(getParameter(environment, "parallel.num_bb_threads", "2")),
401
+ isAblatingBacktracking:
402
+ getParameter(environment, "parallel.ablate_backtracking", "false") === "true",
403
+ },
404
+ extracted.clauses.items,
405
+ extracted.assumptions,
406
+ );
407
+ extracted.clauses.reset();
408
+ if (solved.status === L_TRUE) {
409
+ goal.reset();
410
+ goal.model = solved.model;
411
+ }
412
+ if (solved.status === L_FALSE)
413
+ goal.assert(
414
+ manager.falseExpr,
415
+ mkCoreDependency(solved.core.filter((literal) => extracted.assumptions.includes(literal))),
416
+ );
417
+ if (solved.status === L_UNDEF && !manager.limit.inc()) throw new SmtCanceledError();
418
+ return [goal];
419
+ };
420
+
421
+ const createTacticSolver = (manager: AstManager, getTactic: () => Tactic): AckrSolver => {
422
+ const assertions = new RefVector(manager);
423
+ let model: ProtoModel | undefined;
424
+ return {
425
+ assert: (expr) => assertions.push(expr),
426
+ check: () => {
427
+ model?.decRef();
428
+ model = undefined;
429
+ const goal = new Goal(manager);
430
+ for (const assertion of assertions.items) goal.assert(assertion);
431
+ const checked = checkSatUsing(getTactic(), goal);
432
+ model = checked.model;
433
+ model?.incRef();
434
+ return checked.status;
435
+ },
436
+ getModel: () => model as ProtoModel,
437
+ release: () => {
438
+ model?.decRef();
439
+ assertions.reset();
440
+ },
441
+ };
442
+ };
443
+
444
+ // Each clause gets a fresh context, where Z3 pushes a scope on one context.
445
+ const runUnitSubsume = (environment: TacticEnvironment) => (goal: Goal) => {
446
+ const manager = environment.manager;
447
+ const kernel = new SmtKernel(manager, {
448
+ isMbqi: environment.isMbqi,
449
+ mbqiMaxIterations: environment.mbqiMaxIterations,
450
+ isFindingMacros: false,
451
+ });
452
+ const trail = new RefVector(manager);
453
+ const clauses = goal.forms.items.map(() => manager.mkFreshConst("#clause", SORT_BOOL));
454
+ for (const clause of clauses) trail.push(clause);
455
+ kernel.push();
456
+ for (const [index, form] of goal.forms.items.entries()) {
457
+ const definition = manager.mkEq(clauses[index], form);
458
+ trail.push(definition);
459
+ kernel.assertExpr(definition);
460
+ }
461
+ kernel.push();
462
+ const isDeleted = clauses.map(() => false);
463
+ const deleted: number[] = [];
464
+ for (const [index, clause] of clauses.entries()) {
465
+ kernel.push();
466
+ for (const [other, otherClause] of clauses.entries())
467
+ if (other === index) {
468
+ const negated = manager.mkNot(clause);
469
+ trail.push(negated);
470
+ kernel.assertExpr(negated);
471
+ } else if (!isDeleted[other]) kernel.assertExpr(otherClause);
472
+ kernel.push();
473
+ const isUnsat = kernel.context.isInconsistent();
474
+ kernel.pop(2);
475
+ if (!isUnsat) continue;
476
+ isDeleted[index] = true;
477
+ deleted.push(index);
478
+ }
479
+ for (const index of deleted) goal.update(index, manager.trueExpr);
480
+ goal.elimTrue();
481
+ kernel.pop(2);
482
+ trail.reset();
483
+ return [goal];
484
+ };
485
+
486
+ const inPlace = (run: (goal: Goal) => void) => (goal: Goal) => {
487
+ run(goal);
488
+ return [goal];
489
+ };
490
+
491
+ const selectClause = (goal: Goal, isLargest: boolean) => {
492
+ const manager = goal.manager;
493
+ let position = -1;
494
+ let length = 0;
495
+ for (let index = 0; index < goal.forms.size; index++) {
496
+ const form = goal.forms.items[index];
497
+ if (manager.getOp(form) !== OP_OR) continue;
498
+ const currentLength = manager.getNumArgs(form);
499
+ if (currentLength < 2) continue;
500
+ if (!isLargest) return index;
501
+ if (currentLength > length) {
502
+ position = index;
503
+ length = currentLength;
504
+ }
505
+ }
506
+ return position;
507
+ };
508
+
509
+ const runSplitClause = (isLargest: boolean) => (goal: Goal) => {
510
+ const manager = goal.manager;
511
+ const position = selectClause(goal, isLargest);
512
+ if (position === -1)
513
+ throw new SmtTacticError("split-clause tactic failed, goal does not contain any clause");
514
+ if (goal.isProofsEnabled) throw new SmtUnsupportedError("the proofs of split-clause");
515
+ const dependency = goal.dependencies[position];
516
+ return manager.getArgs(goal.forms.items[position]).map((literal) => {
517
+ const subgoal = goal.copy();
518
+ subgoal.update(position, literal, dependency);
519
+ subgoal.depth++;
520
+ return subgoal;
521
+ });
522
+ };
523
+
524
+ const runDer = (manager: AstManager) => (goal: Goal) => {
525
+ runSimplifier(goal, true, (state) => {
526
+ const rewriter = new DerRewriter(manager);
527
+ return {
528
+ reduce: () => state.rewriteEach((form) => rewriter.rewrite(form)),
529
+ release: () => {
530
+ rewriter.der.release();
531
+ rewriter.release();
532
+ },
533
+ };
534
+ });
535
+ return [goal];
536
+ };
537
+
538
+ const NNF_MODES = new Map([
539
+ ["skolem", NNF_SKOLEM],
540
+ ["quantifiers", NNF_QUANT],
541
+ ["full", NNF_FULL],
542
+ ]);
543
+
544
+ const NNF_DESCRS = getDescrs("nnf", [
545
+ ["mode", PARAM_SYMBOL, "skolem", true],
546
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
547
+ ["sk_hack", PARAM_BOOL, false],
548
+ ["ignore_labels", PARAM_BOOL, false, true],
549
+ ]);
550
+
551
+ const NLSAT_DESCRS = getDescrs("nlsat", [
552
+ ["seed", PARAM_UINT, 0, true],
553
+ ["factor", PARAM_BOOL, true, true],
554
+ ["shuffle_vars", PARAM_BOOL, false, true],
555
+ ["variable_ordering_strategy", PARAM_UINT, 0, true],
556
+ ]);
557
+
558
+ const TSEITIN_DESCRS = getDescrs("", [
559
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
560
+ ["common_patterns", PARAM_BOOL, true],
561
+ ["distributivity", PARAM_BOOL, true],
562
+ ["distributivity_blowup", PARAM_UINT, 32],
563
+ ["ite_chaing", PARAM_BOOL, true],
564
+ ["ite_extra", PARAM_BOOL, true],
565
+ ]);
566
+
567
+ const runNnf = (manager: AstManager, params: TacticParams) => (goal: Goal) => {
568
+ const mode = NNF_MODES.get(String(params.get("mode") ?? "skolem"));
569
+ if (mode === undefined) throw new SmtUnsupportedError("an invalid NNF mode");
570
+ const names = new DefinedNames(manager);
571
+ const nnf = new Nnf(manager, names, mode, getBool(params, "ignore_labels", false));
572
+ const definitions = new RefVector(manager);
573
+ const size = goal.forms.size;
574
+ try {
575
+ for (let index = 0; !goal.isInconsistent && index < size; index++) {
576
+ const result = nnf.apply(goal.forms.items[index], definitions);
577
+ goal.update(index, result);
578
+ manager.decRef(result);
579
+ }
580
+ } catch (error) {
581
+ // Z3's nnf stops at the limit with a default_exception, which or-else lets pass.
582
+ if (!(error instanceof SmtCanceledError)) throw error;
583
+ throw new SmtDefaultError(manager.limit.getCancelMessage());
584
+ }
585
+ for (const definition of definitions.items) {
586
+ if (goal.isInconsistent) break;
587
+ goal.assert(definition);
588
+ }
589
+ goal.depth++;
590
+ if (!goal.isInconsistent)
591
+ for (let index = 0; index < names.numNames; index++)
592
+ goal.addConverter(names.getNameDecl(index));
593
+ definitions.reset();
594
+ nnf.release();
595
+ names.release();
596
+ return [goal];
597
+ };
598
+
599
+ const SAT_DESCRS = getDescrs("sat", [
600
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
601
+ ["ite_extra", PARAM_BOOL, true, true],
602
+ ["learned", PARAM_BOOL, false],
603
+ ["restart", PARAM_SYMBOL, "ema", true],
604
+ ["restart.fast", PARAM_BOOL, true, true],
605
+ ["phase", PARAM_SYMBOL, "caching", true],
606
+ ["rephase.base", PARAM_UINT, 1000, true],
607
+ ["search.sat.conflicts", PARAM_UINT, 400, true],
608
+ ["search.unsat.conflicts", PARAM_UINT, 400, true],
609
+ ["restart.initial", PARAM_UINT, 2, true],
610
+ ["restart.max", PARAM_UINT, UINT_MAX, true],
611
+ ["inprocess.max", PARAM_UINT, UINT_MAX, true],
612
+ ["random_seed", PARAM_UINT, 0, true],
613
+ ["burst_search", PARAM_UINT, 100, true],
614
+ ["enable_pre_simplify", PARAM_BOOL, false, true],
615
+ ["max_conflicts", PARAM_UINT, UINT_MAX, true],
616
+ ["simplify.delay", PARAM_UINT, 0, true],
617
+ ["gc", PARAM_SYMBOL, "glue_psm", true],
618
+ ["gc.initial", PARAM_UINT, 20000, true],
619
+ ["gc.increment", PARAM_UINT, 500, true],
620
+ ["gc.small_lbd", PARAM_UINT, 3, true],
621
+ ["gc.k", PARAM_UINT, 7, true],
622
+ ["gc.burst", PARAM_BOOL, false, true],
623
+ ["gc.defrag", PARAM_BOOL, true, true],
624
+ ["force_cleanup", PARAM_BOOL, false, true],
625
+ ["backtrack.scopes", PARAM_UINT, 100, true],
626
+ ["backtrack.conflicts", PARAM_UINT, 4000, true],
627
+ ["minimize_lemmas", PARAM_BOOL, true, true],
628
+ ["dyn_sub_res", PARAM_BOOL, true, true],
629
+ ["variable_decay", PARAM_UINT, 110, true],
630
+ ["scc", PARAM_BOOL, true, true],
631
+ ["scc.tr", PARAM_BOOL, true, true],
632
+ ["abce", PARAM_BOOL, false, true],
633
+ ["acce", PARAM_BOOL, false, true],
634
+ ["ate", PARAM_BOOL, true, true],
635
+ ["bce", PARAM_BOOL, false, true],
636
+ ["cce", PARAM_BOOL, false, true],
637
+ ["bce_at", PARAM_UINT, 2, true],
638
+ ["bce_delay", PARAM_UINT, 2, true],
639
+ ["blocked_clause_limit", PARAM_UINT, 100000000, true],
640
+ ["elim_vars", PARAM_BOOL, true, true],
641
+ ["subsumption", PARAM_BOOL, true, true],
642
+ ["subsumption.limit", PARAM_UINT, 100000000, true],
643
+ ["override_incremental", PARAM_BOOL, false, true],
644
+ ["resolution.limit", PARAM_UINT, 500000000, true],
645
+ ["resolution.occ_cutoff", PARAM_UINT, 10, true],
646
+ ["resolution.occ_cutoff_range1", PARAM_UINT, 8, true],
647
+ ["resolution.occ_cutoff_range2", PARAM_UINT, 5, true],
648
+ ["resolution.occ_cutoff_range3", PARAM_UINT, 3, true],
649
+ ["resolution.lit_cutoff_range1", PARAM_UINT, 700, true],
650
+ ["resolution.lit_cutoff_range2", PARAM_UINT, 400, true],
651
+ ["resolution.lit_cutoff_range3", PARAM_UINT, 300, true],
652
+ ["resolution.cls_cutoff1", PARAM_UINT, 100000000, true],
653
+ ["resolution.cls_cutoff2", PARAM_UINT, 700000000, true],
654
+ ["asymm_branch", PARAM_BOOL, true, true],
655
+ ["asymm_branch.rounds", PARAM_UINT, 2, true],
656
+ ["asymm_branch.delay", PARAM_UINT, 1, true],
657
+ ["asymm_branch.sampled", PARAM_BOOL, true, true],
658
+ ["asymm_branch.limit", PARAM_UINT, 100000000, true],
659
+ ["asymm_branch.all", PARAM_BOOL, false, true],
660
+ ["probing", PARAM_BOOL, true, true],
661
+ ["probing_limit", PARAM_UINT, 5000000, true],
662
+ ["probing_cache", PARAM_BOOL, true, true],
663
+ ["probing_cache_limit", PARAM_UINT, 1024, true],
664
+ ["probing_binary", PARAM_BOOL, true, true],
665
+ ["local_search", PARAM_BOOL, false],
666
+ ["threads", PARAM_UINT, 1],
667
+ ["euf", PARAM_BOOL, false],
668
+ ["cardinality.solver", PARAM_BOOL, true],
669
+ ]);
670
+
671
+ const NAMED_TACTICS = new Map<string, NamedTactic>([
672
+ [
673
+ "simplify",
674
+ {
675
+ descrs: REWRITER_DESCRS,
676
+ isTrackingDependencies: true,
677
+ build: (environment, params) =>
678
+ inPlace((goal) =>
679
+ simplifyGoal(environment.manager, goal, getRewriterOptions(environment.manager, params)),
680
+ ),
681
+ },
682
+ ],
683
+ [
684
+ "elim-and",
685
+ {
686
+ descrs: REWRITER_DESCRS,
687
+ isTrackingDependencies: true,
688
+ build: (environment, params) =>
689
+ inPlace((goal) =>
690
+ simplifyGoal(environment.manager, goal, {
691
+ ...getRewriterOptions(environment.manager, params),
692
+ isEliminatingAnd: true,
693
+ }),
694
+ ),
695
+ },
696
+ ],
697
+ [
698
+ "propagate-values",
699
+ {
700
+ descrs: new Map([
701
+ ...REWRITER_DESCRS,
702
+ ...getDescrs("", [["max_rounds", PARAM_UINT, 4, true]]),
703
+ ]),
704
+ isTrackingDependencies: true,
705
+ build: (environment, params) =>
706
+ inPlace((goal) =>
707
+ propagateValues(environment.manager, goal, getUint(params, "max_rounds", 4)),
708
+ ),
709
+ },
710
+ ],
711
+ [
712
+ "ctx-simplify",
713
+ {
714
+ descrs: getDescrs("", [
715
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
716
+ ["max_steps", PARAM_UINT, UINT_MAX, true],
717
+ ["max_depth", PARAM_UINT, 1024, true],
718
+ ["propagate_eq", PARAM_BOOL, false],
719
+ ]),
720
+ build: (environment, params) =>
721
+ inPlace((goal) =>
722
+ ctxSimplify(
723
+ environment.manager,
724
+ goal,
725
+ getUint(params, "max_depth", 1024),
726
+ getUint(params, "max_steps", UINT_MAX),
727
+ ),
728
+ ),
729
+ },
730
+ ],
731
+ [
732
+ "ctx-solver-simplify",
733
+ {
734
+ descrs: SMT_DESCRS,
735
+ isRejectingUnknown: false,
736
+ build: (environment, params) =>
737
+ inPlace(
738
+ createCtxSolverSimplify(environment.manager, {
739
+ isMbqi: getBool(params, "mbqi", environment.isMbqi),
740
+ mbqiMaxIterations: getUint(
741
+ params,
742
+ "mbqi.max_iterations",
743
+ environment.mbqiMaxIterations,
744
+ ),
745
+ isFindingMacros: environment.isFindingMacros,
746
+ }),
747
+ ),
748
+ },
749
+ ],
750
+ ["unit-subsume-simplify", { descrs: new Map(), build: runUnitSubsume }],
751
+ [
752
+ "purify-arith",
753
+ {
754
+ descrs: new Map([
755
+ ...REWRITER_DESCRS,
756
+ ...getDescrs("", [
757
+ ["complete", PARAM_BOOL, true, true],
758
+ ["elim_root_objects", PARAM_BOOL, true, true],
759
+ ["elim_inverses", PARAM_BOOL, true, true],
760
+ ]),
761
+ ]),
762
+ build: (environment, params) => {
763
+ const manager = environment.manager;
764
+ const elimRemParams = new Map([...params, ["elim_rem", true]]);
765
+ return [
766
+ runNnf(manager, new Map()),
767
+ inPlace((goal) =>
768
+ simplifyGoal(manager, goal, getRewriterOptions(manager, elimRemParams)),
769
+ ),
770
+ inPlace((goal) =>
771
+ purifyArith(manager, goal, {
772
+ isComplete: getBool(params, "complete", true),
773
+ isElimRootObjects: getBool(params, "elim_root_objects", true),
774
+ isElimInverses: getBool(params, "elim_inverses", true),
775
+ }),
776
+ ),
777
+ inPlace((goal) => simplifyGoal(manager, goal, getRewriterOptions(manager, params))),
778
+ ].reduceRight((second, first) => runAndThen(first, second));
779
+ },
780
+ },
781
+ ],
782
+ [
783
+ "elim-term-ite",
784
+ {
785
+ isTrackingDependencies: true,
786
+ descrs: getDescrs("", [["max_memory", PARAM_UINT, UINT_MAX, true]]),
787
+ build: (environment) => runElimTermIte(environment.manager),
788
+ },
789
+ ],
790
+ [
791
+ "tseitin-cnf-core",
792
+ {
793
+ descrs: TSEITIN_DESCRS,
794
+ build: (environment) => inPlace((goal) => tseitinCnf(environment.manager, goal)),
795
+ },
796
+ ],
797
+ [
798
+ "tseitin-cnf",
799
+ {
800
+ descrs: TSEITIN_DESCRS,
801
+ build: (environment, params) =>
802
+ inPlace((goal) => {
803
+ const manager = environment.manager;
804
+ const original = new RefVector(manager);
805
+ for (const form of goal.forms.items) original.push(form);
806
+ try {
807
+ tseitinCnf(manager, goal);
808
+ } catch (error) {
809
+ if (!(error instanceof SmtTacticError)) throw error;
810
+ simplifyGoal(manager, goal, {
811
+ ...getRewriterOptions(manager, params),
812
+ isEliminatingAnd: true,
813
+ isKeepingDistinct: false,
814
+ });
815
+ if (!goal.isDecided()) tseitinCnf(manager, goal);
816
+ } finally {
817
+ original.reset();
818
+ }
819
+ }),
820
+ },
821
+ ],
822
+ [
823
+ "qe-light",
824
+ {
825
+ descrs: new Map(),
826
+ build: (environment) =>
827
+ inPlace((goal) =>
828
+ goal.isProofsEnabled ? finishSimplifier(goal) : applyQeLite(environment.manager, goal),
829
+ ),
830
+ },
831
+ ],
832
+ [
833
+ "solve-eqs",
834
+ {
835
+ // Z3 never counts the occurrences that solve_eqs_max_occs bounds, so the bound has no effect.
836
+ descrs: getDescrs("", [
837
+ ["solve_eqs_max_occs", PARAM_UINT, UINT_MAX, true],
838
+ ["theory_solver", PARAM_BOOL, true, true],
839
+ ["ite_solver", PARAM_BOOL, true, true],
840
+ ["context_solve", PARAM_BOOL, false, true],
841
+ ["eliminate_mod", PARAM_BOOL, true, true],
842
+ ]),
843
+ build: (environment, params) =>
844
+ inPlace((goal) => {
845
+ checkParams(REWRITER_DESCRS, params);
846
+ const solver = new SolveEqs(environment.manager, goal, {
847
+ isTheorySolver: getBool(params, "theory_solver", true),
848
+ isIteSolver: getBool(params, "ite_solver", true),
849
+ isContextSolve: getBool(params, "context_solve", true),
850
+ isEliminatingMod: getBool(params, "eliminate_mod", true),
851
+ rewriter: getRewriterOptions(environment.manager, params),
852
+ });
853
+ solver.reduce();
854
+ solver.release();
855
+ }),
856
+ },
857
+ ],
858
+ [
859
+ "elim-uncnstr",
860
+ {
861
+ isTrackingDependencies: true,
862
+ descrs: getDescrs("", [
863
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
864
+ ["max_steps", PARAM_UINT, UINT_MAX],
865
+ ]),
866
+ build: (environment) => {
867
+ const bodies = new RefVector(environment.manager);
868
+ return inPlace((goal) => elimUncnstr(environment.manager, goal, bodies));
869
+ },
870
+ },
871
+ ],
872
+ [
873
+ "lia2card",
874
+ {
875
+ isTrackingDependencies: true,
876
+ descrs: getDescrs("", [["compile_equality", PARAM_BOOL, true, true]]),
877
+ build: (environment, params) =>
878
+ inPlace((goal) =>
879
+ lia2card(
880
+ environment.manager,
881
+ goal,
882
+ getUint(params, "lia2card.max_range", 100),
883
+ getUint(params, "lia2card.max_ite_nesting", 4),
884
+ getBool(params, "compile_equality", true),
885
+ ),
886
+ ),
887
+ },
888
+ ],
889
+ [
890
+ "card2bv",
891
+ {
892
+ descrs: getDescrs("", [
893
+ ["keep_cardinality_constraints", PARAM_BOOL, false, true],
894
+ ["pb.solver", PARAM_SYMBOL, "solver", true],
895
+ ["cardinality.encoding", PARAM_SYMBOL, "none", true],
896
+ ]),
897
+ build: (environment, params) =>
898
+ inPlace((goal) => {
899
+ checkParams(REWRITER_DESCRS, params);
900
+ card2bv(environment.manager, goal, getRewriterOptions(environment.manager, params));
901
+ }),
902
+ },
903
+ ],
904
+ [
905
+ "normalize-bounds",
906
+ {
907
+ descrs: getDescrs("", [
908
+ ["produce_models", PARAM_BOOL, false, true],
909
+ ["norm_int_only", PARAM_BOOL, true, true],
910
+ ]),
911
+ build: (environment, params) =>
912
+ inPlace((goal) => {
913
+ checkParams(REWRITER_DESCRS, params);
914
+ normalizeBounds(
915
+ environment.manager,
916
+ goal,
917
+ getRewriterOptions(environment.manager, params),
918
+ getBool(params, "norm_int_only", true),
919
+ );
920
+ }),
921
+ },
922
+ ],
923
+ [
924
+ "propagate-ineqs",
925
+ {
926
+ descrs: getDescrs("", [["bound_max_refinements", PARAM_UINT, 16, true]]),
927
+ build: (environment) => inPlace((goal) => propagateIneqs(environment.manager, goal)),
928
+ },
929
+ ],
930
+ [
931
+ "lia2pb",
932
+ {
933
+ descrs: new Map([
934
+ ...REWRITER_DESCRS,
935
+ ...getDescrs("", [
936
+ ["lia2pb_partial", PARAM_BOOL, false, true],
937
+ ["lia2pb_max_bits", PARAM_UINT, 32, true],
938
+ ["lia2pb_total_bits", PARAM_UINT, 2048, true],
939
+ ]),
940
+ ]),
941
+ isTrackingDependencies: true,
942
+ build: (environment, params) =>
943
+ inPlace((goal) =>
944
+ lia2pb(environment.manager, goal, {
945
+ isPartial: getBool(params, "lia2pb_partial", false),
946
+ maxBits: getUint(params, "lia2pb_max_bits", 32),
947
+ totalBits: getUint(params, "lia2pb_total_bits", 2048),
948
+ rewriter: getRewriterOptions(environment.manager, params),
949
+ }),
950
+ ),
951
+ },
952
+ ],
953
+ [
954
+ "pb2bv",
955
+ {
956
+ descrs: new Map([
957
+ ...[...REWRITER_DESCRS].filter((entry) => BOOL_REWRITER_PARAMS.includes(entry[0])),
958
+ ...getDescrs("", [
959
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
960
+ ["pb2bv_all_clauses_limit", PARAM_UINT, 8, true],
961
+ ["pb2bv_cardinality_limit", PARAM_UINT, UINT_MAX, true],
962
+ ["keep_cardinality_constraints", PARAM_BOOL, false, true],
963
+ ["pb.solver", PARAM_SYMBOL, "solver", true],
964
+ ["cardinality.encoding", PARAM_SYMBOL, "none", true],
965
+ ]),
966
+ ]),
967
+ build: (environment, params) =>
968
+ runPb2Bv(environment.manager, params, getRewriterOptions(environment.manager, params)),
969
+ },
970
+ ],
971
+ [
972
+ "diff-neq",
973
+ {
974
+ descrs: getDescrs("", [["diff_neq_max_k", PARAM_UINT, 1024, true]]),
975
+ build: (environment, params) =>
976
+ inPlace((goal) =>
977
+ diffNeq(environment.manager, goal, getUint(params, "diff_neq_max_k", 1024)),
978
+ ),
979
+ },
980
+ ],
981
+ [
982
+ "fm",
983
+ {
984
+ isTrackingDependencies: true,
985
+ descrs: new Map([
986
+ ...REWRITER_DESCRS,
987
+ ...getDescrs("", [
988
+ ["produce_models", PARAM_BOOL, false, true],
989
+ ["fm_real_only", PARAM_BOOL, true, true],
990
+ ["fm_occ", PARAM_BOOL, false, true],
991
+ ["fm_limit", PARAM_UINT, 5000000, true],
992
+ ["fm_cutoff1", PARAM_UINT, 8, true],
993
+ ["fm_cutoff2", PARAM_UINT, 256, true],
994
+ ["fm_extra", PARAM_UINT, 0, true],
995
+ ]),
996
+ ]),
997
+ build: (environment, params) =>
998
+ inPlace((goal) => {
999
+ const manager = environment.manager;
1000
+ simplifyGoal(
1001
+ manager,
1002
+ goal,
1003
+ getRewriterOptions(
1004
+ manager,
1005
+ new Map([...params, ["arith_lhs", true], ["elim_and", true], ["som", true]]),
1006
+ ),
1007
+ );
1008
+ // and_then stops at a decided goal.
1009
+ if (goal.isDecided()) return;
1010
+ fm(manager, goal, {
1011
+ isRealOnly: getBool(params, "fm_real_only", true),
1012
+ limit: getUint(params, "fm_limit", 5000000),
1013
+ cutoff1: getUint(params, "fm_cutoff1", 8),
1014
+ cutoff2: getUint(params, "fm_cutoff2", 256),
1015
+ extra: getUint(params, "fm_extra", 0),
1016
+ isOcc: getBool(params, "fm_occ", false),
1017
+ });
1018
+ }),
1019
+ },
1020
+ ],
1021
+ [
1022
+ "add-bounds",
1023
+ {
1024
+ descrs: getDescrs("", [
1025
+ ["add_bound_lower", PARAM_NUMERAL, "-2", true],
1026
+ ["add_bound_upper", PARAM_NUMERAL, "2", true],
1027
+ ]),
1028
+ build: (environment, params) =>
1029
+ inPlace((goal) =>
1030
+ addBounds(
1031
+ environment.manager,
1032
+ goal,
1033
+ getNumeral(params, "add_bound_lower", "-2"),
1034
+ getNumeral(params, "add_bound_upper", "2"),
1035
+ ),
1036
+ ),
1037
+ },
1038
+ ],
1039
+ [
1040
+ "cofactor-term-ite",
1041
+ {
1042
+ descrs: getDescrs("", [["cofactor_equalities", PARAM_BOOL, true, true]]),
1043
+ build: (environment, params) =>
1044
+ inPlace((goal) =>
1045
+ cofactorTermIte(
1046
+ environment.manager,
1047
+ goal,
1048
+ getRewriterOptions(environment.manager, params),
1049
+ getBool(params, "cofactor_equalities", true),
1050
+ ),
1051
+ ),
1052
+ },
1053
+ ],
1054
+ [
1055
+ "nla2bv",
1056
+ {
1057
+ descrs: getDescrs("", [
1058
+ ["nla2bv_max_bv_size", PARAM_UINT, UINT_MAX, true],
1059
+ ["nla2bv_bv_size", PARAM_UINT, 4, true],
1060
+ ["nla2bv_root", PARAM_UINT, 2, true],
1061
+ ["nla2bv_divisor", PARAM_UINT, 2, true],
1062
+ ]),
1063
+ build: (environment, params) =>
1064
+ inPlace((goal) =>
1065
+ nla2bv(environment.manager, goal, {
1066
+ maxBvSize: getUint(params, "nla2bv_max_bv_size", UINT_MAX),
1067
+ bvSize: getUint(params, "nla2bv_bv_size", 4),
1068
+ root: getUint(params, "nla2bv_root", 2),
1069
+ divisor: getUint(params, "nla2bv_divisor", 2),
1070
+ }),
1071
+ ),
1072
+ },
1073
+ ],
1074
+ [
1075
+ "fix-dl-var",
1076
+ {
1077
+ isTrackingDependencies: true,
1078
+ descrs: REWRITER_DESCRS,
1079
+ build: (environment, params) =>
1080
+ inPlace((goal) =>
1081
+ fixDlVar(environment.manager, goal, getRewriterOptions(environment.manager, params)),
1082
+ ),
1083
+ },
1084
+ ],
1085
+ [
1086
+ "factor",
1087
+ {
1088
+ isTrackingDependencies: true,
1089
+ descrs: getDescrs("", [
1090
+ ["split_factors", PARAM_BOOL, true, true],
1091
+ ["max_search_size", PARAM_UINT, UINT_MAX],
1092
+ ["max_prime", PARAM_UINT, UINT_MAX],
1093
+ ["num_primes", PARAM_UINT, 4],
1094
+ ]),
1095
+ build: (environment, params) =>
1096
+ inPlace((goal) =>
1097
+ factor(environment.manager, goal, getBool(params, "split_factors", true)),
1098
+ ),
1099
+ },
1100
+ ],
1101
+ ["der", { descrs: new Map(), build: (environment) => runDer(environment.manager) }],
1102
+ [
1103
+ "blast-term-ite",
1104
+ {
1105
+ isTrackingDependencies: true,
1106
+ descrs: new Map(),
1107
+ build: (environment) => inPlace((goal) => blastTermIte(environment.manager, goal)),
1108
+ },
1109
+ ],
1110
+ [
1111
+ "distribute-forall",
1112
+ {
1113
+ descrs: new Map(),
1114
+ build: (environment) => inPlace((goal) => distributeForall(environment.manager, goal)),
1115
+ },
1116
+ ],
1117
+ [
1118
+ "quasi-macros",
1119
+ {
1120
+ descrs: getDescrs("", [
1121
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
1122
+ ["produce_models", PARAM_BOOL, false, true],
1123
+ ["produce_proofs", PARAM_BOOL, false, true],
1124
+ ]),
1125
+ build: (environment) =>
1126
+ inPlace((goal) => {
1127
+ if (!environment.hasDefinitions()) findQuasiMacros(environment.manager, goal);
1128
+ }),
1129
+ },
1130
+ ],
1131
+ [
1132
+ "ufbv-rewriter",
1133
+ {
1134
+ descrs: getDescrs("", [
1135
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
1136
+ ["produce_models", PARAM_BOOL, false, true],
1137
+ ]),
1138
+ build: (environment) => inPlace((goal) => rewriteUfbv(environment.manager, goal)),
1139
+ },
1140
+ ],
1141
+ [
1142
+ "reduce-args",
1143
+ {
1144
+ descrs: new Map(),
1145
+ build: (environment) => inPlace((goal) => reduceArgs(environment.manager, goal)),
1146
+ },
1147
+ ],
1148
+ [
1149
+ "macro-finder",
1150
+ {
1151
+ descrs: getDescrs("", [
1152
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
1153
+ ["produce_models", PARAM_BOOL, false, true],
1154
+ ["produce_proofs", PARAM_BOOL, false, true],
1155
+ ["elim_and", PARAM_BOOL, false, true],
1156
+ ]),
1157
+ isTrackingDependencies: true,
1158
+ build: (environment) =>
1159
+ inPlace((goal) => {
1160
+ if (!environment.hasDefinitions()) findGoalMacros(environment.manager, goal);
1161
+ }),
1162
+ },
1163
+ ],
1164
+ [
1165
+ "dom-simplify",
1166
+ {
1167
+ descrs: new Map(),
1168
+ build: (environment) => inPlace((goal) => domSimplify(environment.manager, goal)),
1169
+ },
1170
+ ],
1171
+ [
1172
+ "split-clause",
1173
+ {
1174
+ descrs: getDescrs("", [["split_largest_clause", PARAM_BOOL, false, true]]),
1175
+ isTrackingDependencies: true,
1176
+ build: (_environment, params) =>
1177
+ runSplitClause(getBool(params, "split_largest_clause", false)),
1178
+ },
1179
+ ],
1180
+ [
1181
+ "occf",
1182
+ {
1183
+ descrs: new Map(),
1184
+ build: (environment) => inPlace((goal) => occf(environment.manager, goal)),
1185
+ },
1186
+ ],
1187
+ [
1188
+ "fpa2bv",
1189
+ {
1190
+ descrs: new Map(),
1191
+ isTrackingDependencies: true,
1192
+ build: (environment) => runFpa2Bv(environment.manager),
1193
+ },
1194
+ ],
1195
+ [
1196
+ "elim-small-bv",
1197
+ {
1198
+ descrs: getDescrs("", [
1199
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
1200
+ ["max_steps", PARAM_UINT, UINT_MAX, true],
1201
+ ["max_bits", PARAM_UINT, 4, true],
1202
+ ]),
1203
+ build: (environment, params) =>
1204
+ runElimSmallBv(
1205
+ environment.manager,
1206
+ getUint(params, "max_bits", 4),
1207
+ getUint(params, "max_steps", UINT_MAX),
1208
+ ),
1209
+ },
1210
+ ],
1211
+ ["dt2bv", { descrs: new Map(), build: (environment) => createDt2BvTactic(environment.manager) }],
1212
+ ["eq2bv", { descrs: new Map(), build: (environment) => createEq2BvTactic(environment.manager) }],
1213
+ [
1214
+ "bit-blast",
1215
+ {
1216
+ descrs: getDescrs("", [
1217
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
1218
+ ["max_steps", PARAM_UINT, UINT_MAX],
1219
+ ["blast_mul", PARAM_BOOL, true, true],
1220
+ ["blast_add", PARAM_BOOL, true, true],
1221
+ ["blast_quant", PARAM_BOOL, false, true],
1222
+ ["blast_full", PARAM_BOOL, false, true],
1223
+ ]),
1224
+ build: (environment, params) =>
1225
+ runBitBlast(environment.manager, {
1226
+ isBlastingMul: getBool(params, "blast_mul", true),
1227
+ isBlastingAdd: getBool(params, "blast_add", true),
1228
+ isBlastingQuant: getBool(params, "blast_quant", false),
1229
+ isBlastingFull: getBool(params, "blast_full", false),
1230
+ }),
1231
+ },
1232
+ ],
1233
+ [
1234
+ "max-bv-sharing",
1235
+ { descrs: new Map(), build: (environment) => runMaxBvSharing(environment.manager) },
1236
+ ],
1237
+ [
1238
+ "bv_bound_chk",
1239
+ {
1240
+ descrs: new Map(),
1241
+ build: (environment, params) =>
1242
+ runBvBoundChk(environment.manager, getUint(params, "bv_ineq_consistency_test_max", 0)),
1243
+ },
1244
+ ],
1245
+ [
1246
+ "bv-divrem-bounds",
1247
+ { descrs: new Map(), build: (environment) => runBvDivremBounds(environment.manager) },
1248
+ ],
1249
+ [
1250
+ "reduce-bv-size",
1251
+ { descrs: new Map(), build: (environment) => runReduceBvSize(environment.manager) },
1252
+ ],
1253
+ [
1254
+ "bv1-blast",
1255
+ {
1256
+ descrs: getDescrs("", [
1257
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
1258
+ ["max_steps", PARAM_UINT, UINT_MAX],
1259
+ ]),
1260
+ build: (environment) => runBv1Blast(environment.manager),
1261
+ },
1262
+ ],
1263
+ [
1264
+ "ackermannize_bv",
1265
+ {
1266
+ descrs: getDescrs("rewriter", [["div0_ackermann_limit", PARAM_UINT, 1000, true]]),
1267
+ build: (environment, params) =>
1268
+ runAckermannizeBv(
1269
+ environment.manager,
1270
+ getRewriterOptions(environment.manager, new Map()),
1271
+ getUint(params, "div0_ackermann_limit", 1000),
1272
+ ),
1273
+ },
1274
+ ],
1275
+ [
1276
+ "qfufbv_ackr",
1277
+ {
1278
+ descrs: new Map([...REWRITER_DESCRS, ...SMT_DESCRS]),
1279
+ isRejectingUnknown: false,
1280
+ build: (environment, params) => {
1281
+ const manager = environment.manager;
1282
+ const preamble = createCommandReader(QFUFBV_ACKR_PREAMBLE).read() as SmtList;
1283
+ return runAndThen(
1284
+ compile(environment, preamble, true).build(params),
1285
+ runCond(
1286
+ isQfufbv,
1287
+ createQfufbvAckrTactic(manager, getRewriterOptions(manager, new Map()), true, () =>
1288
+ createTacticSolver(manager, () => compileInternalTactic(environment, QFAUFBV)),
1289
+ ),
1290
+ runSmt(environment, params),
1291
+ ),
1292
+ );
1293
+ },
1294
+ },
1295
+ ],
1296
+ [
1297
+ "smt",
1298
+ {
1299
+ descrs: SMT_DESCRS,
1300
+ isRejectingUnknown: false,
1301
+ isTrackingDependencies: true,
1302
+ build: runSmt,
1303
+ },
1304
+ ],
1305
+ [
1306
+ "psmt",
1307
+ {
1308
+ descrs: new Map(),
1309
+ isTrackingDependencies: true,
1310
+ build: runParallelSmt,
1311
+ },
1312
+ ],
1313
+ [
1314
+ "nlsat",
1315
+ {
1316
+ descrs: NLSAT_DESCRS,
1317
+ isRejectingUnknown: false,
1318
+ build: (environment, params) =>
1319
+ runNlsat(environment.manager, {
1320
+ seed: getUint(params, "seed", 0),
1321
+ isFactoring: getBool(params, "factor", true),
1322
+ isShufflingVars: getBool(params, "shuffle_vars", false),
1323
+ variableOrderingStrategy: getUint(params, "variable_ordering_strategy", 0),
1324
+ }),
1325
+ },
1326
+ ],
1327
+ [
1328
+ "nlqsat",
1329
+ {
1330
+ descrs: new Map(),
1331
+ build: (environment, params) =>
1332
+ runNlqsat(
1333
+ environment.manager,
1334
+ getUint(params, "seed", 0),
1335
+ compileInternalTactic(environment, "tseitin-cnf"),
1336
+ ),
1337
+ },
1338
+ ],
1339
+ [
1340
+ "horn",
1341
+ {
1342
+ descrs: new Map(),
1343
+ isRejectingUnknown: false,
1344
+ build: (environment) =>
1345
+ runHorn(
1346
+ environment.manager,
1347
+ environment.parameters,
1348
+ getRewriterOptions(environment.manager, new Map()),
1349
+ ),
1350
+ },
1351
+ ],
1352
+ [
1353
+ "qe",
1354
+ {
1355
+ descrs: new Map(),
1356
+ isRejectingUnknown: false,
1357
+ build: (environment) => runQe(environment.manager),
1358
+ },
1359
+ ],
1360
+ [
1361
+ "qsat",
1362
+ {
1363
+ descrs: new Map(),
1364
+ isRejectingUnknown: false,
1365
+ build: (environment) => runQsat(environment, QSAT_SAT),
1366
+ },
1367
+ ],
1368
+ [
1369
+ "qe2",
1370
+ {
1371
+ descrs: new Map(),
1372
+ isRejectingUnknown: false,
1373
+ build: (environment) => runQsat(environment, QSAT_QE),
1374
+ },
1375
+ ],
1376
+ [
1377
+ "qe_rec",
1378
+ {
1379
+ descrs: new Map(),
1380
+ isRejectingUnknown: false,
1381
+ build: (environment) => runQsat(environment, QSAT_QE_REC),
1382
+ },
1383
+ ],
1384
+ [
1385
+ "sat",
1386
+ {
1387
+ descrs: SAT_DESCRS,
1388
+ isRejectingUnknown: false,
1389
+ build: (environment, params) =>
1390
+ createSatTactic(environment.manager, getSatTacticParams(environment, params)),
1391
+ },
1392
+ ],
1393
+ [
1394
+ "qffd",
1395
+ {
1396
+ descrs: SAT_DESCRS,
1397
+ isRejectingUnknown: false,
1398
+ build: (environment, params) =>
1399
+ createFdTactic(environment.manager, getSatTacticParams(environment, params)),
1400
+ },
1401
+ ],
1402
+ [
1403
+ "psat",
1404
+ {
1405
+ descrs: SAT_DESCRS,
1406
+ isRejectingUnknown: false,
1407
+ build: (environment, params) =>
1408
+ createSatTactic(environment.manager, getSatTacticParams(environment, params)),
1409
+ },
1410
+ ],
1411
+ [
1412
+ "snf",
1413
+ { descrs: NNF_DESCRS, build: (environment, params) => runNnf(environment.manager, params) },
1414
+ ],
1415
+ [
1416
+ "nnf",
1417
+ {
1418
+ descrs: NNF_DESCRS,
1419
+ build: (environment, params) =>
1420
+ runNnf(environment.manager, new Map([...params, ["mode", "full"]])),
1421
+ },
1422
+ ],
1423
+ [
1424
+ "aig",
1425
+ {
1426
+ descrs: getDescrs("", [["max_memory", PARAM_UINT, UINT_MAX, true]]),
1427
+ isTrackingDependencies: true,
1428
+ build: (environment) => createAigTactic(environment.manager),
1429
+ },
1430
+ ],
1431
+ ["skip", { descrs: new Map(), isTrackingDependencies: true, build: () => (goal) => [goal] }],
1432
+ [
1433
+ "fail",
1434
+ {
1435
+ descrs: new Map(),
1436
+ isTrackingDependencies: true,
1437
+ build: () => () => {
1438
+ throw new SmtTacticError("fail tactic");
1439
+ },
1440
+ },
1441
+ ],
1442
+ [
1443
+ "fail-if-undecided",
1444
+ {
1445
+ descrs: new Map(),
1446
+ isTrackingDependencies: true,
1447
+ build: () => (goal) => {
1448
+ if (!goal.isDecided()) throw new SmtTacticError("undecided");
1449
+ return [goal];
1450
+ },
1451
+ },
1452
+ ],
1453
+ ]);
1454
+
1455
+ const UNPORTED_TACTICS = new Set(
1456
+ (
1457
+ "bv-slice bvarray2uf collect-statistics " +
1458
+ "degree-shift demodulator " +
1459
+ "elim-predicates elim-uncnstr2 " +
1460
+ "euf-completion ff-sat ff-simplify ff-solve ff-unique ff2bv fold-unfold fpa2bv " +
1461
+ "horn-simplify injectivity pb-preprocess pqffd propagate-bv-bounds " +
1462
+ "propagate-bv-bounds2 propagate-values2 qfbv-sls recover-01 reduce-args2 " +
1463
+ "sat-preprocess sls-smt smtfd solver-subsumption special-relations " +
1464
+ "subpaving symmetry-reduce"
1465
+ ).split(" "),
1466
+ );
1467
+
1468
+ const isUnsignedNumeral = (sexpr: SExpr | undefined): sexpr is SmtToken =>
1469
+ sexpr?.kind === "numeral" && isUnsigned(sexpr.text);
1470
+
1471
+ const getParamName = (keyword: string) =>
1472
+ keyword.replace(/^:/, "").toLowerCase().replaceAll("-", "_");
1473
+
1474
+ const findParam = (descrs: ParamDescrs, name: string) => {
1475
+ const descr = descrs.get(name);
1476
+ if (descr !== undefined) return { name, descr };
1477
+ const period = name.indexOf(".");
1478
+ if (period === -1) return undefined;
1479
+ const suffix = name.slice(period + 1);
1480
+ const suffixDescr = descrs.get(suffix);
1481
+ return suffixDescr?.module === name.slice(0, period)
1482
+ ? { name: suffix, descr: suffixDescr }
1483
+ : undefined;
1484
+ };
1485
+
1486
+ const parseParamValue = (kind: number, value: SExpr) =>
1487
+ kind === PARAM_BOOL
1488
+ ? isSymbol(value, "true") || (isSymbol(value, "false") ? false : undefined)
1489
+ : kind === PARAM_UINT
1490
+ ? isUnsignedNumeral(value)
1491
+ ? Number(value.text)
1492
+ : undefined
1493
+ : kind === PARAM_NUMERAL
1494
+ ? value.kind === "numeral" || value.kind === "decimal"
1495
+ ? value.text
1496
+ : undefined
1497
+ : isSymbol(value)
1498
+ ? value.text
1499
+ : undefined;
1500
+
1501
+ const getUntypedParamValue = (value: SExpr) =>
1502
+ value.kind === "list"
1503
+ ? undefined
1504
+ : value.kind === "numeral"
1505
+ ? Number(value.text)
1506
+ : value.text === "true" || (value.text === "false" ? false : value.text);
1507
+
1508
+ const isUnportedParam = (descr: ParamDescr, value: TacticParam) =>
1509
+ !descr.isPorted && value !== descr.defaultValue;
1510
+
1511
+ const checkParams = (descrs: ParamDescrs, params: TacticParams) => {
1512
+ for (const [name, value] of params) {
1513
+ const descr = descrs.get(name);
1514
+ if (descr !== undefined && isUnportedParam(descr, value))
1515
+ throw new SmtUnsupportedError(`the parameter ${name} of the tactic`);
1516
+ }
1517
+ };
1518
+
1519
+ // sexpr2tactic reports an error at the s-expression: a list at its closing parenthesis.
1520
+ const getSexprPosition = (sexpr: SExpr) => (sexpr.kind === "list" ? sexpr.end : sexpr);
1521
+
1522
+ const getParams = (
1523
+ builder: TacticBuilder,
1524
+ items: SExpr[],
1525
+ isInternal: boolean,
1526
+ ): Map<string, TacticParam> => {
1527
+ const params = new Map<string, TacticParam>();
1528
+ for (let index = 2; index < items.length; index += 2) {
1529
+ const keyword = items[index];
1530
+ if (keyword.kind !== "keyword")
1531
+ throw new SmtParseError(
1532
+ "invalid using-params combinator, keyword expected",
1533
+ getSexprPosition(keyword),
1534
+ );
1535
+ const value = items[index + 1];
1536
+ if (value === undefined)
1537
+ throw new SmtParseError("invalid using-params combinator, parameter value expected", keyword);
1538
+ const found = findParam(builder.descrs, getParamName(keyword.text));
1539
+ if (isInternal) {
1540
+ const parsed =
1541
+ found === undefined
1542
+ ? getUntypedParamValue(value)
1543
+ : parseParamValue(found.descr.kind, value);
1544
+ if (parsed === undefined)
1545
+ throw new SmtParseError("invalid parameter value", getSexprPosition(value));
1546
+ params.set(found?.name ?? getParamName(keyword.text), parsed);
1547
+ continue;
1548
+ }
1549
+ if (found === undefined) {
1550
+ if (!builder.isRejectingUnknown)
1551
+ throw new SmtUnsupportedError(`the parameter ${keyword.text} of the tactic`);
1552
+ throw new SmtParseError(
1553
+ `invalid using-params combinator, unknown parameter ${getParamName(keyword.text)}`,
1554
+ getSexprPosition(value),
1555
+ );
1556
+ }
1557
+ const parsed = parseParamValue(found.descr.kind, value);
1558
+ if (parsed === undefined)
1559
+ throw new SmtParseError(
1560
+ found.descr.kind === PARAM_BOOL
1561
+ ? "invalid parameter value, true or false expected"
1562
+ : found.descr.kind === PARAM_UINT
1563
+ ? "invalid parameter value, unsigned integer expected"
1564
+ : found.descr.kind === PARAM_NUMERAL
1565
+ ? "invalid parameter value, numeral expected"
1566
+ : "invalid parameter value, symbol expected",
1567
+ getSexprPosition(value),
1568
+ );
1569
+ if (isUnportedParam(found.descr, parsed))
1570
+ throw new SmtUnsupportedError(`the parameter ${found.name} of the tactic`);
1571
+ params.set(found.name, parsed);
1572
+ }
1573
+ return params;
1574
+ };
1575
+
1576
+ const mergeDescrs = (builders: TacticBuilder[]) => ({
1577
+ descrs: new Map(builders.flatMap((builder) => [...builder.descrs])),
1578
+ isRejectingUnknown: builders.every((builder) => builder.isRejectingUnknown),
1579
+ isTrackingDependencies: builders.every((builder) => builder.isTrackingDependencies),
1580
+ });
1581
+
1582
+ const isDecidedSat = (goals: Goal[]) => goals.length === 1 && goals[0].isDecidedSat();
1583
+
1584
+ const isDecidedUnsat = (goals: Goal[]) => goals.length === 1 && goals[0].isDecidedUnsat();
1585
+
1586
+ // Deviation from Z3: and_then and repeat join the subgoals' cores, where Z3 answers an empty core.
1587
+ const assertUnsat = (goal: Goal, unsatGoals: Goal[]) => {
1588
+ goal.resetAll();
1589
+ goal.assert(
1590
+ goal.manager.falseExpr,
1591
+ unsatGoals.reduce<Dependency | undefined>(
1592
+ (core, unsatGoal) => joinDependencies(unsatGoal.getDependency(0), core),
1593
+ undefined,
1594
+ ),
1595
+ );
1596
+ return [goal];
1597
+ };
1598
+
1599
+ const runAndThen = (first: Tactic, second: Tactic) => (goal: Goal) => {
1600
+ const goals = first(goal);
1601
+ if (goals.length === 1) return goals[0].isDecided() ? goals : second(goals[0]);
1602
+ const results: Goal[] = [];
1603
+ const unsatGoals: Goal[] = [];
1604
+ for (const subgoal of goals) {
1605
+ const subresults = second(subgoal);
1606
+ if (isDecidedSat(subresults)) return subresults;
1607
+ (isDecidedUnsat(subresults) ? unsatGoals : results).push(...subresults);
1608
+ }
1609
+ return results.length > 0 ? results : assertUnsat(goal, unsatGoals);
1610
+ };
1611
+
1612
+ const runOrElse = (tactics: Tactic[]) => (goal: Goal) => {
1613
+ const original = goal.copy();
1614
+ for (const tactic of tactics.slice(0, -1)) {
1615
+ try {
1616
+ return tactic(goal);
1617
+ } catch (error) {
1618
+ if (!(error instanceof SmtTacticError || error instanceof SmtCanceledError)) throw error;
1619
+ }
1620
+ goal.resetAll();
1621
+ goal.copyFrom(original);
1622
+ }
1623
+ return tactics[tactics.length - 1](goal);
1624
+ };
1625
+
1626
+ const isEqualGoal = (first: Goal, second: Goal) => {
1627
+ if (first.forms.size !== second.forms.size) return false;
1628
+ const firstForms = new Set(first.forms.items);
1629
+ const secondForms = new Set(second.forms.items);
1630
+ return (
1631
+ firstForms.size === secondForms.size && [...secondForms].every((form) => firstForms.has(form))
1632
+ );
1633
+ };
1634
+
1635
+ const runRepeat = (tactic: Tactic, maxDepth: number) => {
1636
+ const run = (depth: number, goal: Goal): Goal[] => {
1637
+ if (depth > maxDepth) return [goal];
1638
+ const original = goal.copy();
1639
+ const goals = tactic(goal);
1640
+ if (goals.length === 1 && isEqualGoal(original, goals[0])) return goals;
1641
+ if (goals.length === 1) return goals[0].isDecided() ? goals : run(depth + 1, goals[0]);
1642
+ const results: Goal[] = [];
1643
+ const unsatGoals: Goal[] = [];
1644
+ for (const subgoal of goals) {
1645
+ const subresults = run(depth + 1, subgoal);
1646
+ if (isDecidedSat(subresults)) return subresults;
1647
+ (isDecidedUnsat(subresults) ? unsatGoals : results).push(...subresults);
1648
+ }
1649
+ return results.length > 0 ? results : assertUnsat(goal, unsatGoals);
1650
+ };
1651
+ return (goal: Goal) => run(0, goal);
1652
+ };
1653
+
1654
+ const runCond = (probe: Probe, onTrue: Tactic, onFalse: Tactic) => (goal: Goal) =>
1655
+ probe(goal) === 0 ? onFalse(goal) : onTrue(goal);
1656
+
1657
+ const checkHasArgument = (list: SmtList, combinator: string) => {
1658
+ if (list.items.length < 2)
1659
+ throw new SmtParseError(
1660
+ `invalid ${combinator} combinator, at least one argument expected`,
1661
+ list.end,
1662
+ );
1663
+ };
1664
+
1665
+ const compile = (
1666
+ environment: TacticEnvironment,
1667
+ sexpr: SExpr,
1668
+ isInternal: boolean,
1669
+ ): TacticBuilder => {
1670
+ if (sexpr.kind !== "list") {
1671
+ if (!isSymbol(sexpr)) throw new SmtParseError("invalid tactic, unexpected input", sexpr);
1672
+ const named = NAMED_TACTICS.get(sexpr.text);
1673
+ if (named !== undefined)
1674
+ return {
1675
+ descrs: named.descrs,
1676
+ isRejectingUnknown: named.isRejectingUnknown ?? true,
1677
+ isTrackingDependencies: named.isTrackingDependencies ?? false,
1678
+ build: (params) => {
1679
+ const tactic = named.build(environment, params);
1680
+ if (!isInternal) return tactic;
1681
+ return (goal) => {
1682
+ checkParams(named.descrs, params);
1683
+ return tactic(goal);
1684
+ };
1685
+ },
1686
+ };
1687
+ const strategy = LOGIC_TACTICS.get(sexpr.text);
1688
+ if (strategy !== undefined)
1689
+ return compile(environment, createCommandReader(strategy).read() as SmtList, true);
1690
+ if (UNPORTED_TACTICS.has(sexpr.text)) {
1691
+ const error = new SmtUnsupportedError(`the tactic ${sexpr.text}`);
1692
+ if (!isInternal) throw error;
1693
+ return {
1694
+ descrs: new Map(),
1695
+ isRejectingUnknown: false,
1696
+ isTrackingDependencies: false,
1697
+ build: () => () => {
1698
+ throw error;
1699
+ },
1700
+ };
1701
+ }
1702
+ throw new SmtParseError(`invalid tactic, unknown tactic ${sexpr.text}`, sexpr);
1703
+ }
1704
+ const head = sexpr.items[0];
1705
+ if (head === undefined) throw new SmtParseError("invalid tactic, arguments expected", sexpr.end);
1706
+ if (!isSymbol(head)) throw new SmtParseError("invalid tactic, symbol expected", sexpr.end);
1707
+ const compileChildren = (combinator: string) => {
1708
+ checkHasArgument(sexpr, combinator);
1709
+ return sexpr.items.slice(1).map((child) => compile(environment, child, isInternal));
1710
+ };
1711
+ switch (head.text) {
1712
+ case "then":
1713
+ case "and-then": {
1714
+ const children = compileChildren("and-then");
1715
+ return {
1716
+ ...mergeDescrs(children),
1717
+ build: (params) =>
1718
+ children
1719
+ .map((child) => child.build(params))
1720
+ .reduceRight((second, first) => runAndThen(first, second)),
1721
+ };
1722
+ }
1723
+ case "or-else": {
1724
+ const children = compileChildren("or-else");
1725
+ if (children.length === 1) return children[0];
1726
+ return {
1727
+ ...mergeDescrs(children),
1728
+ build: (params) => runOrElse(children.map((child) => child.build(params))),
1729
+ };
1730
+ }
1731
+ // Z3 runs these children in threads, and running them in order is one schedule it may pick.
1732
+ case "par":
1733
+ case "par-or": {
1734
+ const children = compileChildren("par-or");
1735
+ if (children.length === 1) return children[0];
1736
+ return {
1737
+ ...mergeDescrs(children),
1738
+ build: (params) => runOrElse(children.map((child) => child.build(params))),
1739
+ };
1740
+ }
1741
+ case "par-then": {
1742
+ const children = compileChildren("par-then");
1743
+ if (children.length === 1) return children[0];
1744
+ return {
1745
+ ...mergeDescrs(children),
1746
+ build: (params) =>
1747
+ children
1748
+ .map((child) => child.build(params))
1749
+ .reduceRight((second, first) => (goal) => {
1750
+ if (goal.isProofsEnabled)
1751
+ throw new SmtTacticError("par_and_then does not support proof production");
1752
+ return runAndThen(first, second)(goal);
1753
+ }),
1754
+ };
1755
+ }
1756
+ // The timeout is not ported, so the child runs to the end.
1757
+ case "try-for": {
1758
+ if (sexpr.items.length !== 3)
1759
+ throw new SmtParseError("invalid try-for combinator, two arguments expected", sexpr.end);
1760
+ if (!isUnsignedNumeral(sexpr.items[2]))
1761
+ throw new SmtParseError(
1762
+ "invalid try-for combinator, second argument must be an unsigned integer",
1763
+ sexpr.end,
1764
+ );
1765
+ const child = compile(environment, sexpr.items[1], isInternal);
1766
+ return {
1767
+ ...child,
1768
+ build: (params) => {
1769
+ const tactic = child.build(params);
1770
+ return (goal) => {
1771
+ try {
1772
+ return tactic(goal);
1773
+ } catch (error) {
1774
+ if (error instanceof SmtDefaultError) throw new SmtTacticError(error.message);
1775
+ if (error instanceof SmtCanceledError)
1776
+ throw new SmtTacticError(goal.manager.limit.getCancelMessage());
1777
+ throw error;
1778
+ }
1779
+ };
1780
+ },
1781
+ };
1782
+ }
1783
+ case "fail-if-branching": {
1784
+ if (sexpr.items.length !== 3 && sexpr.items.length !== 2)
1785
+ throw new SmtParseError(
1786
+ "invalid fail-if-branching combinator, one or two arguments expected",
1787
+ sexpr.end,
1788
+ );
1789
+ const bound = sexpr.items[2];
1790
+ if (bound !== undefined && !isUnsignedNumeral(bound))
1791
+ throw new SmtParseError(
1792
+ "invalid fail-if-branching combinator, second argument must be an unsigned integer",
1793
+ sexpr.end,
1794
+ );
1795
+ const child = compile(environment, sexpr.items[1], isInternal);
1796
+ const threshold = bound === undefined ? 1 : Number(bound.text);
1797
+ return {
1798
+ ...mergeDescrs([child]),
1799
+ build: (params) => {
1800
+ const tactic = child.build(params);
1801
+ return (goal) => {
1802
+ const goals = tactic(goal);
1803
+ if (goals.length > threshold) throw new SmtTacticError("failed-if-branching tactical");
1804
+ return goals;
1805
+ };
1806
+ },
1807
+ };
1808
+ }
1809
+ case "if-no-proofs":
1810
+ case "if-no-unsat-cores":
1811
+ case "if-no-models": {
1812
+ if (sexpr.items.length !== 2)
1813
+ throw new SmtParseError(
1814
+ `invalid ${head.text} combinator, one argument expected`,
1815
+ sexpr.end,
1816
+ );
1817
+ const child = compile(environment, sexpr.items[1], isInternal);
1818
+ const isSkipping = (goal: Goal) =>
1819
+ head.text === "if-no-models"
1820
+ ? goal.isModelsEnabled
1821
+ : head.text === "if-no-proofs"
1822
+ ? goal.isProofsEnabled
1823
+ : goal.isCoresEnabled;
1824
+ return {
1825
+ ...mergeDescrs([child]),
1826
+ build: (params) => {
1827
+ const tactic = child.build(params);
1828
+ return (goal) => (isSkipping(goal) ? [goal] : tactic(goal));
1829
+ },
1830
+ };
1831
+ }
1832
+ case "repeat": {
1833
+ if (sexpr.items.length !== 3 && sexpr.items.length !== 2)
1834
+ throw new SmtParseError(
1835
+ "invalid repeat combinator, one or two arguments expected",
1836
+ sexpr.end,
1837
+ );
1838
+ const bound = sexpr.items[2];
1839
+ if (bound !== undefined && !isUnsignedNumeral(bound))
1840
+ throw new SmtParseError(
1841
+ "invalid repeat combinator, second argument must be an unsigned integer",
1842
+ sexpr.end,
1843
+ );
1844
+ const child = compile(environment, sexpr.items[1], isInternal);
1845
+ const maxDepth = bound === undefined ? UINT_MAX : Number(bound.text);
1846
+ return {
1847
+ ...mergeDescrs([child]),
1848
+ build: (params) => runRepeat(child.build(params), maxDepth),
1849
+ };
1850
+ }
1851
+ case "!":
1852
+ case "using-params":
1853
+ case "with": {
1854
+ checkHasArgument(sexpr, "using-params");
1855
+ const child = compile(environment, sexpr.items[1], isInternal);
1856
+ if (sexpr.items.length === 2) return child;
1857
+ const own = getParams(child, sexpr.items, isInternal);
1858
+ return {
1859
+ ...mergeDescrs([child]),
1860
+ build: (params) => child.build(new Map([...params, ...own])),
1861
+ };
1862
+ }
1863
+ case "skip-if-failed": {
1864
+ if (sexpr.items.length !== 2)
1865
+ throw new SmtParseError(
1866
+ "invalid skip-if-failed combinator, one argument expected",
1867
+ sexpr.end,
1868
+ );
1869
+ const child = compile(environment, sexpr.items[1], isInternal);
1870
+ return {
1871
+ ...mergeDescrs([child]),
1872
+ build: (params) => runOrElse([child.build(params), (goal) => [goal]]),
1873
+ };
1874
+ }
1875
+ case "if":
1876
+ case "ite":
1877
+ case "cond": {
1878
+ if (sexpr.items.length !== 4)
1879
+ throw new SmtParseError(
1880
+ "invalid if/conditional combinator, three arguments expected",
1881
+ sexpr.end,
1882
+ );
1883
+ const probe = compileProbe(sexpr.items[1], isInternal);
1884
+ const children = sexpr.items.slice(2).map((child) => compile(environment, child, isInternal));
1885
+ return {
1886
+ ...mergeDescrs(children),
1887
+ build: (params) => runCond(probe, children[0].build(params), children[1].build(params)),
1888
+ };
1889
+ }
1890
+ case "when": {
1891
+ if (sexpr.items.length !== 3)
1892
+ throw new SmtParseError("invalid when combinator, two arguments expected", sexpr.end);
1893
+ const probe = compileProbe(sexpr.items[1], isInternal);
1894
+ const child = compile(environment, sexpr.items[2], isInternal);
1895
+ return {
1896
+ ...mergeDescrs([child]),
1897
+ build: (params) => runCond(probe, child.build(params), (goal) => [goal]),
1898
+ };
1899
+ }
1900
+ case "fail-if": {
1901
+ if (sexpr.items.length !== 2)
1902
+ throw new SmtParseError("invalid fail-if tactic, one argument expected", sexpr.end);
1903
+ const probe = compileProbe(sexpr.items[1], isInternal);
1904
+ return {
1905
+ descrs: new Map(),
1906
+ isRejectingUnknown: true,
1907
+ isTrackingDependencies: true,
1908
+ build: () => (goal) => {
1909
+ if (probe(goal) !== 0) throw new SmtTacticError("fail-if tactic");
1910
+ return [goal];
1911
+ },
1912
+ };
1913
+ }
1914
+ case "echo": {
1915
+ if (sexpr.items.length < 2)
1916
+ throw new SmtParseError("invalid echo tactic, must have at least one argument", sexpr.end);
1917
+ const pieces = sexpr.items.slice(1).map((piece, index, all): Tactic => {
1918
+ const newline = index === all.length - 1 ? "\n" : "";
1919
+ if (piece.kind === "string")
1920
+ return (goal) => {
1921
+ environment.write(piece.text + newline, false);
1922
+ return [goal];
1923
+ };
1924
+ const probe = compileProbe(piece, isInternal);
1925
+ return (goal) => {
1926
+ environment.write(formatProbeValue(probe(goal)) + newline, true);
1927
+ return [goal];
1928
+ };
1929
+ });
1930
+ return {
1931
+ descrs: new Map(),
1932
+ isRejectingUnknown: true,
1933
+ isTrackingDependencies: true,
1934
+ build: () => pieces.reduceRight((second, first) => runAndThen(first, second)),
1935
+ };
1936
+ }
1937
+ default:
1938
+ throw new SmtParseError(`invalid tactic, unknown tactic combinator ${head.text}`, sexpr.end);
1939
+ }
1940
+ };
1941
+
1942
+ // inc_sat_solver's init_preprocess, with sat.euf.
1943
+ export const mkIncSatEufPreprocess = (manager: AstManager) =>
1944
+ runAndThen(
1945
+ inPlace((goal) => simplifyGoal(manager, goal, getRewriterOptions(manager, new Map()))),
1946
+ inPlace((goal) => propagateValues(manager, goal)),
1947
+ );
1948
+
1949
+ // inc_sat_solver's init_preprocess, without sat.euf.
1950
+ export const mkIncSatPreprocess = (manager: AstManager, bitBlaster: BitBlasterRewriter) =>
1951
+ [
1952
+ inPlace((goal) => simplifyGoal(manager, goal, getRewriterOptions(manager, new Map()))),
1953
+ inPlace((goal) => propagateValues(manager, goal)),
1954
+ inPlace((goal) => card2bv(manager, goal, getRewriterOptions(manager, new Map()))),
1955
+ inPlace((goal) =>
1956
+ simplifyGoal(
1957
+ manager,
1958
+ goal,
1959
+ getRewriterOptions(
1960
+ manager,
1961
+ new Map<string, TacticParam>([
1962
+ ["som", true],
1963
+ ["pull_cheap_ite", true],
1964
+ ["push_ite_bv", false],
1965
+ ["local_ctx", true],
1966
+ ["local_ctx_limit", 10000000],
1967
+ ["flat", true],
1968
+ ["hoist_mul", false],
1969
+ ["elim_and", true],
1970
+ ["blast_distinct", true],
1971
+ ]),
1972
+ ),
1973
+ ),
1974
+ ),
1975
+ runMaxBvSharing(manager),
1976
+ runBitBlast(
1977
+ manager,
1978
+ { isBlastingMul: true, isBlastingAdd: true, isBlastingQuant: false, isBlastingFull: false },
1979
+ bitBlaster,
1980
+ ),
1981
+ inPlace((goal) =>
1982
+ simplifyGoal(manager, goal, getRewriterOptions(manager, new Map([["flat", false]]))),
1983
+ ),
1984
+ ].reduceRight((second, first) => runAndThen(first, second));
1985
+
1986
+ export const compileTactic = (environment: TacticEnvironment, sexpr: SExpr) =>
1987
+ compile(environment, sexpr, false);
1988
+
1989
+ export const compileInternalTactic = (environment: TacticEnvironment, text: string) => {
1990
+ const list = createCommandReader(`(${text})`).read() as SmtList;
1991
+ return compile(environment, list.items[0], true).build(new Map());
1992
+ };
1993
+
1994
+ interface TacticCheck {
1995
+ status: number;
1996
+ model: ProtoModel | undefined;
1997
+ core: Dependency | undefined;
1998
+ reasonUnknown: string | undefined;
1999
+ isConversionCanceled: boolean;
2000
+ }
2001
+
2002
+ // The port's declarations of division by zero leave out their domain; Z3's have two arguments.
2003
+ const DIVISION_BY_ZERO_DECLS = new Set([OP_DIV0, OP_IDIV0, OP_MOD0, OP_POWER0]);
2004
+
2005
+ // A constant of an uninterpreted sort the model lacks puts its value in that sort's universe.
2006
+ export const applyDefinitions = (definitions: readonly Definition[], model: ProtoModel) => {
2007
+ const manager = model.manager;
2008
+ const universe: number[] = [];
2009
+ let evaluator = new ModelEvaluator(manager, model);
2010
+ evaluator.setModelCompletion(true);
2011
+ for (let index = definitions.length - 1; index >= 0; index--) {
2012
+ const definition = definitions[index];
2013
+ if (definition.def === -1) {
2014
+ model.unregisterDecl(definition.decl);
2015
+ continue;
2016
+ }
2017
+ const value = evaluator.rewrite(definition.def);
2018
+ const arity = DIVISION_BY_ZERO_DECLS.has(definition.decl)
2019
+ ? 2
2020
+ : manager.funcDecls[definition.decl].domain.length;
2021
+ if (arity > 0) {
2022
+ const oldInterp = model.funcInterps.get(definition.decl);
2023
+ const isChanged = oldInterp?.elseExpr !== value;
2024
+ if (isChanged) {
2025
+ const interp = new FuncInterp(manager, arity);
2026
+ interp.setElse(value);
2027
+ model.registerFunc(definition.decl, interp);
2028
+ }
2029
+ manager.decRef(value);
2030
+ if (oldInterp !== undefined && isChanged) {
2031
+ evaluator.release();
2032
+ evaluator = new ModelEvaluator(manager, model);
2033
+ evaluator.setModelCompletion(true);
2034
+ }
2035
+ continue;
2036
+ }
2037
+ const old = model.constInterps.get(definition.decl);
2038
+ if (old !== value) model.registerConst(definition.decl, value);
2039
+ const sort = manager.sorts[value];
2040
+ if (
2041
+ manager.isUninterpretedSort(sort) &&
2042
+ !model.getUninterpretedSorts().includes(sort) &&
2043
+ !universe.includes(value)
2044
+ )
2045
+ universe.push(value);
2046
+ manager.decRef(value);
2047
+ if (old !== undefined && old !== value) {
2048
+ evaluator.release();
2049
+ evaluator = new ModelEvaluator(manager, model);
2050
+ evaluator.setModelCompletion(true);
2051
+ }
2052
+ }
2053
+ evaluator.release();
2054
+ for (const value of universe) model.registerValue(value);
2055
+ return model;
2056
+ };
2057
+
2058
+ const applyConverter = (entry: Goal["converters"][number], model: ProtoModel) => {
2059
+ if ("convert" in entry) return entry.convert(model);
2060
+ if ("definitions" in entry) return applyDefinitions(entry.definitions, model);
2061
+ model.unregisterDecl(entry.decl);
2062
+ return model;
2063
+ };
2064
+
2065
+ export const convertModel = (goal: Goal, model: ProtoModel) =>
2066
+ goal.converters.reduceRight((converted, entry) => applyConverter(entry, converted), model);
2067
+
2068
+ const getConvertedModel = (goal: Goal) => {
2069
+ let model = goal.model?.copy() ?? new ProtoModel(goal.manager).mkModel();
2070
+ for (let index = goal.converters.length - 1; index >= 0; index--) {
2071
+ try {
2072
+ model = applyConverter(goal.converters[index], model);
2073
+ } catch (error) {
2074
+ if (!(error instanceof SmtCanceledError)) throw error;
2075
+ return { model, isCanceled: true };
2076
+ }
2077
+ }
2078
+ return { model, isCanceled: false };
2079
+ };
2080
+
2081
+ const getTacticCheck = (goal: Goal, goals: Goal[] | string | undefined): TacticCheck => {
2082
+ const undecided = {
2083
+ status: L_UNDEF,
2084
+ model: undefined,
2085
+ core: undefined,
2086
+ isConversionCanceled: false,
2087
+ };
2088
+ if (goals === undefined) return { ...undecided, reasonUnknown: undefined };
2089
+ if (typeof goals === "string") return { ...undecided, reasonUnknown: goals };
2090
+ if (isDecidedUnsat(goals))
2091
+ return { ...undecided, status: L_FALSE, core: goals[0].getDependency(0), reasonUnknown: "" };
2092
+ const isSat = isDecidedSat(goals);
2093
+ const converted =
2094
+ isSat ||
2095
+ (goal.isModelsEnabled &&
2096
+ goals.length > 0 &&
2097
+ (goals[0].model !== undefined || goals[0].converters.length > 0))
2098
+ ? getConvertedModel(goals[0])
2099
+ : undefined;
2100
+ const model = converted?.model;
2101
+ if (converted?.isCanceled === true)
2102
+ return { ...undecided, model, reasonUnknown: undefined, isConversionCanceled: true };
2103
+ if (isSat)
2104
+ return goal.manager.limit.inc()
2105
+ ? { ...undecided, status: L_TRUE, model, reasonUnknown: "" }
2106
+ : { ...undecided, model, reasonUnknown: "canceled" };
2107
+ return {
2108
+ ...undecided,
2109
+ model,
2110
+ reasonUnknown:
2111
+ goals.length === 1 && goals[0].reasonUnknown !== "" ? goals[0].reasonUnknown : "unknown",
2112
+ };
2113
+ };
2114
+
2115
+ export const checkSatUsing = (tactic: Tactic, goal: Goal) => {
2116
+ const goals = (() => {
2117
+ try {
2118
+ return tactic(goal);
2119
+ } catch (error) {
2120
+ if (error instanceof SmtTacticError || error instanceof SmtDefaultError) return error.message;
2121
+ if (error instanceof SmtCanceledError) return undefined;
2122
+ throw error;
2123
+ }
2124
+ })();
2125
+ try {
2126
+ return getTacticCheck(goal, goals);
2127
+ } finally {
2128
+ goal.reset();
2129
+ if (Array.isArray(goals)) for (const result of goals) result.reset();
2130
+ }
2131
+ };
2132
+
2133
+ export const applyTactic = (tactic: Tactic, goal: Goal) => {
2134
+ try {
2135
+ return tactic(goal);
2136
+ } catch (error) {
2137
+ if (error instanceof SmtCanceledError)
2138
+ throw new SmtTacticError(goal.manager.limit.getCancelMessage());
2139
+ throw error;
2140
+ }
2141
+ };