tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +109 -10
  8. package/dist/index.d.ts +109 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,1406 @@
1
+ import { SmtTacticError, SmtUnsupportedError } from "../../../../errors";
2
+ import { type AstManager, getSymbolName, KIND_VAR, OP_AND, OP_IMPLIES, SORT_BOOL } from "../ast";
3
+ import { flattenOrVector, pushNotOwned } from "../ast-util";
4
+ import { ObjHashtable, ObjMap } from "../hashtable";
5
+ import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
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";
10
+ import { getFreeVarSorts, VarSubst } from "../var-subst";
11
+ import type { DatalogContext, FpParams } from "./dl-context";
12
+ import { blastTermIte } from "./dl-mk-elim-term-ite";
13
+ import type { Rule } from "./dl-rule";
14
+ import type { RuleSet } from "./dl-rule-set";
15
+ import { mkLemmaGeneralizers, type LemmaGeneralizer } from "./spacer-generalizers";
16
+ import { SpacerManager } from "./spacer-manager";
17
+ import { gpdrCreateSplitChildren, gpdrSolveCore } from "./spacer-pdr";
18
+ import { IucSolver, PropSolver } from "./spacer-prop-solver";
19
+ import {
20
+ computeImplicantLiterals,
21
+ flattenAnd,
22
+ INFTY_LEVEL,
23
+ isFalseIn,
24
+ isInftyLevel,
25
+ isTrueIn,
26
+ mkAndOf,
27
+ mkOrOf,
28
+ nextLevel,
29
+ pin,
30
+ prevLevel,
31
+ qeProject,
32
+ SpacerNormalizer,
33
+ sortByAstLt,
34
+ ZkConsts,
35
+ } from "./spacer-util";
36
+
37
+ export const L_GAVE_UP = 2;
38
+
39
+ class ReachFact {
40
+ tag = -1;
41
+
42
+ constructor(
43
+ readonly fact: number,
44
+ readonly auxVars: readonly number[],
45
+ readonly isInit = false,
46
+ ) {}
47
+ }
48
+
49
+ export class Lemma {
50
+ body = -1;
51
+ cube: number[] = [];
52
+ pob: Pob | undefined;
53
+ ctp: ProtoModel | undefined;
54
+ level: number;
55
+ bumped = 0;
56
+ weakness: number;
57
+ isBlocked = false;
58
+
59
+ constructor(
60
+ private context: SpacerContext,
61
+ level: number,
62
+ body = -1,
63
+ pob?: Pob,
64
+ ) {
65
+ this.level = level;
66
+ this.weakness = pob === undefined ? 65535 : pob.weakness;
67
+ this.pob = pob;
68
+ if (body !== -1) this.body = context.normalizer.normalize(body);
69
+ }
70
+
71
+ static fromCube(context: SpacerContext, pob: Pob, cube: readonly number[], level: number) {
72
+ const lemma = new Lemma(context, pob.level, -1, pob);
73
+ lemma.updateCube(pob, cube);
74
+ lemma.setLevel(level);
75
+ return lemma;
76
+ }
77
+
78
+ private get manager() {
79
+ return this.context.manager;
80
+ }
81
+
82
+ getExpr() {
83
+ if (this.body !== -1) return this.body;
84
+ const manager = this.manager;
85
+ const conj = mkAndOf(manager, this.getCube());
86
+ this.body = pushNotOwned(manager, this.context.normalizer.normalize(conj, false));
87
+ return this.body;
88
+ }
89
+
90
+ getCube() {
91
+ if (this.cube.length > 0) return this.cube;
92
+ const manager = this.manager;
93
+ const cube = this.pob !== undefined ? this.pob.post : pushNotOwned(manager, this.body);
94
+ this.cube = flattenAnd(manager, [cube]);
95
+ if (this.cube.length === 0) this.cube.push(manager.trueExpr);
96
+ else sortByAstLt(manager, this.cube);
97
+ return this.cube;
98
+ }
99
+
100
+ isFalse() {
101
+ const manager = this.manager;
102
+ if (this.cube.length === 1) return manager.isTrue(this.cube[0]);
103
+ if (this.body !== -1) return manager.isFalse(this.body);
104
+ if (this.pob !== undefined) return manager.isTrue(this.pob.post);
105
+ return false;
106
+ }
107
+
108
+ updateCube(pob: Pob | undefined, cube: readonly number[]) {
109
+ this.pob = pob;
110
+ this.cube = [...cube];
111
+ this.body = -1;
112
+ if (this.cube.length === 0) this.cube.push(this.manager.trueExpr);
113
+ if (cube.some((lit) => this.context.zkConsts.has(lit)))
114
+ throw new SmtUnsupportedError("quantified spacer lemmas");
115
+ }
116
+
117
+ setLevel(level: number) {
118
+ this.level = level;
119
+ }
120
+
121
+ isInductive() {
122
+ return isInftyLevel(this.level);
123
+ }
124
+
125
+ hasCtp() {
126
+ return !this.isInductive() && this.ctp !== undefined;
127
+ }
128
+ }
129
+
130
+ const isLemmaLess = (manager: AstManager, first: Lemma, second: Lemma) =>
131
+ first.level !== second.level
132
+ ? first.level < second.level
133
+ : manager.ids[first.getExpr()] < manager.ids[second.getExpr()];
134
+
135
+ export class Pob {
136
+ readonly id: number;
137
+ post = -1;
138
+ binding: number[] = [];
139
+ level: number;
140
+ depth: number;
141
+ isOpen = true;
142
+ isUsingFarkas = true;
143
+ isInQueue = false;
144
+ weakness = 0;
145
+ derivation: Derivation | undefined;
146
+ readonly kids: Pob[] = [];
147
+ readonly lemmas: Lemma[] = [];
148
+
149
+ constructor(
150
+ readonly parent: Pob | undefined,
151
+ readonly pt: PredTransformer,
152
+ level: number,
153
+ depth: number,
154
+ isAddingToParent = true,
155
+ ) {
156
+ this.id = pt.nextPobId++;
157
+ this.level = level;
158
+ this.depth = depth;
159
+ if (isAddingToParent && parent !== undefined) parent.kids.push(this);
160
+ }
161
+
162
+ setPost(post: number, binding: readonly number[] = []) {
163
+ this.post = this.pt.context.normalizer.normalize(post, false);
164
+ this.binding = [...binding];
165
+ }
166
+
167
+ inherit(other: Pob) {
168
+ this.binding = [...other.binding];
169
+ this.level = other.level;
170
+ this.depth = other.depth;
171
+ this.isOpen = other.isOpen;
172
+ this.isUsingFarkas = other.isUsingFarkas;
173
+ this.weakness = other.weakness;
174
+ this.derivation = undefined;
175
+ }
176
+
177
+ close() {
178
+ if (!this.isOpen) return;
179
+ this.derivation = undefined;
180
+ this.isOpen = false;
181
+ for (const kid of this.kids) kid.close();
182
+ }
183
+
184
+ isClosed() {
185
+ return !this.isOpen;
186
+ }
187
+
188
+ incLevel() {
189
+ this.level++;
190
+ this.depth++;
191
+ this.weakness = 0;
192
+ }
193
+ }
194
+
195
+ const isPobLess = (manager: AstManager, first: Pob, second: Pob) => {
196
+ if (first.level !== second.level) return first.level < second.level;
197
+ if (first.depth !== second.depth) return first.depth < second.depth;
198
+ const getSize = (post: number) => (manager.getOp(post) === OP_AND ? manager.getNumArgs(post) : 1);
199
+ if (getSize(first.post) !== getSize(second.post))
200
+ return getSize(first.post) < getSize(second.post);
201
+ if (first.post !== second.post) return manager.ids[first.post] < manager.ids[second.post];
202
+ const firstHead = manager.funcDecls[first.pt.head].smallId;
203
+ const secondHead = manager.funcDecls[second.pt.head].smallId;
204
+ return firstHead !== secondHead ? firstHead < secondHead : first.id < second.id;
205
+ };
206
+
207
+ // A binary heap by isPobLess, which orders the proof obligations totally and reads nothing that
208
+ // changes while they are queued.
209
+ class PobQueue {
210
+ root: Pob | undefined;
211
+ maxLevel = 0;
212
+ minDepth = 0;
213
+ private data: Pob[] = [];
214
+
215
+ constructor(private manager: AstManager) {}
216
+
217
+ top() {
218
+ if (this.data.length === 0) return undefined;
219
+ const top = this.data[0];
220
+ if (top.level > this.maxLevel) return undefined;
221
+ if (top.level === this.maxLevel && top.depth > this.minDepth) return undefined;
222
+ return top;
223
+ }
224
+
225
+ pop() {
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;
242
+ }
243
+
244
+ setRoot(root: Pob) {
245
+ this.root = root;
246
+ this.maxLevel = root.level;
247
+ this.minDepth = root.depth;
248
+ this.reset();
249
+ }
250
+
251
+ reset() {
252
+ for (const pob of this.data) pob.isInQueue = false;
253
+ this.data = [];
254
+ if (this.root === undefined) return;
255
+ this.root.isInQueue = true;
256
+ this.data.push(this.root);
257
+ }
258
+
259
+ push(pob: Pob) {
260
+ if (pob.isInQueue) return;
261
+ pob.isInQueue = true;
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;
272
+ }
273
+
274
+ incLevel() {
275
+ this.maxLevel++;
276
+ this.minDepth++;
277
+ if (this.root === undefined || this.data.length > 0) return;
278
+ this.root.isInQueue = true;
279
+ this.data.push(this.root);
280
+ }
281
+
282
+ isRoot(pob: Pob) {
283
+ return this.root === pob;
284
+ }
285
+ }
286
+
287
+ interface Premise {
288
+ pt: PredTransformer;
289
+ oIndex: number;
290
+ summary: number;
291
+ isMust: boolean;
292
+ oVars: number[];
293
+ }
294
+
295
+ class Derivation {
296
+ private premises: Premise[] = [];
297
+ private active = 0;
298
+
299
+ constructor(
300
+ readonly parent: Pob,
301
+ readonly rule: Rule,
302
+ private trans: number,
303
+ private evars: number[],
304
+ ) {}
305
+
306
+ private get pt() {
307
+ return this.parent.pt;
308
+ }
309
+
310
+ private getOVars(pt: PredTransformer, oIndex: number, auxVars: readonly number[] | undefined) {
311
+ const spacer = pt.context.spacerManager;
312
+ return [
313
+ ...pt.sig.map((decl) => spacer.constOf(spacer.o2o(decl, oIndex))),
314
+ ...(auxVars ?? []).map((variable) =>
315
+ spacer.constOf(spacer.n2o(pt.manager.decls[variable], oIndex)),
316
+ ),
317
+ ];
318
+ }
319
+
320
+ addPremise(
321
+ pt: PredTransformer,
322
+ oIndex: number,
323
+ summary: number,
324
+ isMust: boolean,
325
+ auxVars: readonly number[] | undefined,
326
+ ) {
327
+ this.premises.push({
328
+ pt,
329
+ oIndex,
330
+ summary,
331
+ isMust,
332
+ oVars: this.getOVars(pt, oIndex, auxVars),
333
+ });
334
+ }
335
+
336
+ createFirstChild(model: ProtoModel) {
337
+ if (this.premises.length === 0) return undefined;
338
+ this.active = 0;
339
+ return this.createNextChildWith(model);
340
+ }
341
+
342
+ private existSkolemize(fml: number, vars: readonly number[]) {
343
+ const manager = this.pt.manager;
344
+ if (vars.length === 0 || manager.isTrue(fml) || manager.isFalse(fml)) return;
345
+ throw new SmtUnsupportedError("existentially quantified spacer proof obligations");
346
+ }
347
+
348
+ private createNextChildWith(model: ProtoModel): Pob | undefined {
349
+ const manager = this.pt.manager;
350
+ const context = this.pt.context;
351
+ const summaries: number[] = [];
352
+ let vars: number[] = [];
353
+ while (this.active < this.premises.length && this.premises[this.active].isMust) {
354
+ summaries.push(this.premises[this.active].summary);
355
+ vars.push(...this.premises[this.active].oVars);
356
+ this.active++;
357
+ }
358
+ if (this.active >= this.premises.length) return undefined;
359
+ summaries.push(this.trans);
360
+ this.trans = mkAndOf(manager, summaries);
361
+ if (vars.length > 0) {
362
+ vars.push(...this.evars);
363
+ this.evars = [];
364
+ this.trans = this.pt.mbp(vars, this.trans, model, context.isUsingGroundPob);
365
+ this.evars.push(...vars);
366
+ vars = [];
367
+ }
368
+ if (!isTrueIn(model, this.premises[this.active].summary)) return undefined;
369
+ const rest: number[] = [];
370
+ for (let index = this.active + 1; index < this.premises.length; index++) {
371
+ rest.push(this.premises[index].summary);
372
+ vars.push(...this.premises[index].oVars);
373
+ }
374
+ rest.push(this.trans);
375
+ let post = mkAndOf(manager, rest);
376
+ vars.push(...this.evars);
377
+ if (vars.length > this.evars.length)
378
+ post = this.pt.mbp(vars, post, model, context.isUsingGroundPob);
379
+ if (vars.length > 0) this.existSkolemize(post, vars);
380
+ const premise = this.premises[this.active];
381
+ post = context.spacerManager.formulaO2n(post, premise.oIndex);
382
+ return premise.pt.mkPob(this.parent, prevLevel(this.parent.level), this.parent.depth, post);
383
+ }
384
+
385
+ createNextChild(): Pob | undefined {
386
+ if (this.active + 1 >= this.premises.length) return undefined;
387
+ const premise = this.premises[this.active];
388
+ const pt = premise.pt;
389
+ const context = pt.context;
390
+ const manager = pt.manager;
391
+ const spacer = context.spacerManager;
392
+ const summaries = this.premises.slice(this.active + 1).map((other) => other.summary);
393
+ const activeTrans = spacer.formulaO2n(this.trans, premise.oIndex);
394
+ summaries.push(activeTrans);
395
+ const model = pt.isMustReachable(mkAndOf(manager, summaries));
396
+ if (model === undefined) return undefined;
397
+ const reachFact = pt.getUsedRf(model);
398
+ const summary = mkAndOf(manager, computeImplicantLiterals(model, [reachFact.fact]));
399
+ premise.isMust = true;
400
+ premise.summary = spacer.formulaN2o(summary, premise.oIndex);
401
+ premise.oVars = this.getOVars(pt, premise.oIndex, reachFact.auxVars);
402
+ this.trans = mkAndOf(manager, [summary, activeTrans]);
403
+ const vars = [...reachFact.auxVars, ...pt.sig.map((decl) => spacer.constOf(spacer.o2n(decl)))];
404
+ if (vars.length > 0) {
405
+ vars.push(...this.evars);
406
+ this.evars = [];
407
+ this.trans = this.pt.mbp(vars, this.trans, model, context.isUsingGroundPob);
408
+ this.evars.push(...vars);
409
+ }
410
+ this.active++;
411
+ return this.createNextChildWith(model);
412
+ }
413
+ }
414
+
415
+ interface PtRule {
416
+ rule: Rule;
417
+ trans: number;
418
+ auxs: number[];
419
+ tag: number;
420
+ }
421
+
422
+ const isInitRule = (ptRule: PtRule) => ptRule.rule.uninterpretedSize === 0;
423
+
424
+ class PredTransformer {
425
+ readonly sig: number[] = [];
426
+ readonly uses: PredTransformer[] = [];
427
+ readonly ptRules = new Map<Rule, PtRule>();
428
+ readonly rules: Rule[] = [];
429
+ readonly solver: PropSolver;
430
+ private reachSolver: IucSolver;
431
+ private pobs = new Map<number, Pob[]>();
432
+ nextPobId = 0;
433
+ readonly lemmas: Lemma[] = [];
434
+ private frameSize = 0;
435
+ private isSorted = true;
436
+ readonly reachFacts: ReachFact[] = [];
437
+ private transitionClause: number[] = [];
438
+ private transition = -1;
439
+ private init = -1;
440
+ private extendLit: number;
441
+ private isAllInit = false;
442
+ readonly manager: AstManager;
443
+
444
+ constructor(
445
+ readonly context: SpacerContext,
446
+ readonly head: number,
447
+ ) {
448
+ const manager = context.manager;
449
+ this.manager = manager;
450
+ const spacer = context.spacerManager;
451
+ this.reachSolver = new IucSolver(manager, spacer);
452
+ this.solver = new PropSolver(
453
+ manager,
454
+ spacer,
455
+ this.getHeadName(),
456
+ context.params.getUint("spacer.random_seed", 0),
457
+ );
458
+ manager.funcDecls[head].domain.forEach((sort, index) => {
459
+ const decl = spacer.mkFuncDecl(`${this.getHeadName()}_${index}`, [], sort);
460
+ this.sig.push(spacer.getOPred(decl, 0));
461
+ });
462
+ const ext = spacer.mkFuncDecl(`${this.getHeadName()}_ext0`, [], SORT_BOOL);
463
+ this.extendLit = pin(manager, manager.mkNot(spacer.constOf(spacer.getNPred(ext))));
464
+ }
465
+
466
+ private getHeadName() {
467
+ return getSymbolName(this.manager.funcDecls[this.head].name);
468
+ }
469
+
470
+ private get spacer() {
471
+ return this.context.spacerManager;
472
+ }
473
+
474
+ getPredecessors(rule: Rule) {
475
+ return rule.tail.slice(0, rule.uninterpretedSize).map((atom) => this.manager.decls[atom]);
476
+ }
477
+
478
+ getTransition(rule: Rule) {
479
+ return (this.ptRules.get(rule) as PtRule).trans;
480
+ }
481
+
482
+ getAuxVars(rule: Rule) {
483
+ return (this.ptRules.get(rule) as PtRule).auxs;
484
+ }
485
+
486
+ ensureLevel(level: number) {
487
+ if (isInftyLevel(level)) return;
488
+ while (this.frameSize <= level) {
489
+ this.frameSize++;
490
+ this.solver.addLevel();
491
+ }
492
+ }
493
+
494
+ // The model of the state when it is reachable.
495
+ isMustReachable(state: number) {
496
+ const manager = this.manager;
497
+ if (this.reachFacts.length === 0) return undefined;
498
+ const solver = this.reachSolver;
499
+ solver.push();
500
+ solver.assertExpr(state);
501
+ solver.assertExpr(manager.mkNot(this.getLastRfTag()));
502
+ const result = solver.checkSat([]);
503
+ const model = result === L_TRUE ? solver.getModel() : undefined;
504
+ solver.pop(1);
505
+ return model;
506
+ }
507
+
508
+ getUsedRf(model: ProtoModel) {
509
+ for (const reachFact of this.reachFacts) if (isFalseIn(model, reachFact.tag)) return reachFact;
510
+ throw new SmtTacticError("spacer found no used reach fact");
511
+ }
512
+
513
+ getUsedOriginRf(model: ProtoModel, oIndex: number) {
514
+ for (const reachFact of this.reachFacts)
515
+ if (isFalseIn(model, this.spacer.formulaN2o(reachFact.tag, oIndex))) return reachFact;
516
+ throw new SmtTacticError("spacer found no used origin reach fact");
517
+ }
518
+
519
+ private getAllUsedRf(model: ProtoModel, oIndex: number) {
520
+ return this.reachFacts.filter((reachFact) =>
521
+ isFalseIn(
522
+ model,
523
+ oIndex === -1 ? reachFact.tag : this.spacer.formulaN2o(reachFact.tag, oIndex),
524
+ ),
525
+ );
526
+ }
527
+
528
+ findRuleOf(model: ProtoModel) {
529
+ for (const ptRule of this.ptRules.values())
530
+ if (this.manager.isTrue(model.eval(ptRule.tag, false))) return ptRule.rule;
531
+ return undefined;
532
+ }
533
+
534
+ findRule(model: ProtoModel) {
535
+ const manager = this.manager;
536
+ let rule: Rule | undefined;
537
+ let isConcrete = false;
538
+ let reachPredUsed: boolean[] = [];
539
+ for (const ptRule of this.ptRules.values()) {
540
+ if (!manager.isTrue(model.eval(ptRule.tag, false))) continue;
541
+ rule = ptRule.rule;
542
+ isConcrete = true;
543
+ reachPredUsed = [];
544
+ for (let index = 0; index < rule.uninterpretedSize; index++) {
545
+ const pt = this.context.getPredTransformer(rule.getTailDecl(manager, index));
546
+ let isUsed = false;
547
+ if (pt.reachFacts.length === 0) isConcrete = false;
548
+ else {
549
+ const tag = this.spacer.formulaN2o(pt.getLastRfTag(), index);
550
+ isUsed = manager.isFalse(model.eval(tag, false));
551
+ isConcrete = isConcrete && isUsed;
552
+ }
553
+ reachPredUsed.push(isUsed);
554
+ }
555
+ if (isConcrete) break;
556
+ }
557
+ if (rule === undefined) isConcrete = true;
558
+ return { rule, isConcrete, reachPredUsed };
559
+ }
560
+
561
+ getFormulas(level: number) {
562
+ return mkAndOf(
563
+ this.manager,
564
+ this.lemmas.filter((lemma) => lemma.level >= level).map((lemma) => lemma.getExpr()),
565
+ );
566
+ }
567
+
568
+ private addLemmaCore(lemma: Lemma) {
569
+ const level = lemma.level;
570
+ const expr = lemma.getExpr();
571
+ if (!isInftyLevel(level)) this.ensureLevel(level);
572
+ this.solver.assertExpr(expr, level);
573
+ for (const use of this.uses) use.addLemmaFromChild(this, lemma, nextLevel(level));
574
+ }
575
+
576
+ private addLemmaFromChild(child: PredTransformer, lemma: Lemma, level: number) {
577
+ this.ensureLevel(level);
578
+ for (const fml of this.mkAssumptions(child.head, lemma.getExpr()))
579
+ this.solver.assertExpr(fml, level);
580
+ }
581
+
582
+ addLemma(lemma: Lemma) {
583
+ const manager = this.manager;
584
+ for (let index = 0; index < this.lemmas.length; index++) {
585
+ const old = this.lemmas[index];
586
+ if (old.getExpr() !== lemma.getExpr()) continue;
587
+ if (lemma.pob !== undefined && !lemma.pob.lemmas.includes(old)) lemma.pob.lemmas.push(old);
588
+ if (old.level >= lemma.level) {
589
+ if (isInftyLevel(old.level)) {
590
+ old.bumped++;
591
+ if (old.bumped >= 100) throw new SmtTacticError("Stuck on a lemma");
592
+ }
593
+ return false;
594
+ }
595
+ old.setLevel(lemma.level);
596
+ this.addLemmaCore(old);
597
+ for (
598
+ let next = index;
599
+ next + 1 < this.lemmas.length &&
600
+ isLemmaLess(manager, this.lemmas[next + 1], this.lemmas[next]);
601
+ next++
602
+ )
603
+ [this.lemmas[next], this.lemmas[next + 1]] = [this.lemmas[next + 1], this.lemmas[next]];
604
+ return true;
605
+ }
606
+ this.lemmas.push(lemma);
607
+ this.isSorted = false;
608
+ this.addLemmaCore(lemma);
609
+ lemma.pob?.lemmas.push(lemma);
610
+ return true;
611
+ }
612
+
613
+ private sortLemmas() {
614
+ if (this.isSorted) return;
615
+ this.isSorted = true;
616
+ const manager = this.manager;
617
+ this.lemmas.sort((first, second) =>
618
+ isLemmaLess(manager, first, second) ? -1 : isLemmaLess(manager, second, first) ? 1 : 0,
619
+ );
620
+ }
621
+
622
+ propagateToInfinity(level: number) {
623
+ for (const lemma of this.lemmas)
624
+ if (lemma.level >= level && !isInftyLevel(lemma.level)) {
625
+ lemma.setLevel(INFTY_LEVEL);
626
+ this.addLemmaCore(lemma);
627
+ this.isSorted = false;
628
+ }
629
+ }
630
+
631
+ propagateToNextLevel(level: number) {
632
+ const manager = this.manager;
633
+ this.sortLemmas();
634
+ let isAll = true;
635
+ if (this.lemmas.length === 0) return isAll;
636
+ const targetLevel = nextLevel(level);
637
+ this.ensureLevel(targetLevel);
638
+ for (let index = 0; index < this.lemmas.length && this.lemmas[index].level <= level;) {
639
+ const lemma = this.lemmas[index];
640
+ if (lemma.level < level) {
641
+ index++;
642
+ continue;
643
+ }
644
+ const solverLevel = this.isInvariant(targetLevel, lemma);
645
+ if (solverLevel !== undefined) {
646
+ lemma.setLevel(solverLevel);
647
+ this.addLemmaCore(lemma);
648
+ for (
649
+ let next = index;
650
+ next + 1 < this.lemmas.length &&
651
+ isLemmaLess(manager, this.lemmas[next + 1], this.lemmas[next]);
652
+ next++
653
+ )
654
+ [this.lemmas[next], this.lemmas[next + 1]] = [this.lemmas[next + 1], this.lemmas[next]];
655
+ } else {
656
+ isAll = false;
657
+ index++;
658
+ }
659
+ }
660
+ return isAll;
661
+ }
662
+
663
+ private mkFreshRfTag() {
664
+ const spacer = this.spacer;
665
+ const decl = spacer.mkFuncDecl(
666
+ `${this.getHeadName()}#reach_tag_${this.reachFacts.length}`,
667
+ [],
668
+ SORT_BOOL,
669
+ );
670
+ return spacer.constOf(spacer.getNPred(decl));
671
+ }
672
+
673
+ addRf(reachFact: ReachFact | undefined, isForcing = false) {
674
+ const manager = this.manager;
675
+ if (reachFact === undefined) return;
676
+ if (!isForcing && this.reachFacts.some((other) => other.fact === reachFact.fact)) return;
677
+ const lastTag = this.reachFacts.length > 0 ? this.getLastRfTag() : -1;
678
+ reachFact.tag = reachFact.isInit
679
+ ? this.mkFreshRfTag()
680
+ : manager.getArg(this.extendInitial(reachFact.fact), 0);
681
+ this.reachFacts.push(reachFact);
682
+ const fml = mkOrOf(
683
+ manager,
684
+ lastTag === -1
685
+ ? [reachFact.fact, reachFact.tag]
686
+ : [manager.mkNot(lastTag), reachFact.fact, reachFact.tag],
687
+ );
688
+ this.reachSolver.assertExpr(fml);
689
+ const fakeLemma = new Lemma(this.context, INFTY_LEVEL, fml);
690
+ for (const use of this.uses) use.addLemmaFromChild(this, fakeLemma, INFTY_LEVEL);
691
+ }
692
+
693
+ getLastRfTag() {
694
+ return this.reachFacts[this.reachFacts.length - 1].tag;
695
+ }
696
+
697
+ getOriginSummary(model: ProtoModel, level: number, oIndex: number, isMust: boolean) {
698
+ const manager = this.manager;
699
+ let auxVars: readonly number[] | undefined;
700
+ let summary: number;
701
+ if (!isMust) summary = this.getFormulas(level);
702
+ else {
703
+ const reachFact = this.getUsedOriginRf(model, oIndex);
704
+ summary = reachFact.fact;
705
+ auxVars = reachFact.auxVars;
706
+ }
707
+ const conjs = flattenAnd(manager, [this.spacer.formulaN2o(summary, oIndex)]);
708
+ if (conjs.some((conj) => !isTrueIn(model, conj))) return undefined;
709
+ return { summary: mkAndOf(manager, computeImplicantLiterals(model, conjs)), auxVars };
710
+ }
711
+
712
+ mbp(vars: number[], fml: number, model: ProtoModel, isForcing: boolean) {
713
+ return qeProject(this.manager, vars, fml, model, !isForcing);
714
+ }
715
+
716
+ isReachable(pob: Pob, core: number[] | undefined, isWantingModel: boolean) {
717
+ const manager = this.manager;
718
+ const context = this.context;
719
+ this.ensureLevel(pob.level);
720
+ const solver = this.solver;
721
+ return solver.withLevel(pob.level, () => {
722
+ const modelHolder = isWantingModel
723
+ ? { value: undefined as ProtoModel | undefined }
724
+ : undefined;
725
+ solver.core = core;
726
+ solver.model = modelHolder;
727
+ const post = flattenAnd(manager, [pob.post]);
728
+ const reachAssumps: number[] = [];
729
+ if (pob.level > 0 && !this.isAllInit)
730
+ for (const ptRule of this.ptRules.values()) {
731
+ const predicates = this.getPredecessors(ptRule.rule);
732
+ for (let index = 0; index < predicates.length; index++) {
733
+ const pt = context.getPredTransformer(predicates[index]);
734
+ if (pt.reachFacts.length > 0)
735
+ reachAssumps.push(
736
+ pin(manager, manager.mkNot(this.spacer.formulaN2o(pt.getLastRfTag(), index))),
737
+ );
738
+ else {
739
+ reachAssumps.push(pin(manager, manager.mkNot(ptRule.tag)));
740
+ break;
741
+ }
742
+ }
743
+ }
744
+ const result = solver.checkAssumptions(post, reachAssumps, this.transitionClause, [
745
+ this.extendLit,
746
+ ]);
747
+ const model = modelHolder?.value;
748
+ if (result === L_TRUE || result === L_UNDEF) {
749
+ if (core !== undefined) core.length = 0;
750
+ const found = model === undefined ? undefined : this.findRule(model);
751
+ return {
752
+ result,
753
+ model,
754
+ rule: found?.rule,
755
+ isConcrete: found?.isConcrete ?? false,
756
+ reachPredUsed: found?.reachPredUsed ?? [],
757
+ usesLevel: INFTY_LEVEL,
758
+ };
759
+ }
760
+ return {
761
+ result,
762
+ model,
763
+ rule: undefined,
764
+ isConcrete: false,
765
+ reachPredUsed: [] as boolean[],
766
+ usesLevel: solver.usesLevel,
767
+ };
768
+ });
769
+ }
770
+
771
+ private isCtpBlocked(lemma: Lemma) {
772
+ if (!this.context.isUsingCtp || !lemma.hasCtp()) return false;
773
+ const ctp = lemma.ctp as ProtoModel;
774
+ const rule = this.findRuleOf(ctp);
775
+ if (rule === undefined) {
776
+ lemma.isBlocked = true;
777
+ return true;
778
+ }
779
+ const predicates = this.getPredecessors(rule);
780
+ for (let index = 0; index < predicates.length; index++) {
781
+ const pt = this.context.getPredTransformer(predicates[index]);
782
+ const lemmas = this.spacer.formulaN2o(pt.getFormulas(lemma.level), index);
783
+ if (isFalseIn(ctp, lemmas)) return false;
784
+ }
785
+ return true;
786
+ }
787
+
788
+ // The level the lemma is invariant at, or undefined.
789
+ isInvariant(level: number, lemma: Lemma) {
790
+ if (lemma.isBlocked || this.isCtpBlocked(lemma)) return undefined;
791
+ const manager = this.manager;
792
+ const candidate = flattenAnd(manager, [pushNotOwned(manager, lemma.getExpr())]);
793
+ const solver = this.solver;
794
+ return solver.withLevel(level, () => {
795
+ const modelHolder = this.context.isUsingCtp
796
+ ? { value: undefined as ProtoModel | undefined }
797
+ : undefined;
798
+ solver.core = undefined;
799
+ solver.model = modelHolder;
800
+ const result = solver.checkAssumptions(candidate, [], this.transitionClause, [
801
+ this.extendLit,
802
+ ]);
803
+ if (result === L_FALSE) {
804
+ lemma.ctp = undefined;
805
+ return solver.usesLevel;
806
+ }
807
+ if (result === L_TRUE && modelHolder?.value !== undefined) lemma.ctp = modelHolder.value;
808
+ else lemma.ctp = undefined;
809
+ return undefined;
810
+ });
811
+ }
812
+
813
+ // Shrinks the state to a core and returns the level it is inductive at, or undefined.
814
+ checkInductive(level: number, state: number[]) {
815
+ const manager = this.manager;
816
+ const conj = this.mkAssumptions(
817
+ this.head,
818
+ pin(manager, manager.mkNot(mkAndOf(manager, state))),
819
+ );
820
+ conj.push(this.extendLit);
821
+ const solver = this.solver;
822
+ return solver.withLevel(level, () => {
823
+ const core: number[] = [];
824
+ solver.core = core;
825
+ solver.model = undefined;
826
+ const result = solver.checkAssumptions(state, [], this.transitionClause, conj);
827
+ if (result !== L_FALSE) return undefined;
828
+ state.length = 0;
829
+ state.push(...core);
830
+ return solver.usesLevel;
831
+ });
832
+ }
833
+
834
+ private mkAssumptions(head: number, fml: number) {
835
+ const manager = this.manager;
836
+ const result: number[] = [];
837
+ for (const ptRule of this.ptRules.values())
838
+ this.getPredecessors(ptRule.rule).forEach((predicate, index) => {
839
+ if (predicate !== head) return;
840
+ const implication = manager.mkApp(OP_IMPLIES, [ptRule.tag, fml], SORT_BOOL);
841
+ result.push(pin(manager, this.spacer.formulaN2o(pin(manager, implication), index)));
842
+ });
843
+ return result;
844
+ }
845
+
846
+ initialize(pts: Map<number, PredTransformer>) {
847
+ const context = this.context;
848
+ this.init = this.manager.falseExpr;
849
+ this.transition = this.manager.trueExpr;
850
+ this.initRules(pts);
851
+ this.transition = context.simplify(this.transition);
852
+ this.init = context.simplify(this.init);
853
+ this.solver.assertExpr(this.transition);
854
+ this.solver.assertExpr(this.init, 0);
855
+ }
856
+
857
+ initRfs() {
858
+ for (const ptRule of this.ptRules.values())
859
+ if (isInitRule(ptRule)) this.addRf(new ReachFact(ptRule.trans, ptRule.auxs, true));
860
+ }
861
+
862
+ private initRules(pts: Map<number, PredTransformer>) {
863
+ const manager = this.manager;
864
+ for (const rule of this.rules) this.initRule(pts, rule);
865
+ const notInits: number[] = [];
866
+ if (this.ptRules.size === 0) {
867
+ this.transition = manager.falseExpr;
868
+ this.transitionClause = [];
869
+ } else {
870
+ const transitions: number[] = [];
871
+ this.transitionClause = [manager.getArg(this.extendLit, 0)];
872
+ let index = 0;
873
+ for (const ptRule of this.ptRules.values()) {
874
+ ptRule.tag = this.spacer.mkConst(`${this.getHeadName()}__tr${index}`, SORT_BOOL);
875
+ this.transitionClause.push(ptRule.tag);
876
+ transitions.push(manager.mkApp(OP_IMPLIES, [ptRule.tag, ptRule.trans], SORT_BOOL));
877
+ if (!isInitRule(ptRule)) notInits.push(manager.mkNot(ptRule.tag));
878
+ index++;
879
+ }
880
+ if (!this.context.params.getBool("spacer.use_inc_clause", true)) {
881
+ transitions.push(manager.mkOr(this.transitionClause));
882
+ this.transitionClause = [];
883
+ }
884
+ this.transition = mkAndOf(manager, transitions);
885
+ }
886
+ this.init = mkAndOf(manager, notInits);
887
+ if (notInits.length === 0) this.isAllInit = true;
888
+ }
889
+
890
+ private initRule(pts: Map<number, PredTransformer>, rule: Rule) {
891
+ const manager = this.manager;
892
+ const context = this.context;
893
+ const side: number[] = [];
894
+ const varReprs: number[] = [];
895
+ const auxVars: number[] = [];
896
+ this.initAtom(pts, rule.head, varReprs, side, -1);
897
+ for (let index = 0; index < rule.uninterpretedSize; index++) {
898
+ if (rule.isNegated[index])
899
+ throw new SmtTacticError("SPACER does not support negated predicates in rule tails");
900
+ this.initAtom(pts, rule.tail[index], varReprs, side, index);
901
+ }
902
+ let trans = mkAndOf(manager, rule.tail.slice(rule.uninterpretedSize));
903
+ getFreeVarSorts(manager, trans, manager.freeVarBounds[trans]).forEach((sort, index) => {
904
+ if (sort === undefined || (varReprs[index] ?? -1) !== -1) return;
905
+ const fresh = manager.mkFreshFuncDecl("aux", [], sort);
906
+ manager.incDeclRef(fresh);
907
+ const variable = this.spacer.constOf(this.spacer.getNPred(fresh));
908
+ while (varReprs.length <= index) varReprs.push(-1);
909
+ varReprs[index] = variable;
910
+ auxVars.push(variable);
911
+ });
912
+ const subst = new VarSubst(manager, false);
913
+ const substituted = pin(manager, subst.apply(trans, varReprs));
914
+ subst.release();
915
+ side.push(...flattenAnd(manager, [substituted]));
916
+ trans = context.simplify(mkAndOf(manager, side));
917
+ const inflation = context.params.getUint("spacer.blast_term_ite_inflation", 3);
918
+ if (inflation > 0) trans = context.simplify(blastTermIte(manager, trans, inflation));
919
+ if (rule.uninterpretedSize > 0 && !manager.isGroundApp(trans))
920
+ throw new SmtTacticError("spacer: quantifier in a recursive rule");
921
+ if (manager.isFalse(trans)) return;
922
+ if (!this.ptRules.has(rule)) this.ptRules.set(rule, { rule, trans, auxs: auxVars, tag: -1 });
923
+ }
924
+
925
+ private initAtom(
926
+ pts: Map<number, PredTransformer>,
927
+ atom: number,
928
+ varReprs: number[],
929
+ side: number[],
930
+ tailIndex: number,
931
+ ) {
932
+ const manager = this.manager;
933
+ const spacer = this.spacer;
934
+ const pt = pts.get(manager.decls[atom]) as PredTransformer;
935
+ manager.getArgs(atom).forEach((arg, index) => {
936
+ const rep = spacer.constOf(
937
+ tailIndex === -1 ? spacer.o2n(pt.sig[index]) : spacer.o2o(pt.sig[index], tailIndex),
938
+ );
939
+ if (manager.kinds[arg] !== KIND_VAR) {
940
+ side.push(pin(manager, manager.mkEq(rep, arg)));
941
+ return;
942
+ }
943
+ const varIndex = manager.values[arg];
944
+ while (varReprs.length <= varIndex) varReprs.push(-1);
945
+ if (varReprs[varIndex] !== -1) side.push(pin(manager, manager.mkEq(rep, varReprs[varIndex])));
946
+ else varReprs[varIndex] = rep;
947
+ });
948
+ }
949
+
950
+ private extendInitial(expr: number) {
951
+ const manager = this.manager;
952
+ const spacer = this.spacer;
953
+ const fresh = manager.mkFreshFuncDecl(`${this.getHeadName()}_ext`, [], SORT_BOOL);
954
+ manager.incDeclRef(fresh);
955
+ const variable = spacer.constOf(spacer.getNPred(fresh));
956
+ this.solver.assertExpr(mkOrOf(manager, [this.extendLit, expr, variable]));
957
+ this.extendLit = pin(manager, manager.mkNot(variable));
958
+ return this.extendLit;
959
+ }
960
+
961
+ mkRf(model: ProtoModel, rule: Rule) {
962
+ const manager = this.manager;
963
+ const context = this.context;
964
+ const spacer = this.spacer;
965
+ const pathCons = [this.getTransition(rule)];
966
+ const vars: number[] = [];
967
+ this.getPredecessors(rule).forEach((predicate, index) => {
968
+ const pt = context.getPredTransformer(predicate);
969
+ const kid = pt.getUsedOriginRf(model, index);
970
+ pathCons.push(spacer.formulaN2o(kid.fact, index));
971
+ for (const decl of pt.sig) vars.push(spacer.constOf(spacer.o2o(decl, index)));
972
+ for (const variable of kid.auxVars)
973
+ vars.push(spacer.constOf(spacer.n2o(manager.decls[variable], index)));
974
+ });
975
+ const auxVars = this.getAuxVars(rule);
976
+ const isElimAux = context.params.getBool("spacer.elim_aux", true);
977
+ if (isElimAux) vars.push(...auxVars);
978
+ let result = mkAndOf(manager, pathCons);
979
+ if (context.params.getBool("spacer.reach_dnf", true))
980
+ result = mkAndOf(manager, computeImplicantLiterals(model, [result]));
981
+ result = this.mbp(vars, result, model, true);
982
+ return new ReachFact(result, isElimAux ? [] : auxVars);
983
+ }
984
+
985
+ isMdlRfConsistent(rule: Rule, model: ProtoModel) {
986
+ const context = this.context;
987
+ const predicates = this.getPredecessors(rule);
988
+ for (let index = 0; index < predicates.length; index++) {
989
+ const pt = context.getPredTransformer(predicates[index]);
990
+ let isAnyTrue = false;
991
+ const used = pt.getAllUsedRf(model, index);
992
+ for (const reachFact of used) {
993
+ if (!isTrueIn(model, this.spacer.formulaN2o(reachFact.fact, index)))
994
+ model.registerConst(this.manager.decls[reachFact.tag], this.manager.trueExpr);
995
+ else isAnyTrue = true;
996
+ }
997
+ if (used.length > 0 && !isAnyTrue) return false;
998
+ }
999
+ return true;
1000
+ }
1001
+
1002
+ getAllUsedRfAll(model: ProtoModel) {
1003
+ return this.getAllUsedRf(model, -1);
1004
+ }
1005
+
1006
+ mkPob(
1007
+ parent: Pob | undefined,
1008
+ level: number,
1009
+ depth: number,
1010
+ post: number,
1011
+ binding: readonly number[] = [],
1012
+ ) {
1013
+ const probe = new Pob(parent, this, level, depth, false);
1014
+ probe.setPost(post, binding);
1015
+ const existing = this.pobs.get(probe.post);
1016
+ if (existing !== undefined)
1017
+ for (const pob of existing)
1018
+ if (pob.parent === parent && !pob.isInQueue) {
1019
+ pob.inherit(probe);
1020
+ return pob;
1021
+ }
1022
+ const pob = new Pob(parent, this, level, depth);
1023
+ pob.setPost(post, binding);
1024
+ const list = this.pobs.get(pob.post);
1025
+ if (list === undefined) this.pobs.set(pob.post, [pob]);
1026
+ else list.push(pob);
1027
+ return pob;
1028
+ }
1029
+ }
1030
+
1031
+ export class SpacerContext {
1032
+ readonly spacerManager: SpacerManager;
1033
+ readonly normalizer: SpacerNormalizer;
1034
+ readonly zkConsts: ZkConsts;
1035
+ rels = new Map<number, PredTransformer>();
1036
+ queryPred = -1;
1037
+ query: PredTransformer | undefined;
1038
+ readonly pobQueue: PobQueue;
1039
+ expandedLevel = 0;
1040
+ private inductiveLevel = 0;
1041
+ private generalizers: LemmaGeneralizer[] = [];
1042
+ readonly isUsingCtp: boolean;
1043
+ readonly isUsingGroundPob: boolean;
1044
+ readonly isUsingGpdr: boolean;
1045
+ private isResettingObligationQueue: boolean;
1046
+ private isUsingDerivations: boolean;
1047
+ private isUsingPropagate: boolean;
1048
+ readonly maxLevel: number;
1049
+ readonly isPdrBfs: boolean;
1050
+
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;
1059
+ this.spacerManager = new SpacerManager(manager);
1060
+ this.normalizer = new SpacerNormalizer(manager);
1061
+ this.zkConsts = new ZkConsts(manager);
1062
+ this.pobQueue = new PobQueue(manager);
1063
+ this.isUsingCtp = params.getBool("spacer.ctp", true);
1064
+ this.isUsingGpdr = params.getBool("spacer.gpdr", false);
1065
+ this.isUsingGroundPob = this.isUsingGpdr || params.getBool("spacer.ground_pobs", true);
1066
+ this.isResettingObligationQueue =
1067
+ !this.isUsingGpdr && params.getBool("spacer.reset_pob_queue", true);
1068
+ this.isUsingDerivations = !this.isUsingGpdr && params.getBool("spacer.use_derivations", true);
1069
+ this.isUsingPropagate = params.getBool("spacer.propagate", true);
1070
+ this.maxLevel = params.getUint("spacer.max_level", 0xffffffff);
1071
+ this.isPdrBfs = params.getBool("spacer.gpdr.bfs", true);
1072
+ if (params.getBool("spacer.push_pob", false) && !this.isUsingGpdr)
1073
+ throw new SmtUnsupportedError("spacer.push_pob");
1074
+ if (!params.getBool("spacer.ground_pobs", true) && !this.isUsingGpdr)
1075
+ throw new SmtUnsupportedError("spacer with spacer.ground_pobs=false");
1076
+ if (params.getUint("spacer.order_children", 0) !== 0)
1077
+ throw new SmtUnsupportedError("spacer.order_children");
1078
+ if (params.getBool("spacer.global", false) || params.getBool("spacer.q3.use_qgen", false))
1079
+ throw new SmtUnsupportedError("the global and quantified spacer generalizers");
1080
+ }
1081
+
1082
+ simplify(expr: number) {
1083
+ return this.datalogContext.simplify(expr);
1084
+ }
1085
+
1086
+ getPredTransformer(decl: number) {
1087
+ return this.rels.get(decl) as PredTransformer;
1088
+ }
1089
+
1090
+ setQuery(queryPred: number) {
1091
+ this.queryPred = queryPred;
1092
+ }
1093
+
1094
+ updateRules(rules: RuleSet) {
1095
+ const manager = this.manager;
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) {
1102
+ const pt = new PredTransformer(this, predicate);
1103
+ table.set(predicate, pt);
1104
+ pt.rules.push(...rules.getPredicateRules(predicate));
1105
+ }
1106
+ for (const rule of rules.rules)
1107
+ for (let index = 0; index < rule.uninterpretedSize; index++) {
1108
+ const predicate = rule.getTailDecl(manager, index);
1109
+ if (!table.has(predicate)) table.set(predicate, new PredTransformer(this, predicate));
1110
+ }
1111
+ const rels = new Map(table);
1112
+ for (const [predicate, pt] of rels)
1113
+ for (const dependency of rules.deps.getDeps(predicate)) {
1114
+ const user = rels.get(dependency) as PredTransformer;
1115
+ if (!user.uses.includes(pt)) user.uses.push(pt);
1116
+ }
1117
+ for (const pt of rels.values()) pt.initialize(rels);
1118
+ for (const pt of rels.values()) pt.initRfs();
1119
+ this.rels = rels;
1120
+ this.query = undefined;
1121
+ this.generalizers = mkLemmaGeneralizers(this);
1122
+ }
1123
+
1124
+ solve(fromLevel: number) {
1125
+ return this.isUsingGpdr ? gpdrSolveCore(this) : this.solveCore(fromLevel);
1126
+ }
1127
+
1128
+ private solveCore(fromLevel: number) {
1129
+ const manager = this.manager;
1130
+ this.query = this.rels.get(this.queryPred);
1131
+ if (this.query === undefined) return L_FALSE;
1132
+ let level = fromLevel;
1133
+ const root = this.query.mkPob(undefined, fromLevel, 0, manager.trueExpr);
1134
+ this.pobQueue.setRoot(root);
1135
+ for (let index = fromLevel; index < this.maxLevel; index++) {
1136
+ manager.limit.checkpoint();
1137
+ this.expandedLevel = INFTY_LEVEL;
1138
+ const reachable = this.checkReachability();
1139
+ if (reachable !== L_FALSE) return reachable;
1140
+ if (level > 0 && this.isUsingPropagate && this.propagate(this.expandedLevel, level))
1141
+ return L_FALSE;
1142
+ this.pobQueue.incLevel();
1143
+ level = this.pobQueue.maxLevel;
1144
+ }
1145
+ return L_UNDEF;
1146
+ }
1147
+
1148
+ // L_UNDEF when spacer gives up, where Z3 throws unknown_exception.
1149
+ private checkReachability() {
1150
+ const queue = this.pobQueue;
1151
+ let lastReachable: Pob | undefined;
1152
+ const newPobs: Pob[] = [];
1153
+ if (this.isResettingObligationQueue) queue.reset();
1154
+ while (queue.top() !== undefined) {
1155
+ this.manager.limit.checkpoint();
1156
+ while (lastReachable !== undefined) {
1157
+ const node: Pob = lastReachable;
1158
+ lastReachable = undefined;
1159
+ if (queue.isRoot(node)) return L_TRUE;
1160
+ const parent = node.parent as Pob;
1161
+ if (this.isReachablePob(parent)) {
1162
+ lastReachable = parent;
1163
+ parent.close();
1164
+ } else if (!parent.isClosed()) parent.weakness++;
1165
+ }
1166
+ while ((queue.top() as Pob).isClosed()) {
1167
+ const closed = queue.top() as Pob;
1168
+ queue.pop();
1169
+ if (queue.isRoot(closed)) return L_TRUE;
1170
+ }
1171
+ const node = queue.top() as Pob;
1172
+ queue.pop();
1173
+ switch (this.expandPob(node, newPobs)) {
1174
+ case L_TRUE:
1175
+ node.close();
1176
+ lastReachable = node;
1177
+ if (queue.isRoot(node)) return L_TRUE;
1178
+ break;
1179
+ case L_FALSE:
1180
+ if (queue.isRoot(node)) return L_FALSE;
1181
+ break;
1182
+ case L_GAVE_UP:
1183
+ return L_UNDEF;
1184
+ default:
1185
+ for (const pob of newPobs) queue.push(pob);
1186
+ }
1187
+ newPobs.length = 0;
1188
+ }
1189
+ throw new SmtTacticError("spacer ran out of proof obligations");
1190
+ }
1191
+
1192
+ private isReachablePob(pob: Pob): boolean {
1193
+ const saved = pob.level;
1194
+ pob.level = INFTY_LEVEL;
1195
+ const reach = pob.pt.isReachable(pob, undefined, true);
1196
+ pob.level = saved;
1197
+ if (reach.result !== L_TRUE || !reach.isConcrete) return false;
1198
+ if (reach.rule !== undefined && reach.rule.uninterpretedSize > 0)
1199
+ pob.pt.addRf(pob.pt.mkRf(reach.model as ProtoModel, reach.rule));
1200
+ const derivation = pob.derivation;
1201
+ pob.derivation = undefined;
1202
+ pob.close();
1203
+ const next = derivation?.createNextChild();
1204
+ if (next !== undefined) {
1205
+ next.derivation = derivation;
1206
+ if (this.pobQueue.top() === pob) this.pobQueue.pop();
1207
+ this.pobQueue.push(next);
1208
+ }
1209
+ return next !== undefined ? this.isReachablePob(next) : true;
1210
+ }
1211
+
1212
+ private isMdlRfConsistent(model: ProtoModel) {
1213
+ for (const pt of this.rels.values()) {
1214
+ let isAnyTrue = false;
1215
+ const used = pt.getAllUsedRfAll(model);
1216
+ for (const reachFact of used) {
1217
+ if (!isTrueIn(model, reachFact.fact))
1218
+ model.registerConst(this.manager.decls[reachFact.tag], this.manager.trueExpr);
1219
+ else isAnyTrue = true;
1220
+ }
1221
+ if (used.length > 0 && !isAnyTrue) return false;
1222
+ }
1223
+ return true;
1224
+ }
1225
+
1226
+ private handleUnknown(pob: Pob, rule: Rule | undefined, model: ProtoModel) {
1227
+ if (rule === undefined)
1228
+ return isTrueIn(model, pob.post) && this.isMdlRfConsistent(model) ? L_TRUE : L_UNDEF;
1229
+ return isTrueIn(model, pob.pt.getTransition(rule)) &&
1230
+ isTrueIn(model, pob.post) &&
1231
+ rule.uninterpretedSize === 0 &&
1232
+ pob.pt.isMdlRfConsistent(rule, model)
1233
+ ? L_TRUE
1234
+ : L_UNDEF;
1235
+ }
1236
+
1237
+ expandPob(pob: Pob, out: Pob[]): number {
1238
+ const cube: number[] = [];
1239
+ const reach = pob.pt.isReachable(pob, cube, true);
1240
+ let result = reach.result;
1241
+ if (result === L_UNDEF && reach.model !== undefined)
1242
+ result = this.handleUnknown(pob, reach.rule, reach.model);
1243
+ this.manager.limit.checkpoint();
1244
+ switch (result) {
1245
+ case L_TRUE: {
1246
+ const model = reach.model as ProtoModel;
1247
+ if (reach.isConcrete) {
1248
+ const isRoot = this.pobQueue.isRoot(pob);
1249
+ if (reach.rule !== undefined && (reach.rule.uninterpretedSize > 0 || isRoot))
1250
+ pob.pt.addRf(pob.pt.mkRf(model, reach.rule), isRoot);
1251
+ const derivation = pob.derivation;
1252
+ pob.derivation = undefined;
1253
+ pob.close();
1254
+ const next = derivation?.createNextChild();
1255
+ if (next !== undefined) {
1256
+ next.derivation = derivation;
1257
+ out.push(next);
1258
+ }
1259
+ return next !== undefined ? L_UNDEF : L_TRUE;
1260
+ }
1261
+ if (this.createChildren(pob, reach.rule as Rule, model, reach.reachPredUsed, out)) {
1262
+ out.push(pob);
1263
+ return L_UNDEF;
1264
+ }
1265
+ if (pob.weakness < 10) {
1266
+ pob.weakness++;
1267
+ return this.expandPob(pob, out);
1268
+ }
1269
+ return L_GAVE_UP;
1270
+ }
1271
+ case L_FALSE: {
1272
+ if (pob.level < this.expandedLevel) this.expandedLevel = pob.level;
1273
+ const lemma = Lemma.fromCube(this, pob, cube, reach.usesLevel);
1274
+ for (const generalizer of this.generalizers) {
1275
+ if (!pob.isUsingFarkas || lemma.isFalse()) break;
1276
+ this.manager.limit.checkpoint();
1277
+ generalizer(lemma);
1278
+ }
1279
+ pob.pt.addLemma(lemma);
1280
+ pob.incLevel();
1281
+ out.push(pob);
1282
+ return L_FALSE;
1283
+ }
1284
+ default: {
1285
+ if (pob.weakness < 10) {
1286
+ if (reach.rule !== undefined && reach.rule.uninterpretedSize > 0) {
1287
+ const reachPredUsed = reach.reachPredUsed.map(() => false);
1288
+ if (
1289
+ this.createChildren(pob, reach.rule, reach.model as ProtoModel, reachPredUsed, out)
1290
+ ) {
1291
+ out.push(pob);
1292
+ return L_UNDEF;
1293
+ }
1294
+ }
1295
+ pob.weakness++;
1296
+ return this.expandPob(pob, out);
1297
+ }
1298
+ return L_GAVE_UP;
1299
+ }
1300
+ }
1301
+ }
1302
+
1303
+ propagate(minLevel: number, maxLevel: number) {
1304
+ if (minLevel === INFTY_LEVEL) return false;
1305
+ for (let level = minLevel; ; level++) {
1306
+ this.manager.limit.checkpoint();
1307
+ let isAllPropagated = true;
1308
+ for (const pt of this.rels.values())
1309
+ isAllPropagated = pt.propagateToNextLevel(level) && isAllPropagated;
1310
+ if (!isAllPropagated) continue;
1311
+ for (const pt of this.rels.values()) pt.propagateToInfinity(level);
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);
1350
+ }
1351
+ manager.decRef(property);
1352
+ }
1353
+ rewriter.release();
1354
+ return model;
1355
+ }
1356
+
1357
+ createChildren(
1358
+ pob: Pob,
1359
+ rule: Rule,
1360
+ model: ProtoModel,
1361
+ reachPredUsed: readonly boolean[],
1362
+ out: Pob[],
1363
+ ) {
1364
+ const manager = this.manager;
1365
+ const spacer = this.spacerManager;
1366
+ const pt = pob.pt;
1367
+ const predicates = pt.getPredecessors(rule);
1368
+ let phi = mkAndOf(manager, computeImplicantLiterals(model, [pt.getTransition(rule), pob.post]));
1369
+ const vars = [
1370
+ ...pt.sig.map((decl) => spacer.constOf(spacer.o2n(decl))),
1371
+ ...pt.getAuxVars(rule),
1372
+ ];
1373
+ phi = pt.mbp(vars, phi, model, this.isUsingGroundPob);
1374
+ if (this.isUsingGpdr && predicates.length > 1) return gpdrCreateSplitChildren();
1375
+ const derivation = new Derivation(pob, rule, phi, vars);
1376
+ for (let index = 0; index < predicates.length; index++) {
1377
+ const premisePt = this.getPredTransformer(predicates[index]);
1378
+ const summary = premisePt.getOriginSummary(
1379
+ model,
1380
+ prevLevel(pob.level),
1381
+ index,
1382
+ reachPredUsed[index],
1383
+ );
1384
+ if (summary === undefined) return false;
1385
+ derivation.addPremise(
1386
+ premisePt,
1387
+ index,
1388
+ summary.summary,
1389
+ reachPredUsed[index],
1390
+ summary.auxVars,
1391
+ );
1392
+ }
1393
+ const kid = derivation.createFirstChild(model);
1394
+ if (kid === undefined) return false;
1395
+ kid.derivation = derivation;
1396
+ if (!this.isUsingDerivations) kid.derivation = undefined;
1397
+ if (
1398
+ this.params.getBool("spacer.weak_abs", true) &&
1399
+ !this.isUsingGpdr &&
1400
+ (!isTrueIn(model, pt.getTransition(rule)) || !isTrueIn(model, pob.post))
1401
+ )
1402
+ kid.derivation = undefined;
1403
+ out.push(kid);
1404
+ return true;
1405
+ }
1406
+ }