tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479

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 (587) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  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 +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +120 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +829 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +2176 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. package/src/prover/zenon/LICENSE +0 -32
@@ -1,6 +1,5 @@
1
- // Ported from Z3 (src/smt/smt_model_checker.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
- 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";
4
3
  import { AssertedFormulas } from "./asserted-formulas";
5
4
  import { Context } from "./context";
6
5
  import type { Enode } from "./enode";
@@ -12,7 +11,6 @@ import { RefVector } from "./ref-vector";
12
11
  import { VarSubst } from "./var-subst";
13
12
 
14
13
  const MBQI_MAX_CEXS = 1;
15
- const MBQI_MAX_ITERATIONS = 1000;
16
14
 
17
15
  interface Instance {
18
16
  quantifier: number;
@@ -23,13 +21,19 @@ interface Instance {
23
21
  class AuxContext {
24
22
  private context: Context;
25
23
  private asserted: AssertedFormulas;
26
- private polyQhead = 0;
27
- private polyAssumption = -1;
28
24
 
29
- constructor(private manager: AstManager) {
30
- this.asserted = new AssertedFormulas(manager);
31
- this.context = new Context(manager, { isMbqi: true, relevancyLevel: 0 });
32
- 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);
33
37
  }
34
38
 
35
39
  push() {
@@ -40,7 +44,6 @@ class AuxContext {
40
44
  pop() {
41
45
  this.context.pop(1);
42
46
  this.asserted.pop();
43
- this.polyQhead = 0;
44
47
  }
45
48
 
46
49
  assert(formula: number) {
@@ -51,20 +54,8 @@ class AuxContext {
51
54
  check() {
52
55
  const context = this.context;
53
56
  context.popToBaseLevel();
54
- context.internalizeAssertions(this.asserted);
55
- const manager = this.manager;
56
- const numFormulas = this.asserted.getNumFormulas();
57
- const isAssuming = numFormulas !== this.polyQhead;
58
- this.polyQhead = numFormulas;
59
- if (isAssuming) {
60
- const assumption = manager.mkFreshConst("poly", SORT_BOOL);
61
- manager.incRef(assumption);
62
- if (this.polyAssumption !== -1) manager.decRef(this.polyAssumption);
63
- this.polyAssumption = assumption;
64
- }
65
- context.initAssumptions(isAssuming ? [this.polyAssumption] : []);
66
- const result = context.search();
67
- return result === L_TRUE ? context.getModel() : result === L_FALSE ? "unsat" : "unknown";
57
+ const result = context.checkResearching(this.asserted, []);
58
+ return result === L_TRUE ? context.getSatModel() : result === L_FALSE ? "unsat" : "unknown";
68
59
  }
69
60
  }
70
61
 
@@ -95,7 +86,7 @@ export class ModelChecker {
95
86
  const value2expr = new Map<number, number>();
96
87
  for (const entry of this.root2value) {
97
88
  const node = this.getEqEnodeWithMinGen(entry[0]);
98
- 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);
99
90
  }
100
91
  this.value2expr = value2expr;
101
92
  return value2expr;
@@ -182,7 +173,7 @@ export class ModelChecker {
182
173
  const sk = sks[numDecls - index - 1];
183
174
  let skValue = cex.getSomeConstInterp(manager.decls[sk]);
184
175
  if (isUsingInv) {
185
- const inv = this.modelFinder.getInv(quantifier, index, skValue, cex);
176
+ const inv = this.modelFinder.getInv(quantifier, index, skValue);
186
177
  if (inv === null) return false;
187
178
  maxGeneration = Math.max(maxGeneration, inv.generation);
188
179
  skValue = inv.term;
@@ -203,7 +194,7 @@ export class ModelChecker {
203
194
 
204
195
  private checkQuantifier(quantifier: number, model: ProtoModel) {
205
196
  const manager = this.manager;
206
- const aux = this.aux ?? new AuxContext(manager);
197
+ const aux = this.aux ?? new AuxContext(this.context);
207
198
  this.aux = aux;
208
199
  aux.push();
209
200
  const sks = new RefVector(manager);
@@ -270,7 +261,7 @@ export class ModelChecker {
270
261
  check(model: ProtoModel, root2value: Map<Enode, number>) {
271
262
  this.root2value = root2value;
272
263
  if (this.qmanager.quantifiers.length === 0) return true;
273
- if (this.iterationIndex >= MBQI_MAX_ITERATIONS) return false;
264
+ if (this.iterationIndex >= this.context.params.mbqiMaxIterations) return false;
274
265
  this.value2expr = null;
275
266
  model.compress();
276
267
  const first = this.checkQuantifiers(model);
@@ -1,36 +1,56 @@
1
- // Ported from Z3 (src/model/model_evaluator.cpp), MIT license, see z3-license.txt.
1
+ import { mkArrayApp } from "./array-decl-plugin";
2
2
  import {
3
3
  FAMILY_ARITH,
4
+ FAMILY_BASIC,
5
+ FAMILY_LABEL,
6
+ FAMILY_ARRAY,
7
+ FAMILY_FPA,
8
+ FAMILY_MODEL_VALUE,
9
+ FAMILY_RECFUN,
4
10
  FAMILY_USER,
5
11
  KIND_APP,
6
12
  KIND_QUANTIFIER,
7
13
  OP_AND,
14
+ OP_AS_ARRAY,
15
+ OP_CONST_ARRAY,
8
16
  OP_DIV,
9
17
  OP_DIV0,
18
+ OP_DT_ACCESSOR,
19
+ OP_DT_CONSTRUCTOR,
10
20
  OP_EQ,
21
+ OP_FPA_FP,
11
22
  OP_IDIV,
12
23
  OP_IDIV0,
13
24
  OP_ITE,
14
25
  OP_LE,
15
26
  OP_MOD,
16
27
  OP_MOD0,
28
+ OP_REM,
29
+ OP_SELECT,
30
+ OP_STORE,
17
31
  SORT_BOOL,
18
32
  } from "./ast";
19
33
  import type { AstManager } from "./ast";
20
- 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";
21
37
  import type { ProtoModel } from "./proto-model";
22
38
  import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
23
39
  import { RewriterTpl } from "./rewriter-tpl";
24
40
  import type { Rewrite } from "./rewriter-tpl";
25
41
  import { Rational } from "./rational";
42
+ import { mkRecFunApp } from "./recfun-rewriter";
26
43
  import { VarSubst } from "./var-subst";
27
44
 
28
45
  const BY_ZERO_OPS = new Map([
29
46
  [OP_DIV, OP_DIV0],
30
47
  [OP_IDIV, OP_IDIV0],
31
48
  [OP_MOD, OP_MOD0],
49
+ [OP_REM, OP_MOD0],
32
50
  ]);
33
51
 
52
+ const BUILTIN_FAMILIES = new Set([FAMILY_BASIC, FAMILY_USER, FAMILY_MODEL_VALUE, FAMILY_LABEL]);
53
+
34
54
  export class ModelEvaluator extends RewriterTpl {
35
55
  private rewriter: Rewriter;
36
56
  private isModelCompletion = false;
@@ -41,7 +61,12 @@ export class ModelEvaluator extends RewriterTpl {
41
61
  private model: ProtoModel,
42
62
  ) {
43
63
  super(manager);
44
- 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
+ isExpandingSelects: true,
68
+ isKeepingDistinct: true,
69
+ });
45
70
  this.rewriter.releaseResult = () => this.setLastResult(-1);
46
71
  }
47
72
 
@@ -70,6 +95,11 @@ export class ModelEvaluator extends RewriterTpl {
70
95
  const manager = this.manager;
71
96
  const model = this.model;
72
97
  const family = manager.funcDecls[decl].family;
98
+ if (family === FAMILY_ARRAY && manager.funcDecls[decl].op === OP_AS_ARRAY) {
99
+ const arrayDecl = manager.funcDecls[decl].parameters[0];
100
+ const arrayInterp = model.funcInterps.get(arrayDecl)?.getArrayInterp(arrayDecl);
101
+ if (arrayInterp !== undefined) return { expr: arrayInterp, depth: 1 };
102
+ }
73
103
  if (family === FAMILY_USER) {
74
104
  if (args.length > 0) {
75
105
  const result = this.evaluate(decl, args);
@@ -83,15 +113,29 @@ export class ModelEvaluator extends RewriterTpl {
83
113
  model.registerConst(decl, some);
84
114
  return some;
85
115
  }
116
+ if (manager.funcDecls[decl].op === OP_EQ && manager.isArraySort(manager.sorts[args[0]])) {
117
+ const reduced = this.mkArrayEq(args[0], args[1]);
118
+ if (reduced !== undefined) return reduced;
119
+ }
86
120
  if (manager.funcDecls[decl].op === OP_AND) {
87
121
  const reduced = this.mkArithAndCore(args);
88
122
  if (reduced !== undefined) return reduced;
89
123
  }
124
+ if (family === FAMILY_LABEL && args.length === 1) return args[0];
125
+ if (family === FAMILY_RECFUN) {
126
+ const unfolded = mkRecFunApp(manager, decl, args, true);
127
+ if (unfolded !== undefined) return unfolded;
128
+ const interp = model.funcInterps.get(decl);
129
+ if (interp === undefined) return -1;
130
+ if (interp.isPartial()) interp.setElse(model.getSomeValue(sort));
131
+ const result = this.substitute(interp.getInterp() as number, args);
132
+ return manager.isGroundApp(result) ? { expr: result, depth: Infinity } : result;
133
+ }
90
134
  const rewritten = this.rewriter.reduceAppCore(decl, args);
91
135
  const reduced =
92
- rewritten === -1 && family === FAMILY_ARITH
93
- ? this.evaluatePartialTheoryFunc(decl, args, sort)
94
- : rewritten;
136
+ rewritten !== -1 || BUILTIN_FAMILIES.has(family)
137
+ ? rewritten
138
+ : this.evaluatePartialTheoryFunc(decl, args, sort);
95
139
  if (
96
140
  family !== FAMILY_ARITH ||
97
141
  typeof reduced !== "number" ||
@@ -121,8 +165,10 @@ export class ModelEvaluator extends RewriterTpl {
121
165
  private evaluatePartialTheoryFunc(decl: number, args: number[], sort: number): number | Rewrite {
122
166
  const manager = this.manager;
123
167
  const model = this.model;
124
- const op = manager.funcDecls[decl].op;
125
- const byZero = BY_ZERO_OPS.get(op);
168
+ const info = manager.funcDecls[decl];
169
+ if (info.family === FAMILY_FPA && !isConsideredUninterpreted(manager, decl, args)) return -1;
170
+ const op = info.op;
171
+ const byZero = info.family === FAMILY_ARITH ? BY_ZERO_OPS.get(op) : undefined;
126
172
  let interp = model.funcInterps.get(decl);
127
173
  if (interp === undefined && byZero !== undefined && !manager.isNumeral(args[1])) {
128
174
  const definition = model.funcInterps.get(byZero)?.getInterp();
@@ -135,16 +181,146 @@ export class ModelEvaluator extends RewriterTpl {
135
181
  sort,
136
182
  );
137
183
  }
138
- if (interp === undefined) {
184
+ if (interp === undefined && info.family === FAMILY_ARITH) {
139
185
  const isByZero = byZero !== undefined && manager.getRationalValue(args[1]).isZero();
140
186
  if (!isByZero && op !== OP_DIV0 && op !== OP_IDIV0 && op !== OP_MOD0) return -1;
141
187
  interp = isByZero ? model.funcInterps.get(byZero) : undefined;
142
188
  if (interp === undefined) return manager.mkNumeralOfSort(Rational.zero, sort);
143
189
  }
144
- if (interp.isPartial()) interp.setElse(model.getSomeValue(sort));
190
+ if (interp === undefined && info.family === FAMILY_FPA)
191
+ return getManagerSomeValue(manager, sort);
192
+ if (op === OP_DT_ACCESSOR) {
193
+ if (interp === undefined && manager.isValue(args[0])) {
194
+ const value = model.getSomeValue(sort);
195
+ const created = new FuncInterp(manager, args.length);
196
+ created.setElse(value);
197
+ model.registerFunc(decl, created);
198
+ return value;
199
+ }
200
+ if (!manager.isGroundApp(args[0])) return manager.mkApp(decl, args, sort);
201
+ }
202
+ if (op === OP_DT_CONSTRUCTOR) return manager.mkApp(decl, args, sort);
203
+ if (interp === undefined) return -1;
204
+ if (interp.isPartial()) interp.setElse(getManagerSomeValue(manager, sort));
145
205
  return { expr: this.substitute(interp.getInterp() as number, args), depth: Infinity };
146
206
  }
147
207
 
208
+ // Like Z3, only the indices of the stores of a store chain decide whether they are unique.
209
+ private extractArrayFuncInterp(inputArray: number) {
210
+ const manager = this.manager;
211
+ const stores: number[][] = [];
212
+ let array = inputArray;
213
+ let areUnique = true;
214
+ while (manager.getFamily(array) === FAMILY_ARRAY && manager.getOp(array) === OP_STORE) {
215
+ const store = manager.getArgs(array).slice(1);
216
+ areUnique &&= store.slice(0, -1).every((index) => manager.isUniqueValue(index));
217
+ stores.push(store);
218
+ array = manager.getArg(array, 0);
219
+ }
220
+ if (manager.getFamily(array) === FAMILY_ARRAY && manager.getOp(array) === OP_CONST_ARRAY)
221
+ return { stores, elseExpr: manager.getArg(array, 0), areUnique };
222
+ if (manager.getFamily(array) !== FAMILY_ARRAY || manager.getOp(array) !== OP_AS_ARRAY)
223
+ return undefined;
224
+ const interp = this.model.funcInterps.get(
225
+ manager.funcDecls[manager.decls[array]].parameters[0],
226
+ );
227
+ const elseExpr = interp?.elseExpr ?? null;
228
+ if (interp === undefined || elseExpr === null) return undefined;
229
+ let isGround = manager.isGroundApp(elseExpr);
230
+ for (const entry of interp.entries) {
231
+ if (entry.result === elseExpr) continue;
232
+ const store = [...entry.args, entry.result];
233
+ isGround &&= store.every((arg) => manager.isGroundApp(arg));
234
+ stores.push(store);
235
+ }
236
+ return isGround ? { stores, elseExpr, areUnique } : undefined;
237
+ }
238
+
239
+ private mkArrayEq(first: number, second: number): number | Rewrite | undefined {
240
+ const manager = this.manager;
241
+ if (first === second) return manager.trueExpr;
242
+ const firstInterp = this.extractArrayFuncInterp(first);
243
+ const secondInterp = this.extractArrayFuncInterp(second);
244
+ if (firstInterp === undefined || secondInterp === undefined) return undefined;
245
+ const firstElse = firstInterp.elseExpr;
246
+ const secondElse = secondInterp.elseExpr;
247
+ const areUnique = firstInterp.areUnique && secondInterp.areUnique;
248
+ const sort = manager.sorts[first];
249
+ const domain = manager.getSortParameters(sort).slice(0, -1);
250
+ const domainSize = domain.reduce((size, index) => {
251
+ const indexSize = manager.getSortSize(index);
252
+ return size < 0n || indexSize < 0n ? -1n : size * indexSize;
253
+ }, 1n);
254
+ const stores = [...firstInterp.stores, ...secondInterp.stores];
255
+ const isFullyCovered =
256
+ areUnique &&
257
+ firstElse !== secondElse &&
258
+ domainSize >= 0n &&
259
+ stores.length > 0 &&
260
+ BigInt(new Set(stores.map((store) => store.slice(0, -1).join(","))).size) >= domainSize;
261
+ const conjuncts: number[] = [];
262
+ const isElseInfinite = manager.getSortSize(manager.sorts[firstElse]) < 0n;
263
+ if (firstElse !== secondElse && !isFullyCovered) {
264
+ if (manager.areDistinct(firstElse, secondElse) && isElseInfinite) return manager.falseExpr;
265
+ conjuncts.push(manager.mkEq(firstElse, secondElse));
266
+ }
267
+ if (areUnique && firstInterp.stores.length > 0)
268
+ return this.mkArrayEqCore(
269
+ firstInterp.stores,
270
+ firstElse,
271
+ secondInterp.stores,
272
+ secondElse,
273
+ conjuncts,
274
+ );
275
+ for (const store of stores) {
276
+ const indices = store.slice(0, -1);
277
+ conjuncts.push(
278
+ manager.mkEq(
279
+ mkArrayApp(manager, OP_SELECT, [first, ...indices]),
280
+ mkArrayApp(manager, OP_SELECT, [second, ...indices]),
281
+ ),
282
+ );
283
+ }
284
+ return { expr: manager.mkAnd(conjuncts), depth: Infinity };
285
+ }
286
+
287
+ private mkArrayEqCore(
288
+ firstStores: number[][],
289
+ firstElse: number,
290
+ secondStores: number[][],
291
+ secondElse: number,
292
+ conjuncts: number[],
293
+ ): number | Rewrite {
294
+ const manager = this.manager;
295
+ const arity = firstStores[0].length - 1;
296
+ const getKey = (store: number[]) => store.slice(0, arity).join(",");
297
+ const firstTable = new Map<string, number[]>();
298
+ // A store of a smaller index takes precedence.
299
+ for (const store of [...firstStores].reverse()) firstTable.set(getKey(store), store);
300
+ const secondKeys = new Set<string>();
301
+ // A pair that is neither equal nor distinct is left as an equality.
302
+ const isDistinct = (left: number, right: number) => {
303
+ if (left === right) return false;
304
+ if (manager.areDistinct(left, right)) return true;
305
+ conjuncts.push(manager.mkEq(left, right));
306
+ return false;
307
+ };
308
+ for (const store of secondStores) {
309
+ const key = getKey(store);
310
+ if (secondKeys.has(key)) continue;
311
+ secondKeys.add(key);
312
+ const value = store[arity];
313
+ const match = firstTable.get(key);
314
+ if (match !== undefined) firstTable.delete(key);
315
+ const isDifferent =
316
+ match === undefined ? isDistinct(firstElse, value) : isDistinct(value, match[arity]);
317
+ if (isDifferent) return manager.falseExpr;
318
+ }
319
+ for (const store of firstTable.values())
320
+ if (isDistinct(store[arity], secondElse)) return manager.falseExpr;
321
+ return { expr: manager.mkAnd(conjuncts), depth: Infinity };
322
+ }
323
+
148
324
  private substitute(expr: number, args: number[]) {
149
325
  const subst = new VarSubst(this.manager, false);
150
326
  const result = subst.apply(expr, args);
@@ -155,17 +331,19 @@ export class ModelEvaluator extends RewriterTpl {
155
331
 
156
332
  private containsRedex(expr: number) {
157
333
  const manager = this.manager;
334
+ if (manager.getOp(expr) === OP_AS_ARRAY) return true;
158
335
  if (manager.kinds[expr] !== KIND_APP || manager.getNumArgs(expr) === 0) return false;
159
336
  const visited = new Set<number>();
160
337
  const todo = [expr];
161
338
  for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
162
339
  if (visited.has(current)) continue;
163
340
  visited.add(current);
164
- if (manager.getOp(current) === OP_EQ) return true;
341
+ const op = manager.getOp(current);
342
+ if (op === OP_AS_ARRAY || op === OP_EQ || op === OP_FPA_FP) return true;
165
343
  if (manager.kinds[current] === KIND_APP) manager.pushArgs(current, todo);
166
344
  else if (manager.kinds[current] === KIND_QUANTIFIER) {
167
345
  const data = manager.getQuantifier(current);
168
- todo.push(data.body, ...data.patterns);
346
+ todo.push(data.body, ...data.patterns, ...data.noPatterns);
169
347
  }
170
348
  }
171
349
  return false;
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_model_finder.cpp), MIT license, see z3-license.txt.
2
1
  import { OP_OR, SORT_BOOL, type AstManager } from "./ast";
3
2
  import type { Context } from "./context";
4
3
  import { L_TRUE } from "./lbool";
@@ -6,11 +5,12 @@ import { solveMacros } from "./model-macro-solver";
6
5
  import type { ProtoModel } from "./proto-model";
7
6
  import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
8
7
  import { AufSolver } from "./auf-solver";
9
- import { MBQI_FORCE_TEMPLATE, QuantifierAnalyzer, QuantifierInfo } from "./quantifier-analyzer";
8
+ import { QuantifierAnalyzer, QuantifierInfo } from "./quantifier-analyzer";
10
9
  import { RefVector } from "./ref-vector";
11
10
  import { shrink } from "./array";
12
11
 
13
12
  export class ModelFinder {
13
+ private manager: AstManager;
14
14
  private q2info = new Map<number, QuantifierInfo>();
15
15
  private quantifiers: number[] = [];
16
16
  private scopes: number[] = [];
@@ -20,13 +20,11 @@ export class ModelFinder {
20
20
  readonly aufSolver: AufSolver;
21
21
  private newConstraints: number[] = [];
22
22
 
23
- constructor(
24
- private manager: AstManager,
25
- private context: Context,
26
- ) {
27
- this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
28
- this.macroRewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
29
- this.aufSolver = new AufSolver(manager, this.rewriter);
23
+ constructor(private context: Context) {
24
+ this.manager = context.manager;
25
+ this.rewriter = new Rewriter(this.manager, TACTIC_REWRITER_OPTIONS);
26
+ this.macroRewriter = new Rewriter(this.manager, TACTIC_REWRITER_OPTIONS);
27
+ this.aufSolver = new AufSolver(this.manager, this.rewriter);
30
28
  }
31
29
 
32
30
  getQuantifierInfo(quantifier: number) {
@@ -34,7 +32,7 @@ export class ModelFinder {
34
32
  }
35
33
 
36
34
  registerQuantifier(quantifier: number) {
37
- const info = new QuantifierInfo(this.manager, this.context, quantifier, this.macroRewriter);
35
+ const info = new QuantifierInfo(this.context, quantifier, this.macroRewriter);
38
36
  this.q2info.set(quantifier, info);
39
37
  this.quantifiers.push(quantifier);
40
38
  new QuantifierAnalyzer(this.manager, this.rewriter, info).analyze();
@@ -65,12 +63,8 @@ export class ModelFinder {
65
63
  );
66
64
  if (quantifiers.length === 0) return;
67
65
  for (const quantifier of quantifiers) this.getQuantifierInfo(quantifier).resetTheOne();
68
- const residue = solveMacros(
69
- this.manager,
70
- model,
71
- quantifiers,
72
- (quantifier) => this.getQuantifierInfo(quantifier),
73
- MBQI_FORCE_TEMPLATE,
66
+ const residue = solveMacros(this.manager, model, quantifiers, (quantifier) =>
67
+ this.getQuantifierInfo(quantifier),
74
68
  );
75
69
  const solver = this.aufSolver;
76
70
  solver.reset();
@@ -97,10 +91,10 @@ export class ModelFinder {
97
91
  );
98
92
  }
99
93
 
100
- getInv(quantifier: number, index: number, value: number, model: ProtoModel) {
94
+ getInv(quantifier: number, index: number, value: number) {
101
95
  const set = this.getUvarInstSet(quantifier, index);
102
96
  if (set === null) return null;
103
- const term = set.getInv(value, model);
97
+ const term = set.getInv(value);
104
98
  if (term !== undefined && this.aufSolver.isDefaultRepresentative(term))
105
99
  return { term: value, generation: 0 };
106
100
  return term === undefined ? null : { term, generation: set.getGeneration(term) };
@@ -1,34 +1,31 @@
1
- // Ported from Z3 (src/smt/smt_model_generator.cpp), MIT license, see z3-license.txt.
2
- import {
3
- FAMILY_MODEL_VALUE,
4
- FAMILY_USER,
5
- type FuncDecl,
6
- OP_DIV0,
7
- OP_IDIV0,
8
- OP_MOD0,
9
- SORT_BOOL,
10
- isArithSort,
11
- } from "./ast";
1
+ import { FAMILY_BASIC, FAMILY_USER, SORT_BOOL } from "./ast";
12
2
  import type { Context } from "./context";
13
- import type { Enode } from "./enode";
3
+ import { Enode } from "./enode";
14
4
  import { FuncInterp, ProtoModel } from "./proto-model";
5
+ import type { DependentValue, ExtraFreshValue } from "./theory";
15
6
 
16
7
  export interface GeneratedModel {
17
8
  model: ProtoModel;
18
9
  root2value: Map<Enode, number>;
19
10
  }
20
11
 
21
- const isIncludedFuncInterp = (decl: FuncDecl) =>
22
- decl.family === FAMILY_USER ||
23
- decl.family === FAMILY_MODEL_VALUE ||
24
- decl.op === OP_DIV0 ||
25
- decl.op === OP_IDIV0 ||
26
- decl.op === OP_MOD0;
12
+ // include_func_interp: the model interprets uninterpreted functions, the decls that their theory
13
+ // asks for, such as theory_lra's divisions by zero, and the decls of a family without a theory, such
14
+ // as model values, which stand for themselves.
15
+ const isIncludedFuncInterp = (context: Context, decl: number) => {
16
+ const family = context.manager.funcDecls[decl].family;
17
+ if (family === FAMILY_USER) return true;
18
+ if (family === FAMILY_BASIC) return false;
19
+ return context.getTheory(family)?.includeFuncInterp(decl) ?? true;
20
+ };
21
+
22
+ const GREY = 1;
23
+ const BLACK = 2;
27
24
 
28
25
  export const mkModel = (context: Context): GeneratedModel => {
29
26
  const manager = context.manager;
30
27
  const model = new ProtoModel(manager);
31
- context.theory?.initModel(model);
28
+ for (const theory of context.theories) theory.initModel(model);
32
29
  for (const node of context.enodes)
33
30
  if (node.root === node && context.isRelevant(node.owner) && manager.isModelValue(node.owner))
34
31
  model.registerValue(node.owner);
@@ -40,26 +37,94 @@ export const mkModel = (context: Context): GeneratedModel => {
40
37
  context.findAssignment(expr) > 0 ? manager.trueExpr : manager.falseExpr,
41
38
  );
42
39
  }
43
- const root2value = new Map<Enode, number>();
44
- const freshRoots: Enode[] = [];
40
+ const roots: Enode[] = [];
41
+ const procs = new Map<Enode, number | DependentValue>();
42
+ const freshRoots = new Set<Enode>();
43
+ const extraFreshValues = new Set<ExtraFreshValue>();
45
44
  for (const node of context.enodes) {
46
45
  if (node.root !== node) continue;
47
46
  const expr = node.owner;
48
- if (!context.isRelevant(expr) && !manager.isUniqueValue(expr)) continue;
47
+ if (!context.isRelevant(expr) && !manager.isValue(expr)) continue;
48
+ roots.push(node);
49
49
  const sort = manager.sorts[expr];
50
+ const theory = context.getTheory(manager.getSortFamily(sort));
50
51
  if (sort === SORT_BOOL)
51
- root2value.set(node, context.findAssignment(expr) > 0 ? manager.trueExpr : manager.falseExpr);
52
- else if (manager.isUniqueValue(expr) && !isArithSort(sort)) root2value.set(node, expr);
53
- else if (isArithSort(sort)) {
54
- const value = context.theory?.mkValue(node);
55
- if (value === undefined) freshRoots.push(node);
56
- else root2value.set(node, value);
57
- } else root2value.set(node, model.getFreshValue(sort) ?? model.getSomeValue(sort));
52
+ procs.set(node, context.findAssignment(expr) > 0 ? manager.trueExpr : manager.falseExpr);
53
+ else if (manager.isModelValue(expr)) procs.set(node, expr);
54
+ else if (theory !== undefined && theory.buildModels()) {
55
+ const proc = node.getThVar(theory.id) < 0 ? undefined : theory.mkValue(node);
56
+ if (proc === undefined) {
57
+ const freshValue: ExtraFreshValue = { sort, value: undefined };
58
+ freshRoots.add(node);
59
+ extraFreshValues.add(freshValue);
60
+ procs.set(node, { dependencies: [freshValue], mkValue: (values) => values[0] });
61
+ } else {
62
+ if (typeof proc !== "number")
63
+ for (const dependency of proc.dependencies)
64
+ if (!(dependency instanceof Enode)) extraFreshValues.add(dependency);
65
+ procs.set(node, proc);
66
+ }
67
+ } else procs.set(node, model.getFreshValue(sort) ?? model.getSomeValue(sort));
58
68
  }
59
- for (const value of root2value.values()) model.registerValue(value);
60
- for (const node of freshRoots) {
61
- const sort = manager.sorts[node.owner];
62
- root2value.set(node, model.getFreshValue(sort) ?? model.getSomeValue(sort));
69
+ const colors = new Map<Enode | ExtraFreshValue, number>();
70
+ const traversedSorts = new Set<number>();
71
+ const sortedSources: (Enode | ExtraFreshValue)[] = [];
72
+ const todo: (Enode | ExtraFreshValue)[] = [];
73
+ const visitChild = (source: Enode | ExtraFreshValue) => {
74
+ if (!colors.has(source)) todo.push(source);
75
+ };
76
+ const processSource = (source: Enode | ExtraFreshValue) => {
77
+ if (colors.get(source) === BLACK) return;
78
+ todo.push(source);
79
+ while (todo.length > 0) {
80
+ const current = todo[todo.length - 1];
81
+ const color = colors.get(current);
82
+ if (color === BLACK) todo.pop();
83
+ else if (color === GREY) {
84
+ colors.set(current, BLACK);
85
+ sortedSources.push(current);
86
+ } else {
87
+ colors.set(current, GREY);
88
+ if (current instanceof Enode) {
89
+ const proc = procs.get(current);
90
+ if (proc !== undefined && typeof proc !== "number")
91
+ for (const dependency of proc.dependencies)
92
+ visitChild(dependency instanceof Enode ? dependency.root : dependency);
93
+ } else if (!traversedSorts.has(current.sort)) {
94
+ for (const root of roots)
95
+ if (manager.sorts[root.owner] === current.sort && !freshRoots.has(root))
96
+ visitChild(root);
97
+ traversedSorts.add(current.sort);
98
+ }
99
+ }
100
+ }
101
+ };
102
+ for (const freshValue of extraFreshValues) processSource(freshValue);
103
+ for (const root of freshRoots) processSource(root);
104
+ for (const root of roots) processSource(root);
105
+ const root2value = new Map<Enode, number>();
106
+ for (const source of sortedSources) {
107
+ if (!(source instanceof Enode)) {
108
+ source.value = model.getFreshValue(source.sort) ?? undefined;
109
+ continue;
110
+ }
111
+ const expr = source.owner;
112
+ const sort = manager.sorts[expr];
113
+ const proc = procs.get(source) ?? model.getFreshValue(sort) ?? model.getSomeValue(sort);
114
+ const value = manager.isValue(expr)
115
+ ? expr
116
+ : typeof proc === "number"
117
+ ? proc
118
+ : proc.mkValue(
119
+ proc.dependencies.map((dependency) =>
120
+ dependency instanceof Enode
121
+ ? (root2value.get(dependency.root) ??
122
+ model.getSomeValue(manager.sorts[dependency.owner]))
123
+ : (dependency.value ?? model.getSomeValue(dependency.sort)),
124
+ ),
125
+ );
126
+ model.registerValue(value);
127
+ root2value.set(source, value);
63
128
  }
64
129
  const getValue = (node: Enode) =>
65
130
  root2value.get(node.root) ?? model.getSomeValue(manager.sorts[node.owner]);
@@ -68,7 +133,7 @@ export const mkModel = (context: Context): GeneratedModel => {
68
133
  model.registerConst(manager.decls[node.owner], getValue(node));
69
134
  for (const node of context.enodes) {
70
135
  const expr = node.owner;
71
- if (!context.isRelevant(expr) || !isIncludedFuncInterp(manager.funcDecls[node.decl])) continue;
136
+ if (!context.isRelevant(expr) || !isIncludedFuncInterp(context, node.decl)) continue;
72
137
  if (node.numArgs === 0) {
73
138
  model.registerConst(node.decl, getValue(node));
74
139
  continue;
@@ -79,8 +144,12 @@ export const mkModel = (context: Context): GeneratedModel => {
79
144
  interp = new FuncInterp(manager, node.numArgs);
80
145
  model.registerFunc(node.decl, interp);
81
146
  }
82
- const args = Array.from({ length: node.numArgs }, (_, index) => getValue(node.getArg(index)));
147
+ const args = Array.from({ length: node.numArgs }, (_value, index) =>
148
+ getValue(node.getArg(index)),
149
+ );
83
150
  if (interp.getEntry(args) === undefined) interp.insertNewEntry(args, getValue(node));
84
151
  }
152
+ for (const theory of context.theories) theory.finalizeModel();
153
+ context.macros?.registerInterpretations(model);
85
154
  return { model, root2value };
86
155
  };