tla-ts 0.0.10-dev.094b9b512 → 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 (487) hide show
  1. package/dist/deciders.cjs +37 -36
  2. package/dist/deciders.js +55 -54
  3. package/dist/index.cjs +1 -1
  4. package/dist/index.d.cts +3 -0
  5. package/dist/index.d.ts +3 -0
  6. package/dist/index.js +1 -1
  7. package/dist/parallel-worker.cjs +1 -1
  8. package/dist/parallel-worker.js +1 -1
  9. package/dist/prove.cjs +146 -58
  10. package/dist/prove.js +142 -54
  11. package/dist/run.cjs +45 -43
  12. package/dist/run.js +47 -45
  13. package/dist/transfer.cjs +39 -36
  14. package/dist/transfer.js +23 -20
  15. package/dist/worker.cjs +1 -1
  16. package/dist/worker.js +1 -1
  17. package/package.json +1 -1
  18. package/src/ast.ts +3 -3
  19. package/src/check.ts +203 -33
  20. package/src/cli/tlapm.ts +268 -71
  21. package/src/cli/tlc-output.ts +3 -3
  22. package/src/cli/tlc-usage.ts +0 -1
  23. package/src/cli/tlc.ts +15 -1
  24. package/src/dependencies.ts +23 -2
  25. package/src/environment.ts +10 -5
  26. package/src/errors.ts +1 -1
  27. package/src/exit-codes.ts +1 -0
  28. package/src/liveness-checker.ts +530 -201
  29. package/src/liveness.ts +47 -32
  30. package/src/obligations/action.ts +0 -2
  31. package/src/obligations/anonymize.ts +2 -6
  32. package/src/obligations/equality.ts +0 -2
  33. package/src/obligations/expression.ts +0 -2
  34. package/src/obligations/format.ts +0 -2
  35. package/src/obligations/generate.ts +0 -2
  36. package/src/obligations/index.ts +8 -7
  37. package/src/obligations/levels.ts +0 -2
  38. package/src/obligations/module.ts +0 -2
  39. package/src/obligations/normalize.ts +0 -2
  40. package/src/obligations/operators.ts +0 -2
  41. package/src/obligations/pragma.ts +2 -2
  42. package/src/obligations/printer.ts +0 -2
  43. package/src/obligations/proof.ts +0 -2
  44. package/src/obligations/regroup.ts +0 -2
  45. package/src/obligations/simplify.ts +0 -2
  46. package/src/obligations/subexpression.ts +1 -4
  47. package/src/obligations/substitution.ts +0 -2
  48. package/src/obligations/temporal.ts +0 -2
  49. package/src/obligations/tuples.ts +0 -2
  50. package/src/parallel.ts +2 -2
  51. package/src/parser.ts +151 -42
  52. package/src/pretty-print.ts +1 -1
  53. package/src/prover/deciders.ts +1 -8
  54. package/src/prover/isabelle/encode.ts +0 -2
  55. package/src/prover/isabelle/isar/attrib.ts +86 -55
  56. package/src/prover/isabelle/isar/context.ts +25 -26
  57. package/src/prover/isabelle/isar/induct.ts +2 -12
  58. package/src/prover/isabelle/isar/method.ts +6 -10
  59. package/src/prover/isabelle/isar/proof.ts +40 -39
  60. package/src/prover/isabelle/isar/rule-cases.ts +6 -16
  61. package/src/prover/isabelle/isar/theory.ts +16 -17
  62. package/src/prover/isabelle/isar/toplevel.ts +46 -56
  63. package/src/prover/isabelle/isar/type-check.ts +0 -2
  64. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  65. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  66. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  67. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  68. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  69. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  70. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  71. package/src/prover/isabelle/provers/classical.ts +1 -3
  72. package/src/prover/isabelle/provers/hypsubst.ts +0 -2
  73. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  74. package/src/prover/isabelle/pure/consts.ts +0 -2
  75. package/src/prover/isabelle/pure/conv.ts +0 -2
  76. package/src/prover/isabelle/pure/drule.ts +0 -2
  77. package/src/prover/isabelle/pure/envir.ts +0 -2
  78. package/src/prover/isabelle/pure/goal.ts +0 -2
  79. package/src/prover/isabelle/pure/logic.ts +0 -2
  80. package/src/prover/isabelle/pure/name.ts +0 -2
  81. package/src/prover/isabelle/pure/net.ts +0 -2
  82. package/src/prover/isabelle/pure/object-logic.ts +0 -2
  83. package/src/prover/isabelle/pure/pattern.ts +0 -2
  84. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  85. package/src/prover/isabelle/pure/rewriter.ts +0 -2
  86. package/src/prover/isabelle/pure/search.ts +0 -2
  87. package/src/prover/isabelle/pure/seq.ts +0 -2
  88. package/src/prover/isabelle/pure/simplifier.ts +0 -2
  89. package/src/prover/isabelle/pure/table.ts +0 -2
  90. package/src/prover/isabelle/pure/tactic.ts +0 -2
  91. package/src/prover/isabelle/pure/tactical.ts +0 -2
  92. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  93. package/src/prover/isabelle/pure/term.ts +0 -2
  94. package/src/prover/isabelle/pure/thm.ts +0 -2
  95. package/src/prover/isabelle/pure/type.ts +0 -2
  96. package/src/prover/isabelle/pure/unify.ts +0 -2
  97. package/src/prover/isabelle/pure/variable.ts +0 -2
  98. package/src/prover/isabelle/tla/classical-setup.ts +0 -2
  99. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  100. package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
  101. package/src/prover/ocaml.ts +4 -1
  102. package/src/prover/prep/action.ts +1 -0
  103. package/src/prover/prep/methods.ts +55 -6
  104. package/src/prover/prep/normalize.ts +4 -1
  105. package/src/prover/prove.ts +58 -32
  106. package/src/prover/ptl/decide.ts +43 -63
  107. package/src/prover/smt/context.ts +10 -14
  108. package/src/prover/smt/data.ts +51 -45
  109. package/src/prover/smt/encode.ts +1 -2
  110. package/src/prover/smt/rewrite.ts +1 -0
  111. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
  112. package/src/prover/smt/solver/ackr-helper.ts +0 -3
  113. package/src/prover/smt/solver/ackr-model-converter.ts +1 -8
  114. package/src/prover/smt/solver/act-cache.ts +0 -1
  115. package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
  116. package/src/prover/smt/solver/aig-tactic.ts +25 -16
  117. package/src/prover/smt/solver/aig.ts +2 -3
  118. package/src/prover/smt/solver/arith-rewriter.ts +4 -7
  119. package/src/prover/smt/solver/arith-terms.ts +0 -2
  120. package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
  121. package/src/prover/smt/solver/array-rewriter.ts +1 -4
  122. package/src/prover/smt/solver/asserted-formulas.ts +1 -2
  123. package/src/prover/smt/solver/ast-lt.ts +1 -2
  124. package/src/prover/smt/solver/ast-util.ts +4 -5
  125. package/src/prover/smt/solver/ast.ts +113 -157
  126. package/src/prover/smt/solver/auf-solver.ts +0 -1
  127. package/src/prover/smt/solver/bit-blast-tactic.ts +2 -11
  128. package/src/prover/smt/solver/bit-blaster.ts +0 -3
  129. package/src/prover/smt/solver/bound-manager.ts +39 -29
  130. package/src/prover/smt/solver/bound-simplifier.ts +0 -2
  131. package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
  132. package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
  133. package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
  134. package/src/prover/smt/solver/bv-rewriter.ts +14 -18
  135. package/src/prover/smt/solver/bv1-blast.ts +1 -11
  136. package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
  137. package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
  138. package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
  139. package/src/prover/smt/solver/card2bv.ts +0 -2
  140. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  141. package/src/prover/smt/solver/cg-table.ts +19 -16
  142. package/src/prover/smt/solver/check-logic.ts +6 -2
  143. package/src/prover/smt/solver/clause.ts +0 -1
  144. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
  145. package/src/prover/smt/solver/conflict-resolution.ts +8 -8
  146. package/src/prover/smt/solver/context.ts +21 -12
  147. package/src/prover/smt/solver/ctx-simplify.ts +0 -1
  148. package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
  149. package/src/prover/smt/solver/datatype-decl-plugin.ts +7 -10
  150. package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
  151. package/src/prover/smt/solver/demodulator.ts +2 -5
  152. package/src/prover/smt/solver/dependent-expr-state.ts +16 -3
  153. package/src/prover/smt/solver/der.ts +0 -1
  154. package/src/prover/smt/solver/diff-neq.ts +0 -1
  155. package/src/prover/smt/solver/distribute-forall.ts +1 -11
  156. package/src/prover/smt/solver/dom-simplify.ts +1 -3
  157. package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
  158. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  159. package/src/prover/smt/solver/e-matching.ts +6 -7
  160. package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
  161. package/src/prover/smt/solver/elim-uncnstr.ts +3 -16
  162. package/src/prover/smt/solver/enode.ts +16 -10
  163. package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
  164. package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
  165. package/src/prover/smt/solver/euf/arith-internalize.ts +1 -7
  166. package/src/prover/smt/solver/euf/arith-solver.ts +0 -6
  167. package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
  168. package/src/prover/smt/solver/euf/array-internalize.ts +20 -11
  169. package/src/prover/smt/solver/euf/array-solver.ts +0 -2
  170. package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
  171. package/src/prover/smt/solver/euf/bv-internalize.ts +0 -2
  172. package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
  173. package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
  174. package/src/prover/smt/solver/euf/egraph.ts +66 -44
  175. package/src/prover/smt/solver/euf/euf-solver.ts +37 -35
  176. package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
  177. package/src/prover/smt/solver/euf/mam.ts +6 -50
  178. package/src/prover/smt/solver/euf/q-ematch.ts +26 -96
  179. package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
  180. package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
  181. package/src/prover/smt/solver/euf/q-solver.ts +3 -3
  182. package/src/prover/smt/solver/euf/th-solver.ts +1 -9
  183. package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
  184. package/src/prover/smt/solver/expr-ref.ts +0 -1
  185. package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
  186. package/src/prover/smt/solver/expr2polynomial.ts +0 -1
  187. package/src/prover/smt/solver/factor.ts +1 -12
  188. package/src/prover/smt/solver/fd-solver.ts +1 -5
  189. package/src/prover/smt/solver/fingerprints.ts +0 -1
  190. package/src/prover/smt/solver/fix-dl-var.ts +1 -2
  191. package/src/prover/smt/solver/flat-literals.ts +0 -1
  192. package/src/prover/smt/solver/fm-tactic.ts +25 -14
  193. package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
  194. package/src/prover/smt/solver/fpa-rewriter.ts +13 -14
  195. package/src/prover/smt/solver/fpa2bv-converter.ts +10 -7
  196. package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
  197. package/src/prover/smt/solver/fpa2bv-tactic.ts +1 -3
  198. package/src/prover/smt/solver/goal.ts +0 -1
  199. package/src/prover/smt/solver/goal2nlsat.ts +0 -2
  200. package/src/prover/smt/solver/guard-set.ts +0 -1
  201. package/src/prover/smt/solver/hash.ts +0 -1
  202. package/src/prover/smt/solver/hashtable.ts +0 -1
  203. package/src/prover/smt/solver/inf-eps.ts +1 -2
  204. package/src/prover/smt/solver/inj-axiom.ts +0 -1
  205. package/src/prover/smt/solver/internalizer.ts +41 -3
  206. package/src/prover/smt/solver/lackr.ts +0 -2
  207. package/src/prover/smt/solver/lbool.ts +0 -1
  208. package/src/prover/smt/solver/lia2card.ts +1 -2
  209. package/src/prover/smt/solver/lia2pb.ts +18 -5
  210. package/src/prover/smt/solver/literal.ts +0 -1
  211. package/src/prover/smt/solver/logic-tactics.ts +0 -4
  212. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  213. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  214. package/src/prover/smt/solver/lp/containers.ts +0 -1
  215. package/src/prover/smt/solver/lp/core-solver.ts +0 -3
  216. package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
  217. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  218. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  219. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  220. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  221. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  222. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  223. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  224. package/src/prover/smt/solver/lp/int-cube.ts +0 -1
  225. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  226. package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
  227. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  228. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  229. package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
  230. package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
  231. package/src/prover/smt/solver/lp/nex.ts +0 -1
  232. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  233. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  234. package/src/prover/smt/solver/lp/nla-core.ts +25 -6
  235. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  236. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  237. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  238. package/src/prover/smt/solver/lp/nla-grobner.ts +0 -2
  239. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  240. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  241. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  242. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  243. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  244. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  245. package/src/prover/smt/solver/lp/nla-powers.ts +144 -108
  246. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  247. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  248. package/src/prover/smt/solver/lp/nla-transcendentals.ts +50 -19
  249. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  250. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  251. package/src/prover/smt/solver/lp/nra-solver.ts +97 -62
  252. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  253. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  254. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  255. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  256. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  257. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  258. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  259. package/src/prover/smt/solver/lp/union-find.ts +0 -1
  260. package/src/prover/smt/solver/macro-finder.ts +1 -4
  261. package/src/prover/smt/solver/mam-compiler.ts +13 -14
  262. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  263. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
  264. package/src/prover/smt/solver/max-cliques.ts +0 -2
  265. package/src/prover/smt/solver/maxcore.ts +6 -15
  266. package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -2
  267. package/src/prover/smt/solver/maxlex.ts +0 -8
  268. package/src/prover/smt/solver/maxsmt-base.ts +7 -1
  269. package/src/prover/smt/solver/maxsmt.ts +0 -1
  270. package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
  271. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
  272. package/src/prover/smt/solver/mbp/mbp-plugin.ts +10 -3
  273. package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
  274. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
  275. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +1 -19
  276. package/src/prover/smt/solver/model-based-opt.ts +0 -1
  277. package/src/prover/smt/solver/model-checker.ts +2 -3
  278. package/src/prover/smt/solver/model-evaluator.ts +9 -6
  279. package/src/prover/smt/solver/model-finder.ts +0 -1
  280. package/src/prover/smt/solver/model-generator.ts +0 -1
  281. package/src/prover/smt/solver/model-macro-solver.ts +3 -4
  282. package/src/prover/smt/solver/model-printer.ts +0 -1
  283. package/src/prover/smt/solver/mpf.ts +0 -1
  284. package/src/prover/smt/solver/mus.ts +0 -1
  285. package/src/prover/smt/solver/muz/dl-context.ts +57 -15
  286. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
  287. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
  288. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
  289. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -6
  290. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
  291. package/src/prover/smt/solver/muz/dl-mk-slice.ts +76 -14
  292. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
  293. package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -30
  294. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
  295. package/src/prover/smt/solver/muz/dl-rule.ts +91 -55
  296. package/src/prover/smt/solver/muz/hnf.ts +6 -6
  297. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  298. package/src/prover/smt/solver/muz/horn-tactic.ts +14 -5
  299. package/src/prover/smt/solver/muz/rule-properties.ts +195 -37
  300. package/src/prover/smt/solver/muz/spacer-context.ts +109 -98
  301. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -4
  302. package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
  303. package/src/prover/smt/solver/muz/spacer-manager.ts +0 -6
  304. package/src/prover/smt/solver/muz/spacer-pdr.ts +3 -4
  305. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +4 -15
  306. package/src/prover/smt/solver/muz/spacer-util.ts +2 -29
  307. package/src/prover/smt/solver/muz/substitution.ts +88 -39
  308. package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
  309. package/src/prover/smt/solver/nlqsat.ts +4 -4
  310. package/src/prover/smt/solver/nlsat/algebraic.ts +1 -4
  311. package/src/prover/smt/solver/nlsat/atoms.ts +0 -2
  312. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  313. package/src/prover/smt/solver/nlsat/explain.ts +5 -1
  314. package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
  315. package/src/prover/smt/solver/nlsat/levelwise.ts +2 -3
  316. package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
  317. package/src/prover/smt/solver/nlsat/polynomial.ts +0 -2
  318. package/src/prover/smt/solver/nlsat/solver.ts +47 -44
  319. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
  320. package/src/prover/smt/solver/nlsat/transcendentals.ts +0 -2
  321. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  322. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +0 -3
  323. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  324. package/src/prover/smt/solver/nlsat-tactic.ts +0 -1
  325. package/src/prover/smt/solver/nnf.ts +0 -1
  326. package/src/prover/smt/solver/normalize-bounds.ts +0 -1
  327. package/src/prover/smt/solver/occf.ts +0 -1
  328. package/src/prover/smt/solver/opt-context.ts +10 -10
  329. package/src/prover/smt/solver/opt-nlsat.ts +68 -59
  330. package/src/prover/smt/solver/opt-pareto.ts +0 -2
  331. package/src/prover/smt/solver/opt-preprocess.ts +0 -1
  332. package/src/prover/smt/solver/opt-solver.ts +16 -8
  333. package/src/prover/smt/solver/opt-value.ts +0 -1
  334. package/src/prover/smt/solver/optsmt.ts +12 -11
  335. package/src/prover/smt/solver/parallel-tactic.ts +0 -2
  336. package/src/prover/smt/solver/pattern-inference.ts +2 -3
  337. package/src/prover/smt/solver/pb-rewriter.ts +14 -26
  338. package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
  339. package/src/prover/smt/solver/poly-rewriter.ts +2 -3
  340. package/src/prover/smt/solver/probes.ts +3 -5
  341. package/src/prover/smt/solver/propagate-values.ts +4 -1
  342. package/src/prover/smt/solver/proto-model.ts +5 -6
  343. package/src/prover/smt/solver/pull-quant.ts +0 -1
  344. package/src/prover/smt/solver/purify-arith.ts +50 -16
  345. package/src/prover/smt/solver/qe-arith-plugin.ts +2 -3
  346. package/src/prover/smt/solver/qe-lite-der.ts +0 -1
  347. package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
  348. package/src/prover/smt/solver/qe-lite.ts +0 -1
  349. package/src/prover/smt/solver/qe-mbp.ts +13 -24
  350. package/src/prover/smt/solver/qe.ts +45 -55
  351. package/src/prover/smt/solver/qel.ts +0 -1
  352. package/src/prover/smt/solver/qi-queue.ts +0 -1
  353. package/src/prover/smt/solver/qsat.ts +71 -97
  354. package/src/prover/smt/solver/quant-hoist.ts +2 -1
  355. package/src/prover/smt/solver/quant-tactics.ts +0 -1
  356. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  357. package/src/prover/smt/solver/quantifier-manager.ts +0 -1
  358. package/src/prover/smt/solver/quasi-macros.ts +9 -20
  359. package/src/prover/smt/solver/random-gen.ts +0 -1
  360. package/src/prover/smt/solver/rational.ts +17 -1
  361. package/src/prover/smt/solver/recfun-decl-plugin.ts +33 -20
  362. package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
  363. package/src/prover/smt/solver/reduce-args.ts +0 -1
  364. package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
  365. package/src/prover/smt/solver/ref-vector.ts +0 -1
  366. package/src/prover/smt/solver/relevancy.ts +0 -1
  367. package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
  368. package/src/prover/smt/solver/rewriter.ts +1 -2
  369. package/src/prover/smt/solver/rlimit.ts +13 -1
  370. package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
  371. package/src/prover/smt/solver/sat/big.ts +0 -1
  372. package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
  373. package/src/prover/smt/solver/sat/clause.ts +2 -20
  374. package/src/prover/smt/solver/sat/cleaner.ts +0 -2
  375. package/src/prover/smt/solver/sat/config.ts +5 -8
  376. package/src/prover/smt/solver/sat/consequences.ts +1 -2
  377. package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
  378. package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
  379. package/src/prover/smt/solver/sat/inc-sat-solver.ts +4 -14
  380. package/src/prover/smt/solver/sat/model-converter.ts +1 -21
  381. package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
  382. package/src/prover/smt/solver/sat/pb-solver.ts +49 -25
  383. package/src/prover/smt/solver/sat/probing.ts +22 -21
  384. package/src/prover/smt/solver/sat/sat-tactic.ts +0 -1
  385. package/src/prover/smt/solver/sat/sat2goal.ts +9 -15
  386. package/src/prover/smt/solver/sat/scc.ts +1 -2
  387. package/src/prover/smt/solver/sat/simplifier.ts +15 -59
  388. package/src/prover/smt/solver/sat/solver.ts +22 -23
  389. package/src/prover/smt/solver/sat/var-queue.ts +0 -2
  390. package/src/prover/smt/solver/sat/watch-list.ts +7 -3
  391. package/src/prover/smt/solver/search-tree.ts +0 -1
  392. package/src/prover/smt/solver/seq-axioms.ts +1 -4
  393. package/src/prover/smt/solver/seq-decl-plugin.ts +9 -13
  394. package/src/prover/smt/solver/seq-derive.ts +8 -10
  395. package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
  396. package/src/prover/smt/solver/seq-eq-solver.ts +7 -8
  397. package/src/prover/smt/solver/seq-factory.ts +2 -4
  398. package/src/prover/smt/solver/seq-monadic.ts +0 -2
  399. package/src/prover/smt/solver/seq-range-predicate.ts +18 -8
  400. package/src/prover/smt/solver/seq-re-rewriter.ts +3 -129
  401. package/src/prover/smt/solver/seq-re-util.ts +7 -26
  402. package/src/prover/smt/solver/seq-regex-bisim.ts +1 -2
  403. package/src/prover/smt/solver/seq-regex-live.ts +4 -6
  404. package/src/prover/smt/solver/seq-rewriter.ts +1 -6
  405. package/src/prover/smt/solver/seq-skolem.ts +0 -1
  406. package/src/prover/smt/solver/seq-subset.ts +0 -1
  407. package/src/prover/smt/solver/seq-view-witness.ts +0 -2
  408. package/src/prover/smt/solver/smt-consequences.ts +0 -2
  409. package/src/prover/smt/solver/smt-kernel.ts +0 -2
  410. package/src/prover/smt/solver/smt-logics.ts +0 -1
  411. package/src/prover/smt/solver/smt-setup.ts +18 -14
  412. package/src/prover/smt/solver/smt2-printer.ts +0 -2
  413. package/src/prover/smt/solver/smtlib-parser.ts +1204 -582
  414. package/src/prover/smt/solver/smtlib-script.ts +868 -730
  415. package/src/prover/smt/solver/solve-eqs.ts +0 -2
  416. package/src/prover/smt/solver/solver.ts +1 -2
  417. package/src/prover/smt/solver/static-features.ts +0 -5
  418. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  419. package/src/prover/smt/solver/tactic.ts +66 -16
  420. package/src/prover/smt/solver/term-enumeration.ts +0 -1
  421. package/src/prover/smt/solver/theory-array.ts +25 -60
  422. package/src/prover/smt/solver/theory-bv.ts +13 -52
  423. package/src/prover/smt/solver/theory-char.ts +0 -1
  424. package/src/prover/smt/solver/theory-datatype.ts +0 -1
  425. package/src/prover/smt/solver/theory-finite-set.ts +2 -2
  426. package/src/prover/smt/solver/theory-fpa.ts +46 -79
  427. package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
  428. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
  429. package/src/prover/smt/solver/theory-lra-final-check.ts +0 -1
  430. package/src/prover/smt/solver/theory-lra-internalize.ts +8 -1
  431. package/src/prover/smt/solver/theory-lra-model.ts +0 -1
  432. package/src/prover/smt/solver/theory-lra-propagate.ts +0 -1
  433. package/src/prover/smt/solver/theory-lra-state.ts +0 -1
  434. package/src/prover/smt/solver/theory-lra.ts +0 -6
  435. package/src/prover/smt/solver/theory-pb.ts +10 -8
  436. package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
  437. package/src/prover/smt/solver/theory-recfun.ts +2 -3
  438. package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
  439. package/src/prover/smt/solver/theory-seq-solve.ts +5 -7
  440. package/src/prover/smt/solver/theory-seq-state.ts +6 -15
  441. package/src/prover/smt/solver/theory-seq.ts +32 -55
  442. package/src/prover/smt/solver/theory.ts +16 -2
  443. package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
  444. package/src/prover/smt/solver/var-subst.ts +6 -6
  445. package/src/prover/smt/table.ts +3 -2
  446. package/src/prover/zenon/decide.ts +9 -13
  447. package/src/prover/zenon/encode.ts +0 -2
  448. package/src/prover/zenon/eqrel.ts +0 -2
  449. package/src/prover/zenon/equality-rules.ts +0 -2
  450. package/src/prover/zenon/expr.ts +0 -2
  451. package/src/prover/zenon/index-table.ts +0 -2
  452. package/src/prover/zenon/isar-case.ts +0 -2
  453. package/src/prover/zenon/isar.ts +0 -2
  454. package/src/prover/zenon/llproof.ts +0 -2
  455. package/src/prover/zenon/mltoll.ts +0 -2
  456. package/src/prover/zenon/node.ts +12 -13
  457. package/src/prover/zenon/parse.ts +0 -2
  458. package/src/prover/zenon/phrase.ts +0 -2
  459. package/src/prover/zenon/proof.ts +0 -2
  460. package/src/prover/zenon/propositional-rules.ts +0 -2
  461. package/src/prover/zenon/rules.ts +0 -2
  462. package/src/prover/zenon/search.ts +0 -2
  463. package/src/prover/zenon/tla/functions.ts +0 -2
  464. package/src/prover/zenon/tla/llproof.ts +0 -2
  465. package/src/prover/zenon/tla/records.ts +0 -2
  466. package/src/prover/zenon/tla/rewrites.ts +0 -2
  467. package/src/prover/zenon/tla/sets.ts +1 -3
  468. package/src/prover/zenon/tla/terms.ts +0 -2
  469. package/src/prover/zenon/tla/tla.ts +0 -2
  470. package/src/resolve.ts +1 -2
  471. package/src/runtime.ts +4 -0
  472. package/src/sany/levels.ts +0 -2
  473. package/src/sany/linter.ts +0 -2
  474. package/src/search.ts +160 -36
  475. package/src/simulate.ts +3 -0
  476. package/src/standard-definitions.ts +4 -0
  477. package/src/state-graph.ts +0 -2
  478. package/src/successors.ts +1 -1
  479. package/src/symmetry.ts +2 -2
  480. package/src/tableau.ts +2 -2
  481. package/src/tlc/fingerprint.ts +81 -9
  482. package/src/tlc/summary.ts +29 -14
  483. package/src/tlc/tlcext-operators.ts +44 -12
  484. package/src/typed-tier.ts +6535 -0
  485. package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
  486. package/src/prover/smt/solver/z3-license.txt +0 -10
  487. package/src/prover/zenon/LICENSE +0 -32
