tla-ts 0.0.9 → 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 +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +48 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +122 -12
  8. package/dist/index.d.ts +122 -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 +3 -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 +1156 -888
  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 +330 -659
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +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 +263 -370
  51. package/src/errors.ts +107 -57
  52. package/src/evaluate.ts +898 -369
  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 +137 -22
  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 -322
  64. package/src/liveness.ts +230 -133
  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 +36 -60
  88. package/src/parallel.ts +64 -73
  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 +135 -40
  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 +299 -108
  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 +479 -0
  612. package/src/typescript/collections.ts +614 -0
  613. package/src/typescript/compile.ts +63 -0
  614. package/src/typescript/context.ts +94 -0
  615. package/src/typescript/emit.ts +121 -0
  616. package/src/typescript/expressions.ts +496 -0
  617. package/src/typescript/formula.ts +154 -0
  618. package/src/typescript/functions.ts +284 -0
  619. package/src/typescript/model.ts +162 -0
  620. package/src/typescript/names.ts +114 -0
  621. package/src/typescript/program.ts +48 -0
  622. package/src/typescript/properties.ts +139 -0
  623. package/src/typescript/scope.ts +112 -0
  624. package/src/typescript/steps.ts +167 -0
  625. package/src/typescript/types.ts +171 -0
  626. package/src/values.ts +945 -526
  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,734 @@
