tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +109 -10
  8. package/dist/index.d.ts +109 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -1,9 +1,5 @@
1
- // Ported from Z3 (src/smt/smt_model_checker.cpp), MIT license, see z3-license.txt. Checks whether
2
- // the candidate model satisfies each relevant quantifier: the negated body, with the model's
3
- // interpretations in place of the uninterpreted symbols, goes to an auxiliary context. A model of it
4
- // is a counterexample that becomes an instance of the quantifier.
5
1
  import { SmtInvariantError } from "../../../errors";
6
- import { KIND_APP, OP_NOT, OP_OR, SORT_BOOL, type AstManager } from "./ast";
2
+ import { KIND_APP, OP_NOT, OP_OR, SORT_BOOL } from "./ast";
7
3
  import { AssertedFormulas } from "./asserted-formulas";
8
4
  import { Context } from "./context";
9
5
  import type { Enode } from "./enode";
@@ -14,36 +10,30 @@ import type { DefaultQuantifierManager } from "./quantifier-manager";
14
10
  import { RefVector } from "./ref-vector";
15
11
  import { VarSubst } from "./var-subst";
16
12
 
17
- // qi_params' mbqi_max_cexs and mbqi_max_iterations.
18
13
  const MBQI_MAX_CEXS = 1;
19
- const MBQI_MAX_ITERATIONS = 1000;
20
14
 
21
- // An instance whose bindings start at offset in m_pinned_exprs.
22
15
  interface Instance {
23
16
  quantifier: number;
24
17
  offset: number;
25
18
  generation: number;
26
19
  }
27
20
 
