tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79

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 (586) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +37 -0
  8. package/dist/index.d.ts +37 -0
  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.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +47 -44
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +44 -41
  19. package/dist/transfer.js +44 -41
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +474 -718
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +8 -7
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +244 -238
  35. package/src/cli/tlc-output.ts +687 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +49 -702
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +55 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +31 -106
  47. package/src/exit-codes.ts +2 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +616 -306
  57. package/src/liveness.ts +104 -120
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +118 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +10 -30
  81. package/src/parallel.ts +50 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  310. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +814 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +1986 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +15 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +206 -44
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +22 -47
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +54 -26
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,117 @@
1
+ export class VarQueue {
2
+ private values: number[] = [-1];
3
+ private indices: number[] = [];
4
+
5
+ constructor(private activity: number[]) {}
6
+
7
+ private isLess(first: number, second: number) {
8
+ return this.activity[first] > this.activity[second];
9
+ }
10
+
11
+ private moveUp(start: number) {
12
+ let index = start;
13
+ const value = this.values[index];
14
+ for (;;) {
15
+ const parentIndex = index >> 1;
16
+ if (parentIndex === 0 || !this.isLess(value, this.values[parentIndex])) break;
17
+ this.values[index] = this.values[parentIndex];
18
+ this.indices[this.values[index]] = index;
19
+ index = parentIndex;
20
+ }
21
+ this.values[index] = value;
22
+ this.indices[value] = index;
23
+ }
24
+
25
+ private moveDown(start: number) {
26
+ let index = start;
27
+ const value = this.values[index];
28
+ const size = this.values.length;
29
+ for (;;) {
30
+ const left = 2 * index;
31
+ if (left >= size) break;
32
+ const right = left + 1;
33
+ const minIndex =
34
+ right < size && this.isLess(this.values[right], this.values[left]) ? right : left;
35
+ const minValue = this.values[minIndex];
36
+ if (!this.isLess(minValue, value)) break;
37
+ this.values[index] = minValue;
38
+ this.indices[minValue] = index;
39
+ index = minIndex;
40
+ }
41
+ this.values[index] = value;
42
+ this.indices[value] = index;
43
+ }
44
+
45
+ contains(value: number) {
46
+ return value < this.indices.length && this.indices[value] !== 0;
47
+ }
48
+
49
+ isEmpty() {
50
+ return this.values.length === 1;
51
+ }
52
+
53
+ private insert(value: number) {
54
+ const index = this.values.length;
55
+ this.indices[value] = index;
56
+ this.values.push(value);
57
+ this.moveUp(index);
58
+ }
59
+
60
+ private erase(value: number) {
61
+ const index = this.indices[value];
62
+ if (index === this.values.length - 1) {
63
+ this.indices[value] = 0;
64
+ this.values.pop();
65
+ return;
66
+ }
67
+ const last = this.values[this.values.length - 1];
68
+ this.values[index] = last;
69
+ this.indices[last] = index;
70
+ this.indices[value] = 0;
71
+ this.values.pop();
72
+ const parentIndex = index >> 1;
73
+ if (parentIndex !== 0 && this.isLess(last, this.values[parentIndex])) this.moveUp(index);
74
+ else this.moveDown(index);
75
+ }
76
+
77
+ activityIncreased(value: number) {
78
+ if (this.contains(value)) this.moveUp(this.indices[value]);
79
+ }
80
+
81
+ mkVar(value: number) {
82
+ while (this.indices.length <= value) this.indices.push(0);
83
+ this.unassignVar(value);
84
+ }
85
+
86
+ delVar(value: number) {
87
+ if (this.contains(value)) this.erase(value);
88
+ }
89
+
90
+ unassignVar(value: number) {
91
+ if (!this.contains(value)) this.insert(value);
92
+ }
93
+
94
+ nextVar() {
95
+ const result = this.values[1];
96
+ if (this.values.length === 2) {
97
+ this.indices[result] = 0;
98
+ this.values.pop();
99
+ return result;
100
+ }
101
+ const last = this.values[this.values.length - 1];
102
+ this.values[1] = last;
103
+ this.indices[last] = 1;
104
+ this.indices[result] = 0;
105
+ this.values.pop();
106
+ this.moveDown(1);
107
+ return result;
108
+ }
109
+
110
+ minVar() {
111
+ return this.values[1];
112
+ }
113
+
114
+ isMoreActive(first: number, second: number) {
115
+ return this.isLess(first, second);
116
+ }
117
+ }
@@ -0,0 +1,140 @@
1
+ export const WATCH_BINARY = 0;
2
+ export const WATCH_CLAUSE = 1;
3
+ export const WATCH_EXT_CONSTRAINT = 2;
4
+
5
+ export const mkBinaryWatch = (isLearned: boolean) => (isLearned ? 4 : 0);
6
+
7
+ export const mkClauseWatch = (blockedLit: number) => WATCH_CLAUSE + (blockedLit << 2);
8
+
9
+ export class WatchList {
10
+ data = new Int32Array(8);
11
+ size = 0;
12
+
13
+ push(val1: number, val2: number) {
14
+ if (2 * this.size + 2 > this.data.length) {
15
+ const data = new Int32Array(this.data.length * 2);
16
+ data.set(this.data);
17
+ this.data = data;
18
+ }
19
+ this.data[2 * this.size] = val1;
20
+ this.data[2 * this.size + 1] = val2;
21
+ this.size++;
22
+ }
23
+
24
+ pushBinary(lit: number, isLearned: boolean) {
25
+ this.push(lit, mkBinaryWatch(isLearned));
26
+ }
27
+
28
+ pushClause(blockedLit: number, clause: number) {
29
+ this.push(clause, mkClauseWatch(blockedLit));
30
+ }
31
+
32
+ val1(index: number) {
33
+ return this.data[2 * index];
34
+ }
35
+
36
+ val2(index: number) {
37
+ return this.data[2 * index + 1];
38
+ }
39
+
40
+ getKind(index: number) {
41
+ return this.data[2 * index + 1] & 3;
42
+ }
43
+
44
+ isBinary(index: number) {
45
+ return (this.data[2 * index + 1] & 3) === WATCH_BINARY;
46
+ }
47
+
48
+ isClause(index: number) {
49
+ return (this.data[2 * index + 1] & 3) === WATCH_CLAUSE;
50
+ }
51
+
52
+ getLiteral(index: number) {
53
+ return this.data[2 * index];
54
+ }
55
+
56
+ isLearned(index: number) {
57
+ return ((this.data[2 * index + 1] >> 2) & 1) === 1;
58
+ }
59
+
60
+ setLearned(index: number, isLearned: boolean) {
61
+ this.data[2 * index + 1] = isLearned
62
+ ? this.data[2 * index + 1] | 4
63
+ : this.data[2 * index + 1] & ~4;
64
+ }
65
+
66
+ numNonlearnedBin() {
67
+ let count = 0;
68
+ for (let index = 0; index < this.size; index++)
69
+ if (this.isBinary(index) && !this.isLearned(index)) count++;
70
+ return count;
71
+ }
72
+
73
+ getClause(index: number) {
74
+ return this.data[2 * index];
75
+ }
76
+
77
+ getBlockedLiteral(index: number) {
78
+ return this.data[2 * index + 1] >> 2;
79
+ }
80
+
81
+ setClause(index: number, blockedLit: number, clause: number) {
82
+ this.data[2 * index] = clause;
83
+ this.data[2 * index + 1] = mkClauseWatch(blockedLit);
84
+ }
85
+
86
+ copy(target: number, source: number) {
87
+ this.data[2 * target] = this.data[2 * source];
88
+ this.data[2 * target + 1] = this.data[2 * source + 1];
89
+ }
90
+
91
+ setEnd(size: number) {
92
+ this.size = size;
93
+ }
94
+
95
+ reset() {
96
+ this.size = 0;
97
+ }
98
+
99
+ finalize() {
100
+ this.data = new Int32Array(8);
101
+ this.size = 0;
102
+ }
103
+
104
+ findBinary(lit: number) {
105
+ for (let index = 0; index < this.size; index++)
106
+ if (this.isBinary(index) && this.data[2 * index] === lit) return index;
107
+ return -1;
108
+ }
109
+
110
+ eraseAt(position: number) {
111
+ this.data.copyWithin(2 * position, 2 * position + 2, 2 * this.size);
112
+ this.size--;
113
+ }
114
+
115
+ erase(val1: number, val2: number) {
116
+ for (let index = 0; index < this.size; index++)
117
+ if (this.data[2 * index] === val1 && this.data[2 * index + 1] === val2) {
118
+ this.eraseAt(index);
119
+ return;
120
+ }
121
+ }
122
+
123
+ eraseClause(clause: number) {
124
+ for (let index = 0; index < this.size; index++)
125
+ if (this.isClause(index) && this.data[2 * index] === clause) {
126
+ this.eraseAt(index);
127
+ return true;
128
+ }
129
+ return false;
130
+ }
131
+
132
+ sortBinariesFirst() {
133
+ const binaries: number[] = [];
134
+ const others: number[] = [];
135
+ for (let index = 0; index < this.size; index++)
136
+ (this.isBinary(index) ? binaries : others).push(this.val1(index), this.val2(index));
137
+ this.data.set(binaries, 0);
138
+ this.data.set(others, binaries.length);
139
+ }
140
+ }
@@ -0,0 +1,284 @@
1
+ import { SmtInvariantError } from "../../../errors";
2
+ import type { AstManager } from "./ast";
3
+ import { RandomGen } from "./random-gen";
4
+
5
+ const STATUS_OPEN = 0;
6
+ const STATUS_CLOSED = 1;
7
+ const STATUS_ACTIVE = 2;
8
+
9
+ // A literal is an expression, and -1 stands for the root's null literal.
10
+ export class SearchNode {
11
+ left: SearchNode | undefined;
12
+ right: SearchNode | undefined;
13
+ status = STATUS_OPEN;
14
+ core: number[] = [];
15
+ numActivations = 0;
16
+ effortSpent = 0;
17
+ private roundMaxEffort = 0;
18
+ private activeWorkers = 0;
19
+
20
+ constructor(
21
+ readonly literal: number,
22
+ readonly parent: SearchNode | undefined,
23
+ ) {}
24
+
25
+ get isLeaf() {
26
+ return this.left === undefined && this.right === undefined;
27
+ }
28
+
29
+ get depth() {
30
+ let depth = 0;
31
+ for (let node = this.parent; node !== undefined; node = node.parent) depth++;
32
+ return depth;
33
+ }
34
+
35
+ markNewActivation() {
36
+ this.status = STATUS_ACTIVE;
37
+ this.numActivations++;
38
+ this.activeWorkers++;
39
+ }
40
+
41
+ decActiveWorkers() {
42
+ if (this.activeWorkers > 0) this.activeWorkers--;
43
+ if (this.activeWorkers === 0 && this.status === STATUS_ACTIVE) {
44
+ this.roundMaxEffort = 0;
45
+ this.status = STATUS_OPEN;
46
+ }
47
+ }
48
+
49
+ updateRoundMaxEffort(effort: number) {
50
+ if (effort <= this.roundMaxEffort) return;
51
+ this.effortSpent += effort - this.roundMaxEffort;
52
+ this.roundMaxEffort = effort;
53
+ }
54
+ }
55
+
56
+ interface Candidate {
57
+ node: SearchNode | undefined;
58
+ scaledEffort: number;
59
+ depth: number;
60
+ }
61
+
62
+ const getAtom = (manager: AstManager, literal: number) =>
63
+ manager.isNot(literal) ? manager.getArg(literal, 0) : literal;
64
+
65
+ const isPathContainingAtom = (manager: AstManager, node: SearchNode, literal: number) => {
66
+ const atom = getAtom(manager, literal);
67
+ for (let current: SearchNode | undefined = node; current !== undefined; current = current.parent)
68
+ if (current.literal !== -1 && getAtom(manager, current.literal) === atom) return true;
69
+ return false;
70
+ };
71
+
72
+ const isBetter = (first: Candidate, second: Candidate) => {
73
+ if (first.node === undefined) return false;
74
+ if (second.node === undefined) return true;
75
+ if (first.scaledEffort !== second.scaledEffort) return first.scaledEffort < second.scaledEffort;
76
+ return first.depth > second.depth;
77
+ };
78
+
79
+ export const isAncestor = (ancestor: SearchNode, node: SearchNode | undefined) => {
80
+ for (let current = node; current !== undefined; current = current.parent)
81
+ if (current === ancestor) return true;
82
+ return false;
83
+ };
84
+
85
+ export const isPathContaining = (node: SearchNode, literal: number) => {
86
+ for (let current: SearchNode | undefined = node; current !== undefined; current = current.parent)
87
+ if (current.literal === literal) return true;
88
+ return false;
89
+ };
90
+
91
+ const getSiblingResolvent = (left: SearchNode, right: SearchNode) => {
92
+ const resolvent: number[] = [];
93
+ if (left.core.length === 0 || right.core.length === 0 || left.parent !== right.parent)
94
+ return resolvent;
95
+ for (const literal of left.core)
96
+ if (literal !== left.literal && !resolvent.includes(literal)) resolvent.push(literal);
97
+ for (const literal of right.core)
98
+ if (literal !== right.literal && !resolvent.includes(literal)) resolvent.push(literal);
99
+ return resolvent;
100
+ };
101
+
102
+ const close = (node: SearchNode | undefined, core: number[]) => {
103
+ if (node === undefined || node.status === STATUS_CLOSED) return;
104
+ node.status = STATUS_CLOSED;
105
+ node.core = core;
106
+ close(node.left, core);
107
+ close(node.right, core);
108
+ };
109
+
110
+ export class SearchTree {
111
+ root = new SearchNode(-1, undefined);
112
+ private random = new RandomGen(0);
113
+ private effortUnit = 1000;
114
+
115
+ constructor(private manager: AstManager) {}
116
+
117
+ setEffortUnit(effortUnit: number) {
118
+ this.effortUnit = Math.max(1, effortUnit);
119
+ }
120
+
121
+ private getScaledEffort(node: SearchNode) {
122
+ return Math.trunc(node.effortSpent / Math.max(1, this.effortUnit));
123
+ }
124
+
125
+ private selectNextNode(node: SearchNode | undefined, status: number, best: Candidate) {
126
+ if (node === undefined || node.status === STATUS_CLOSED) return;
127
+ if (node.status === status) {
128
+ const candidate = { node, scaledEffort: this.getScaledEffort(node), depth: node.depth };
129
+ if (isBetter(candidate, best)) Object.assign(best, candidate);
130
+ }
131
+ this.selectNextNode(node.left, status, best);
132
+ this.selectNextNode(node.right, status, best);
133
+ }
134
+
135
+ private hasUnvisitedOpenNode(node: SearchNode | undefined): boolean {
136
+ if (node === undefined || node.status === STATUS_CLOSED) return false;
137
+ if (node.status === STATUS_OPEN && node.numActivations === 0) return true;
138
+ return this.hasUnvisitedOpenNode(node.left) || this.hasUnvisitedOpenNode(node.right);
139
+ }
140
+
141
+ private countUnsolvedNodes(node: SearchNode | undefined): number {
142
+ if (node === undefined || node.status === STATUS_CLOSED) return 0;
143
+ return 1 + this.countUnsolvedNodes(node.left) + this.countUnsolvedNodes(node.right);
144
+ }
145
+
146
+ private countActiveNodes(node: SearchNode | undefined): number {
147
+ if (node === undefined || node.status === STATUS_CLOSED) return 0;
148
+ return (
149
+ (node.status === STATUS_ACTIVE ? 1 : 0) +
150
+ this.countActiveNodes(node.left) +
151
+ this.countActiveNodes(node.right)
152
+ );
153
+ }
154
+
155
+ private getShallowestTimedOutLeafDepth(node: SearchNode | undefined): number {
156
+ if (node === undefined || node.status === STATUS_CLOSED) return Infinity;
157
+ return Math.min(
158
+ node.isLeaf && node.effortSpent > 0 ? node.depth : Infinity,
159
+ this.getShallowestTimedOutLeafDepth(node.left),
160
+ this.getShallowestTimedOutLeafDepth(node.right),
161
+ );
162
+ }
163
+
164
+ // m_min_tree_size is 0, so the throttle always applies.
165
+ private shouldSplit(node: SearchNode) {
166
+ if (node.status !== STATUS_ACTIVE || !node.isLeaf) return false;
167
+ const numActiveNodes = this.countActiveNodes(this.root);
168
+ if (this.countUnsolvedNodes(this.root) >= numActiveNodes * 2) return false;
169
+ if (this.hasUnvisitedOpenNode(this.root)) return false;
170
+ if (this.random.next() % 2 !== 0) return false;
171
+ return node.depth === this.getShallowestTimedOutLeafDepth(this.root);
172
+ }
173
+
174
+ private findHighestAttach(node: SearchNode, resolvent: number[]) {
175
+ let attach = node;
176
+ for (let candidate: SearchNode | undefined = node; candidate !== undefined;) {
177
+ const current: SearchNode = candidate;
178
+ if (resolvent.every((literal) => isPathContaining(current, literal))) attach = current;
179
+ candidate = current.parent;
180
+ }
181
+ return attach;
182
+ }
183
+
184
+ private propagateClosureUpward(node: SearchNode) {
185
+ for (let current = node; ;) {
186
+ const parent = current.parent;
187
+ if (parent?.left === undefined || parent.right === undefined) return;
188
+ if (parent.left.status !== STATUS_CLOSED || parent.right.status !== STATUS_CLOSED) return;
189
+ if (parent.left.core.length === 0 || parent.right.core.length === 0) return;
190
+ const resolvent = getSiblingResolvent(parent.left, parent.right);
191
+ if (resolvent.length === 0) {
192
+ close(this.root, resolvent);
193
+ return;
194
+ }
195
+ close(parent, resolvent);
196
+ current = parent;
197
+ }
198
+ }
199
+
200
+ private closeWithCore(node: SearchNode, core: number[]) {
201
+ if (node.status === STATUS_CLOSED && node.core.every((literal) => core.includes(literal)))
202
+ return;
203
+ const parent = node.parent;
204
+ if (parent !== undefined && core.every((literal) => literal !== node.literal)) {
205
+ this.closeWithCore(parent, core);
206
+ return;
207
+ }
208
+ close(node, core);
209
+ if (parent?.left === undefined || parent.right === undefined) return;
210
+ if (parent.left.status !== STATUS_CLOSED || parent.right.status !== STATUS_CLOSED) return;
211
+ if (parent.left.core.length === 0 || parent.right.core.length === 0) return;
212
+ const resolvent = getSiblingResolvent(parent.left, parent.right);
213
+ if (resolvent.length === 0) {
214
+ close(this.root, resolvent);
215
+ return;
216
+ }
217
+ const attach = this.findHighestAttach(parent, resolvent);
218
+ close(attach, resolvent);
219
+ this.propagateClosureUpward(attach);
220
+ }
221
+
222
+ trySplit(node: SearchNode, literal: number, negation: number, effort: number) {
223
+ if (this.isLeaseCanceled(node)) return false;
224
+ node.updateRoundMaxEffort(effort);
225
+ if (!this.shouldSplit(node)) return false;
226
+ if (isPathContainingAtom(this.manager, node, literal))
227
+ throw new SmtInvariantError("the search tree splits on an atom of its path");
228
+ node.left = new SearchNode(literal, node);
229
+ node.right = new SearchNode(negation, node);
230
+ return true;
231
+ }
232
+
233
+ // The conflict's literals are on the path from the root to the node, or are assumptions.
234
+ backtrack(node: SearchNode, conflict: number[]) {
235
+ if (conflict.length === 0) {
236
+ this.closeWithCore(this.root, conflict);
237
+ return;
238
+ }
239
+ for (let current: SearchNode | undefined = node; current !== undefined;) {
240
+ const literal = current.literal;
241
+ if (conflict.includes(literal)) {
242
+ this.closeWithCore(current, conflict);
243
+ return;
244
+ }
245
+ current = current.parent;
246
+ }
247
+ throw new SmtInvariantError("the conflict has no literal of the search tree's path");
248
+ }
249
+
250
+ activateBestNode() {
251
+ const best: Candidate = { node: undefined, scaledEffort: Infinity, depth: 0 };
252
+ this.selectNextNode(this.root, STATUS_OPEN, best);
253
+ if (best.node === undefined) this.selectNextNode(this.root, STATUS_ACTIVE, best);
254
+ best.node?.markNewActivation();
255
+ return best.node;
256
+ }
257
+
258
+ activateRoot() {
259
+ if (this.root.status === STATUS_CLOSED) return undefined;
260
+ this.root.markNewActivation();
261
+ return this.root;
262
+ }
263
+
264
+ findNonclosedNodesWithLiteral(literal: number) {
265
+ const found: SearchNode[] = [];
266
+ const visit = (node: SearchNode | undefined) => {
267
+ if (node === undefined) return;
268
+ if (node.literal !== -1 && node.literal === literal && node.status !== STATUS_CLOSED)
269
+ found.push(node);
270
+ visit(node.left);
271
+ visit(node.right);
272
+ };
273
+ visit(this.root);
274
+ return found;
275
+ }
276
+
277
+ isLeaseCanceled(node: SearchNode) {
278
+ return node.status === STATUS_CLOSED;
279
+ }
280
+
281
+ get isClosed() {
282
+ return this.root.status === STATUS_CLOSED;
283
+ }
284
+ }