tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a

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 (551) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +45 -41
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +5 -1
  8. package/dist/index.d.ts +5 -1
  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 +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +44 -43
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +1 -1
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +4 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +349 -91
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/cli/xml-exporter.ts +1 -1
  36. package/src/codegen.ts +9 -5
  37. package/src/dependencies.ts +72 -11
  38. package/src/dfid.ts +9 -2
  39. package/src/environment.ts +65 -36
  40. package/src/errors.ts +38 -3
  41. package/src/evaluate.ts +92 -32
  42. package/src/exit-codes.ts +5 -2
  43. package/src/instances.ts +5 -5
  44. package/src/java-overrides.ts +2 -2
  45. package/src/levels.ts +138 -90
  46. package/src/lexer.ts +5 -3
  47. package/src/liveness-checker.ts +572 -204
  48. package/src/liveness.ts +47 -32
  49. package/src/obligations/action.ts +10 -6
  50. package/src/obligations/anonymize.ts +33 -14
  51. package/src/obligations/enabled-axioms.ts +218 -0
  52. package/src/obligations/equality.ts +1 -3
  53. package/src/obligations/expression.ts +18 -6
  54. package/src/obligations/format.ts +0 -2
  55. package/src/obligations/generate.ts +22 -17
  56. package/src/obligations/index.ts +37 -7
  57. package/src/obligations/levels.ts +24 -11
  58. package/src/obligations/module.ts +1 -3
  59. package/src/obligations/normalize.ts +25 -17
  60. package/src/obligations/operators.ts +0 -2
  61. package/src/obligations/pragma.ts +53 -16
  62. package/src/obligations/printer.ts +48 -18
  63. package/src/obligations/proof.ts +3 -2
  64. package/src/obligations/regroup.ts +0 -2
  65. package/src/obligations/simplify.ts +17 -7
  66. package/src/obligations/source.ts +71 -17
  67. package/src/obligations/subexpression.ts +45 -18
  68. package/src/obligations/substitution.ts +1 -3
  69. package/src/obligations/temporal.ts +0 -2
  70. package/src/obligations/tuples.ts +0 -2
  71. package/src/parallel-worker.ts +8 -2
  72. package/src/parallel.ts +7 -2
  73. package/src/parser.ts +664 -287
  74. package/src/pretty-print.ts +1 -1
  75. package/src/prover/deciders.ts +11 -8
  76. package/src/prover/isabelle/decide.ts +3 -25
  77. package/src/prover/isabelle/encode.ts +71 -41
  78. package/src/prover/isabelle/isar/attrib.ts +250 -0
  79. package/src/prover/isabelle/isar/context.ts +335 -0
  80. package/src/prover/isabelle/isar/induct.ts +382 -0
  81. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  82. package/src/prover/isabelle/isar/method.ts +506 -198
  83. package/src/prover/isabelle/isar/proof.ts +570 -14
  84. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  85. package/src/prover/isabelle/isar/theory.ts +479 -69
  86. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  87. package/src/prover/isabelle/isar/type-check.ts +83 -8
  88. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  91. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  92. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  93. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  94. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  95. package/src/prover/isabelle/provers/classical.ts +45 -20
  96. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  97. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  98. package/src/prover/isabelle/pure/consts.ts +0 -2
  99. package/src/prover/isabelle/pure/conv.ts +0 -2
  100. package/src/prover/isabelle/pure/drule.ts +63 -4
  101. package/src/prover/isabelle/pure/envir.ts +0 -2
  102. package/src/prover/isabelle/pure/goal.ts +1 -3
  103. package/src/prover/isabelle/pure/logic.ts +0 -2
  104. package/src/prover/isabelle/pure/name.ts +0 -2
  105. package/src/prover/isabelle/pure/net.ts +0 -2
  106. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  107. package/src/prover/isabelle/pure/pattern.ts +0 -2
  108. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  109. package/src/prover/isabelle/pure/rewriter.ts +4 -11
  110. package/src/prover/isabelle/pure/search.ts +0 -2
  111. package/src/prover/isabelle/pure/seq.ts +0 -2
  112. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  113. package/src/prover/isabelle/pure/table.ts +0 -2
  114. package/src/prover/isabelle/pure/tactic.ts +0 -2
  115. package/src/prover/isabelle/pure/tactical.ts +0 -2
  116. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  117. package/src/prover/isabelle/pure/term.ts +3 -5
  118. package/src/prover/isabelle/pure/thm.ts +0 -2
  119. package/src/prover/isabelle/pure/type.ts +0 -2
  120. package/src/prover/isabelle/pure/unify.ts +0 -2
  121. package/src/prover/isabelle/pure/variable.ts +0 -2
  122. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  123. package/src/prover/isabelle/tla/context.ts +51 -9
  124. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  125. package/src/prover/isabelle/tla/logic.ts +40 -1
  126. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  127. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  128. package/src/prover/ocaml.ts +4 -1
  129. package/src/prover/prep/action.ts +19 -12
  130. package/src/prover/prep/enabled-axioms.ts +11 -2
  131. package/src/prover/prep/md5.ts +26 -29
  132. package/src/prover/prep/methods.ts +159 -50
  133. package/src/prover/prep/normalize.ts +38 -9
  134. package/src/prover/prove.ts +343 -65
  135. package/src/prover/ptl/decide.ts +95 -50
  136. package/src/prover/ptl/encode.ts +2 -3
  137. package/src/prover/ptl/tableau.ts +28 -2
  138. package/src/prover/smt/arithmetic.ts +310 -0
  139. package/src/prover/smt/axioms.ts +12 -8
  140. package/src/prover/smt/context.ts +42 -6
  141. package/src/prover/smt/data.ts +191 -84
  142. package/src/prover/smt/encode.ts +122 -43
  143. package/src/prover/smt/extensionality.ts +5 -3
  144. package/src/prover/smt/flatten.ts +4 -6
  145. package/src/prover/smt/format.ts +28 -4
  146. package/src/prover/smt/instances.ts +7 -1
  147. package/src/prover/smt/layout.ts +91 -0
  148. package/src/prover/smt/rewrite.ts +483 -116
  149. package/src/prover/smt/simplify.ts +441 -0
  150. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  151. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  152. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  153. package/src/prover/smt/solver/act-cache.ts +0 -1
  154. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  155. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  156. package/src/prover/smt/solver/aig.ts +889 -0
  157. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  158. package/src/prover/smt/solver/arith-terms.ts +121 -0
  159. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  160. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  161. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  162. package/src/prover/smt/solver/ast-lt.ts +165 -11
  163. package/src/prover/smt/solver/ast-util.ts +160 -2
  164. package/src/prover/smt/solver/ast.ts +1449 -41
  165. package/src/prover/smt/solver/auf-solver.ts +0 -1
  166. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  167. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  168. package/src/prover/smt/solver/bound-manager.ts +196 -0
  169. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  170. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  171. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  172. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  173. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  174. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  175. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  176. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  177. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  178. package/src/prover/smt/solver/card2bv.ts +109 -0
  179. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  180. package/src/prover/smt/solver/cg-table.ts +39 -25
  181. package/src/prover/smt/solver/check-logic.ts +330 -0
  182. package/src/prover/smt/solver/clause.ts +0 -1
  183. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  184. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  185. package/src/prover/smt/solver/context.ts +533 -114
  186. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  187. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  188. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  189. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  190. package/src/prover/smt/solver/demodulator.ts +786 -0
  191. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  192. package/src/prover/smt/solver/der.ts +38 -10
  193. package/src/prover/smt/solver/diff-neq.ts +205 -0
  194. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  195. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  196. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  197. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  198. package/src/prover/smt/solver/e-matching.ts +6 -7
  199. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  200. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  201. package/src/prover/smt/solver/enode.ts +100 -3
  202. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  203. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  204. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  205. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  206. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  207. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  208. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  209. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  210. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  211. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  212. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  213. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  214. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  215. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  216. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  217. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  218. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  219. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  220. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  221. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  222. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  223. package/src/prover/smt/solver/expr-ref.ts +0 -1
  224. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  225. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  226. package/src/prover/smt/solver/factor.ts +163 -0
  227. package/src/prover/smt/solver/fd-solver.ts +267 -0
  228. package/src/prover/smt/solver/fingerprints.ts +15 -15
  229. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  230. package/src/prover/smt/solver/flat-literals.ts +0 -1
  231. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  232. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  233. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  234. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  235. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  236. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  237. package/src/prover/smt/solver/goal.ts +177 -15
  238. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  239. package/src/prover/smt/solver/guard-set.ts +219 -0
  240. package/src/prover/smt/solver/hash.ts +0 -1
  241. package/src/prover/smt/solver/hashtable.ts +30 -16
  242. package/src/prover/smt/solver/inf-eps.ts +63 -0
  243. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  244. package/src/prover/smt/solver/internalizer.ts +109 -36
  245. package/src/prover/smt/solver/lackr.ts +381 -0
  246. package/src/prover/smt/solver/lbool.ts +0 -1
  247. package/src/prover/smt/solver/lia2card.ts +268 -0
  248. package/src/prover/smt/solver/lia2pb.ts +154 -0
  249. package/src/prover/smt/solver/literal.ts +0 -1
  250. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  251. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  252. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  253. package/src/prover/smt/solver/lp/containers.ts +7 -2
  254. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  255. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  256. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  257. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  258. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  259. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  260. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  261. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  262. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  263. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  264. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  265. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  266. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  267. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  268. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  269. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  270. package/src/prover/smt/solver/lp/nex.ts +2 -2
  271. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  273. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  274. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  277. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  278. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  281. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  282. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  285. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  288. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  290. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  291. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  292. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  293. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  294. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  295. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  296. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  297. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  298. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  299. package/src/prover/smt/solver/macro-finder.ts +530 -0
  300. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  301. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  302. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  303. package/src/prover/smt/solver/max-cliques.ts +105 -0
  304. package/src/prover/smt/solver/maxcore.ts +309 -0
  305. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  306. package/src/prover/smt/solver/maxlex.ts +115 -0
  307. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  308. package/src/prover/smt/solver/maxsmt.ts +92 -0
  309. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  310. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  311. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  312. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  313. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  314. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  315. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  316. package/src/prover/smt/solver/model-checker.ts +17 -26
  317. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  318. package/src/prover/smt/solver/model-finder.ts +0 -1
  319. package/src/prover/smt/solver/model-generator.ts +59 -30
  320. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  321. package/src/prover/smt/solver/model-printer.ts +214 -0
  322. package/src/prover/smt/solver/mpf.ts +709 -0
  323. package/src/prover/smt/solver/mus.ts +50 -0
  324. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  325. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  326. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  327. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  328. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  329. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  330. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  331. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  332. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  333. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  334. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  335. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  336. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  337. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  338. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  339. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  340. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  341. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  342. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  343. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  344. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  345. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  346. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  347. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  348. package/src/prover/smt/solver/nlqsat.ts +484 -0
  349. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  350. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  351. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  352. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  353. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  354. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  355. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  356. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  357. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  358. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  359. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  360. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  361. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  362. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  363. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  364. package/src/prover/smt/solver/nnf.ts +105 -23
  365. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  366. package/src/prover/smt/solver/occf.ts +97 -0
  367. package/src/prover/smt/solver/opt-context.ts +792 -0
  368. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  369. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  370. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  371. package/src/prover/smt/solver/opt-solver.ts +311 -0
  372. package/src/prover/smt/solver/opt-value.ts +55 -0
  373. package/src/prover/smt/solver/optsmt.ts +692 -0
  374. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  375. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  376. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  377. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  378. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  379. package/src/prover/smt/solver/probes.ts +511 -0
  380. package/src/prover/smt/solver/propagate-values.ts +37 -21
  381. package/src/prover/smt/solver/proto-model.ts +650 -17
  382. package/src/prover/smt/solver/pull-quant.ts +28 -12
  383. package/src/prover/smt/solver/purify-arith.ts +632 -0
  384. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  385. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  386. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  387. package/src/prover/smt/solver/qe-lite.ts +37 -17
  388. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  389. package/src/prover/smt/solver/qe.ts +1499 -0
  390. package/src/prover/smt/solver/qel.ts +25 -0
  391. package/src/prover/smt/solver/qi-queue.ts +0 -1
  392. package/src/prover/smt/solver/qsat.ts +814 -0
  393. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  394. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  395. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  396. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  397. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  398. package/src/prover/smt/solver/random-gen.ts +0 -1
  399. package/src/prover/smt/solver/rational.ts +45 -1
  400. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  401. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  402. package/src/prover/smt/solver/reduce-args.ts +225 -0
  403. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  404. package/src/prover/smt/solver/ref-vector.ts +0 -1
  405. package/src/prover/smt/solver/relevancy.ts +1 -2
  406. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  407. package/src/prover/smt/solver/rewriter.ts +475 -36
  408. package/src/prover/smt/solver/rlimit.ts +38 -2
  409. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  410. package/src/prover/smt/solver/sat/big.ts +177 -0
  411. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  412. package/src/prover/smt/solver/sat/clause.ts +203 -0
  413. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  414. package/src/prover/smt/solver/sat/config.ts +122 -0
  415. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  416. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  417. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  418. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  419. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  420. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  421. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  422. package/src/prover/smt/solver/sat/probing.ts +170 -0
  423. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  424. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  425. package/src/prover/smt/solver/sat/scc.ts +142 -0
  426. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  427. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  428. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  429. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  430. package/src/prover/smt/solver/search-tree.ts +284 -0
  431. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  432. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  433. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  434. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  435. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  436. package/src/prover/smt/solver/seq-factory.ts +89 -0
  437. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  438. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  439. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  440. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  441. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  442. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  443. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  444. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  445. package/src/prover/smt/solver/seq-subset.ts +165 -0
  446. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  447. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  448. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  449. package/src/prover/smt/solver/smt-logics.ts +66 -0
  450. package/src/prover/smt/solver/smt-setup.ts +544 -0
  451. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  452. package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
  453. package/src/prover/smt/solver/smtlib-script.ts +1843 -0
  454. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  455. package/src/prover/smt/solver/solver.ts +113 -22
  456. package/src/prover/smt/solver/static-features.ts +314 -0
  457. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  458. package/src/prover/smt/solver/tactic.ts +2012 -0
  459. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  460. package/src/prover/smt/solver/theory-array.ts +1240 -0
  461. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  462. package/src/prover/smt/solver/theory-char.ts +355 -0
  463. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  464. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  465. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  466. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  467. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  468. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  469. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  470. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  471. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  472. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  473. package/src/prover/smt/solver/theory-lra.ts +188 -2
  474. package/src/prover/smt/solver/theory-pb.ts +933 -0
  475. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  476. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  477. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  478. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  479. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  480. package/src/prover/smt/solver/theory-seq.ts +961 -0
  481. package/src/prover/smt/solver/theory.ts +189 -0
  482. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  483. package/src/prover/smt/solver/var-subst.ts +36 -14
  484. package/src/prover/smt/table.ts +3 -2
  485. package/src/prover/smt/types.ts +146 -0
  486. package/src/prover/tlapm/cache.ts +37 -16
  487. package/src/prover/tlapm-library.ts +3208 -0
  488. package/src/prover/verdict.ts +2 -0
  489. package/src/prover/zenon/decide.ts +10 -7
  490. package/src/prover/zenon/encode.ts +0 -2
  491. package/src/prover/zenon/eqrel.ts +0 -2
  492. package/src/prover/zenon/equality-rules.ts +24 -2
  493. package/src/prover/zenon/expr.ts +21 -2
  494. package/src/prover/zenon/index-table.ts +7 -4
  495. package/src/prover/zenon/isar-case.ts +1 -3
  496. package/src/prover/zenon/isar.ts +2 -4
  497. package/src/prover/zenon/llproof.ts +0 -2
  498. package/src/prover/zenon/mltoll.ts +0 -2
  499. package/src/prover/zenon/node.ts +20 -5
  500. package/src/prover/zenon/parse.ts +6 -2
  501. package/src/prover/zenon/phrase.ts +1 -3
  502. package/src/prover/zenon/proof.ts +0 -2
  503. package/src/prover/zenon/propositional-rules.ts +0 -2
  504. package/src/prover/zenon/rules.ts +2 -3
  505. package/src/prover/zenon/search.ts +7 -5
  506. package/src/prover/zenon/tla/functions.ts +0 -2
  507. package/src/prover/zenon/tla/llproof.ts +0 -2
  508. package/src/prover/zenon/tla/records.ts +0 -2
  509. package/src/prover/zenon/tla/rewrites.ts +0 -2
  510. package/src/prover/zenon/tla/sets.ts +7 -8
  511. package/src/prover/zenon/tla/terms.ts +0 -2
  512. package/src/prover/zenon/tla/tla.ts +0 -2
  513. package/src/resolve.ts +625 -189
  514. package/src/runtime.ts +7 -1
  515. package/src/sany/builtins.ts +10 -10
  516. package/src/sany/generation.ts +2 -13
  517. package/src/sany/generator-definitions.ts +3 -1
  518. package/src/sany/generator-expressions.ts +36 -30
  519. package/src/sany/generator-proofs.ts +5 -3
  520. package/src/sany/generator.ts +2 -1
  521. package/src/sany/levels.ts +0 -2
  522. package/src/sany/lexer.ts +3 -3
  523. package/src/sany/linter.ts +0 -2
  524. package/src/sany/modules.ts +4 -2
  525. package/src/sany/nodes.ts +1 -1
  526. package/src/sany/selectors.ts +11 -6
  527. package/src/sany/xml.ts +2 -3
  528. package/src/search.ts +209 -56
  529. package/src/simulate.ts +3 -0
  530. package/src/spec-description.ts +2 -2
  531. package/src/standard-definitions.ts +4 -0
  532. package/src/state-graph.ts +0 -2
  533. package/src/subexpressions.ts +265 -94
  534. package/src/successors.ts +2 -1
  535. package/src/symmetry.ts +3 -3
  536. package/src/tableau.ts +2 -2
  537. package/src/tlc/fingerprint.ts +81 -9
  538. package/src/tlc/jar-data.ts +10 -0
  539. package/src/tlc/messages.ts +3 -3
  540. package/src/tlc/order.ts +14 -3
  541. package/src/tlc/summary.ts +29 -14
  542. package/src/tlc/tlc-operators.ts +3 -1
  543. package/src/tlc/tlcext-operators.ts +61 -16
  544. package/src/tlc/trace-spec.ts +5 -5
  545. package/src/typed-tier.ts +6541 -0
  546. package/src/typescript/types.ts +2 -2
  547. package/src/values.ts +46 -27
  548. package/src/prover/isabelle/isar/statement.ts +0 -52
  549. package/src/prover/smt/solver/z3-license.txt +0 -10
  550. package/src/prover/tlaps-module.ts +0 -510
  551. package/src/prover/zenon/LICENSE +0 -32