@@ -1,9 +1,12 @@
1
- // Ported from Z3 (src/muz/spacer/spacer_context.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtTacticError, SmtUnsupportedError } from "../../../../errors";
3
2
  import { type AstManager, getSymbolName, KIND_VAR, OP_AND, OP_IMPLIES, SORT_BOOL } from "../ast";
4
- import { pushNotOwned } from "../ast-util";
3
+ import { flattenOrVector, pushNotOwned } from "../ast-util";
4
+ import { ObjHashtable, ObjMap } from "../hashtable";
5
5
  import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
6
- import type { ProtoModel } from "../proto-model";
6
+ import { ExprSafeReplace } from "../expr-safe-replace";
7
+ import { FuncInterp, ProtoModel } from "../proto-model";
8
+ import { RefVector } from "../ref-vector";
9
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "../rewriter";
7
10
  import { getFreeVarSorts, VarSubst } from "../var-subst";
8
11
  import type { DatalogContext, FpParams } from "./dl-context";
9
12
  import { blastTermIte } from "./dl-mk-elim-term-ite";
@@ -35,10 +38,8 @@ export const L_GAVE_UP = 2;
35
38
 
36
39
  class ReachFact {
37
40
  tag = -1;
38
- readonly justifications: ReachFact[] = [];
39
41
 
40
42
  constructor(
41
- readonly rule: Rule,
42
43
  readonly fact: number,
43
44
  readonly auxVars: readonly number[],
44
45
  readonly isInit = false,
@@ -53,9 +54,7 @@ export class Lemma {
53
54
  level: number;
54
55
  bumped = 0;
55
56
  weakness: number;
56
- isExternal = false;
57
57
  isBlocked = false;
58
- isBackground = false;
59
58
 
60
59
  constructor(
61
60
  private context: SpacerContext,
@@ -116,7 +115,6 @@ export class Lemma {
116
115
  }
117
116
 
118
117
  setLevel(level: number) {
119
- this.pob?.blockedAt(level);
120
118
  this.level = level;
121
119
  }
122
120
 
@@ -132,8 +130,7 @@ export class Lemma {
132
130
  const isLemmaLess = (manager: AstManager, first: Lemma, second: Lemma) =>
133
131
  first.level !== second.level
134
132
  ? first.level < second.level
135
- : sortByAstLt(manager, [second.getExpr(), first.getExpr()])[0] === first.getExpr() &&
136
- first.getExpr() !== second.getExpr();
133
+ : manager.ids[first.getExpr()] < manager.ids[second.getExpr()];
137
134
 
138
135
  export class Pob {
139
136
  readonly id: number;
@@ -141,7 +138,6 @@ export class Pob {
141
138
  binding: number[] = [];
142
139
  level: number;
143
140
  depth: number;
144
- desiredLevel = 0;
145
141
  isOpen = true;
146
142
  isUsingFarkas = true;
147
143
  isInQueue = false;
@@ -149,8 +145,6 @@ export class Pob {
149
145
  derivation: Derivation | undefined;
150
146
  readonly kids: Pob[] = [];
151
147
  readonly lemmas: Lemma[] = [];
152
- blockedLevel = 0;
153
- gas = 0;
154
148
 
155
149
  constructor(
156
150
  readonly parent: Pob | undefined,
@@ -163,7 +157,6 @@ export class Pob {
163
157
  this.level = level;
164
158
  this.depth = depth;
165
159
  if (isAddingToParent && parent !== undefined) parent.kids.push(this);
166
- if (parent !== undefined) this.gas = parent.gas;
167
160
  }
168
161
 
169
162
  setPost(post: number, binding: readonly number[] = []) {
@@ -175,7 +168,6 @@ export class Pob {
175
168
  this.binding = [...other.binding];
176
169
  this.level = other.level;
177
170
  this.depth = other.depth;
178
- this.desiredLevel = Math.max(this.desiredLevel, other.desiredLevel);
179
171
  this.isOpen = other.isOpen;
180
172
  this.isUsingFarkas = other.isUsingFarkas;
181
173
  this.weakness = other.weakness;
@@ -198,17 +190,11 @@ export class Pob {
198
190
  this.depth++;
199
191
  this.weakness = 0;
200
192
  }
201
-
202
- blockedAt(level = 0) {
203
- this.blockedLevel = Math.max(level, this.blockedLevel);
204
- return this.blockedLevel;
205
- }
206
193
  }
207
194
 
208
195
  const isPobLess = (manager: AstManager, first: Pob, second: Pob) => {
209
196
  if (first.level !== second.level) return first.level < second.level;
210
197
  if (first.depth !== second.depth) return first.depth < second.depth;
211
- if (first.gas !== second.gas) return first.gas > second.gas;
212
198
  const getSize = (post: number) => (manager.getOp(post) === OP_AND ? manager.getNumArgs(post) : 1);
213
199
  if (getSize(first.post) !== getSize(second.post))
214
200
  return getSize(first.post) < getSize(second.post);
@@ -218,6 +204,8 @@ const isPobLess = (manager: AstManager, first: Pob, second: Pob) => {
218
204
  return firstHead !== secondHead ? firstHead < secondHead : first.id < second.id;
219
205
  };
220
206
 
207
+ // A binary heap by isPobLess, which orders the proof obligations totally and reads nothing that
208
+ // changes while they are queued.
221
209
  class PobQueue {
222
210
  root: Pob | undefined;
223
211
  maxLevel = 0;
@@ -226,25 +214,31 @@ class PobQueue {
226
214
 
227
215
  constructor(private manager: AstManager) {}
228
216
 
229
- private getMinIndex() {
230
- let best = 0;
231
- for (let index = 1; index < this.data.length; index++)
232
- if (isPobLess(this.manager, this.data[index], this.data[best])) best = index;
233
- return best;
234
- }
235
-
236
217
  top() {
237
218
  if (this.data.length === 0) return undefined;
238
- const top = this.data[this.getMinIndex()];
219
+ const top = this.data[0];
239
220
  if (top.level > this.maxLevel) return undefined;
240
221
  if (top.level === this.maxLevel && top.depth > this.minDepth) return undefined;
241
222
  return top;
242
223
  }
243
224
 
244
225
  pop() {
245
- const index = this.getMinIndex();
246
- this.data[index].isInQueue = false;
247
- this.data.splice(index, 1);
226
+ const data = this.data;
227
+ data[0].isInQueue = false;
228
+ const moved = data[data.length - 1];
229
+ data.pop();
230
+ if (data.length === 0) return;
231
+ let index = 0;
232
+ for (let left = 1; left < data.length; left = 2 * index + 1) {
233
+ const child =
234
+ left + 1 < data.length && isPobLess(this.manager, data[left + 1], data[left])
235
+ ? left + 1
236
+ : left;
237
+ if (!isPobLess(this.manager, data[child], moved)) break;
238
+ data[index] = data[child];
239
+ index = child;
240
+ }
241
+ data[index] = moved;
248
242
  }
249
243
 
250
244
  setRoot(root: Pob) {
@@ -265,7 +259,16 @@ class PobQueue {
265
259
  push(pob: Pob) {
266
260
  if (pob.isInQueue) return;
267
261
  pob.isInQueue = true;
268
- this.data.push(pob);
262
+ const data = this.data;
263
+ let index = data.length;
264
+ data.push(pob);
265
+ while (index > 0) {
266
+ const parent = (index - 1) >> 1;
267
+ if (!isPobLess(this.manager, pob, data[parent])) break;
268
+ data[index] = data[parent];
269
+ index = parent;
270
+ }
271
+ data[index] = pob;
269
272
  }
270
273
 
271
274
  incLevel() {
@@ -391,7 +394,7 @@ class Derivation {
391
394
  summaries.push(activeTrans);
392
395
  const model = pt.isMustReachable(mkAndOf(manager, summaries));
393
396
  if (model === undefined) return undefined;
394
- const reachFact = pt.getUsedRf(model, true);
397
+ const reachFact = pt.getUsedRf(model);
395
398
  const summary = mkAndOf(manager, computeImplicantLiterals(model, [reachFact.fact]));
396
399
  premise.isMust = true;
397
400
  premise.summary = spacer.formulaN2o(summary, premise.oIndex);
@@ -428,11 +431,9 @@ class PredTransformer {
428
431
  private pobs = new Map<number, Pob[]>();
429
432
  nextPobId = 0;
430
433
  readonly lemmas: Lemma[] = [];
431
- private bgInvs: Lemma[] = [];
432
434
  private frameSize = 0;
433
435
  private isSorted = true;
434
436
  readonly reachFacts: ReachFact[] = [];
435
- private rfInitSize = 0;
436
437
  private transitionClause: number[] = [];
437
438
  private transition = -1;
438
439
  private init = -1;
@@ -504,11 +505,8 @@ class PredTransformer {
504
505
  return model;
505
506
  }
506
507
 
507
- getUsedRf(model: ProtoModel, isAll: boolean) {
508
- for (const reachFact of this.reachFacts) {
509
- if (!isAll && reachFact.isInit) continue;
510
- if (isFalseIn(model, reachFact.tag)) return reachFact;
511
- }
508
+ getUsedRf(model: ProtoModel) {
509
+ for (const reachFact of this.reachFacts) if (isFalseIn(model, reachFact.tag)) return reachFact;
512
510
  throw new SmtTacticError("spacer found no used reach fact");
513
511
  }
514
512
 
@@ -567,20 +565,15 @@ class PredTransformer {
567
565
  );
568
566
  }
569
567
 
570
- private addLemmaCore(lemma: Lemma, isGroundOnly = false) {
568
+ private addLemmaCore(lemma: Lemma) {
571
569
  const level = lemma.level;
572
570
  const expr = lemma.getExpr();
573
571
  if (!isInftyLevel(level)) this.ensureLevel(level);
574
572
  this.solver.assertExpr(expr, level);
575
- for (const use of this.uses) use.addLemmaFromChild(this, lemma, nextLevel(level), isGroundOnly);
573
+ for (const use of this.uses) use.addLemmaFromChild(this, lemma, nextLevel(level));
576
574
  }
577
575
 
578
- private addLemmaFromChild(
579
- child: PredTransformer,
580
- lemma: Lemma,
581
- level: number,
582
- _isGroundOnly: boolean,
583
- ) {
576
+ private addLemmaFromChild(child: PredTransformer, lemma: Lemma, level: number) {
584
577
  this.ensureLevel(level);
585
578
  for (const fml of this.mkAssumptions(child.head, lemma.getExpr()))
586
579
  this.solver.assertExpr(fml, level);
@@ -588,11 +581,6 @@ class PredTransformer {
588
581
 
589
582
  addLemma(lemma: Lemma) {
590
583
  const manager = this.manager;
591
- if (lemma.isBackground) {
592
- if (this.bgInvs.some((other) => other.getExpr() === lemma.getExpr())) return false;
593
- this.bgInvs.push(lemma);
594
- return true;
595
- }
596
584
  for (let index = 0; index < this.lemmas.length; index++) {
597
585
  const old = this.lemmas[index];
598
586
  if (old.getExpr() !== lemma.getExpr()) continue;
@@ -691,7 +679,6 @@ class PredTransformer {
691
679
  ? this.mkFreshRfTag()
692
680
  : manager.getArg(this.extendInitial(reachFact.fact), 0);
693
681
  this.reachFacts.push(reachFact);
694
- if (reachFact.isInit) this.rfInitSize++;
695
682
  const fml = mkOrOf(
696
683
  manager,
697
684
  lastTag === -1
@@ -700,7 +687,7 @@ class PredTransformer {
700
687
  );
701
688
  this.reachSolver.assertExpr(fml);
702
689
  const fakeLemma = new Lemma(this.context, INFTY_LEVEL, fml);
703
- for (const use of this.uses) use.addLemmaFromChild(this, fakeLemma, INFTY_LEVEL, false);
690
+ for (const use of this.uses) use.addLemmaFromChild(this, fakeLemma, INFTY_LEVEL);
704
691
  }
705
692
 
706
693
  getLastRfTag() {
@@ -722,17 +709,6 @@ class PredTransformer {
722
709
  return { summary: mkAndOf(manager, computeImplicantLiterals(model, conjs)), auxVars };
723
710
  }
724
711
 
725
- isBlocked(pob: Pob) {
726
- this.ensureLevel(pob.level);
727
- const solver = this.solver;
728
- return solver.withLevel(pob.level, () => {
729
- solver.core = undefined;
730
- solver.model = undefined;
731
- const result = solver.checkAssumptions([pob.post], [], [], []);
732
- return result === L_FALSE ? solver.usesLevel : undefined;
733
- });
734
- }
735
-
736
712
  mbp(vars: number[], fml: number, model: ProtoModel, isForcing: boolean) {
737
713
  return qeProject(this.manager, vars, fml, model, !isForcing);
738
714
  }
@@ -880,8 +856,7 @@ class PredTransformer {
880
856
 
881
857
  initRfs() {
882
858
  for (const ptRule of this.ptRules.values())
883
- if (isInitRule(ptRule))
884
- this.addRf(new ReachFact(ptRule.rule, ptRule.trans, ptRule.auxs, true));
859
+ if (isInitRule(ptRule)) this.addRf(new ReachFact(ptRule.trans, ptRule.auxs, true));
885
860
  }
886
861
 
887
862
  private initRules(pts: Map<number, PredTransformer>) {
@@ -941,7 +916,7 @@ class PredTransformer {
941
916
  trans = context.simplify(mkAndOf(manager, side));
942
917
  const inflation = context.params.getUint("spacer.blast_term_ite_inflation", 3);
943
918
  if (inflation > 0) trans = context.simplify(blastTermIte(manager, trans, inflation));
944
- if (rule.uninterpretedSize > 0 && !manager.isGround(trans))
919
+ if (rule.uninterpretedSize > 0 && !manager.isGroundApp(trans))
945
920
  throw new SmtTacticError("spacer: quantifier in a recursive rule");
946
921
  if (manager.isFalse(trans)) return;
947
922
  if (!this.ptRules.has(rule)) this.ptRules.set(rule, { rule, trans, auxs: auxVars, tag: -1 });
@@ -983,17 +958,15 @@ class PredTransformer {
983
958
  return this.extendLit;
984
959
  }
985
960
 
986
- mkRf(pob: Pob, model: ProtoModel, rule: Rule) {
961
+ mkRf(model: ProtoModel, rule: Rule) {
987
962
  const manager = this.manager;
988
963
  const context = this.context;
989
964
  const spacer = this.spacer;
990
- const children: ReachFact[] = [];
991
965
  const pathCons = [this.getTransition(rule)];
992
966
  const vars: number[] = [];
993
967
  this.getPredecessors(rule).forEach((predicate, index) => {
994
968
  const pt = context.getPredTransformer(predicate);
995
969
  const kid = pt.getUsedOriginRf(model, index);
996
- children.push(kid);
997
970
  pathCons.push(spacer.formulaN2o(kid.fact, index));
998
971
  for (const decl of pt.sig) vars.push(spacer.constOf(spacer.o2o(decl, index)));
999
972
  for (const variable of kid.auxVars)
@@ -1006,10 +979,7 @@ class PredTransformer {
1006
979
  if (context.params.getBool("spacer.reach_dnf", true))
1007
980
  result = mkAndOf(manager, computeImplicantLiterals(model, [result]));
1008
981
  result = this.mbp(vars, result, model, true);
1009
- const reachFact = new ReachFact(rule, result, isElimAux ? [] : auxVars);
1010
- reachFact.justifications.push(...children);
1011
- void pob;
1012
- return reachFact;
982
+ return new ReachFact(result, isElimAux ? [] : auxVars);
1013
983
  }
1014
984
 
1015
985
  isMdlRfConsistent(rule: Rule, model: ProtoModel) {
@@ -1066,9 +1036,8 @@ export class SpacerContext {
1066
1036
  queryPred = -1;
1067
1037
  query: PredTransformer | undefined;
1068
1038
  readonly pobQueue: PobQueue;
1069
- lastResult = L_UNDEF;
1070
- inductiveLevel = 0;
1071
1039
  expandedLevel = 0;
1040
+ private inductiveLevel = 0;
1072
1041
  private generalizers: LemmaGeneralizer[] = [];
1073
1042
  readonly isUsingCtp: boolean;
1074
1043
  readonly isUsingGroundPob: boolean;
@@ -1079,11 +1048,14 @@ export class SpacerContext {
1079
1048
  readonly maxLevel: number;
1080
1049
  readonly isPdrBfs: boolean;
1081
1050
 
1082
- constructor(
1083
- readonly datalogContext: DatalogContext,
1084
- readonly params: FpParams,
1085
- readonly manager: AstManager,
1086
- ) {
1051
+ readonly params: FpParams;
1052
+ readonly manager: AstManager;
1053
+
1054
+ constructor(readonly datalogContext: DatalogContext) {
1055
+ const params = datalogContext.params;
1056
+ const manager = datalogContext.manager;
1057
+ this.params = params;
1058
+ this.manager = manager;
1087
1059
  this.spacerManager = new SpacerManager(manager);
1088
1060
  this.normalizer = new SpacerNormalizer(manager);
1089
1061
  this.zkConsts = new ZkConsts(manager);
@@ -1120,18 +1092,23 @@ export class SpacerContext {
1120
1092
  }
1121
1093
 
1122
1094
  updateRules(rules: RuleSet) {
1123
- const rels = new Map<number, PredTransformer>();
1124
1095
  const manager = this.manager;
1125
- for (const predicate of rules.getHeadPredicates()) {
1096
+ // decl2rel and the grouped rules are tables that Z3 walks in slot order.
1097
+ const getHash = (decl: number) => manager.getDeclHash(decl);
1098
+ const heads = new ObjHashtable(getHash);
1099
+ for (const predicate of rules.getHeadPredicates()) heads.add(predicate);
1100
+ const table = new ObjMap<PredTransformer>(getHash);
1101
+ for (const predicate of heads) {
1126
1102
  const pt = new PredTransformer(this, predicate);
1127
- rels.set(predicate, pt);
1103
+ table.set(predicate, pt);
1128
1104
  pt.rules.push(...rules.getPredicateRules(predicate));
1129
1105
  }
1130
1106
  for (const rule of rules.rules)
1131
1107
  for (let index = 0; index < rule.uninterpretedSize; index++) {
1132
1108
  const predicate = rule.getTailDecl(manager, index);
1133
- if (!rels.has(predicate)) rels.set(predicate, new PredTransformer(this, predicate));
1109
+ if (!table.has(predicate)) table.set(predicate, new PredTransformer(this, predicate));
1134
1110
  }
1111
+ const rels = new Map(table);
1135
1112
  for (const [predicate, pt] of rels)
1136
1113
  for (const dependency of rules.deps.getDeps(predicate)) {
1137
1114
  const user = rels.get(dependency) as PredTransformer;
@@ -1141,14 +1118,11 @@ export class SpacerContext {
1141
1118
  for (const pt of rels.values()) pt.initRfs();
1142
1119
  this.rels = rels;
1143
1120
  this.query = undefined;
1144
- this.lastResult = L_UNDEF;
1145
- this.inductiveLevel = 0;
1146
1121
  this.generalizers = mkLemmaGeneralizers(this);
1147
1122
  }
1148
1123
 
1149
1124
  solve(fromLevel: number) {
1150
- this.lastResult = this.isUsingGpdr ? gpdrSolveCore(this) : this.solveCore(fromLevel);
1151
- return this.lastResult;
1125
+ return this.isUsingGpdr ? gpdrSolveCore(this) : this.solveCore(fromLevel);
1152
1126
  }
1153
1127
 
1154
1128
  private solveCore(fromLevel: number) {
@@ -1222,7 +1196,7 @@ export class SpacerContext {
1222
1196
  pob.level = saved;
1223
1197
  if (reach.result !== L_TRUE || !reach.isConcrete) return false;
1224
1198
  if (reach.rule !== undefined && reach.rule.uninterpretedSize > 0)
1225
- pob.pt.addRf(pob.pt.mkRf(pob, reach.model as ProtoModel, reach.rule));
1199
+ pob.pt.addRf(pob.pt.mkRf(reach.model as ProtoModel, reach.rule));
1226
1200
  const derivation = pob.derivation;
1227
1201
  pob.derivation = undefined;
1228
1202
  pob.close();
@@ -1273,7 +1247,7 @@ export class SpacerContext {
1273
1247
  if (reach.isConcrete) {
1274
1248
  const isRoot = this.pobQueue.isRoot(pob);
1275
1249
  if (reach.rule !== undefined && (reach.rule.uninterpretedSize > 0 || isRoot))
1276
- pob.pt.addRf(pob.pt.mkRf(pob, model, reach.rule), isRoot);
1250
+ pob.pt.addRf(pob.pt.mkRf(model, reach.rule), isRoot);
1277
1251
  const derivation = pob.derivation;
1278
1252
  pob.derivation = undefined;
1279
1253
  pob.close();
@@ -1335,12 +1309,49 @@ export class SpacerContext {
1335
1309
  isAllPropagated = pt.propagateToNextLevel(level) && isAllPropagated;
1336
1310
  if (!isAllPropagated) continue;
1337
1311
  for (const pt of this.rels.values()) pt.propagateToInfinity(level);
1338
- if (level <= maxLevel) {
1339
- this.inductiveLevel = level;
1340
- return true;
1312
+ if (level > maxLevel) return false;
1313
+ this.inductiveLevel = level;
1314
+ return true;
1315
+ }
1316
+ }
1317
+
1318
+ // context::get_model with get_level_property and inductive_property::to_model, before the
1319
+ // model converter.
1320
+ getModel() {
1321
+ const manager = this.manager;
1322
+ const model = new ProtoModel(manager);
1323
+ const rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
1324
+ for (const pt of this.rels.values()) {
1325
+ if (pt.head === this.queryPred) continue;
1326
+ const clauses = flattenAnd(manager, [
1327
+ this.spacerManager.formulaN2o(pt.getFormulas(this.inductiveLevel), 0),
1328
+ ]).map((clause) => {
1329
+ const disjuncts = new RefVector(manager);
1330
+ disjuncts.push(clause);
1331
+ flattenOrVector(manager, disjuncts);
1332
+ const fixed = pin(manager, rewriter.mkOr([...disjuncts.items]));
1333
+ disjuncts.reset();
1334
+ return fixed;
1335
+ });
1336
+ const replace = new ExprSafeReplace(manager);
1337
+ pt.sig.forEach((decl, index) =>
1338
+ replace.insert(
1339
+ this.spacerManager.constOf(decl),
1340
+ pin(manager, manager.mkVar(index, manager.funcDecls[decl].range)),
1341
+ ),
1342
+ );
1343
+ const property = replace.apply(pin(manager, rewriter.mkAnd(clauses)));
1344
+ replace.release();
1345
+ if (pt.sig.length === 0) model.registerConst(pt.head, property);
1346
+ else {
1347
+ const interp = new FuncInterp(manager, pt.sig.length);
1348
+ interp.setElse(property);
1349
+ model.registerFunc(pt.head, interp);
1341
1350
  }
1342
- return false;
1351
+ manager.decRef(property);
1343
1352
  }
1353
+ rewriter.release();
1354
+ return model;
1344
1355
  }
1345
1356
 
1346
1357
  createChildren(
@@ -1,7 +1,7 @@
1
- // Ported from Z3 (src/muz/spacer/spacer_dl_interface.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtUnsupportedError } from "../../../../errors";
3
2
  import { L_FALSE } from "../lbool";
4
- import type { DatalogContext, Engine } from "./dl-context";
3
+ import { ProtoModel } from "../proto-model";
4
+ import type { DatalogContext, Engine, ModelConverter } from "./dl-context";
5
5
  import { MkSlice } from "./dl-mk-slice";
6
6
  import { RuleSet } from "./dl-rule-set";
7
7
  import { applyDefaultTransformation, transformRules } from "./dl-rule-transformer";
@@ -10,6 +10,9 @@ import { SpacerContext } from "./spacer-context";
10
10
  // Each query gets a fresh spacer context, where Z3 keeps the lemmas of a previous query whose
11
11
  // rules subsume the new ones.
12
12
  export class SpacerDlInterface implements Engine {
13
+ private spacer: SpacerContext | undefined;
14
+ private modelConverters: readonly ModelConverter[] = [];
15
+
13
16
  constructor(private context: DatalogContext) {}
14
17
 
15
18
  query(query: number) {
@@ -28,14 +31,22 @@ export class SpacerDlInterface implements Engine {
28
31
  const spacerRules = new RuleSet(context);
29
32
  spacerRules.replaceRules(rules);
30
33
  spacerRules.close();
31
- context.recordTransformedRules();
32
34
  context.reopen();
33
35
  context.replaceRules(oldRules);
34
36
  context.manager.limit.checkpoint();
35
- const spacer = new SpacerContext(context, params, context.manager);
37
+ const spacer = new SpacerContext(context);
38
+ this.spacer = spacer;
39
+ this.modelConverters = context.modelConverters ?? [];
36
40
  spacer.setQuery(queryPred);
37
41
  spacer.updateRules(spacerRules);
38
42
  if (spacerRules.rules.length === 0) return L_FALSE;
39
43
  return spacer.solve(params.getUint("spacer.min_level", 0));
40
44
  }
45
+
46
+ getModel() {
47
+ return this.modelConverters.reduceRight(
48
+ (model, convert) => convert(model),
49
+ this.spacer?.getModel() ?? new ProtoModel(this.context.manager),
50
+ );
51
+ }
41
52
  }
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/muz/spacer/spacer_ind_lemma_generalizer.cpp,
2
- // src/muz/spacer/spacer_generalizers.cpp, src/muz/spacer/spacer_util.cpp), MIT license, see
3
- // z3-license.txt.
4
1
  import { MBQI_MAX_ITERATIONS } from "../context";
5
2
  import { SmtUnsupportedError } from "../../../../errors";
6
3
  import {
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/muz/spacer/spacer_manager.cpp, src/muz/spacer/spacer_sym_mux.cpp), MIT
2
- // license, see z3-license.txt.
3
1
  import { type AstManager, getSymbolName, KIND_APP } from "../ast";
4
2
  import { RewriterTpl } from "../rewriter-tpl";
5
3
  import { pin } from "./spacer-util";
@@ -126,8 +124,4 @@ export class SpacerManager {
126
124
  formulaN2o(expr: number, oIndex: number) {
127
125
  return this.shiftExpr(expr, 0, oIndex + 1);
128
126
  }
129
-
130
- formulaO2o(expr: number, sourceIndex: number, targetIndex: number) {
131
- return this.shiftExpr(expr, sourceIndex + 1, targetIndex + 1);
132
- }
133
127
  }
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/muz/spacer/spacer_pdr.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtUnsupportedError } from "../../../../errors";
3
2
  import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
4
3
  import { L_GAVE_UP, type Pob, type SpacerContext } from "./spacer-context";
@@ -158,9 +157,9 @@ class ModelSearch {
158
157
  }
159
158
  }
160
159
 
161
- // Z3 closes a node that reaches its premises but never closes the parents it completes, so the
162
- // root of a reachable query stays open and gpdr answers unreachable. The parents that all their
163
- // children close are closed here, up to the root.
160
+ // Deviation from Z3: gpdr_check_reachability closes only the node that reaches its premises
161
+ // (set_closed), so the root of a reachable query stays open and Z3 answers unreachable
162
+ // (spacer_pdr.cpp). The parents that all their children close are closed here, up to the root.
164
163
  const closeNode = (node: ModelNode, root: ModelNode) => {
165
164
  node.isClosed = true;
166
165
  for (let parent = node.parent; parent?.isOneClosed(); parent = parent.parent)
@@ -1,5 +1,4 @@
1
- // Ported from Z3 (src/muz/spacer/spacer_prop_solver.cpp, src/muz/spacer/spacer_iuc_solver.cpp),
2
- // MIT license, see z3-license.txt. Cores are subset cores: the port has no proofs to interpolate.
1
+ // Cores are subset cores: the port has no proofs to interpolate.
3
2
  import { MBQI_MAX_ITERATIONS } from "../context";
4
3
  import { type AstManager, KIND_APP, SORT_BOOL } from "../ast";
5
4
  import { flattenAndVector } from "../ast-util";
@@ -9,7 +8,7 @@ import { RandomGen } from "../random-gen";
9
8
  import { RefVector } from "../ref-vector";
10
9
  import { SmtKernel } from "../smt-kernel";
11
10
  import type { SpacerManager } from "./spacer-manager";
12
- import { INFTY_LEVEL, isInftyLevel, isFalseIn, pin } from "./spacer-util";
11
+ import { INFTY_LEVEL, isInftyLevel, pin } from "./spacer-util";
13
12
 
14
13
  class DefManager {
15
14
  readonly expr2proxy = new Map<number, number>();
@@ -186,9 +185,7 @@ export class PropSolver {
186
185
  private random: RandomGen;
187
186
  core: number[] | undefined;
188
187
  model: { value: ProtoModel | undefined } | undefined;
189
- isSubsetBasedCore = false;
190
188
  usesLevel = INFTY_LEVEL;
191
- isDeltaLevel = false;
192
189
  isInLevel = false;
193
190
  currentLevel = 0;
194
191
 
@@ -225,10 +222,8 @@ export class PropSolver {
225
222
  }
226
223
 
227
224
  private assertLevelAtoms(level: number) {
228
- for (let index = 0; index < this.levelPreds.length; index++) {
229
- const isActive = this.isDeltaLevel ? index === level : index >= level;
230
- this.context.pushBg(isActive ? this.negLevelAtoms[index] : this.posLevelAtoms[index]);
231
- }
225
+ for (let index = 0; index < this.levelPreds.length; index++)
226
+ this.context.pushBg(index >= level ? this.negLevelAtoms[index] : this.posLevelAtoms[index]);
232
227
  }
233
228
 
234
229
  assertExpr(form: number, level = INFTY_LEVEL) {
@@ -324,7 +319,6 @@ export class PropSolver {
324
319
  if (context.getNumBg() > numBg) context.popBg(context.getNumBg() - numBg);
325
320
  this.core = undefined;
326
321
  this.model = undefined;
327
- this.isSubsetBasedCore = false;
328
322
  return result;
329
323
  }
330
324
 
@@ -336,9 +330,4 @@ export class PropSolver {
336
330
  this.isInLevel = saved;
337
331
  return result;
338
332
  }
339
-
340
- isFalseInModel(expr: number) {
341
- const model = this.model?.value;
342
- return model !== undefined && isFalseIn(model, expr);
343
- }
344
333
  }
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/muz/spacer/spacer_util.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtUnsupportedError } from "../../../../errors";
3
2
  import {
4
3
  type AstManager,
@@ -16,14 +15,12 @@ import {
16
15
  FAMILY_BASIC,
17
16
  SORT_BOOL,
18
17
  } from "../ast";
19
- import { compareAsts } from "../ast-lt";
20
18
  import { flattenAndVector } from "../ast-util";
21
19
  import { pickEquality, MbpContext } from "../mbp/mbp-plugin";
22
20
  import type { ProtoModel } from "../proto-model";
23
21
  import { Mbproj } from "../qe-mbp";
24
22
  import { RefVector } from "../ref-vector";
25
23
  import { Rewriter, TACTIC_REWRITER_OPTIONS } from "../rewriter";
26
- import { getFreeVarSorts, VarSubst } from "../var-subst";
27
24
 
28
25
  export const INFTY_LEVEL = 0xffffffff;
29
26
 
@@ -55,8 +52,9 @@ export const flattenAnd = (manager: AstManager, exprs: readonly number[]) => {
55
52
  return result;
56
53
  };
57
54
 
55
+ // std::sort under ast_lt_proc, which orders by id.
58
56
  export const sortByAstLt = (manager: AstManager, exprs: number[]) =>
59
- exprs.sort((first, second) => compareAsts(manager, first, second));
57
+ exprs.sort((first, second) => manager.ids[first] - manager.ids[second]);
60
58
 
61
59
  export const isTrueIn = (model: ProtoModel, expr: number) =>
62
60
  model.manager.isTrue(model.eval(pin(model.manager, expr), false));
@@ -266,21 +264,8 @@ export const qeProject = (
266
264
  };
267
265
 
268
266
  export class ZkConsts {
269
- private consts = new Map<string, number>();
270
-
271
267
  constructor(private manager: AstManager) {}
272
268
 
273
- mk(index: number, sort: number) {
274
- const key = `${index}:${sort}`;
275
- const existing = this.consts.get(key);
276
- if (existing !== undefined) return existing;
277
- const manager = this.manager;
278
- const decl = manager.mkFuncDecl(`sk!${index}`, [], sort);
279
- const result = pin(manager, manager.mkApp(decl, [], sort));
280
- this.consts.set(key, result);
281
- return result;
282
- }
283
-
284
269
  has(expr: number) {
285
270
  const manager = this.manager;
286
271
  const visited = new Set<number>();
@@ -294,16 +279,4 @@ export class ZkConsts {
294
279
  }
295
280
  return false;
296
281
  }
297
-
298
- // ground_expr: replaces the free variables by skolem constants.
299
- ground(expr: number) {
300
- const manager = this.manager;
301
- const sorts = getFreeVarSorts(manager, expr, manager.freeVarBounds[expr]);
302
- if (sorts.length === 0) return expr;
303
- const consts = sorts.map((sort, index) => this.mk(index, sort ?? SORT_BOOL));
304
- const subst = new VarSubst(manager, false);
305
- const result = pin(manager, subst.apply(expr, consts));
306
- subst.release();
307
- return result;
308
- }
309
282
  }