1
+ import { SmtCanceledError, SmtTacticError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ KIND_APP,
5
+ KIND_QUANTIFIER,
6
+ OP_ADD,
7
+ OP_AND,
8
+ OP_EQ,
9
+ OP_IMPLIES,
10
+ OP_OR,
11
+ OP_UBV2INT,
12
+ OP_ULEQ,
13
+ SORT_BOOL,
14
+ SORT_INT,
15
+ } from "./ast";
16
+ import { mkNot } from "./ast-util";
17
+ import { BoundManager } from "./bound-manager";
18
+ import { mkBvApp } from "./bv-decl-plugin";
19
+ import { Bv2IntContext, Bv2IntRewriter } from "./bv2int-rewriter";
20
+ import { createCard2Bv } from "./card2bv";
21
+ import { DependentExprState } from "./dependent-expr-state";
22
+ import { Enum2BvRewriter } from "./dt2bv-tactic";
23
+ import { assignOwned, release } from "./expr-ref";
24
+ import { ExprSafeReplace } from "./expr-safe-replace";
25
+ import {
26
+ type Definition,
27
+ type Dependency,
28
+ getDependencyValues,
29
+ Goal,
30
+ mkDependencyLeaf,
31
+ } from "./goal";
32
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
33
+ import type { ProtoModel } from "./proto-model";
34
+ import type { Rational } from "./rational";
35
+ import { RefVector } from "./ref-vector";
36
+ import { Rewriter } from "./rewriter";
37
+ import { RewriterTpl } from "./rewriter-tpl";
38
+ import { applyDefinitions, getRewriterOptions } from "./tactic";
39
+ import { UINT_MAX } from "./sat/clause";
40
+ import type { SatParams } from "./sat/config";
41
+ import { IncSatSolver } from "./sat/inc-sat-solver";
42
+
43
+ const getNumBits = (value: bigint) => {
44
+ let bound = 1n;
45
+ let numBits = 1;
46
+ while (bound <= value) {
47
+ numBits++;
48
+ bound *= 2n;
49
+ }
50
+ return numBits;
51
+ };
52
+
53
+ const collectBounds = (manager: AstManager, bounds: BoundManager, form: number) => {
54
+ if (manager.getOp(form) !== OP_AND) {
55
+ bounds.add(form);
56
+ return;
57
+ }
58
+ for (const arg of manager.getArgs(form)) collectBounds(manager, bounds, arg);
59
+ };
60
+
61
+ class SolverFormulas extends Goal {
62
+ override assert(form: number, dependency?: Dependency) {
63
+ if (this.manager.isFalse(form)) this.isInconsistent = true;
64
+ this.forms.push(form);
65
+ this.dependencies.push(dependency);
66
+ }
67
+
68
+ override update(index: number, form: number, dependency?: Dependency) {
69
+ if (this.manager.isFalse(form)) this.isInconsistent = true;
70
+ this.forms.set(index, form);
71
+ this.dependencies[index] = dependency;
72
+ }
73
+
74
+ flattenSuffix(qhead: number) {
75
+ const manager = this.manager;
76
+ const forms = this.forms;
77
+ const seen = new Set<number>();
78
+ const pinned = new RefVector(manager);
79
+ let kept = qhead;
80
+ for (let index = qhead; index < forms.size; index++) {
81
+ const form = forms.items[index];
82
+ const dependency = this.dependencies[index];
83
+ pinned.push(form);
84
+ if (seen.has(form)) continue;
85
+ seen.add(form);
86
+ if (manager.isTrue(form)) continue;
87
+ if (manager.getOp(form) === OP_AND) {
88
+ const numArgs = manager.getNumArgs(form);
89
+ for (let argIndex = 0; argIndex < numArgs; argIndex++)
90
+ this.assert(manager.getArg(form, argIndex), dependency);
91
+ continue;
92
+ }
93
+ if (manager.isNot(form) && manager.getOp(manager.getArg(form, 0)) === OP_OR) {
94
+ const disjunction = manager.getArg(form, 0);
95
+ const numArgs = manager.getNumArgs(disjunction);
96
+ for (let argIndex = 0; argIndex < numArgs; argIndex++)
97
+ this.assert(mkNot(manager, manager.getArg(disjunction, argIndex)), dependency);
98
+ continue;
99
+ }
100
+ if (index !== kept) {
101
+ forms.set(kept, form);
102
+ this.dependencies[kept] = dependency;
103
+ }
104
+ kept++;
105
+ }
106
+ this.shrinkTo(kept);
107
+ pinned.reset();
108
+ }
109
+
110
+ shrinkTo(size: number) {
111
+ this.forms.shrink(size);
112
+ this.dependencies.length = size;
113
+ }
114
+ }
115
+
116
+ // Z3's dep_expr_state reads the formulas in place, without holding one.
117
+ class FdState extends DependentExprState {
118
+ declare readonly goal: SolverFormulas;
119
+
120
+ override get(index: number) {
121
+ return this.goal.forms.items[index];
122
+ }
123
+ }
124
+
125
+ class MacroReplacer extends RewriterTpl {
126
+ constructor(
127
+ manager: AstManager,
128
+ private readonly decl: number,
129
+ private readonly def: number,
130
+ ) {
131
+ super(manager);
132
+ }
133
+
134
+ override isRewritingPatterns() {
135
+ return false;
136
+ }
137
+
138
+ override getSubst(expr: number) {
139
+ return this.manager.kinds[expr] === KIND_APP && this.manager.decls[expr] === this.decl
140
+ ? this.def
141
+ : undefined;
142
+ }
143
+ }
144
+
145
+ const addVars = (manager: AstManager, expr: number, freeVars: Set<number>) => {
146
+ const visited = new Set<number>();
147
+ const todo = [expr];
148
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
149
+ if (visited.has(current)) continue;
150
+ visited.add(current);
151
+ if (manager.kinds[current] === KIND_QUANTIFIER) todo.push(manager.getQuantifier(current).body);
152
+ else if (manager.kinds[current] === KIND_APP) {
153
+ if (manager.isUninterpreted(current)) freeVars.add(manager.decls[current]);
154
+ manager.pushArgs(current, todo);
155
+ }
156
+ }
157
+ };
158
+
159
+ const retainDefinitions = (manager: AstManager, definitions: readonly Definition[]) => {
160
+ for (const definition of definitions) {
161
+ manager.incDeclRef(definition.decl);
162
+ if (definition.def !== -1) manager.incRef(definition.def);
163
+ }
164
+ return [...definitions];
165
+ };
166
+
167
+ const releaseDefinitions = (manager: AstManager, definitions: readonly Definition[]) => {
168
+ for (let index = definitions.length - 1; index >= 0; index--) {
169
+ const definition = definitions[index];
170
+ if (definition.def !== -1) manager.decRef(definition.def);
171
+ manager.decDeclRef(definition.decl);
172
+ }
173
+ };
174
+
175
+ class ModelTrail {
176
+ readonly entries: Definition[] = [];
177
+
178
+ constructor(private readonly manager: AstManager) {}
179
+
180
+ hide(decl: number) {
181
+ this.manager.incDeclRef(decl);
182
+ this.entries.push({ decl, def: -1 });
183
+ }
184
+
185
+ define(decl: number, def: number) {
186
+ this.manager.incDeclRef(decl);
187
+ this.manager.incRef(def);
188
+ this.entries.push({ decl, def });
189
+ }
190
+
191
+ shrink(size: number) {
192
+ releaseDefinitions(this.manager, this.entries.splice(size));
193
+ }
194
+
195
+ replay(qhead: number, assumptions: RefVector, fmls: SolverFormulas) {
196
+ const manager = this.manager;
197
+ if (this.entries.length === 0) return;
198
+ if (qhead === fmls.forms.size && assumptions.size === 0) return;
199
+ const freeVars = new Set<number>();
200
+ for (let index = qhead; index < fmls.forms.size; index++)
201
+ addVars(manager, fmls.forms.items[index], freeVars);
202
+ for (const assumption of assumptions.items) addVars(manager, assumption, freeVars);
203
+ if (!this.entries.some((entry) => entry.def !== -1 && freeVars.has(entry.decl))) return;
204
+ for (const entry of this.entries) {
205
+ if (entry.def === -1 || !freeVars.has(entry.decl)) continue;
206
+ addVars(manager, entry.def, freeVars);
207
+ const replacer = new MacroReplacer(manager, entry.decl, entry.def);
208
+ // Deviation from Z3: macro_replacer returns the rewrite of a named formula's last name, which drops the formula.
209
+ for (let index = qhead; index < fmls.forms.size; index++) {
210
+ const form = fmls.forms.items[index];
211
+ const replaced = replacer.rewrite(form);
212
+ replacer.reset();
213
+ if (replaced !== form) fmls.update(index, replaced, fmls.getDependency(index));
214
+ manager.decRef(replaced);
215
+ }
216
+ for (let index = 0; index < assumptions.size; index++) {
217
+ assumptions.setOwned(index, replacer.rewrite(assumptions.items[index]));
218
+ replacer.reset();
219
+ }
220
+ replacer.release();
221
+ }
222
+ }
223
+ }
224
+
225
+ class BoundedInt2BvSimplifier {
226
+ private readonly bounds: BoundManager[];
227
+ private readonly bvFns: number[] = [];
228
+ private readonly intFns: number[] = [];
229
+ private readonly fnLimits: number[] = [];
230
+ private readonly int2bv = new Map<number, number>();
231
+ private readonly bv2offset = new Map<number, Rational>();
232
+ private readonly context: Bv2IntContext;
233
+ private readonly rewriter: Bv2IntRewriter;
234
+ private readonly sideConditions: RefVector;
235
+
236
+ constructor(private readonly manager: AstManager) {
237
+ this.bounds = [new BoundManager(manager)];
238
+ this.context = new Bv2IntContext(manager, UINT_MAX);
239
+ this.rewriter = new Bv2IntRewriter(manager, this.context);
240
+ this.sideConditions = new RefVector(manager);
241
+ }
242
+
243
+ private accumulateSubstitution(
244
+ substitution: ExprSafeReplace,
245
+ bounds: BoundManager,
246
+ trail: ModelTrail,
247
+ ) {
248
+ const manager = this.manager;
249
+ for (const expr of bounds.boundedVars) {
250
+ const lower = bounds.lowers.get(expr);
251
+ const upper = bounds.uppers.get(expr);
252
+ if (
253
+ lower === undefined ||
254
+ upper === undefined ||
255
+ lower.value.compare(upper.value) > 0 ||
256
+ lower.isStrict ||
257
+ upper.isStrict ||
258
+ manager.sorts[expr] !== SORT_INT
259
+ )
260
+ continue;
261
+ const decl = manager.decls[expr];
262
+ const bvDecl =
263
+ this.int2bv.get(decl) ?? this.addBitVector(decl, lower.value, upper.value, trail);
264
+ const offset = this.bv2offset.get(bvDecl) ?? lower.value;
265
+ substitution.insert(expr, this.mkValue(bvDecl, offset));
266
+ }
267
+ }
268
+
269
+ private mkValue(bvDecl: number, offset: Rational) {
270
+ const manager = this.manager;
271
+ const unsigned = mkBvApp(manager, OP_UBV2INT, [
272
+ manager.mkApp(bvDecl, [], manager.funcDecls[bvDecl].range),
273
+ ]);
274
+ return offset.isZero()
275
+ ? unsigned
276
+ : manager.mkApp(OP_ADD, [unsigned, manager.mkNumeral(offset.num)], SORT_INT);
277
+ }
278
+
279
+ private addBitVector(decl: number, lower: Rational, upper: Rational, trail: ModelTrail) {
280
+ const manager = this.manager;
281
+ const domainSize = upper.sub(lower).num + 1n;
282
+ const numBits = getNumBits(domainSize);
283
+ const bits = manager.mkFreshConst("b", manager.mkBvSort(numBits));
284
+ manager.incRef(bits);
285
+ const bvDecl = manager.decls[bits];
286
+ this.int2bv.set(decl, bvDecl);
287
+ this.bv2offset.set(bvDecl, lower);
288
+ manager.incDeclRef(bvDecl);
289
+ this.bvFns.push(bvDecl);
290
+ manager.incDeclRef(decl);
291
+ this.intFns.push(decl);
292
+ trail.hide(bvDecl);
293
+ trail.define(decl, this.mkValue(bvDecl, lower));
294
+ if (!lower.isZero() && (domainSize & (domainSize - 1n)) !== 0n)
295
+ this.sideConditions.push(
296
+ mkBvApp(manager, OP_ULEQ, [bits, manager.mkBvNumeral(domainSize - 1n, numBits)]),
297
+ );
298
+ manager.decRef(bits);
299
+ return bvDecl;
300
+ }
301
+
302
+ reduce(state: FdState, trail: ModelTrail) {
303
+ const manager = this.manager;
304
+ const fmls = state.goal;
305
+ const bounds = this.bounds[this.bounds.length - 1];
306
+ state.forEachIndex((index) => collectBounds(manager, bounds, fmls.forms.items[index]));
307
+ const substitution = new ExprSafeReplace(manager);
308
+ try {
309
+ for (const scopeBounds of this.bounds)
310
+ this.accumulateSubstitution(substitution, scopeBounds, trail);
311
+ if (substitution.sources.size > 0) {
312
+ let replaced = -1;
313
+ let result = -1;
314
+ try {
315
+ state.forEachIndex((index) => {
316
+ const form = fmls.forms.items[index];
317
+ replaced = assignOwned(manager, replaced, substitution.apply(form));
318
+ result = assignOwned(manager, result, this.rewriter.rewrite(replaced));
319
+ if (result !== form) fmls.update(index, result, fmls.getDependency(index));
320
+ });
321
+ } finally {
322
+ release(manager, result);
323
+ release(manager, replaced);
324
+ }
325
+ }
326
+ for (const condition of this.sideConditions.items) fmls.assert(condition);
327
+ this.sideConditions.reset();
328
+ this.rewriter.reset();
329
+ } finally {
330
+ substitution.release();
331
+ }
332
+ }
333
+
334
+ push() {
335
+ this.fnLimits.push(this.bvFns.length);
336
+ this.bounds.push(new BoundManager(this.manager));
337
+ }
338
+
339
+ pop(numScopes: number) {
340
+ const manager = this.manager;
341
+ const limit = this.fnLimits[this.fnLimits.length - numScopes];
342
+ for (let index = this.intFns.length - 1; index >= limit; index--) {
343
+ this.int2bv.delete(this.intFns[index]);
344
+ this.bv2offset.delete(this.bvFns[index]);
345
+ }
346
+ for (const decl of this.bvFns.splice(limit)) manager.decDeclRef(decl);
347
+ for (const decl of this.intFns.splice(limit)) manager.decDeclRef(decl);
348
+ this.fnLimits.length -= numScopes;
349
+ this.bounds.length -= numScopes;
350
+ }
351
+
352
+ release() {
353
+ const manager = this.manager;
354
+ this.sideConditions.reset();
355
+ this.rewriter.release();
356
+ this.context.release();
357
+ for (const decl of this.intFns) manager.decDeclRef(decl);
358
+ for (const decl of this.bvFns) manager.decDeclRef(decl);
359
+ }
360
+ }
361
+
362
+ class Enum2BvSimplifier {
363
+ private readonly rewriter: Enum2BvRewriter;
364
+ private readonly hidden = new Set<number>();
365
+ private readonly defined = new Set<number>();
366
+ private readonly hiddenTrail: number[] = [];
367
+ private readonly definedTrail: number[] = [];
368
+ private readonly hiddenLimits: number[] = [];
369
+ private readonly definedLimits: number[] = [];
370
+
371
+ constructor(private readonly manager: AstManager) {
372
+ this.rewriter = new Enum2BvRewriter(manager, undefined);
373
+ }
374
+
375
+ reduce(state: FdState, trail: ModelTrail) {
376
+ const manager = this.manager;
377
+ const fmls = state.goal;
378
+ const rewriter = this.rewriter;
379
+ let result = -1;
380
+ try {
381
+ state.forEachIndex((index) => {
382
+ const form = fmls.forms.items[index];
383
+ result = assignOwned(manager, result, rewriter.rewrite(form));
384
+ if (result !== form) fmls.update(index, result, fmls.getDependency(index));
385
+ });
386
+ const bounds = new RefVector(manager);
387
+ for (const bound of rewriter.bounds.items) bounds.push(bound);
388
+ rewriter.bounds.reset();
389
+ for (const bound of bounds.items) fmls.assert(bound);
390
+ bounds.reset();
391
+ for (const [, index] of rewriter.enumIndexes) {
392
+ const bvDecl = rewriter.enumBvs[index];
393
+ if (this.hidden.has(bvDecl)) continue;
394
+ this.hidden.add(bvDecl);
395
+ manager.incDeclRef(bvDecl);
396
+ this.hiddenTrail.push(bvDecl);
397
+ trail.hide(bvDecl);
398
+ }
399
+ for (const [decl, index] of rewriter.enumIndexes) {
400
+ if (this.defined.has(decl)) continue;
401
+ this.defined.add(decl);
402
+ manager.incDeclRef(decl);
403
+ this.definedTrail.push(decl);
404
+ trail.define(decl, rewriter.enumDefs.items[index]);
405
+ }
406
+ } finally {
407
+ release(manager, result);
408
+ }
409
+ }
410
+
411
+ push() {
412
+ this.rewriter.push();
413
+ this.hiddenLimits.push(this.hiddenTrail.length);
414
+ this.definedLimits.push(this.definedTrail.length);
415
+ }
416
+
417
+ pop(numScopes: number) {
418
+ const manager = this.manager;
419
+ const hiddenLimit = this.hiddenLimits[this.hiddenLimits.length - numScopes];
420
+ const definedLimit = this.definedLimits[this.definedLimits.length - numScopes];
421
+ for (let index = this.hiddenTrail.length - 1; index >= hiddenLimit; index--)
422
+ this.hidden.delete(this.hiddenTrail[index]);
423
+ for (let index = this.definedTrail.length - 1; index >= definedLimit; index--)
424
+ this.defined.delete(this.definedTrail[index]);
425
+ for (const decl of this.hiddenTrail.splice(hiddenLimit)) manager.decDeclRef(decl);
426
+ for (const decl of this.definedTrail.splice(definedLimit)) manager.decDeclRef(decl);
427
+ this.hiddenLimits.length -= numScopes;
428
+ this.definedLimits.length -= numScopes;
429
+ this.rewriter.pop(numScopes);
430
+ }
431
+
432
+ release() {
433
+ const manager = this.manager;
434
+ for (const decl of this.definedTrail) manager.decDeclRef(decl);
435
+ for (const decl of this.hiddenTrail) manager.decDeclRef(decl);
436
+ this.rewriter.release();
437
+ }
438
+ }
439
+
440
+ // The sole uninterpreted constant of a term, which stands for it in the SAT solver.
441
+ const getRepresentative = (manager: AstManager, expr: number) => {
442
+ const visited = new Set<number>();
443
+ const todo = [expr];
444
+ let result = -1;
445
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
446
+ if (visited.has(current)) continue;
447
+ visited.add(current);
448
+ if (manager.isUninterpretedConst(current)) {
449
+ if (result !== -1 && result !== current) return -1;
450
+ result = current;
451
+ } else if (manager.kinds[current] === KIND_QUANTIFIER)
452
+ todo.push(manager.getQuantifier(current).body);
453
+ else if (manager.kinds[current] === KIND_APP) manager.pushArgs(current, todo);
454
+ }
455
+ return result;
456
+ };
457
+
458
+ interface FdScope {
459
+ qhead: number;
460
+ size: number;
461
+ trailSize: number;
462
+ isInconsistent: boolean;
463
+ }
464
+
465
+ export class FdSolver {
466
+ private readonly solver: IncSatSolver;
467
+ private readonly fmls: SolverFormulas;
468
+ private readonly state: FdState;
469
+ private readonly trail: ModelTrail;
470
+ private readonly int2bv: BoundedInt2BvSimplifier;
471
+ private readonly enum2bv: Enum2BvSimplifier;
472
+ private readonly coreReplace: ExprSafeReplace;
473
+ private readonly core: RefVector;
474
+ private readonly scopes: FdScope[] = [];
475
+ private converter: Definition[] = [];
476
+ private model: ProtoModel | undefined;
477
+
478
+ constructor(
479
+ private readonly manager: AstManager,
480
+ params: SatParams,
481
+ isIncremental = true,
482
+ ) {
483
+ this.solver = new IncSatSolver(manager, params, isIncremental);
484
+ this.fmls = new SolverFormulas(manager);
485
+ this.state = new FdState(manager, this.fmls);
486
+ this.trail = new ModelTrail(manager);
487
+ this.int2bv = new BoundedInt2BvSimplifier(manager);
488
+ this.enum2bv = new Enum2BvSimplifier(manager);
489
+ this.coreReplace = new ExprSafeReplace(manager);
490
+ this.core = new RefVector(manager);
491
+ }
492
+
493
+ get reasonUnknown() {
494
+ return this.solver.reasonUnknown;
495
+ }
496
+
497
+ assertExpr(form: number, name = -1) {
498
+ this.clearModel();
499
+ this.fmls.forms.push(form);
500
+ this.fmls.dependencies.push(name === -1 ? undefined : mkDependencyLeaf(name));
501
+ }
502
+
503
+ push() {
504
+ this.flush([]).reset();
505
+ this.scopes.push({
506
+ qhead: this.state.qhead,
507
+ size: this.fmls.forms.size,
508
+ trailSize: this.trail.entries.length,
509
+ isInconsistent: this.fmls.isInconsistent,
510
+ });
511
+ this.int2bv.push();
512
+ this.enum2bv.push();
513
+ this.solver.push();
514
+ }
515
+
516
+ pop(numScopes: number) {
517
+ this.solver.pop(numScopes);
518
+ this.clearModel();
519
+ this.int2bv.pop(numScopes);
520
+ this.enum2bv.pop(numScopes);
521
+ const scope = this.scopes[this.scopes.length - numScopes];
522
+ this.scopes.length -= numScopes;
523
+ this.trail.shrink(scope.trailSize);
524
+ this.fmls.isInconsistent = scope.isInconsistent;
525
+ this.fmls.shrinkTo(scope.size);
526
+ this.state.qhead = scope.qhead;
527
+ }
528
+
529
+ check(assumptions: readonly number[] = []) {
530
+ const flushed = this.flush(assumptions);
531
+ const result = this.solver.check(flushed.items);
532
+ flushed.reset();
533
+ // solver::check_sat counts a step to see whether the limit stopped a search that gave up.
534
+ if (result === L_UNDEF) this.manager.limit.inc();
535
+ return result;
536
+ }
537
+
538
+ getModel() {
539
+ if (this.model !== undefined) return this.model;
540
+ const model = this.solver.getModel();
541
+ if (model === null) return undefined;
542
+ const converted = this.converter.length > 0 ? applyDefinitions(this.converter, model) : model;
543
+ converted.incRef();
544
+ this.model = converted;
545
+ return converted;
546
+ }
547
+
548
+ getUnsatCore() {
549
+ this.core.reset();
550
+ for (const expr of this.solver.getUnsatCore())
551
+ this.core.pushOwned(this.coreReplace.apply(expr));
552
+ return this.core.items;
553
+ }
554
+
555
+ getConsequences(assumptions: readonly number[], vars: readonly number[]) {
556
+ const manager = this.manager;
557
+ const flushed = this.flush([...assumptions, ...vars]);
558
+ const asms1 = flushed.items.slice(0, assumptions.length);
559
+ const vars1 = flushed.items.slice(assumptions.length);
560
+ const queryVars = vars1.map((expr) => {
561
+ const representative = getRepresentative(manager, expr);
562
+ return representative === -1 ? expr : representative;
563
+ });
564
+ const found = this.solver.getConsequences(asms1, queryVars);
565
+ const trail = new RefVector(manager);
566
+ const rewriter = new Rewriter(manager, getRewriterOptions(manager, new Map()));
567
+ const consequences = new RefVector(manager);
568
+ for (const consequence of found.consequences) {
569
+ const premise = manager.getArg(consequence, 0);
570
+ const conclusion = manager.getArg(consequence, 1);
571
+ const [query, value] = (() => {
572
+ if (manager.decls[conclusion] === OP_EQ) {
573
+ const lhs = manager.getArg(conclusion, 0);
574
+ const rhs = manager.getArg(conclusion, 1);
575
+ for (const queryVar of queryVars) {
576
+ if (lhs === queryVar) return [lhs, rhs];
577
+ if (rhs === queryVar) return [rhs, lhs];
578
+ }
579
+ return [-1, -1];
580
+ }
581
+ if (manager.isUninterpretedConst(conclusion)) return [conclusion, manager.trueExpr];
582
+ if (
583
+ manager.isNot(conclusion) &&
584
+ manager.isUninterpretedConst(manager.getArg(conclusion, 0))
585
+ )
586
+ return [manager.getArg(conclusion, 0), manager.falseExpr];
587
+ return [-1, -1];
588
+ })();
589
+ const index = queryVars.findIndex(
590
+ (queryVar, position) => queryVar === query && vars[position] !== vars1[position],
591
+ );
592
+ const decoded = (() => {
593
+ if (query === -1 || index === -1) return consequence;
594
+ const substitution = new ExprSafeReplace(manager);
595
+ substitution.insert(query, value);
596
+ const replaced = substitution.apply(vars1[index]);
597
+ trail.pushOwned(replaced);
598
+ substitution.release();
599
+ const rewritten = rewriter.rewrite(replaced);
600
+ trail.pushOwned(rewritten);
601
+ return manager.mkApp(
602
+ OP_IMPLIES,
603
+ [premise, manager.mkEq(vars[index], rewritten)],
604
+ SORT_BOOL,
605
+ );
606
+ })();
607
+ consequences.pushOwned(this.coreReplace.apply(decoded));
608
+ }
609
+ rewriter.release();
610
+ trail.reset();
611
+ flushed.reset();
612
+ return { result: found.result, consequences };
613
+ }
614
+
615
+ getAssertions() {
616
+ return this.solver.getAssertions();
617
+ }
618
+
619
+ getConverters(): Goal["converters"] {
620
+ const definitions = retainDefinitions(this.manager, this.converter);
621
+ return [...(definitions.length > 0 ? [{ definitions }] : []), ...this.solver.getConverters()];
622
+ }
623
+
624
+ private flush(assumptions: readonly number[]) {
625
+ const manager = this.manager;
626
+ const fmls = this.fmls;
627
+ this.clearModel();
628
+ const qhead = this.state.qhead;
629
+ const flushed = new RefVector(manager);
630
+ for (const assumption of assumptions) flushed.push(assumption);
631
+ this.coreReplace.reset();
632
+ this.replay(qhead, flushed);
633
+ if (qhead < fmls.forms.size) {
634
+ this.reduce();
635
+ if (!manager.limit.inc()) return flushed;
636
+ this.replay(qhead, flushed);
637
+ this.state.qhead = fmls.forms.size;
638
+ }
639
+ flushed.items.forEach((assumption, index) =>
640
+ this.coreReplace.insert(assumption, assumptions[index]),
641
+ );
642
+ const converter = retainDefinitions(manager, this.trail.entries);
643
+ releaseDefinitions(manager, this.converter);
644
+ this.converter = converter;
645
+ for (let index = qhead; index < fmls.forms.size; index++) {
646
+ const names = getDependencyValues(fmls.getDependency(index));
647
+ if (names.length === 0) this.solver.assertExpr(fmls.forms.items[index]);
648
+ else this.solver.assertNamed(fmls.forms.items[index], manager.mkAnd(names));
649
+ }
650
+ return flushed;
651
+ }
652
+
653
+ private replay(qhead: number, assumptions: RefVector) {
654
+ const manager = this.manager;
655
+ this.trail.replay(qhead, assumptions, this.fmls);
656
+ if (assumptions.size === 0) return;
657
+ const rewriter = new Rewriter(manager, getRewriterOptions(manager, new Map()));
658
+ for (let index = 0; index < assumptions.size; index++)
659
+ assumptions.setOwned(index, rewriter.rewrite(assumptions.items[index]));
660
+ rewriter.release();
661
+ }
662
+
663
+ private reduce() {
664
+ const manager = this.manager;
665
+ const fmls = this.fmls;
666
+ const state = this.state;
667
+ if (fmls.isInconsistent || !manager.limit.inc()) return;
668
+ const simplifiers = [
669
+ () => this.int2bv.reduce(state, this.trail),
670
+ () => {
671
+ const simplifier = createCard2Bv(manager, getRewriterOptions(manager, new Map()))(state);
672
+ try {
673
+ simplifier.reduce();
674
+ } finally {
675
+ simplifier.release();
676
+ }
677
+ },
678
+ () => this.enum2bv.reduce(state, this.trail),
679
+ ];
680
+ for (const simplify of simplifiers) {
681
+ if (fmls.isInconsistent || !manager.limit.inc()) break;
682
+ try {
683
+ simplify();
684
+ } catch (error) {
685
+ // The rewriter_exception of a canceled rewrite or of a nested datatype.
686
+ if (!(error instanceof SmtCanceledError || error instanceof SmtTacticError)) throw error;
687
+ break;
688
+ }
689
+ fmls.flattenSuffix(state.qhead);
690
+ }
691
+ fmls.flattenSuffix(state.qhead);
692
+ }
693
+
694
+ private clearModel() {
695
+ this.model?.decRef();
696
+ this.model = undefined;
697
+ }
698
+
699
+ release() {
700
+ this.clearModel();
701
+ this.core.reset();
702
+ this.coreReplace.release();
703
+ releaseDefinitions(this.manager, this.converter);
704
+ this.converter = [];
705
+ this.int2bv.release();
706
+ this.enum2bv.release();
707
+ this.trail.shrink(0);
708
+ this.fmls.reset();
709
+ this.solver.release();
710
+ }
711
+ }
712
+
713
+ export const createFdTactic = (manager: AstManager, params: SatParams) => (goal: Goal) => {
714
+ const solver = new FdSolver(manager, params, false);
715
+ try {
716
+ for (const form of goal.forms.items) solver.assertExpr(form);
717
+ const result = solver.check();
718
+ goal.reset();
719
+ if (result === L_TRUE) {
720
+ const model = solver.getModel();
721
+ model?.incRef();
722
+ if (model !== undefined) goal.model = model;
723
+ } else if (result === L_FALSE) goal.assert(manager.falseExpr);
724
+ else {
725
+ if (!manager.limit.inc()) throw new SmtTacticError("canceled");
726
+ for (const form of solver.getAssertions()) goal.assert(form);
727
+ goal.converters = [...goal.converters, ...solver.getConverters()];
728
+ }
729
+ goal.depth++;
730
+ return [goal];
731
+ } finally {
732
+ solver.release();
733
+ }
734
+ };