@@ -1,6 +1,4 @@
1
- // Ported from Z3 (src/smt/mam.cpp), MIT license, see z3-license.txt.
2
1
  import { KIND_VAR, type AstManager } from "./ast";
3
- import type { Context } from "./context";
4
2
  import type { Enode } from "./enode";
5
3
 
6
4
  export const OP_INIT = 0;
@@ -17,51 +15,66 @@ export const OP_CONTINUE = 10;
17
15
  export const OP_GET_ENODE = 11;
18
16
  export const OP_GET_CGR = 12;
19
17
  export const OP_IS_CGR = 13;
18
+ export const OP_INITAC = 14;
20
19
 
21
20
  const JOINT_NULL = 0;
22
21
  export const JOINT_GROUND = 1;
23
22
  export const JOINT_VAR = 2;
24
23
  export const JOINT_NESTED = 3;
25
24
 
26
- export interface Joint {
25
+ export interface Joint<E = Enode> {
27
26
  kind: number;
28
- enode: Enode | null;
27
+ enode: E | null;
29
28
  reg: number;
30
29
  decl: number;
31
30
  argPos: number;
32
31
  }
33
32
 
34
- export interface Instruction {
33
+ export interface Instruction<E = Enode> {
35
34
  op: number;
36
- next: Instruction | null;
35
+ next: Instruction<E> | null;
37
36
  numArgs: number;
38
37
  reg: number;
39
38
  reg2: number;
40
39
  oreg: number;
41
40
  label: number;
42
- enode: Enode | null;
41
+ enode: E | null;
43
42
  lblLow: number;
44
43
  lblHigh: number;
45
- alt: Instruction | null;
44
+ alt: Instruction<E> | null;
46
45
  quantifier: number;
46
+ pattern: number;
47
47
  regs: number[];
48
- joints: Joint[];
48
+ joints: Joint<E>[];
49
49
  }
50
50
 
51
- export interface CodeTree {
51
+ export interface CodeTree<E = Enode> {
52
52
  numArgs: number;
53
53
  isFilteringCandidates: boolean;
54
54
  numRegs: number;
55
55
  numChoices: number;
56
- root: Instruction;
57
- candidates: Enode[];
56
+ root: Instruction<E>;
57
+ candidates: E[];
58
+ qhead: number;
58
59
  candidateGcThreshold: number;
59
60
  }
60
61
 
61
- export interface LabelHasher {
62
+ export interface LabelHasher<E = Enode> {
62
63
  getLabelHash(decl: number): number;
63
- getGroundEnode(expr: number, quantifier: number): Enode | null;
64
- getLblHash(node: Enode): number;
64
+ getGroundEnode(expr: number, quantifier: number): E | null;
65
+ getLblHash(node: E): number;
66
+ }
67
+
68
+ // The part of an enode that compiling a pattern reads.
69
+ export interface MamEnode<E> {
70
+ readonly root: E;
71
+ lblHash: number;
72
+ }
73
+
74
+ // The context that undoes a compiler's updates of shared code trees.
75
+ interface CompilerContext {
76
+ readonly manager: AstManager;
77
+ pushTrail(undo: () => void): void;
65
78
  }
66
79
 
67
80
  const NOT_CHECKED = 0;
@@ -71,7 +84,7 @@ const CHECK_SINGLETON = 2;
71
84
  const FIND_BEST_CHILD_THRESHOLD = 64;
72
85
  const SIMPLE_SEQ_THRESHOLD = 4;
73
86
 
74
- const mkInstruction = (op: number): Instruction => ({
87
+ const mkInstruction = <E>(op: number): Instruction<E> => ({
75
88
  op,
76
89
  next: null,
77
90
  numArgs: 0,
@@ -84,11 +97,12 @@ const mkInstruction = (op: number): Instruction => ({
84
97
  lblHigh: 0,
85
98
  alt: null,
86
99
  quantifier: -1,
100
+ pattern: -1,
87
101
  regs: [],
88
102
  joints: [],
89
103
  });
90
104
 
91
- const mkNullJoint = (): Joint => ({
105
+ const mkNullJoint = <E>(): Joint<E> => ({
92
106
  kind: JOINT_NULL,
93
107
  enode: null,
94
108
  reg: 0,
@@ -105,66 +119,69 @@ const countBits = (word: number) => {
105
119
  return count;
106
120
  };
107
121
 
108
- const setHash = (instr: Instruction, hash: number) => {
122
+ const setHash = <E>(instr: Instruction<E>, hash: number) => {
109
123
  if (hash < 32) instr.lblLow |= 1 << hash;
110
124
  else instr.lblHigh |= 1 << hash;
111
125
  };
112
126
 
113
- const mkFilter = (op: number, reg: number, low: number, high: number) => {
114
- const instr = mkInstruction(op);
127
+ const mkFilter = <E>(op: number, reg: number, low: number, high: number) => {
128
+ const instr = mkInstruction<E>(op);
115
129
  instr.reg = reg;
116
130
  instr.lblLow = low;
117
131
  instr.lblHigh = high;
118
132
  return instr;
119
133
  };
120
134
 
121
- const mkSingletonFilter = (op: number, reg: number, hash: number) => {
122
- const instr = mkFilter(op, reg, 0, 0);
135
+ const mkSingletonFilter = <E>(op: number, reg: number, hash: number) => {
136
+ const instr = mkFilter<E>(op, reg, 0, 0);
123
137
  setHash(instr, hash);
124
138
  return instr;
125
139
  };
126
140
 
127
- const mkCompare = (reg1: number, reg2: number) => {
128
- const instr = mkInstruction(OP_COMPARE);
141
+ const mkCompare = <E>(reg1: number, reg2: number) => {
142
+ const instr = mkInstruction<E>(OP_COMPARE);
129
143
  instr.reg = reg1;
130
144
  instr.reg2 = reg2;
131
145
  return instr;
132
146
  };
133
147
 
134
- const mkCheck = (reg: number, enode: Enode | null) => {
135
- const instr = mkInstruction(OP_CHECK);
148
+ const mkCheck = <E>(reg: number, enode: E | null) => {
149
+ const instr = mkInstruction<E>(OP_CHECK);
136
150
  instr.reg = reg;
137
151
  instr.enode = enode;
138
152
  return instr;
139
153
  };
140
154
 
141
- const mkChoose = (alt: Instruction | null) => {
142
- const instr = mkInstruction(OP_CHOOSE);
155
+ const mkChoose = <E>(alt: Instruction<E> | null) => {
156
+ const instr = mkInstruction<E>(OP_CHOOSE);
143
157
  instr.alt = alt;
144
158
  return instr;
145
159
  };
146
160
 
147
- const mkInit = (numArgs: number) => {
148
- const instr = mkInstruction(OP_INIT);
161
+ const mkInit = <E>(op: number, numArgs: number) => {
162
+ const instr = mkInstruction<E>(op);
149
163
  instr.numArgs = numArgs;
150
164
  return instr;
151
165
  };
152
166
 
153
- export class Compiler {
167
+ // isAc marks the associative-commutative labels that euf's matcher starts with OP_INITAC.
168
+ export class Compiler<E extends MamEnode<E> = Enode> {
154
169
  private manager: AstManager;
155
170
  private registers: number[] = [];
156
171
  private todo: number[] = [];
157
172
  private aux: number[] = [];
158
173
  private vars: number[] = [];
159
174
  private quantifier = -1;
175
+ private pattern = -1;
160
176
  private patterns: number[] = [];
161
- private tree: CodeTree = {
177
+ private tree: CodeTree<E> = {
162
178
  numArgs: 0,
163
179
  isFilteringCandidates: false,
164
180
  numRegs: 0,
165
181
  numChoices: 0,
166
- root: mkInit(0),
182
+ root: mkInit<E>(OP_INIT, 0),
167
183
  candidates: [],
184
+ qhead: 0,
168
185
  candidateGcThreshold: 0,
169
186
  };
170
187
  private numChoices = 0;
@@ -173,13 +190,14 @@ export class Compiler {
173
190
  private matchedExprs = new Map<number, number>();
174
191
  private marks: number[] = [];
175
192
  private toReset: number[] = [];
176
- private compatible: Instruction[] = [];
177
- private incompatible: Instruction[] = [];
178
- private seq: Instruction[] = [];
193
+ private compatible: Instruction<E>[] = [];
194
+ private incompatible: Instruction<E>[] = [];
195
+ private seq: Instruction<E>[] = [];
179
196
 
180
197
  constructor(
181
- private context: Context,
182
- private hasher: LabelHasher,
198
+ private context: CompilerContext,
199
+ private hasher: LabelHasher<E>,
200
+ private isAc: (decl: number) => boolean = () => false,
183
201
  ) {
184
202
  this.manager = context.manager;
185
203
  }
@@ -200,10 +218,17 @@ export class Compiler {
200
218
  return expr !== -1 && this.manager.kinds[expr] !== KIND_VAR;
201
219
  }
202
220
 
203
- private init(tree: CodeTree, quantifier: number, patterns: number[], firstIndex: number) {
221
+ private init(
222
+ tree: CodeTree<E>,
223
+ quantifier: number,
224
+ pattern: number,
225
+ patterns: number[],
226
+ firstIndex: number,
227
+ ) {
204
228
  const manager = this.manager;
205
229
  this.tree = tree;
206
230
  this.quantifier = quantifier;
231
+ this.pattern = pattern;
207
232
  this.patterns = patterns;
208
233
  this.numChoices = 0;
209
234
  this.todo = [];
@@ -232,7 +257,7 @@ export class Compiler {
232
257
  let numUnboundVars = 0;
233
258
  const visit = (term: number) => {
234
259
  size++;
235
- if (manager.isGround(term)) return;
260
+ if (manager.isGroundApp(term)) return;
236
261
  for (let index = 0; index < manager.getNumArgs(term); index++) {
237
262
  const arg = manager.getArg(term, index);
238
263
  if (manager.kinds[arg] === KIND_VAR) {
@@ -261,7 +286,7 @@ export class Compiler {
261
286
  else this.vars[varIndex] = reg;
262
287
  continue;
263
288
  }
264
- if (manager.isGround(pattern)) {
289
+ if (manager.isGroundApp(pattern)) {
265
290
  this.seq.push(mkCheck(reg, hasher.getGroundEnode(pattern, this.quantifier)));
266
291
  this.setMark(reg, NOT_CHECKED);
267
292
  continue;
@@ -305,7 +330,7 @@ export class Compiler {
305
330
  const label = manager.decls[firstApp];
306
331
  const numArgs = manager.getNumArgs(firstApp);
307
332
  if (this.isAllArgsBoundVars(firstApp)) {
308
- const instr = mkInstruction(OP_IS_CGR);
333
+ const instr = mkInstruction<E>(OP_IS_CGR);
309
334
  instr.label = label;
310
335
  instr.reg = firstAppReg;
311
336
  instr.numArgs = numArgs;
@@ -318,7 +343,7 @@ export class Compiler {
318
343
  this.registers[oreg + index] = manager.getArg(firstApp, index);
319
344
  this.aux.push(oreg + index);
320
345
  }
321
- const instr = mkInstruction(OP_BIND);
346
+ const instr = mkInstruction<E>(OP_BIND);
322
347
  instr.label = label;
323
348
  instr.numArgs = numArgs;
324
349
  instr.reg = firstAppReg;
@@ -338,7 +363,7 @@ export class Compiler {
338
363
  let count = 0;
339
364
  let hasUnboundVars = false;
340
365
  const visit = (term: number) => {
341
- if (manager.isGround(term)) return;
366
+ if (manager.isGroundApp(term)) return;
342
367
  for (let index = 0; index < manager.getNumArgs(term); index++) {
343
368
  const arg = manager.getArg(term, index);
344
369
  if (manager.kinds[arg] !== KIND_VAR) visit(arg);
@@ -352,10 +377,10 @@ export class Compiler {
352
377
 
353
378
  private genMpFilter(expr: number): number {
354
379
  const manager = this.manager;
355
- if (manager.isGround(expr)) {
380
+ if (manager.isGroundApp(expr)) {
356
381
  const oreg = this.tree.numRegs;
357
382
  this.tree.numRegs += 1;
358
- const instr = mkInstruction(OP_GET_ENODE);
383
+ const instr = mkInstruction<E>(OP_GET_ENODE);
359
384
  instr.oreg = oreg;
360
385
  instr.enode = this.hasher.getGroundEnode(expr, this.quantifier);
361
386
  this.seq.push(instr);
@@ -366,7 +391,7 @@ export class Compiler {
366
391
  );
367
392
  const oreg = this.tree.numRegs;
368
393
  this.tree.numRegs += 1;
369
- const instr = mkInstruction(OP_GET_CGR);
394
+ const instr = mkInstruction<E>(OP_GET_CGR);
370
395
  instr.label = manager.decls[expr];
371
396
  instr.numArgs = iregs.length;
372
397
  instr.oreg = oreg;
@@ -415,32 +440,32 @@ export class Compiler {
415
440
  this.todo.push(oreg + index);
416
441
  if (
417
442
  (manager.kinds[arg] === KIND_VAR && this.vars[manager.values[arg]] >= 0) ||
418
- (manager.kinds[arg] !== KIND_VAR && manager.isGround(arg))
443
+ manager.isGroundApp(arg)
419
444
  )
420
445
  hasDepth1Joint = true;
421
446
  }
422
- const joints = manager.mapArgs(best, (arg): Joint => {
447
+ const joints = manager.mapArgs(best, (arg): Joint<E> => {
423
448
  if (hasDepth1Joint) {
424
449
  if (manager.kinds[arg] === KIND_VAR) {
425
450
  const reg = this.vars[manager.values[arg]];
426
- return reg >= 0 ? { ...mkNullJoint(), kind: JOINT_VAR, reg } : mkNullJoint();
451
+ return reg >= 0 ? { ...mkNullJoint<E>(), kind: JOINT_VAR, reg } : mkNullJoint<E>();
427
452
  }
428
- if (manager.isGround(arg))
453
+ if (manager.isGroundApp(arg))
429
454
  return {
430
- ...mkNullJoint(),
455
+ ...mkNullJoint<E>(),
431
456
  kind: JOINT_GROUND,
432
457
  enode: this.hasher.getGroundEnode(arg, this.quantifier),
433
458
  };
434
- return mkNullJoint();
459
+ return mkNullJoint<E>();
435
460
  }
436
- if (manager.kinds[arg] === KIND_VAR) return mkNullJoint();
461
+ if (manager.kinds[arg] === KIND_VAR) return mkNullJoint<E>();
437
462
  let argPos = -1;
438
463
  for (let index = 0; index < manager.getNumArgs(arg) && argPos === -1; index++) {
439
464
  const innerArg = manager.getArg(arg, index);
440
465
  if (manager.kinds[innerArg] === KIND_VAR && this.vars[manager.values[innerArg]] >= 0)
441
466
  argPos = index;
442
467
  }
443
- if (argPos === -1) return mkNullJoint();
468
+ if (argPos === -1) return mkNullJoint<E>();
444
469
  return {
445
470
  kind: JOINT_NESTED,
446
471
  enode: null,
@@ -449,7 +474,7 @@ export class Compiler {
449
474
  argPos,
450
475
  };
451
476
  });
452
- const instr = mkInstruction(OP_CONTINUE);
477
+ const instr = mkInstruction<E>(OP_CONTINUE);
453
478
  instr.label = manager.decls[best];
454
479
  instr.numArgs = manager.getNumArgs(best);
455
480
  instr.oreg = oreg;
@@ -461,7 +486,7 @@ export class Compiler {
461
486
  }
462
487
  }
463
488
 
464
- private linearise(head: Instruction, firstIndex: number) {
489
+ private linearise(head: Instruction<E>, firstIndex: number) {
465
490
  this.seq = [];
466
491
  this.matchedExprs.clear();
467
492
  while (this.todo.length > 0) this.lineariseCore();
@@ -471,8 +496,9 @@ export class Compiler {
471
496
  }
472
497
  const numDecls = this.manager.getQuantifier(this.quantifier).sorts.length;
473
498
  for (let index = 0; index < numDecls; index++) if (this.vars[index] === -1) return;
474
- const instr = mkInstruction(OP_YIELD);
499
+ const instr = mkInstruction<E>(OP_YIELD);
475
500
  instr.quantifier = this.quantifier;
501
+ instr.pattern = this.pattern;
476
502
  instr.numArgs = numDecls;
477
503
  instr.regs = this.vars.slice(0, numDecls);
478
504
  this.seq.push(instr);
@@ -483,7 +509,7 @@ export class Compiler {
483
509
  }
484
510
  }
485
511
 
486
- private setNext(instr: Instruction, next: Instruction | null) {
512
+ private setNext(instr: Instruction<E>, next: Instruction<E> | null) {
487
513
  if (!this.isTmpTree) {
488
514
  const old = instr.next;
489
515
  this.context.pushTrail(() => {
@@ -493,11 +519,11 @@ export class Compiler {
493
519
  instr.next = next;
494
520
  }
495
521
 
496
- private findBestChild(firstChild: Instruction) {
522
+ private findBestChild(firstChild: Instruction<E>) {
497
523
  let numTooSimple = 0;
498
- let bestChild: Instruction | null = null;
524
+ let bestChild: Instruction<E> | null = null;
499
525
  let maxCompatibility = 0;
500
- for (let child: Instruction | null = firstChild; child !== null; child = child.alt) {
526
+ for (let child: Instruction<E> | null = firstChild; child !== null; child = child.alt) {
501
527
  const measure = this.getCompatibilityMeasure(child);
502
528
  if (measure.isSimple) {
503
529
  numTooSimple++;
@@ -511,76 +537,76 @@ export class Compiler {
511
537
  return bestChild;
512
538
  }
513
539
 
514
- private isBindCompatible(instr: Instruction) {
540
+ private isBindCompatible(instr: Instruction<E>) {
515
541
  const manager = this.manager;
516
542
  const expr = this.getRegister(instr.reg);
517
543
  return (
518
544
  this.isApp(expr) &&
519
- !manager.isGround(expr) &&
545
+ !manager.isGroundApp(expr) &&
520
546
  manager.decls[expr] === instr.label &&
521
547
  manager.getNumArgs(expr) === instr.numArgs
522
548
  );
523
549
  }
524
550
 
525
- private isCompareCompatible(instr: Instruction) {
551
+ private isCompareCompatible(instr: Instruction<E>) {
526
552
  const expr = this.getRegister(instr.reg);
527
553
  return expr !== -1 && expr === this.getRegister(instr.reg2);
528
554
  }
529
555
 
530
- private isCheckCompatible(instr: Instruction) {
556
+ private isCheckCompatible(instr: Instruction<E>) {
531
557
  const expr = this.getRegister(instr.reg);
532
- if (!this.isApp(expr) || !this.manager.isGround(expr)) return false;
558
+ if (!this.manager.isGroundApp(expr)) return false;
533
559
  const node = this.hasher.getGroundEnode(expr, this.quantifier);
534
560
  return instr.enode !== null && node !== null && instr.enode.root === node.root;
535
561
  }
536
562
 
537
563
  private getPatLblHash(reg: number) {
538
564
  const expr = this.registers[reg];
539
- if (this.manager.isGround(expr)) {
565
+ if (this.manager.isGroundApp(expr)) {
540
566
  const node = this.hasher.getGroundEnode(expr, this.quantifier);
541
567
  return node === null ? -1 : this.hasher.getLblHash(node);
542
568
  }
543
569
  return this.hasher.getLabelHash(this.manager.decls[expr]);
544
570
  }
545
571
 
546
- private isCheckSemiCompatible(instr: Instruction) {
572
+ private isCheckSemiCompatible(instr: Instruction<E>) {
547
573
  if (instr.enode !== null) this.hasher.getLblHash(instr.enode);
548
574
  const expr = this.getRegister(instr.reg);
549
575
  return (
550
576
  expr !== -1 &&
551
577
  this.getMark(instr.reg) === NOT_CHECKED &&
552
- this.manager.isGround(expr) &&
578
+ this.manager.isGroundApp(expr) &&
553
579
  instr.enode !== null &&
554
580
  this.getPatLblHash(instr.reg) === instr.enode.lblHash
555
581
  );
556
582
  }
557
583
 
558
- private isFilterCompatible(instr: Instruction) {
584
+ private isFilterCompatible(instr: Instruction<E>) {
559
585
  const expr = this.getRegister(instr.reg);
560
586
  return (
561
587
  this.isApp(expr) &&
562
- !this.manager.isGround(expr) &&
588
+ !this.manager.isGroundApp(expr) &&
563
589
  hasHash(instr.lblLow, instr.lblHigh, this.getPatLblHash(instr.reg))
564
590
  );
565
591
  }
566
592
 
567
- private isCfilterCompatible(instr: Instruction) {
593
+ private isCfilterCompatible(instr: Instruction<E>) {
568
594
  const expr = this.getRegister(instr.reg);
569
595
  return (
570
596
  expr !== -1 &&
571
- this.manager.isGround(expr) &&
597
+ this.manager.isGroundApp(expr) &&
572
598
  hasHash(instr.lblLow, instr.lblHigh, this.getPatLblHash(instr.reg))
573
599
  );
574
600
  }
575
601
 
576
- private isFilterSemiCompatible(instr: Instruction) {
602
+ private isFilterSemiCompatible(instr: Instruction<E>) {
577
603
  const expr = this.getRegister(instr.reg);
578
604
  return (
579
- this.getMark(instr.reg) === NOT_CHECKED && this.isApp(expr) && !this.manager.isGround(expr)
605
+ this.getMark(instr.reg) === NOT_CHECKED && this.isApp(expr) && !this.manager.isGroundApp(expr)
580
606
  );
581
607
  }
582
608
 
583
- private getCompatibilityMeasure(child: Instruction) {
609
+ private getCompatibilityMeasure(child: Instruction<E>) {
584
610
  const manager = this.manager;
585
611
  this.toReset.length = 0;
586
612
  let weight = 0;
@@ -629,7 +655,7 @@ export class Compiler {
629
655
  if (index !== -1) this.todo.splice(index, 1);
630
656
  }
631
657
 
632
- private insertAt(start: Instruction, firstIndex: number) {
658
+ private insertAt(start: Instruction<E>, firstIndex: number) {
633
659
  const manager = this.manager;
634
660
  let head = start;
635
661
  for (;;) {
@@ -659,7 +685,7 @@ export class Compiler {
659
685
  this.setMark(curr.reg, NOT_CHECKED);
660
686
  compatible.push(curr);
661
687
  } else if (this.isCheckSemiCompatible(curr) && curr.enode !== null) {
662
- const filter = mkFilter(OP_CFILTER, curr.reg, 0, 0);
688
+ const filter = mkFilter<E>(OP_CFILTER, curr.reg, 0, 0);
663
689
  setHash(filter, this.hasher.getLblHash(curr.enode));
664
690
  setHash(filter, this.getPatLblHash(curr.reg));
665
691
  this.setMark(curr.reg, CHECK_SET);
@@ -706,7 +732,7 @@ export class Compiler {
706
732
  setHash(filter, hash);
707
733
  compatible.push(curr);
708
734
  } else {
709
- const filter = mkFilter(OP_FILTER, curr.reg, curr.lblLow, curr.lblHigh);
735
+ const filter = mkFilter<E>(OP_FILTER, curr.reg, curr.lblLow, curr.lblHigh);
710
736
  setHash(filter, hash);
711
737
  compatible.push(filter);
712
738
  incompatible.push(curr);
@@ -733,7 +759,7 @@ export class Compiler {
733
759
  continue;
734
760
  }
735
761
  const firstChildHead = curr;
736
- const newChildHead2 = mkInstruction(OP_NOOP);
762
+ const newChildHead2 = mkInstruction<E>(OP_NOOP);
737
763
  const newChildHead1 = mkChoose(newChildHead2);
738
764
  this.numChoices++;
739
765
  let tail = head;
@@ -759,30 +785,34 @@ export class Compiler {
759
785
  patterns: number[],
760
786
  firstIndex: number,
761
787
  isFilteringCandidates: boolean,
788
+ pattern = -1,
762
789
  ) {
763
- const pattern = patterns[firstIndex];
764
- const numArgs = this.manager.getNumArgs(pattern);
765
- const tree: CodeTree = {
790
+ const first = patterns[firstIndex];
791
+ const numArgs = this.manager.getNumArgs(first);
792
+ const tree: CodeTree<E> = {
766
793
  numArgs,
767
794
  isFilteringCandidates,
768
795
  numRegs: numArgs + 1,
769
796
  numChoices: 0,
770
- root: mkInit(numArgs),
797
+ root: mkInit<E>(this.isAc(this.manager.decls[first]) ? OP_INITAC : OP_INIT, numArgs),
771
798
  candidates: [],
799
+ qhead: 0,
772
800
  candidateGcThreshold: 10000,
773
801
  };
774
- this.init(tree, quantifier, patterns, firstIndex);
802
+ this.init(tree, quantifier, pattern, patterns, firstIndex);
775
803
  this.linearise(tree.root, firstIndex);
804
+ if (tree.root.op === OP_INITAC) this.numChoices++;
776
805
  tree.numChoices = this.numChoices;
777
806
  return tree;
778
807
  }
779
808
 
780
809
  insert(
781
- tree: CodeTree,
810
+ tree: CodeTree<E>,
782
811
  quantifier: number,
783
812
  patterns: number[],
784
813
  firstIndex: number,
785
814
  isTmpTree: boolean,
815
+ pattern = -1,
786
816
  ) {
787
817
  if (tree.numArgs !== this.manager.getNumArgs(patterns[firstIndex])) return;
788
818
  this.isTmpTree = isTmpTree;
@@ -792,7 +822,7 @@ export class Compiler {
792
822
  tree.numRegs = numRegs;
793
823
  });
794
824
  }
795
- this.init(tree, quantifier, patterns, firstIndex);
825
+ this.init(tree, quantifier, pattern, patterns, firstIndex);
796
826
  this.numChoices = tree.numChoices;
797
827
  this.insertAt(tree.root, firstIndex);
798
828
  if (this.numChoices <= tree.numChoices) return;
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/mam.cpp), MIT license, see z3-license.txt.
2
1
  import type { Context } from "./context";
3
2
  import type { Enode } from "./enode";
4
3
  import {
@@ -0,0 +1,17 @@
1
+ import type { AstManager } from "./ast";
2
+ import { runSimplifier } from "./dependent-expr-state";
3
+ import type { Goal } from "./goal";
4
+ import { MaxBvSharing } from "./maximize-ac-sharing";
5
+
6
+ // dependent_expr_state_tactic pushes a scope of the state but not of the simplifier, so the
7
+ // rewriter never registers the kinds it shares and leaves every formula as it is.
8
+ export const runMaxBvSharing = (manager: AstManager) => (goal: Goal) => {
9
+ runSimplifier(goal, false, (state) => {
10
+ const rewriter = new MaxBvSharing(manager);
11
+ return {
12
+ reduce: () => state.rewriteEach((form) => rewriter.rewrite(form)),
13
+ release: () => rewriter.release(),
14
+ };
15
+ });
16
+ return [goal];
17
+ };
@@ -0,0 +1,105 @@
1
+ const getSortedSet = (set: Set<number>) => [...set].sort((left, right) => left - right);
2
+
3
+ export class MaxCliques {
4
+ private next: number[][] = [];
5
+ private tc: number[][] = [];
6
+ private seen1 = new Set<number>();
7
+ private seen2 = new Set<number>();
8
+
9
+ constructor(private negate: (vertex: number) => number) {}
10
+
11
+ private getNext(vertex: number) {
12
+ return this.next[vertex] ?? [];
13
+ }
14
+
15
+ private getTc(vertex: number) {
16
+ this.tc[vertex] ??= [];
17
+ return this.tc[vertex];
18
+ }
19
+
20
+ private getReachable(start: number, goal: Set<number>, reachable: Set<number>) {
21
+ this.seen1.clear();
22
+ const todo = [start];
23
+ for (let index = 0; index < todo.length; index++) {
24
+ const vertex = todo[index];
25
+ if (this.seen1.has(vertex)) continue;
26
+ this.seen1.add(vertex);
27
+ if (this.seen2.has(vertex)) {
28
+ for (const next of this.getTc(vertex)) if (goal.has(next)) reachable.add(next);
29
+ continue;
30
+ }
31
+ const negated = this.negate(vertex);
32
+ if (goal.has(negated)) reachable.add(negated);
33
+ todo.push(...this.getNext(negated));
34
+ }
35
+ for (let index = todo.length; index-- > 0;) {
36
+ const vertex = todo[index];
37
+ if (this.seen2.has(vertex)) continue;
38
+ this.seen2.add(vertex);
39
+ const negated = this.negate(vertex);
40
+ const tc = this.getTc(vertex);
41
+ if (goal.has(negated)) tc.push(negated);
42
+ else for (const next of this.getNext(negated)) tc.push(...this.getTc(next));
43
+ }
44
+ }
45
+
46
+ addEdge(source: number, target: number) {
47
+ (this.next[source] ??= []).push(target);
48
+ (this.next[target] ??= []).push(source);
49
+ }
50
+
51
+ cliques2(vertices: readonly number[]) {
52
+ const goal = new Set(vertices);
53
+ const conns = new Map<number, Set<number>>();
54
+ for (const vertex of vertices) {
55
+ const reach = new Set<number>();
56
+ this.getReachable(vertex, goal, reach);
57
+ conns.set(vertex, reach);
58
+ }
59
+ return this.cliques(vertices, conns);
60
+ }
61
+
62
+ cliques(vertices: readonly number[], conns: Map<number, Set<number>>) {
63
+ const getConns = (vertex: number) => {
64
+ const set = conns.get(vertex);
65
+ if (set !== undefined) return set;
66
+ const created = new Set<number>();
67
+ conns.set(vertex, created);
68
+ return created;
69
+ };
70
+ const isLess = (first: number, second: number) => {
71
+ const firstSize = getConns(first).size;
72
+ const secondSize = getConns(second).size;
73
+ return firstSize < secondSize || (firstSize === secondSize && first < second);
74
+ };
75
+ const todo = new Set(vertices);
76
+ const heap = new Set(vertices);
77
+ const result: number[][] = [];
78
+ while (todo.size > 0) {
79
+ let vertex = -1;
80
+ for (const candidate of heap)
81
+ if (vertex === -1 || isLess(candidate, vertex)) vertex = candidate;
82
+ const atMostOne = new Set<number>();
83
+ const next = getSortedSet(getConns(vertex))
84
+ .filter((neighbor) => todo.has(neighbor))
85
+ .sort((first, second) => (isLess(first, second) ? -1 : isLess(second, first) ? 1 : 0));
86
+ for (const neighbor of next) {
87
+ const isAll =
88
+ heap.has(neighbor) &&
89
+ getSortedSet(atMostOne).every((member) => getConns(neighbor).has(member));
90
+ if (isAll) atMostOne.add(neighbor);
91
+ }
92
+ atMostOne.add(vertex);
93
+ const members = getSortedSet(atMostOne);
94
+ for (const member of members) {
95
+ todo.delete(member);
96
+ for (const neighbor of getSortedSet(getConns(member))) getConns(neighbor).delete(member);
97
+ }
98
+ for (const member of members) heap.delete(member);
99
+ if (members.length <= 1) continue;
100
+ if (members.length === 2 && members[0] === this.negate(members[1])) continue;
101
+ result.push(members);
102
+ }
103
+ return result;
104
+ }
105
+ }