tla-ts 0.0.9 → 0.0.10-dev.06b481ee0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (631) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +48 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +122 -12
  8. package/dist/index.d.ts +122 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1156 -888
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +330 -659
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +263 -370
  51. package/src/errors.ts +107 -57
  52. package/src/evaluate.ts +898 -369
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +137 -22
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -322
  64. package/src/liveness.ts +230 -133
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +36 -60
  88. package/src/parallel.ts +64 -73
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +135 -40
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +299 -108
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +479 -0
  612. package/src/typescript/collections.ts +614 -0
  613. package/src/typescript/compile.ts +63 -0
  614. package/src/typescript/context.ts +94 -0
  615. package/src/typescript/emit.ts +121 -0
  616. package/src/typescript/expressions.ts +496 -0
  617. package/src/typescript/formula.ts +154 -0
  618. package/src/typescript/functions.ts +284 -0
  619. package/src/typescript/model.ts +162 -0
  620. package/src/typescript/names.ts +114 -0
  621. package/src/typescript/program.ts +48 -0
  622. package/src/typescript/properties.ts +139 -0
  623. package/src/typescript/scope.ts +112 -0
  624. package/src/typescript/steps.ts +167 -0
  625. package/src/typescript/types.ts +171 -0
  626. package/src/values.ts +945 -526
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,1046 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_ARITH,
4
+ FAMILY_BASIC,
5
+ FAMILY_BV,
6
+ KIND_VAR,
7
+ OP_ADD,
8
+ OP_AND,
9
+ OP_MUL,
10
+ OP_OR,
11
+ OP_XOR,
12
+ } from "../ast";
13
+ import { isAssociativeBvOp } from "../bv-decl-plugin";
14
+ import { hashU, mkMix } from "../hash";
15
+ import {
16
+ type CodeTree,
17
+ Compiler,
18
+ hasHash,
19
+ type Instruction,
20
+ type Joint,
21
+ JOINT_GROUND,
22
+ JOINT_NESTED,
23
+ JOINT_VAR,
24
+ type LabelHasher,
25
+ OP_BIND,
26
+ OP_CFILTER,
27
+ OP_CHECK,
28
+ OP_CHOOSE,
29
+ OP_COMPARE,
30
+ OP_CONTINUE,
31
+ OP_FILTER,
32
+ OP_GET_CGR,
33
+ OP_GET_ENODE,
34
+ OP_INIT,
35
+ OP_INITAC,
36
+ OP_IS_CGR,
37
+ OP_NOOP,
38
+ OP_PFILTER,
39
+ OP_YIELD,
40
+ } from "../mam-compiler";
41
+ import { type Egraph, type Enode, getClass } from "./egraph";
42
+ import type { TrailStack } from "./th-solver";
43
+
44
+ // euf::mam_solver: the solver whose trail undoes the matcher.
45
+ interface MamSolver {
46
+ readonly manager: AstManager;
47
+ readonly egraph: Egraph;
48
+ readonly trail: TrailStack;
49
+ }
50
+
51
+ export type OnBinding = (
52
+ quantifier: number,
53
+ pattern: number,
54
+ bindings: readonly Enode[],
55
+ maxGeneration: number,
56
+ ) => void;
57
+
58
+ const isAcDecl = (manager: AstManager, decl: number) => {
59
+ const info = manager.funcDecls[decl];
60
+ if (info.family === FAMILY_BASIC)
61
+ return info.op === OP_AND || info.op === OP_OR || info.op === OP_XOR;
62
+ if (info.family === FAMILY_ARITH) return info.op === OP_ADD || info.op === OP_MUL;
63
+ return info.family === FAMILY_BV && isAssociativeBvOp(info.op);
64
+ };
65
+
66
+ interface BacktrackPoint {
67
+ instr: Instruction<Enode>;
68
+ oldMaxGeneration: number;
69
+ currGeneration: number;
70
+ curr: Enode | null;
71
+ candidates: readonly Enode[];
72
+ index: number;
73
+ }
74
+
75
+ const MAX_FILTERED_GET_CGR_ARGS = 6;
76
+
77
+ class Interpreter {
78
+ private registers: Enode[] = [];
79
+ private bindings: Enode[] = [];
80
+ private backtrackStack: BacktrackPoint[] = [];
81
+ private top = 0;
82
+ private maxGeneration = 0;
83
+ private currMaxGeneration = 0;
84
+ private acArgs: Enode[] = [];
85
+ private acBitset: boolean[] = [];
86
+ private acPatArg: number[] = [];
87
+
88
+ constructor(
89
+ private ctx: MamSolver,
90
+ private onBinding: OnBinding,
91
+ ) {}
92
+
93
+ private pushPoint(instr: Instruction<Enode>, oldMaxGeneration: number) {
94
+ let point = this.backtrackStack[this.top];
95
+ if (point === undefined) {
96
+ point = {
97
+ instr,
98
+ oldMaxGeneration,
99
+ currGeneration: 0,
100
+ curr: null,
101
+ candidates: [],
102
+ index: 0,
103
+ };
104
+ this.backtrackStack.push(point);
105
+ }
106
+ point.instr = instr;
107
+ point.oldMaxGeneration = oldMaxGeneration;
108
+ this.top++;
109
+ return point;
110
+ }
111
+
112
+ private updateMaxGeneration(node: Enode) {
113
+ this.maxGeneration = Math.max(this.maxGeneration, node.generation);
114
+ }
115
+
116
+ private getFirstFApp(label: number, numArgs: number, first: Enode) {
117
+ let matchingCgr: Enode | null = null;
118
+ let minGenMatch: Enode | null = null;
119
+ for (const curr of getClass(first)) {
120
+ if (curr.decl !== label || curr.numArgs !== numArgs) continue;
121
+ if (curr.isCgr && matchingCgr === null) matchingCgr = curr;
122
+ if (minGenMatch === null || minGenMatch.generation > curr.generation) minGenMatch = curr;
123
+ }
124
+ if (matchingCgr !== null) this.updateMaxGeneration(minGenMatch as Enode);
125
+ return matchingCgr;
126
+ }
127
+
128
+ private getNextFApp(label: number, numArgs: number, first: Enode, start: Enode) {
129
+ for (let curr = start.next; curr !== first; curr = curr.next)
130
+ if (curr.decl === label && curr.numArgs === numArgs && curr.isCgr) return curr;
131
+ return null;
132
+ }
133
+
134
+ private isCgr(instr: Instruction<Enode>) {
135
+ const numArgs = instr.numArgs;
136
+ const args = instr.regs.map((reg) => this.registers[reg].root);
137
+ const first = this.registers[instr.reg];
138
+ for (const node of getClass(first)) {
139
+ if (node.decl !== instr.label || (numArgs > 2 && node.numArgs !== numArgs)) continue;
140
+ if (args.every((arg, index) => node.getArg(index).root === arg)) {
141
+ this.updateMaxGeneration(node);
142
+ return true;
143
+ }
144
+ }
145
+ return false;
146
+ }
147
+
148
+ private isRelevantParent(parent: Enode, decl: number, argIndex: number, child: Enode) {
149
+ return (
150
+ parent.decl === decl &&
151
+ argIndex < parent.numArgs &&
152
+ parent.isRelevant &&
153
+ parent.isCgr &&
154
+ parent.getArg(argIndex).root === child
155
+ );
156
+ }
157
+
158
+ private getDepth1Vector(node: Enode, decl: number, argIndex: number, limit: number) {
159
+ const root = node.root;
160
+ const result: Enode[] = [];
161
+ for (const parent of root.parents) {
162
+ if (!this.isRelevantParent(parent, decl, argIndex, root)) continue;
163
+ if (result.length + 1 >= limit) return null;
164
+ result.push(parent);
165
+ }
166
+ return result;
167
+ }
168
+
169
+ private getDepth2Vector(joint: Joint<Enode>, decl: number, argIndex: number, limit: number) {
170
+ const root = this.registers[joint.reg].root;
171
+ if (root.parents.length === 0) return null;
172
+ const result: Enode[] = [];
173
+ for (const parent of root.parents) {
174
+ if (!this.isRelevantParent(parent, joint.decl, joint.argPos, root)) continue;
175
+ const parentRoot = parent.root;
176
+ for (const grandparent of parentRoot.parents) {
177
+ if (!this.isRelevantParent(grandparent, decl, argIndex, parentRoot)) continue;
178
+ if (result.length + 1 >= limit) return null;
179
+ result.push(grandparent);
180
+ }
181
+ }
182
+ return result;
183
+ }
184
+
185
+ private getJointNode(joint: Joint<Enode>) {
186
+ if (joint.kind === JOINT_GROUND) return joint.enode;
187
+ if (joint.kind === JOINT_VAR) return this.registers[joint.reg];
188
+ return null;
189
+ }
190
+
191
+ private initContinue(instr: Instruction<Enode>) {
192
+ const label = instr.label;
193
+ const all = this.ctx.egraph.enodesOf(label);
194
+ for (const joint of instr.joints) {
195
+ const node = this.getJointNode(joint);
196
+ if (node === null) continue;
197
+ const root = node.root;
198
+ if ((root.plbls & instr.lblLow) === 0 && (root.plblsHigh & instr.lblHigh) === 0) return null;
199
+ if (root.parents.length === 0) return null;
200
+ }
201
+ let best: Enode[] | null = null;
202
+ for (let argIndex = 0; argIndex < instr.joints.length; argIndex++) {
203
+ const joint = instr.joints[argIndex];
204
+ const node = this.getJointNode(joint);
205
+ const limit: number = best === null ? all.length : Math.min(all.length, best.length);
206
+ const current =
207
+ node !== null
208
+ ? this.getDepth1Vector(node, label, argIndex, limit)
209
+ : joint.kind === JOINT_NESTED
210
+ ? this.getDepth2Vector(joint, label, argIndex, limit)
211
+ : null;
212
+ if (
213
+ current === null ||
214
+ current.length >= all.length ||
215
+ (best !== null && current.length >= best.length)
216
+ )
217
+ continue;
218
+ if (current.length === 0) return null;
219
+ best = current;
220
+ }
221
+ const candidates = best ?? all;
222
+ let index = 0;
223
+ while (index < candidates.length) {
224
+ const node = candidates[index];
225
+ if (node.numArgs === instr.numArgs && node.isRelevant) break;
226
+ index++;
227
+ }
228
+ if (index === candidates.length) return null;
229
+ const point = this.pushPoint(instr, this.maxGeneration);
230
+ point.candidates = candidates;
231
+ point.index = index;
232
+ this.updateMaxGeneration(candidates[index]);
233
+ return candidates[index];
234
+ }
235
+
236
+ private setArgs(oreg: number, node: Enode, numArgs: number) {
237
+ for (let index = 0; index < numArgs; index++) this.registers[oreg + index] = node.getArg(index);
238
+ }
239
+
240
+ private initAc(instr: Instruction<Enode>) {
241
+ const app = this.registers[0];
242
+ const acArgs = this.acArgs;
243
+ acArgs.length = 0;
244
+ acArgs.push(app);
245
+ const manager = this.ctx.manager;
246
+ for (let index = 0; index < acArgs.length; index++) {
247
+ const arg = acArgs[index];
248
+ if (!manager.isApp(arg.owner) || arg.decl !== app.decl) continue;
249
+ acArgs.push(...arg.args);
250
+ acArgs[index] = acArgs[acArgs.length - 1];
251
+ acArgs.pop();
252
+ index--;
253
+ }
254
+ const numPatArgs = instr.numArgs;
255
+ if (numPatArgs > acArgs.length) return false;
256
+ this.acBitset = acArgs.map(() => false);
257
+ this.acPatArg = acArgs.map(() => 0);
258
+ this.pushPoint(instr, this.currMaxGeneration);
259
+ for (let index = 0; index < numPatArgs; index++) {
260
+ this.acPatArg[index] = index;
261
+ this.acBitset[index] = true;
262
+ this.registers[index + 1] = acArgs[index];
263
+ }
264
+ return true;
265
+ }
266
+
267
+ private nextAcMatch(numArgs: number) {
268
+ const acArgs = this.acArgs;
269
+ const bitset = this.acBitset;
270
+ const patArg = this.acPatArg;
271
+ for (let index = numArgs; index-- > 0;) {
272
+ let next = patArg[index];
273
+ bitset[next] = false;
274
+ for (;;) {
275
+ next++;
276
+ while (next < acArgs.length && bitset[next]) next++;
277
+ if (next === acArgs.length) break;
278
+ this.registers[index + 1] = acArgs[next];
279
+ bitset[next] = true;
280
+ patArg[index] = next;
281
+ let isFilled = true;
282
+ for (let later = index + 1; later < numArgs; later++) {
283
+ const free = bitset.indexOf(false);
284
+ if (free === -1) {
285
+ for (let undone = later - 1; undone >= index; undone--) bitset[patArg[undone]] = false;
286
+ isFilled = false;
287
+ break;
288
+ }
289
+ this.registers[later + 1] = acArgs[free];
290
+ bitset[free] = true;
291
+ patArg[later] = free;
292
+ }
293
+ if (isFilled) return true;
294
+ next = patArg[index];
295
+ }
296
+ }
297
+ return false;
298
+ }
299
+
300
+ private resume(point: BacktrackPoint): Instruction<Enode> | null {
301
+ const instr = point.instr;
302
+ switch (instr.op) {
303
+ case OP_CHOOSE:
304
+ this.top--;
305
+ return instr.alt;
306
+ case OP_BIND: {
307
+ const node = this.getNextFApp(
308
+ instr.label,
309
+ instr.numArgs,
310
+ this.registers[instr.reg],
311
+ point.curr as Enode,
312
+ );
313
+ if (node === null) {
314
+ this.top--;
315
+ return null;
316
+ }
317
+ point.curr = node;
318
+ this.maxGeneration = point.currGeneration;
319
+ this.setArgs(instr.oreg, node, instr.numArgs);
320
+ return instr.next;
321
+ }
322
+ case OP_INITAC:
323
+ if (this.nextAcMatch(instr.numArgs)) return instr.next;
324
+ this.top--;
325
+ return null;
326
+ default:
327
+ for (point.index++; point.index < point.candidates.length; point.index++) {
328
+ const node = point.candidates[point.index];
329
+ if (node.numArgs === instr.numArgs && node.isRelevant) {
330
+ this.updateMaxGeneration(node);
331
+ this.setArgs(instr.oreg, node, instr.numArgs);
332
+ return instr.next;
333
+ }
334
+ }
335
+ this.top--;
336
+ return null;
337
+ }
338
+ }
339
+
340
+ executeCore(tree: CodeTree<Enode>, node: Enode) {
341
+ const manager = this.ctx.manager;
342
+ const egraph = this.ctx.egraph;
343
+ const registers = this.registers;
344
+ if (!node.isRelevant) return false;
345
+ this.maxGeneration = node.generation;
346
+ registers[0] = node;
347
+ this.top = 0;
348
+ let pc: Instruction<Enode> | null = tree.root;
349
+ for (;;) {
350
+ if (pc === null) {
351
+ if (this.top === 0) return true;
352
+ const point = this.backtrackStack[this.top - 1];
353
+ this.maxGeneration = point.oldMaxGeneration;
354
+ pc = this.resume(point);
355
+ continue;
356
+ }
357
+ const instr: Instruction<Enode> = pc;
358
+ pc = null;
359
+ switch (instr.op) {
360
+ case OP_INIT: {
361
+ const first = registers[0];
362
+ if (first.numArgs !== instr.numArgs) break;
363
+ this.setArgs(1, first, instr.numArgs);
364
+ pc = instr.next;
365
+ break;
366
+ }
367
+ case OP_INITAC:
368
+ if (this.initAc(instr)) pc = instr.next;
369
+ break;
370
+ case OP_COMPARE:
371
+ if (registers[instr.reg].root === registers[instr.reg2].root) pc = instr.next;
372
+ break;
373
+ case OP_CHECK:
374
+ if (registers[instr.reg].root === (instr.enode as Enode).root) pc = instr.next;
375
+ break;
376
+ case OP_CFILTER:
377
+ case OP_FILTER:
378
+ case OP_PFILTER: {
379
+ const root = registers[instr.reg].root;
380
+ const isParent = instr.op === OP_PFILTER;
381
+ const low = isParent ? root.plbls : root.lbls;
382
+ const high = isParent ? root.plblsHigh : root.lblsHigh;
383
+ if ((low & instr.lblLow) !== 0 || (high & instr.lblHigh) !== 0) pc = instr.next;
384
+ break;
385
+ }
386
+ case OP_CHOOSE:
387
+ this.pushPoint(instr, this.maxGeneration);
388
+ pc = instr.next;
389
+ break;
390
+ case OP_NOOP:
391
+ pc = instr.next;
392
+ break;
393
+ case OP_BIND: {
394
+ this.currMaxGeneration = this.maxGeneration;
395
+ const found = this.getFirstFApp(instr.label, instr.numArgs, registers[instr.reg]);
396
+ if (found === null) break;
397
+ const point = this.pushPoint(instr, this.currMaxGeneration);
398
+ point.curr = found;
399
+ point.currGeneration = this.maxGeneration;
400
+ this.setArgs(instr.oreg, found, instr.numArgs);
401
+ pc = instr.next;
402
+ break;
403
+ }
404
+ case OP_YIELD: {
405
+ const numBindings = instr.regs.length;
406
+ const bindings = this.bindings;
407
+ bindings.length = 0;
408
+ for (let index = 0; index < numBindings; index++)
409
+ bindings.push(registers[instr.regs[numBindings - index - 1]]);
410
+ for (const binding of bindings)
411
+ this.maxGeneration = Math.max(this.maxGeneration, binding.generation);
412
+ if (!manager.limit.inc()) return false;
413
+ this.onBinding(instr.quantifier, instr.pattern, bindings, this.maxGeneration);
414
+ break;
415
+ }
416
+ case OP_GET_ENODE:
417
+ registers[instr.oreg] = instr.enode as Enode;
418
+ pc = instr.next;
419
+ break;
420
+ case OP_GET_CGR: {
421
+ const args = instr.regs.map((reg) => registers[reg]);
422
+ if (
423
+ instr.numArgs <= MAX_FILTERED_GET_CGR_ARGS &&
424
+ args.some(
425
+ (arg) =>
426
+ (arg.root.plbls & instr.lblLow) === 0 && (arg.root.plblsHigh & instr.lblHigh) === 0,
427
+ )
428
+ )
429
+ break;
430
+ const found = egraph.findCongruent(instr.label, args);
431
+ if (found === undefined || !found.isRelevant) break;
432
+ this.updateMaxGeneration(found);
433
+ registers[instr.oreg] = found;
434
+ pc = instr.next;
435
+ break;
436
+ }
437
+ case OP_IS_CGR:
438
+ if (this.isCgr(instr)) pc = instr.next;
439
+ break;
440
+ case OP_CONTINUE: {
441
+ const found = this.initContinue(instr);
442
+ if (found === null) break;
443
+ this.setArgs(instr.oreg, found, instr.numArgs);
444
+ pc = instr.next;
445
+ break;
446
+ }
447
+ }
448
+ }
449
+ }
450
+
451
+ execute(tree: CodeTree<Enode>) {
452
+ if (tree.qhead >= tree.candidates.length) return;
453
+ const qhead = tree.qhead;
454
+ this.ctx.trail.push(() => {
455
+ tree.qhead = qhead;
456
+ });
457
+ const start = tree.qhead;
458
+ const isFiltering = tree.isFilteringCandidates;
459
+ while (tree.qhead < tree.candidates.length) {
460
+ const app = tree.candidates[tree.qhead++];
461
+ if (isFiltering ? !app.isMarked3 && app.isCgr : app.isCgr) {
462
+ this.executeCore(tree, app);
463
+ if (isFiltering) app.isMarked3 = true;
464
+ }
465
+ }
466
+ if (!isFiltering) return;
467
+ for (let index = tree.candidates.length; index-- > start;)
468
+ tree.candidates[index].isMarked3 = false;
469
+ }
470
+ }
471
+
472
+ interface Path {
473
+ label: number;
474
+ argIndex: number;
475
+ groundArgIndex: number;
476
+ groundArg: Enode | null;
477
+ patternIndex: number;
478
+ child: Path | null;
479
+ }
480
+
481
+ interface PathTree {
482
+ label: number;
483
+ argIndex: number;
484
+ groundArgIndex: number;
485
+ groundArg: Enode | null;
486
+ filter: number;
487
+ filterHigh: number;
488
+ code: CodeTree<Enode> | null;
489
+ firstChild: PathTree | null;
490
+ sibling: PathTree | null;
491
+ todo: Enode[] | null;
492
+ }
493
+
494
+ const isEqualPath = (first: Path, second: Path): boolean => {
495
+ let left = first;
496
+ let right = second;
497
+ for (;;) {
498
+ if (
499
+ left.label !== right.label ||
500
+ left.argIndex !== right.argIndex ||
501
+ left.patternIndex !== right.patternIndex ||
502
+ (left.child === null) !== (right.child === null)
503
+ )
504
+ return false;
505
+ if (left.child === null || right.child === null) return true;
506
+ left = left.child;
507
+ right = right.child;
508
+ }
509
+ };
510
+
511
+ interface MultiPattern {
512
+ quantifier: number;
513
+ pattern: number;
514
+ patterns: number[];
515
+ }
516
+
517
+ // euf::mam::ground_subterms: the maximal ground applications of an expression.
518
+ export const getGroundSubterms = (manager: AstManager, expr: number) => {
519
+ const ground: number[] = [];
520
+ if (!manager.isApp(expr)) return ground;
521
+ const seen = new Set<number>();
522
+ const todo = [expr];
523
+ for (let node = todo.pop(); node !== undefined; node = todo.pop()) {
524
+ if (seen.has(node)) continue;
525
+ seen.add(node);
526
+ if (manager.isGroundApp(node)) ground.push(node);
527
+ else
528
+ for (let index = 0; index < manager.getNumArgs(node); index++) {
529
+ const arg = manager.getArg(node, index);
530
+ if (manager.isApp(arg)) todo.push(arg);
531
+ }
532
+ }
533
+ return ground;
534
+ };
535
+
536
+ export class Mam implements LabelHasher<Enode> {
537
+ private trees = new Map<number, CodeTree<Enode>>();
538
+ private toMatch: CodeTree<Enode>[] = [];
539
+ private toMatchHead = 0;
540
+ private newPatterns: MultiPattern[] = [];
541
+ private newPatternsHead = 0;
542
+ private pc = new Map<number, PathTree>();
543
+ private pp = new Map<number, (PathTree | null)[]>();
544
+ private plbls = new Set<number>();
545
+ private clbls = new Set<number>();
546
+ private root: Enode | null = null;
547
+ private other: Enode | null = null;
548
+ private visitedParents: Enode[] = [];
549
+ private queuedRoots: Enode[] = [];
550
+ private labelHashes: (number | undefined)[] = [];
551
+ private compiler: Compiler<Enode>;
552
+ private interpreter: Interpreter;
553
+
554
+ constructor(
555
+ private ctx: MamSolver,
556
+ onBinding: OnBinding,
557
+ ) {
558
+ const manager = ctx.manager;
559
+ this.compiler = new Compiler<Enode>(
560
+ { manager, pushTrail: (undo) => ctx.trail.push(undo) },
561
+ this,
562
+ (decl) => isAcDecl(manager, decl),
563
+ );
564
+ this.interpreter = new Interpreter(ctx, onBinding);
565
+ }
566
+
567
+ private get manager() {
568
+ return this.ctx.manager;
569
+ }
570
+
571
+ private pushTrail(undo: () => void) {
572
+ this.ctx.trail.push(undo);
573
+ }
574
+
575
+ getLabelHash(decl: number) {
576
+ const cached = this.labelHashes[decl];
577
+ if (cached !== undefined) return cached;
578
+ const hash = mkMix(17, 3, this.manager.funcDecls[decl].smallId) & 63;
579
+ this.labelHashes[decl] = hash;
580
+ return hash;
581
+ }
582
+
583
+ getLblHash(node: Enode) {
584
+ if (node.lblHash === -1)
585
+ this.ctx.egraph.setLblHash(node, hashU(this.manager.ids[node.owner]) & 63);
586
+ return node.lblHash;
587
+ }
588
+
589
+ getGroundEnode(expr: number) {
590
+ return this.ctx.egraph.find(expr) ?? null;
591
+ }
592
+
593
+ private setLbls(root: Enode, isParent: boolean, hash: number) {
594
+ const low = isParent ? root.plbls : root.lbls;
595
+ const high = isParent ? root.plblsHigh : root.lblsHigh;
596
+ if (hasHash(low, high, hash)) return;
597
+ this.pushTrail(() => {
598
+ if (isParent) {
599
+ root.plbls = low;
600
+ root.plblsHigh = high;
601
+ } else {
602
+ root.lbls = low;
603
+ root.lblsHigh = high;
604
+ }
605
+ });
606
+ const bit = 1 << hash;
607
+ if (isParent && hash < 32) root.plbls |= bit;
608
+ else if (isParent) root.plblsHigh |= bit;
609
+ else if (hash < 32) root.lbls |= bit;
610
+ else root.lblsHigh |= bit;
611
+ }
612
+
613
+ private updateChildrenPlbls(node: Enode, hash: number) {
614
+ for (const arg of node.args) this.setLbls(arg.root, true, hash);
615
+ }
616
+
617
+ private updatePlbls(decl: number) {
618
+ if (this.plbls.has(decl)) return;
619
+ this.plbls.add(decl);
620
+ this.pushTrail(() => this.plbls.delete(decl));
621
+ const hash = this.getLabelHash(decl);
622
+ for (const node of this.ctx.egraph.enodesOf(decl))
623
+ if (node.isRelevant) this.updateChildrenPlbls(node, hash);
624
+ }
625
+
626
+ private updateClbls(decl: number) {
627
+ if (this.clbls.has(decl)) return;
628
+ this.clbls.add(decl);
629
+ this.pushTrail(() => this.clbls.delete(decl));
630
+ const hash = this.getLabelHash(decl);
631
+ for (const node of this.ctx.egraph.enodesOf(decl))
632
+ if (node.isRelevant) this.setLbls(node.root, false, hash);
633
+ }
634
+
635
+ private mkPathTree(path: Path, mp: MultiPattern): PathTree {
636
+ const hash = this.getLabelHash(path.label);
637
+ const tree: PathTree = {
638
+ label: path.label,
639
+ argIndex: path.argIndex,
640
+ groundArgIndex: path.groundArgIndex,
641
+ groundArg: path.groundArg,
642
+ filter: hash < 32 ? 1 << hash : 0,
643
+ filterHigh: hash < 32 ? 0 : 1 << hash,
644
+ code: null,
645
+ firstChild: null,
646
+ sibling: null,
647
+ todo: null,
648
+ };
649
+ if (path.child === null)
650
+ tree.code = this.compiler.mkTree(
651
+ mp.quantifier,
652
+ mp.patterns,
653
+ path.patternIndex,
654
+ true,
655
+ mp.pattern,
656
+ );
657
+ else tree.firstChild = this.mkPathTree(path.child, mp);
658
+ return tree;
659
+ }
660
+
661
+ private insertPath(head: PathTree, path: Path, mp: MultiPattern) {
662
+ let isLabelFound = false;
663
+ let last = head;
664
+ for (let tree: PathTree | null = head; tree !== null; tree = tree.sibling) {
665
+ last = tree;
666
+ if (tree.label !== path.label) continue;
667
+ isLabelFound = true;
668
+ if (
669
+ tree.argIndex !== path.argIndex ||
670
+ tree.groundArg !== path.groundArg ||
671
+ tree.groundArgIndex !== path.groundArgIndex
672
+ )
673
+ continue;
674
+ const found = tree;
675
+ if (path.child !== null && found.firstChild !== null)
676
+ this.insertPath(found.firstChild, path.child, mp);
677
+ else if (path.child !== null) {
678
+ found.firstChild = this.mkPathTree(path.child, mp);
679
+ this.pushTrail(() => {
680
+ found.firstChild = null;
681
+ });
682
+ } else if (found.code !== null)
683
+ this.compiler.insert(
684
+ found.code,
685
+ mp.quantifier,
686
+ mp.patterns,
687
+ path.patternIndex,
688
+ false,
689
+ mp.pattern,
690
+ );
691
+ else {
692
+ found.code = this.compiler.mkTree(
693
+ mp.quantifier,
694
+ mp.patterns,
695
+ path.patternIndex,
696
+ true,
697
+ mp.pattern,
698
+ );
699
+ this.pushTrail(() => {
700
+ found.code = null;
701
+ });
702
+ }
703
+ return;
704
+ }
705
+ const previous = last;
706
+ previous.sibling = this.mkPathTree(path, mp);
707
+ this.pushTrail(() => {
708
+ previous.sibling = null;
709
+ });
710
+ if (isLabelFound) return;
711
+ const low = head.filter;
712
+ const high = head.filterHigh;
713
+ this.pushTrail(() => {
714
+ head.filter = low;
715
+ head.filterHigh = high;
716
+ });
717
+ const hash = this.getLabelHash(path.label);
718
+ if (hash < 32) head.filter |= 1 << hash;
719
+ else head.filterHigh |= 1 << hash;
720
+ }
721
+
722
+ private updatePc(firstHash: number, secondHash: number, path: Path, mp: MultiPattern) {
723
+ const key = firstHash * 64 + secondHash;
724
+ const existing = this.pc.get(key);
725
+ if (existing !== undefined) {
726
+ this.insertPath(existing, path, mp);
727
+ return;
728
+ }
729
+ this.pc.set(key, this.mkPathTree(path, mp));
730
+ this.pushTrail(() => this.pc.delete(key));
731
+ }
732
+
733
+ private updatePp(
734
+ inputFirstHash: number,
735
+ inputSecondHash: number,
736
+ inputFirst: Path,
737
+ inputSecond: Path,
738
+ mp: MultiPattern,
739
+ ) {
740
+ if (inputFirstHash === inputSecondHash) {
741
+ const key = inputFirstHash * 65;
742
+ const entry = this.pp.get(key);
743
+ if (entry !== undefined) {
744
+ this.insertPath(entry[0] as PathTree, inputFirst, mp);
745
+ if (!isEqualPath(inputFirst, inputSecond))
746
+ this.insertPath(entry[0] as PathTree, inputSecond, mp);
747
+ return;
748
+ }
749
+ const tree = this.mkPathTree(inputFirst, mp);
750
+ this.pp.set(key, [tree, null]);
751
+ this.pushTrail(() => this.pp.delete(key));
752
+ this.insertPath(tree, inputSecond, mp);
753
+ return;
754
+ }
755
+ const isSwapped = inputFirstHash > inputSecondHash;
756
+ const firstHash = isSwapped ? inputSecondHash : inputFirstHash;
757
+ const secondHash = isSwapped ? inputFirstHash : inputSecondHash;
758
+ const first = isSwapped ? inputSecond : inputFirst;
759
+ const second = isSwapped ? inputFirst : inputSecond;
760
+ const key = firstHash * 64 + secondHash;
761
+ const entry = this.pp.get(key);
762
+ if (entry !== undefined) {
763
+ this.insertPath(entry[0] as PathTree, first, mp);
764
+ this.insertPath(entry[1] as PathTree, second, mp);
765
+ return;
766
+ }
767
+ this.pp.set(key, [this.mkPathTree(first, mp), this.mkPathTree(second, mp)]);
768
+ this.pushTrail(() => this.pp.delete(key));
769
+ }
770
+
771
+ private updateFilters(
772
+ pattern: number,
773
+ parentPath: Path | null,
774
+ patternIndex: number,
775
+ varPaths: Path[][],
776
+ mp: MultiPattern,
777
+ ) {
778
+ const manager = this.manager;
779
+ const numArgs = manager.getNumArgs(pattern);
780
+ let groundArgIndex = 0;
781
+ let groundArg: Enode | null = null;
782
+ for (let index = 0; index < numArgs; index++)
783
+ if (manager.isGroundApp(manager.getArg(pattern, index))) {
784
+ groundArgIndex = index;
785
+ groundArg = this.getGroundEnode(manager.getArg(pattern, index));
786
+ break;
787
+ }
788
+ const label = manager.decls[pattern];
789
+ for (let index = 0; index < numArgs; index++) {
790
+ const child = manager.getArg(pattern, index);
791
+ const path: Path = {
792
+ label,
793
+ argIndex: index,
794
+ groundArgIndex,
795
+ groundArg,
796
+ patternIndex,
797
+ child: parentPath,
798
+ };
799
+ if (manager.kinds[child] === KIND_VAR) {
800
+ const varIndex = manager.values[child];
801
+ if (varIndex >= varPaths.length) continue;
802
+ const paths = varPaths[varIndex];
803
+ let isFound = false;
804
+ for (const existing of paths) {
805
+ if (isEqualPath(path, existing)) isFound = true;
806
+ this.updatePlbls(existing.label);
807
+ this.updatePlbls(path.label);
808
+ this.updatePp(
809
+ this.getLabelHash(existing.label),
810
+ this.getLabelHash(path.label),
811
+ existing,
812
+ path,
813
+ mp,
814
+ );
815
+ }
816
+ if (!isFound) paths.push(path);
817
+ continue;
818
+ }
819
+ if (manager.isGroundApp(child)) {
820
+ const node = this.getGroundEnode(child);
821
+ if (node === null) continue;
822
+ this.updatePlbls(label);
823
+ this.updatePc(this.getLabelHash(label), this.getLblHash(node), path, mp);
824
+ continue;
825
+ }
826
+ const childLabel = manager.decls[child];
827
+ this.updatePlbls(label);
828
+ this.updateClbls(childLabel);
829
+ this.updatePc(this.getLabelHash(label), this.getLabelHash(childLabel), path, mp);
830
+ this.updateFilters(child, path, patternIndex, varPaths, mp);
831
+ }
832
+ }
833
+
834
+ addPattern(quantifier: number, pattern: number) {
835
+ const manager = this.manager;
836
+ const patterns = manager.getArgs(pattern);
837
+ if (patterns.every((arg) => manager.isGroundApp(arg))) return;
838
+ if (patterns.some((arg) => manager.hasQuantifierFlags[arg])) return;
839
+ const mp: MultiPattern = { quantifier, pattern, patterns };
840
+ const numDecls = manager.getQuantifier(quantifier).sorts.length;
841
+ const varPaths: Path[][] = Array.from({ length: numDecls }, () => []);
842
+ patterns.forEach((arg, index) => this.updateFilters(arg, null, index, varPaths, mp));
843
+ this.newPatterns.push(mp);
844
+ this.pushTrail(() => this.newPatterns.pop());
845
+ patterns.forEach((arg, firstIndex) => {
846
+ if (manager.isGroundApp(arg)) return;
847
+ const label = manager.decls[arg];
848
+ const tree = this.trees.get(label);
849
+ if (tree !== undefined) {
850
+ this.compiler.insert(tree, quantifier, patterns, firstIndex, false, pattern);
851
+ return;
852
+ }
853
+ this.trees.set(label, this.compiler.mkTree(quantifier, patterns, firstIndex, false, pattern));
854
+ this.pushTrail(() => this.trees.delete(label));
855
+ });
856
+ }
857
+
858
+ private addCandidateTo(tree: CodeTree<Enode>, node: Enode) {
859
+ if (tree.qhead >= tree.candidates.length) {
860
+ this.toMatch.push(tree);
861
+ this.pushTrail(() => this.toMatch.pop());
862
+ }
863
+ tree.candidates.push(node);
864
+ this.pushTrail(() => tree.candidates.pop());
865
+ }
866
+
867
+ addNode(node: Enode, isLazy: boolean) {
868
+ if (node.lblHash !== -1) this.setLbls(node.root, false, node.lblHash);
869
+ if (node.numArgs === 0) return;
870
+ const hash = this.getLabelHash(node.decl);
871
+ if (this.clbls.has(node.decl)) this.setLbls(node.root, false, hash);
872
+ if (this.plbls.has(node.decl)) this.updateChildrenPlbls(node, hash);
873
+ const tree = this.trees.get(node.decl);
874
+ if (!isLazy && tree !== undefined) this.addCandidateTo(tree, node);
875
+ }
876
+
877
+ private isEqModMerge(first: Enode, second: Enode) {
878
+ const firstRoot = first.root;
879
+ const secondRoot = second.root;
880
+ return (
881
+ firstRoot === secondRoot ||
882
+ (firstRoot === this.other && secondRoot === this.root) ||
883
+ (firstRoot === this.root && secondRoot === this.other)
884
+ );
885
+ }
886
+
887
+ private collectParents(start: Enode, head: PathTree | null | undefined) {
888
+ if (head === null || head === undefined) return;
889
+ const levels: PathTree[] = [head];
890
+ const visitedParents = this.visitedParents;
891
+ const queuedRoots = this.queuedRoots;
892
+ head.todo = [start];
893
+ for (let index = 0; index < levels.length; index++) {
894
+ const level = levels[index];
895
+ const nodes = level.todo ?? [];
896
+ level.todo = null;
897
+ const filter = level.filter;
898
+ const filterHigh = level.filterHigh;
899
+ for (const node of nodes) {
900
+ const child = node.root;
901
+ if ((child.plbls & filter) === 0 && (child.plblsHigh & filterHigh) === 0) continue;
902
+ for (const parent of child.parents) {
903
+ if (parent.isEquality) continue;
904
+ const label = parent.decl;
905
+ const parentRoot = parent.root;
906
+ if (
907
+ !hasHash(filter, filterHigh, this.getLabelHash(label)) ||
908
+ parent.isMarked1 ||
909
+ (parent.cg !== parent && this.isEqModMerge(parent.cg, parentRoot)) ||
910
+ !parent.isRelevant
911
+ )
912
+ continue;
913
+ for (let tree: PathTree | null = level; tree !== null; tree = tree.sibling) {
914
+ if (
915
+ tree.label !== label ||
916
+ tree.argIndex >= parent.numArgs ||
917
+ parent.getArg(tree.argIndex).root !== child ||
918
+ tree.groundArgIndex >= parent.numArgs ||
919
+ (tree.groundArg !== null &&
920
+ !this.isEqModMerge(tree.groundArg, parent.getArg(tree.groundArgIndex)))
921
+ )
922
+ continue;
923
+ if (tree.code !== null) this.addCandidateTo(tree.code, parent);
924
+ const next = tree.firstChild;
925
+ if (next === null) continue;
926
+ if (next.todo === null) {
927
+ next.todo = [];
928
+ levels.push(next);
929
+ }
930
+ if (!parentRoot.isMarked2) next.todo.push(parentRoot);
931
+ }
932
+ parent.isMarked1 = true;
933
+ visitedParents.push(parent);
934
+ if (!parentRoot.isMarked2) {
935
+ parentRoot.isMarked2 = true;
936
+ queuedRoots.push(parentRoot);
937
+ }
938
+ }
939
+ }
940
+ for (const parent of visitedParents) parent.isMarked1 = false;
941
+ for (const root of queuedRoots) root.isMarked2 = false;
942
+ visitedParents.length = 0;
943
+ queuedRoots.length = 0;
944
+ }
945
+ }
946
+
947
+ private processPc(r1: Enode, r2: Enode) {
948
+ if ((r1.plbls === 0 && r1.plblsHigh === 0) || (r2.lbls === 0 && r2.lblsHigh === 0)) return;
949
+ for (let parentHash = 0; parentHash < 64; parentHash++) {
950
+ if (!hasHash(r1.plbls, r1.plblsHigh, parentHash)) continue;
951
+ if (!this.manager.limit.inc()) return;
952
+ for (let childHash = 0; childHash < 64; childHash++)
953
+ if (hasHash(r2.lbls, r2.lblsHigh, childHash))
954
+ this.collectParents(r1, this.pc.get(parentHash * 64 + childHash));
955
+ }
956
+ }
957
+
958
+ private processPp(r1: Enode, r2: Enode) {
959
+ if ((r1.plbls === 0 && r1.plblsHigh === 0) || (r2.plbls === 0 && r2.plblsHigh === 0)) return;
960
+ for (let firstHash = 0; firstHash < 64; firstHash++) {
961
+ if (!hasHash(r1.plbls, r1.plblsHigh, firstHash)) continue;
962
+ if (!this.manager.limit.inc()) return;
963
+ for (let secondHash = 0; secondHash < 64; secondHash++) {
964
+ if (!hasHash(r2.plbls, r2.plblsHigh, secondHash)) continue;
965
+ const isSwapped = firstHash > secondHash;
966
+ const lowHash = isSwapped ? secondHash : firstHash;
967
+ const highHash = isSwapped ? firstHash : secondHash;
968
+ const lowRoot = isSwapped ? r2 : r1;
969
+ const highRoot = isSwapped ? r1 : r2;
970
+ const entry = this.pp.get(lowHash * 64 + highHash);
971
+ if (entry === undefined) continue;
972
+ if (lowHash === highHash) {
973
+ if (lowRoot.parents.length <= highRoot.parents.length)
974
+ this.collectParents(lowRoot, entry[0]);
975
+ else this.collectParents(highRoot, entry[0]);
976
+ } else if (lowRoot.parents.length <= highRoot.parents.length)
977
+ this.collectParents(lowRoot, entry[0]);
978
+ else this.collectParents(highRoot, entry[1]);
979
+ }
980
+ }
981
+ }
982
+
983
+ onMerge(root: Enode, other: Enode) {
984
+ this.other = other;
985
+ this.root = root;
986
+ this.processPc(other, root);
987
+ this.processPc(root, other);
988
+ this.processPp(other, root);
989
+ this.other = null;
990
+ this.root = null;
991
+ const lbls = root.lbls;
992
+ const lblsHigh = root.lblsHigh;
993
+ const plbls = root.plbls;
994
+ const plblsHigh = root.plblsHigh;
995
+ this.pushTrail(() => {
996
+ root.lbls = lbls;
997
+ root.lblsHigh = lblsHigh;
998
+ });
999
+ this.pushTrail(() => {
1000
+ root.plbls = plbls;
1001
+ root.plblsHigh = plblsHigh;
1002
+ });
1003
+ root.lbls |= other.lbls;
1004
+ root.lblsHigh |= other.lblsHigh;
1005
+ root.plbls |= other.plbls;
1006
+ root.plblsHigh |= other.plblsHigh;
1007
+ }
1008
+
1009
+ propagate() {
1010
+ if (this.toMatchHead < this.toMatch.length) {
1011
+ const head = this.toMatchHead;
1012
+ this.pushTrail(() => {
1013
+ this.toMatchHead = head;
1014
+ });
1015
+ for (; this.toMatchHead < this.toMatch.length; this.toMatchHead++)
1016
+ this.interpreter.execute(this.toMatch[this.toMatchHead]);
1017
+ }
1018
+ this.propagateNewPatterns();
1019
+ }
1020
+
1021
+ private propagateNewPatterns() {
1022
+ if (this.newPatternsHead >= this.newPatterns.length) return;
1023
+ const head = this.newPatternsHead;
1024
+ this.pushTrail(() => {
1025
+ this.newPatternsHead = head;
1026
+ });
1027
+ const manager = this.manager;
1028
+ const egraph = this.ctx.egraph;
1029
+ const tmpTrees = new Map<number, CodeTree<Enode>>();
1030
+ for (; this.newPatternsHead < this.newPatterns.length; this.newPatternsHead++) {
1031
+ if (!manager.limit.inc()) break;
1032
+ const mp = this.newPatterns[this.newPatternsHead];
1033
+ const label = manager.decls[mp.patterns[0]];
1034
+ if (egraph.enodesOf(label).length === 0) continue;
1035
+ const tree = tmpTrees.get(label);
1036
+ if (tree === undefined)
1037
+ tmpTrees.set(label, this.compiler.mkTree(mp.quantifier, mp.patterns, 0, false, mp.pattern));
1038
+ else this.compiler.insert(tree, mp.quantifier, mp.patterns, 0, true, mp.pattern);
1039
+ }
1040
+ for (const entry of tmpTrees) {
1041
+ const nodes = egraph.enodesOf(entry[0]);
1042
+ for (let index = 0; index < nodes.length; index++)
1043
+ if (nodes[index].isRelevant) this.interpreter.executeCore(entry[1], nodes[index]);
1044
+ }
1045
+ }
1046
+ }