28
- // The auxiliary context: Z3 keeps one context for every check and pushes a scope per check, so the
29
- // restricted checks continue from the complete check, with its phases and activities. It runs without
30
- // MBQI and with relevancy level 0, and preprocesses the assertions of a check together.
31
21
  class AuxContext {
32
22
  private context: Context;
33
23
  private asserted: AssertedFormulas;
34
- // theory_polymorphism's m_qhead: the number of formulas when it last added an assumption. Its
35
- // trail restores it when the scope is popped, and no formula is asserted outside the scopes.
36
- private polyQhead = 0;
37
- // theory_polymorphism's m_assumption, which holds its last assumption.
38
- private polyAssumption = -1;
39
24
 
40
- // The context makes its asserted formulas first. Its theories hold only constants that exist by
41
- // now, so setup_context can run at once. init_aux_context copies the kernel's smt_params, so the
42
- // context has a model finder too, though it never sees a quantifier.
43
- constructor(private manager: AstManager) {
44
- this.asserted = new AssertedFormulas(manager);
45
- this.context = new Context(manager, { isMbqi: true, relevancyLevel: 0 });
46
- this.context.setupContext();
25
+ // init_aux_context copies the kernel's smt_params and theories, so the context has a model
26
+ // finder too, though it never sees a quantifier.
27
+ constructor(parent: Context) {
28
+ this.asserted = new AssertedFormulas(parent.manager);
29
+ this.context = new Context(parent.manager, {
30
+ ...parent.params,
31
+ relevancyLevel: 0,
32
+ isArrayFakeSupport: true,
33
+ });
34
+ this.context.config = { ...parent.config, relevancyLevel: 0 };
35
+ for (const theory of parent.theories) this.context.registerFamily(theory.id);
36
+ this.context.setupContext(parent.setup, false, this.asserted);
47
37
  }
48
38
 
49
39
  push() {
@@ -54,34 +44,17 @@ class AuxContext {
54
44
  pop() {
55
45
  this.context.pop(1);
56
46
  this.asserted.pop();
57
- this.polyQhead = 0;
58
47
  }
59
48
 
60
- // assert_expr_core: outside the search, the scopes of the last search are popped first.
61
49
  assert(formula: number) {
62
50
  this.context.popToBaseLevel();
63
51
  this.asserted.assertExpr(formula);
64
52
  }
65
53
 
66
- // A model of the assertions, or whether they are unsatisfiable or undecided. Z3 registers
67
- // theory_polymorphism, which assumes a fresh constant whenever formulas were asserted since its
68
- // last assumption.
69
54
  check() {
70
55
  const context = this.context;
71
56
  context.popToBaseLevel();
72
- context.internalizeAssertions(this.asserted);
73
- const manager = this.manager;
74
- const numFormulas = this.asserted.getNumFormulas();
75
- const isAssuming = numFormulas !== this.polyQhead;
76
- this.polyQhead = numFormulas;
77
- if (isAssuming) {
78
- const assumption = manager.mkFreshConst("poly", SORT_BOOL);
79
- manager.incRef(assumption);
80
- if (this.polyAssumption !== -1) manager.decRef(this.polyAssumption);
81
- this.polyAssumption = assumption;
82
- }
83
- context.initAssumptions(isAssuming ? [this.polyAssumption] : []);
84
- const result = context.search();
57
+ const result = context.checkResearching(this.asserted, []);
85
58
  return result === L_TRUE ? context.getModel() : result === L_FALSE ? "unsat" : "unknown";
86
59
  }
87
60
  }
@@ -90,7 +63,6 @@ export class ModelChecker {
90
63
  private maxCexs = MBQI_MAX_CEXS;
91
64
  private iterationIndex = 0;
92
65
  private newInstances: Instance[] = [];
93
- // m_pinned_exprs: the bindings and quantifier of each new instance, held until they are asserted.
94
66
  private pinnedExprs: RefVector;
95
67
  private root2value = new Map<Enode, number>();
96
68
  private value2expr: Map<number, number> | null = null;
@@ -114,14 +86,12 @@ export class ModelChecker {
114
86
  const value2expr = new Map<number, number>();
115
87
  for (const entry of this.root2value) {
116
88
  const node = this.getEqEnodeWithMinGen(entry[0]);
117
- if (!this.manager.isUniqueValue(node.owner)) value2expr.set(entry[1], node.owner);
89
+ if (!this.manager.isValue(node.owner)) value2expr.set(entry[1], node.owner);
118
90
  }
119
91
  this.value2expr = value2expr;
120
92
  return value2expr;
121
93
  }
122
94
 
123
- // enode::get_eq_enode_with_min_gen: the first node of the class with generation 0, or else the
124
- // first with the least generation.
125
95
  private getEqEnodeWithMinGen(root: Enode) {
126
96
  const context = this.context;
127
97
  let result = root;
@@ -139,8 +109,6 @@ export class ModelChecker {
139
109
  return result;
140
110
  }
141
111
 
142
- // get_type_compatible_term: a term of the context that stands for a value, which may be a fresh
143
- // constant.
144
112
  private getTypeCompatibleTerm(value: number): number {
145
113
  const manager = this.manager;
146
114
  let freshTerm: number;
@@ -164,8 +132,6 @@ export class ModelChecker {
164
132
  return freshTerm;
165
133
  }
166
134
 
167
- // assert_neg_q_m: asserts the negated body under the model, with fresh constants for the
168
- // variables, which sks holds.
169
135
  private assertNegQM(aux: AuxContext, quantifier: number, model: ProtoModel, sks: RefVector) {
170
136
  const manager = this.manager;
171
137
  const data = manager.getQuantifier(quantifier);
@@ -177,8 +143,8 @@ export class ModelChecker {
177
143
  const sk = manager.mkFreshConst(null, sort);
178
144
  sks.set(numDecls - index - 1, sk);
179
145
  if (model.isFinite(sort)) {
180
- // restrict_to_universe: ast_manager::mk_or, which keeps a single disjunct in an or.
181
146
  const universe = model.getKnownUniverse(sort).map((value) => manager.mkEq(sk, value));
147
+ // ast_manager::mk_or keeps a single disjunct in an or.
182
148
  const constraint = manager.mkApp(OP_OR, universe, SORT_BOOL);
183
149
  manager.incRef(constraint);
184
150
  aux.assert(constraint);
@@ -207,7 +173,7 @@ export class ModelChecker {
207
173
  const sk = sks[numDecls - index - 1];
208
174
  let skValue = cex.getSomeConstInterp(manager.decls[sk]);
209
175
  if (isUsingInv) {
210
- const inv = this.modelFinder.getInv(quantifier, index, skValue, cex);
176
+ const inv = this.modelFinder.getInv(quantifier, index, skValue);
211
177
  if (inv === null) return false;
212
178
  maxGeneration = Math.max(maxGeneration, inv.generation);
213
179
  skValue = inv.term;
@@ -226,13 +192,11 @@ export class ModelChecker {
226
192
  return true;
227
193
  }
228
194
 
229
- // check(q): whether the model satisfies the quantifier. A counterexample becomes an instance.
230
195
  private checkQuantifier(quantifier: number, model: ProtoModel) {
231
196
  const manager = this.manager;
232
- const aux = this.aux ?? new AuxContext(manager);
197
+ const aux = this.aux ?? new AuxContext(this.context);
233
198
  this.aux = aux;
234
199
  aux.push();
235
- // sks: the fresh constants of the variables, which are released before the scope is popped.
236
200
  const sks = new RefVector(manager);
237
201
  const isSatisfied = this.checkInScope(aux, quantifier, model, sks);
238
202
  sks.reset();
@@ -247,9 +211,7 @@ export class ModelChecker {
247
211
  const completeCex = aux.check();
248
212
  if (completeCex === "unsat") return true;
249
213
  if (completeCex === "unknown") return false;
250
- // complete_cex and cex hold their models.
251
214
  completeCex.incRef();
252
- // Try to find instances from the instantiation sets first.
253
215
  this.modelFinder.restrictSksToInstSet(quantifier, sks, (expr) => aux.assert(expr));
254
216
  let numNewInstances = 0;
255
217
  for (;;) {
@@ -267,7 +229,6 @@ export class ModelChecker {
267
229
  return false;
268
230
  }
269
231
 
270
- // add_blocking_clause: diseqs and blocking_clause hold their terms until it is asserted.
271
232
  private addBlockingClause(aux: AuxContext, cex: ProtoModel, sks: number[]) {
272
233
  const manager = this.manager;
273
234
  const diseqs = new RefVector(manager);
@@ -285,7 +246,6 @@ export class ModelChecker {
285
246
  let isFoundRelevant = false;
286
247
  let numFailures = 0;
287
248
  for (const quantifier of this.qmanager.quantifiers) {
288
- // Z3's resource limit cancels the checks, and the search gives up.
289
249
  if (context.checkCanceled()) return { isFoundRelevant, numFailures: numFailures + 1 };
290
250
  if (
291
251
  !context.isRelevant(quantifier) ||
@@ -298,11 +258,10 @@ export class ModelChecker {
298
258
  return { isFoundRelevant, numFailures };
299
259
  }
300
260
 
301
- // check(md, root2value): whether the model satisfies every relevant quantifier.
302
261
  check(model: ProtoModel, root2value: Map<Enode, number>) {
303
262
  this.root2value = root2value;
304
263
  if (this.qmanager.quantifiers.length === 0) return true;
305
- if (this.iterationIndex >= MBQI_MAX_ITERATIONS) return false;
264
+ if (this.iterationIndex >= this.context.params.mbqiMaxIterations) return false;
306
265
  this.value2expr = null;
307
266
  model.compress();
308
267
  const first = this.checkQuantifiers(model);
@@ -324,7 +283,6 @@ export class ModelChecker {
324
283
  return this.newInstances.length > 0;
325
284
  }
326
285
 
327
- // restart_eh: assert_new_instances.
328
286
  restartEh() {
329
287
  const context = this.context;
330
288
  for (const instance of this.newInstances) {
@@ -340,7 +298,6 @@ export class ModelChecker {
340
298
  });
341
299
  this.qmanager.addInstance(instance.quantifier, nodes, instance.generation);
342
300
  }
343
- // reset_new_instances.
344
301
  this.pinnedExprs.reset();
345
302
  this.newInstances = [];
346
303
  }
@@ -1,48 +1,59 @@
1
- // Ported from Z3 (src/model/model_evaluator.cpp), MIT license, see z3-license.txt. Evaluates an
2
- // expression in a model with rewriter_tpl and evaluator_cfg: uninterpreted symbols take their
3
- // interpretations, the interpretation of a function is expanded like a macro, and the rewriters fold
4
- // the interpreted operators. With model completion, a symbol without an interpretation gets some
5
- // value, so a ground expression always evaluates to a value. The cache persists between evaluations
6
- // until the model completion flag changes.
1
+ import { mkArrayApp } from "./array-decl-plugin";
7
2
  import {
8
3
  FAMILY_ARITH,
4
+ FAMILY_BASIC,
5
+ FAMILY_LABEL,
6
+ FAMILY_ARRAY,
7
+ FAMILY_FPA,
8
+ FAMILY_MODEL_VALUE,
9
+ FAMILY_RECFUN,
9
10
  FAMILY_USER,
10
11
  KIND_APP,
11
12
  KIND_QUANTIFIER,
12
13
  OP_AND,
14
+ OP_AS_ARRAY,
15
+ OP_CONST_ARRAY,
13
16
  OP_DIV,
14
17
  OP_DIV0,
18
+ OP_DT_ACCESSOR,
19
+ OP_DT_CONSTRUCTOR,
15
20
  OP_EQ,
21
+ OP_FPA_FP,
16
22
  OP_IDIV,
17
23
  OP_IDIV0,
18
24
  OP_ITE,
19
25
  OP_LE,
20
26
  OP_MOD,
21
27
  OP_MOD0,
28
+ OP_REM,
29
+ OP_SELECT,
30
+ OP_STORE,
22
31
  SORT_BOOL,
23
32
  } from "./ast";
24
33
  import type { AstManager } from "./ast";
25
- import { FuncInterp } from "./proto-model";
34
+ import { DEFAULT_BV_OPTIONS } from "./bv-rewriter";
35
+ import { isConsideredUninterpreted } from "./fpa-decl-plugin";
36
+ import { FuncInterp, getManagerSomeValue } from "./proto-model";
26
37
  import type { ProtoModel } from "./proto-model";
27
38
  import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
28
39
  import { RewriterTpl } from "./rewriter-tpl";
29
40
  import type { Rewrite } from "./rewriter-tpl";
30
41
  import { Rational } from "./rational";
42
+ import { mkRecFunApp } from "./recfun-rewriter";
31
43
  import { VarSubst } from "./var-subst";
32
44
 
33
- // The division by zero that a division stands for when its divisor is zero.
34
45
  const BY_ZERO_OPS = new Map([
35
46
  [OP_DIV, OP_DIV0],
36
47
  [OP_IDIV, OP_IDIV0],
37
48
  [OP_MOD, OP_MOD0],
49
+ [OP_REM, OP_MOD0],
38
50
  ]);
39
51
 
40
- // A th_rewriter with the default parameters.
52
+ const BUILTIN_FAMILIES = new Set([FAMILY_BASIC, FAMILY_USER, FAMILY_MODEL_VALUE, FAMILY_LABEL]);
53
+
41
54
  export class ModelEvaluator extends RewriterTpl {
42
- // m_b_rw and m_a_rw, whose reductions evaluator_cfg applies.
43
55
  private rewriter: Rewriter;
44
56
  private isModelCompletion = false;
45
- // The arguments of a reduced arithmetic term, reused across evaluations.
46
57
  private reducedArgs: number[] = [];
47
58
 
48
59
  constructor(
@@ -50,11 +61,13 @@ export class ModelEvaluator extends RewriterTpl {
50
61
  private model: ProtoModel,
51
62
  ) {
52
63
  super(manager);
53
- this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
64
+ this.rewriter = new Rewriter(manager, {
65
+ ...TACTIC_REWRITER_OPTIONS,
66
+ bv: { ...DEFAULT_BV_OPTIONS, isHiDiv0: manager.isHiDiv0, isMkbv2num: true },
67
+ });
54
68
  this.rewriter.releaseResult = () => this.setLastResult(-1);
55
69
  }
56
70
 
57
- // set_model_completion: the cache is reset when the flag changes.
58
71
  setModelCompletion(isModelCompletion: boolean) {
59
72
  if (this.isModelCompletion === isModelCompletion) return;
60
73
  this.reset();
@@ -76,11 +89,15 @@ export class ModelEvaluator extends RewriterTpl {
76
89
  return result;
77
90
  }
78
91
 
79
- // evaluator_cfg::reduce_app_core. -1 is BR_FAILED.
80
92
  private reduceAppCore(decl: number, args: number[], sort: number): number | Rewrite {
81
93
  const manager = this.manager;
82
94
  const model = this.model;
83
95
  const family = manager.funcDecls[decl].family;
96
+ if (family === FAMILY_ARRAY && manager.funcDecls[decl].op === OP_AS_ARRAY) {
97
+ const arrayDecl = manager.funcDecls[decl].parameters[0];
98
+ const arrayInterp = model.funcInterps.get(arrayDecl)?.getArrayInterp(arrayDecl);
99
+ if (arrayInterp !== undefined) return { expr: arrayInterp, depth: 1 };
100
+ }
84
101
  if (family === FAMILY_USER) {
85
102
  if (args.length > 0) {
86
103
  const result = this.evaluate(decl, args);
@@ -94,15 +111,29 @@ export class ModelEvaluator extends RewriterTpl {
94
111
  model.registerConst(decl, some);
95
112
  return some;
96
113
  }
114
+ if (manager.funcDecls[decl].op === OP_EQ && manager.isArraySort(manager.sorts[args[0]])) {
115
+ const reduced = this.mkArrayEq(args[0], args[1]);
116
+ if (reduced !== undefined) return reduced;
117
+ }
97
118
  if (manager.funcDecls[decl].op === OP_AND) {
98
119
  const reduced = this.mkArithAndCore(args);
99
120
  if (reduced !== undefined) return reduced;
100
121
  }
122
+ if (family === FAMILY_LABEL && args.length === 1) return args[0];
123
+ if (family === FAMILY_RECFUN) {
124
+ const unfolded = mkRecFunApp(manager, decl, args, true);
125
+ if (unfolded !== undefined) return unfolded;
126
+ const interp = model.funcInterps.get(decl);
127
+ if (interp === undefined) return -1;
128
+ if (interp.isPartial()) interp.setElse(model.getSomeValue(sort));
129
+ const result = this.substitute(interp.getInterp() as number, args);
130
+ return manager.isGroundApp(result) ? { expr: result, depth: Infinity } : result;
131
+ }
101
132
  const rewritten = this.rewriter.reduceAppCore(decl, args);
102
133
  const reduced =
103
- rewritten === -1 && family === FAMILY_ARITH
104
- ? this.evaluatePartialTheoryFunc(decl, args, sort)
105
- : rewritten;
134
+ rewritten !== -1 || BUILTIN_FAMILIES.has(family)
135
+ ? rewritten
136
+ : this.evaluatePartialTheoryFunc(decl, args, sort);
106
137
  if (
107
138
  family !== FAMILY_ARITH ||
108
139
  typeof reduced !== "number" ||
@@ -117,8 +148,6 @@ export class ModelEvaluator extends RewriterTpl {
117
148
  return result === undefined ? reduced : { expr: result, depth: 1 };
118
149
  }
119
150
 
120
- // evaluate and eval_fi: the result of the entry for the arguments when they are values. Otherwise
121
- // get_macro expands the interpretation.
122
151
  private evaluate(decl: number, args: number[]) {
123
152
  const manager = this.manager;
124
153
  const interp = this.model.funcInterps.get(decl);
@@ -131,14 +160,13 @@ export class ModelEvaluator extends RewriterTpl {
131
160
  return interp.getEntry(args)?.result;
132
161
  }
133
162
 
134
- // evaluate_partial_theory_func: div0, idiv0 and mod0 take their interpretations, or 0 without
135
- // one, and so does a division by zero. A division by a term is its interpretation when the term
136
- // is zero.
137
163
  private evaluatePartialTheoryFunc(decl: number, args: number[], sort: number): number | Rewrite {
138
164
  const manager = this.manager;
139
165
  const model = this.model;
140
- const op = manager.funcDecls[decl].op;
141
- const byZero = BY_ZERO_OPS.get(op);
166
+ const info = manager.funcDecls[decl];
167
+ if (info.family === FAMILY_FPA && !isConsideredUninterpreted(manager, decl, args)) return -1;
168
+ const op = info.op;
169
+ const byZero = info.family === FAMILY_ARITH ? BY_ZERO_OPS.get(op) : undefined;
142
170
  let interp = model.funcInterps.get(decl);
143
171
  if (interp === undefined && byZero !== undefined && !manager.isNumeral(args[1])) {
144
172
  const definition = model.funcInterps.get(byZero)?.getInterp();
@@ -151,17 +179,146 @@ export class ModelEvaluator extends RewriterTpl {
151
179
  sort,
152
180
  );
153
181
  }
154
- if (interp === undefined) {
182
+ if (interp === undefined && info.family === FAMILY_ARITH) {
155
183
  const isByZero = byZero !== undefined && manager.getRationalValue(args[1]).isZero();
156
184
  if (!isByZero && op !== OP_DIV0 && op !== OP_IDIV0 && op !== OP_MOD0) return -1;
157
185
  interp = isByZero ? model.funcInterps.get(byZero) : undefined;
158
186
  if (interp === undefined) return manager.mkNumeralOfSort(Rational.zero, sort);
159
187
  }
160
- if (interp.isPartial()) interp.setElse(model.getSomeValue(sort));
188
+ if (interp === undefined && info.family === FAMILY_FPA)
189
+ return getManagerSomeValue(manager, sort);
190
+ if (op === OP_DT_ACCESSOR) {
191
+ if (interp === undefined && manager.isValue(args[0])) {
192
+ const value = model.getSomeValue(sort);
193
+ const created = new FuncInterp(manager, args.length);
194
+ created.setElse(value);
195
+ model.registerFunc(decl, created);
196
+ return value;
197
+ }
198
+ if (!manager.isGroundApp(args[0])) return manager.mkApp(decl, args, sort);
199
+ }
200
+ if (op === OP_DT_CONSTRUCTOR) return manager.mkApp(decl, args, sort);
201
+ if (interp === undefined) return -1;
202
+ if (interp.isPartial()) interp.setElse(getManagerSomeValue(manager, sort));
161
203
  return { expr: this.substitute(interp.getInterp() as number, args), depth: Infinity };
162
204
  }
163
205
 
164
- // var_subst without the standard order, whose result the temporaries hold.
206
+ // Like Z3, only the indices of the stores of a store chain decide whether they are unique.
207
+ private extractArrayFuncInterp(inputArray: number) {
208
+ const manager = this.manager;
209
+ const stores: number[][] = [];
210
+ let array = inputArray;
211
+ let areUnique = true;
212
+ while (manager.getFamily(array) === FAMILY_ARRAY && manager.getOp(array) === OP_STORE) {
213
+ const store = manager.getArgs(array).slice(1);
214
+ areUnique &&= store.slice(0, -1).every((index) => manager.isUniqueValue(index));
215
+ stores.push(store);
216
+ array = manager.getArg(array, 0);
217
+ }
218
+ if (manager.getFamily(array) === FAMILY_ARRAY && manager.getOp(array) === OP_CONST_ARRAY)
219
+ return { stores, elseExpr: manager.getArg(array, 0), areUnique };
220
+ if (manager.getFamily(array) !== FAMILY_ARRAY || manager.getOp(array) !== OP_AS_ARRAY)
221
+ return undefined;
222
+ const interp = this.model.funcInterps.get(
223
+ manager.funcDecls[manager.decls[array]].parameters[0],
224
+ );
225
+ const elseExpr = interp?.elseExpr ?? null;
226
+ if (interp === undefined || elseExpr === null) return undefined;
227
+ let isGround = manager.isGroundApp(elseExpr);
228
+ for (const entry of interp.entries) {
229
+ if (entry.result === elseExpr) continue;
230
+ const store = [...entry.args, entry.result];
231
+ isGround &&= store.every((arg) => manager.isGroundApp(arg));
232
+ stores.push(store);
233
+ }
234
+ return isGround ? { stores, elseExpr, areUnique } : undefined;
235
+ }
236
+
237
+ private mkArrayEq(first: number, second: number): number | Rewrite | undefined {
238
+ const manager = this.manager;
239
+ if (first === second) return manager.trueExpr;
240
+ const firstInterp = this.extractArrayFuncInterp(first);
241
+ const secondInterp = this.extractArrayFuncInterp(second);
242
+ if (firstInterp === undefined || secondInterp === undefined) return undefined;
243
+ const firstElse = firstInterp.elseExpr;
244
+ const secondElse = secondInterp.elseExpr;
245
+ const areUnique = firstInterp.areUnique && secondInterp.areUnique;
246
+ const sort = manager.sorts[first];
247
+ const domain = manager.getSortParameters(sort).slice(0, -1);
248
+ const domainSize = domain.reduce((size, index) => {
249
+ const indexSize = manager.getSortSize(index);
250
+ return size < 0n || indexSize < 0n ? -1n : size * indexSize;
251
+ }, 1n);
252
+ const stores = [...firstInterp.stores, ...secondInterp.stores];
253
+ const isFullyCovered =
254
+ areUnique &&
255
+ firstElse !== secondElse &&
256
+ domainSize >= 0n &&
257
+ stores.length > 0 &&
258
+ BigInt(new Set(stores.map((store) => store.slice(0, -1).join(","))).size) >= domainSize;
259
+ const conjuncts: number[] = [];
260
+ const isElseInfinite = manager.getSortSize(manager.sorts[firstElse]) < 0n;
261
+ if (firstElse !== secondElse && !isFullyCovered) {
262
+ if (manager.areDistinct(firstElse, secondElse) && isElseInfinite) return manager.falseExpr;
263
+ conjuncts.push(manager.mkEq(firstElse, secondElse));
264
+ }
265
+ if (areUnique && firstInterp.stores.length > 0)
266
+ return this.mkArrayEqCore(
267
+ firstInterp.stores,
268
+ firstElse,
269
+ secondInterp.stores,
270
+ secondElse,
271
+ conjuncts,
272
+ );
273
+ for (const store of stores) {
274
+ const indices = store.slice(0, -1);
275
+ conjuncts.push(
276
+ manager.mkEq(
277
+ mkArrayApp(manager, OP_SELECT, [first, ...indices]),
278
+ mkArrayApp(manager, OP_SELECT, [second, ...indices]),
279
+ ),
280
+ );
281
+ }
282
+ return { expr: manager.mkAnd(conjuncts), depth: Infinity };
283
+ }
284
+
285
+ private mkArrayEqCore(
286
+ firstStores: number[][],
287
+ firstElse: number,
288
+ secondStores: number[][],
289
+ secondElse: number,
290
+ conjuncts: number[],
291
+ ): number | Rewrite {
292
+ const manager = this.manager;
293
+ const arity = firstStores[0].length - 1;
294
+ const getKey = (store: number[]) => store.slice(0, arity).join(",");
295
+ const firstTable = new Map<string, number[]>();
296
+ // A store of a smaller index takes precedence.
297
+ for (const store of [...firstStores].reverse()) firstTable.set(getKey(store), store);
298
+ const secondKeys = new Set<string>();
299
+ // A pair that is neither equal nor distinct is left as an equality.
300
+ const isDistinct = (left: number, right: number) => {
301
+ if (left === right) return false;
302
+ if (manager.areDistinct(left, right)) return true;
303
+ conjuncts.push(manager.mkEq(left, right));
304
+ return false;
305
+ };
306
+ for (const store of secondStores) {
307
+ const key = getKey(store);
308
+ if (secondKeys.has(key)) continue;
309
+ secondKeys.add(key);
310
+ const value = store[arity];
311
+ const match = firstTable.get(key);
312
+ if (match !== undefined) firstTable.delete(key);
313
+ const isDifferent =
314
+ match === undefined ? isDistinct(firstElse, value) : isDistinct(value, match[arity]);
315
+ if (isDifferent) return manager.falseExpr;
316
+ }
317
+ for (const store of firstTable.values())
318
+ if (isDistinct(store[arity], secondElse)) return manager.falseExpr;
319
+ return { expr: manager.mkAnd(conjuncts), depth: Infinity };
320
+ }
321
+
165
322
  private substitute(expr: number, args: number[]) {
166
323
  const subst = new VarSubst(this.manager, false);
167
324
  const result = subst.apply(expr, args);
@@ -170,30 +327,27 @@ export class ModelEvaluator extends RewriterTpl {
170
327
  return result;
171
328
  }
172
329
 
173
- // contains_redex: whether a constant's value has an equality to evaluate.
174
330
  private containsRedex(expr: number) {
175
331
  const manager = this.manager;
332
+ if (manager.getOp(expr) === OP_AS_ARRAY) return true;
176
333
  if (manager.kinds[expr] !== KIND_APP || manager.getNumArgs(expr) === 0) return false;
177
334
  const visited = new Set<number>();
178
335
  const todo = [expr];
179
- while (todo.length > 0) {
180
- const current = todo.pop() as number;
336
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
181
337
  if (visited.has(current)) continue;
182
338
  visited.add(current);
183
- if (manager.getOp(current) === OP_EQ) return true;
339
+ const op = manager.getOp(current);
340
+ if (op === OP_AS_ARRAY || op === OP_EQ || op === OP_FPA_FP) return true;
184
341
  if (manager.kinds[current] === KIND_APP) manager.pushArgs(current, todo);
185
342
  else if (manager.kinds[current] === KIND_QUANTIFIER) {
186
343
  const data = manager.getQuantifier(current);
187
- todo.push(data.body, ...data.patterns);
344
+ todo.push(data.body, ...data.patterns, ...data.noPatterns);
188
345
  }
189
346
  }
190
347
  return false;
191
348
  }
192
349
 
193
- // arith_rewriter::mk_and_core: of lower bounds (<= a y) and (<= b y) on the same term, the
194
- // conjunction keeps the greatest. Z3 compares each bound with the first rather than with the
195
- // greatest so far, which drops the greatest when a smaller one follows it. This port keeps the
196
- // greatest.
350
+ // Z3 compares each bound with the first rather than the greatest so far, where this keeps the greatest.
197
351
  private mkArithAndCore(args: number[]): Rewrite | undefined {
198
352
  const manager = this.manager;
199
353
  if (args.length <= 1 || manager.getOp(args[0]) !== OP_LE) return undefined;
@@ -220,8 +374,6 @@ export class ModelEvaluator extends RewriterTpl {
220
374
  return { expr: manager.mkApp(OP_AND, rest, SORT_BOOL), depth: 1 };
221
375
  }
222
376
 
223
- // get_macro: the interpretation of an uninterpreted function. With model completion, a partial
224
- // interpretation gets an else value, and a function without one gets a constant interpretation.
225
377
  getMacro(decl: number) {
226
378
  const manager = this.manager;
227
379
  const model = this.model;
@@ -246,7 +398,6 @@ export class ModelEvaluator extends RewriterTpl {
246
398
  return true;
247
399
  }
248
400
 
249
- // evaluator_cfg::reduce_quantifier: a th_rewriter of its own reduces the quantifier.
250
401
  reduceQuantifier(expr: number, body: number, patterns: number[]) {
251
402
  const rewriter = new Rewriter(this.manager, TACTIC_REWRITER_OPTIONS);
252
403
  const result = rewriter.reduceQuantifier(expr, body, patterns);
@@ -254,7 +405,6 @@ export class ModelEvaluator extends RewriterTpl {
254
405
  return result;
255
406
  }
256
407
 
257
- // ~imp: evaluator_cfg goes before the caches of rewriter_tpl.
258
408
  release() {
259
409
  this.rewriter.release();
260
410
  super.release();