tla-ts 0.0.9 → 0.0.10-dev.06b481ee0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (631) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +48 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +122 -12
  8. package/dist/index.d.ts +122 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1156 -888
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +330 -659
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +263 -370
  51. package/src/errors.ts +107 -57
  52. package/src/evaluate.ts +898 -369
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +137 -22
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -322
  64. package/src/liveness.ts +230 -133
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +36 -60
  88. package/src/parallel.ts +64 -73
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +135 -40
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +299 -108
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +479 -0
  612. package/src/typescript/collections.ts +614 -0
  613. package/src/typescript/compile.ts +63 -0
  614. package/src/typescript/context.ts +94 -0
  615. package/src/typescript/emit.ts +121 -0
  616. package/src/typescript/expressions.ts +496 -0
  617. package/src/typescript/formula.ts +154 -0
  618. package/src/typescript/functions.ts +284 -0
  619. package/src/typescript/model.ts +162 -0
  620. package/src/typescript/names.ts +114 -0
  621. package/src/typescript/program.ts +48 -0
  622. package/src/typescript/properties.ts +139 -0
  623. package/src/typescript/scope.ts +112 -0
  624. package/src/typescript/steps.ts +167 -0
  625. package/src/typescript/types.ts +171 -0
  626. package/src/values.ts +945 -526
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -1,77 +1,82 @@
1
- // Ported from Z3 (src/smt/smt_cg_table.h, src/smt/smt_cg_table.cpp), MIT license, see
2
- // z3-license.txt. The congruence table maps a declaration and the roots of its arguments to the
3
- // congruence root, so f(a) and f(b) meet when a and b are merged. Equalities are commutative.
4
1
  import { CONGRUENCE_JUSTIFICATIONS, type Enode } from "./enode";
5
2
 
6
- // The hash of an equality between the classes of first and second, in either order.
3
+ // The smt enode and the euf enode share the congruence table.
4
+ export interface CgNode {
5
+ readonly owner: number;
6
+ readonly decl: number;
7
+ readonly numArgs: number;
8
+ readonly isCommutative: boolean;
9
+ // Whether cg_table::mk_table_for gives the declaration the binary commutative table.
10
+ readonly isCommutativeTable: boolean;
11
+ readonly root: CgNode;
12
+ getArg(index: number): CgNode;
13
+ }
14
+
7
15
  const getEqHash = (decl: number, first: number, second: number) =>
8
16
  first < second
9
17
  ? (Math.imul(Math.imul(decl, 0x9e3779b1) + first, 0x85ebca6b) + second) | 0
10
18
  : (Math.imul(Math.imul(decl, 0x9e3779b1) + second, 0x85ebca6b) + first) | 0;
11
19
 
12
- const getHash = (decl: number, args: Enode[], isEq: boolean) => {
13
- if (isEq) return getEqHash(decl, args[0].root.owner, args[1].root.owner);
20
+ const getHash = (decl: number, args: readonly CgNode[], isCommutativeTable: boolean) => {
21
+ if (isCommutativeTable) return getEqHash(decl, args[0].root.owner, args[1].root.owner);
14
22
  let hash = decl;
15
23
  for (let index = 0; index < args.length; index++)
16
24
  hash = (Math.imul(hash, 0x9e3779b1) + args[index].root.owner) | 0;
17
25
  return hash;
18
26
  };
19
27
 
20
- const getNodeHash = (node: Enode) => {
21
- if (node.isEq) return getEqHash(node.decl, node.getArg(0).root.owner, node.getArg(1).root.owner);
28
+ const getNodeHash = (node: CgNode) => {
29
+ if (node.isCommutativeTable)
30
+ return getEqHash(node.decl, node.getArg(0).root.owner, node.getArg(1).root.owner);
22
31
  let hash = node.decl;
23
32
  for (let index = 0; index < node.numArgs; index++)
24
33
  hash = (Math.imul(hash, 0x9e3779b1) + node.getArg(index).root.owner) | 0;
25
34
  return hash;
26
35
  };
27
36
 
28
- // Whether node is decl applied to nodes equal to first and second, in either order for an equality.
29
- const isPairCongruentTo = (node: Enode, first: Enode, second: Enode, isEq: boolean) => {
37
+ const isPairCongruentTo = (node: CgNode, first: CgNode, second: CgNode, isCommutative: boolean) => {
30
38
  const nodeFirst = node.getArg(0).root;
31
39
  const nodeSecond = node.getArg(1).root;
32
40
  return (
33
41
  (nodeFirst === first.root && nodeSecond === second.root) ||
34
- (isEq && nodeFirst === second.root && nodeSecond === first.root)
42
+ (isCommutative && nodeFirst === second.root && nodeSecond === first.root)
35
43
  );
36
44
  };
37
45
 
38
- const isCongruentTo = (node: Enode, decl: number, args: Enode[], isEq: boolean) => {
46
+ const isCongruentTo = (node: CgNode, decl: number, args: readonly CgNode[]) => {
39
47
  if (node.decl !== decl || node.numArgs !== args.length) return false;
40
- if (isEq) return isPairCongruentTo(node, args[0], args[1], true);
48
+ if (node.isCommutative) return isPairCongruentTo(node, args[0], args[1], true);
41
49
  for (let index = 0; index < args.length; index++)
42
50
  if (node.getArg(index).root !== args[index].root) return false;
43
51
  return true;
44
52
  };
45
53
 
46
- // congruent: whether two nodes apply one declaration to equal arguments. Only equalities are
47
- // commutative.
48
- export const isCongruent = (first: Enode, second: Enode) => {
54
+ export const isCongruent = (first: CgNode, second: CgNode) => {
49
55
  if (first.decl !== second.decl || first.numArgs !== second.numArgs) return false;
50
56
  if (first.numArgs === 2)
51
- return isPairCongruentTo(first, second.getArg(0), second.getArg(1), first.isEq);
57
+ return isPairCongruentTo(first, second.getArg(0), second.getArg(1), first.isCommutative);
52
58
  for (let index = 0; index < first.numArgs; index++)
53
59
  if (first.getArg(index).root !== second.getArg(index).root) return false;
54
60
  return true;
55
61
  };
56
62
 
57
- // The justification of a node's equality with the congruent node that the table returned for it.
58
63
  export const getCongruenceJustification = (node: Enode, congruent: Enode) =>
59
- CONGRUENCE_JUSTIFICATIONS[node.isEq && congruent.getArg(0).root !== node.getArg(0).root ? 1 : 0];
64
+ CONGRUENCE_JUSTIFICATIONS[
65
+ node.isCommutative && congruent.getArg(0).root !== node.getArg(0).root ? 1 : 0
66
+ ];
60
67
 
61
68
  const EMPTY = 0;
62
69
  const FULL = 1;
63
70
  const DELETED = 2;
64
71
 
65
- // Open addressing with linear probing. An erased node leaves a deleted slot, which probes pass over,
66
- // until the table is rebuilt.
67
- export class CgTable {
68
- private nodes = Array<Enode | null>(1024).fill(null);
72
+ export class CgTable<Node extends CgNode = Enode> {
73
+ private nodes = Array<Node | null>(1024).fill(null);
69
74
  private hashes = new Int32Array(1024);
70
75
  private states = new Uint8Array(1024);
71
76
  private numFull = 0;
72
77
  private numDeleted = 0;
73
78
 
74
- private find(decl: number, args: Enode[], isEq: boolean, hash: number) {
79
+ private find(decl: number, args: readonly CgNode[], hash: number) {
75
80
  const mask = this.states.length - 1;
76
81
  for (let slot = hash & mask; this.states[slot] !== EMPTY; slot = (slot + 1) & mask) {
77
82
  const node = this.nodes[slot];
@@ -79,14 +84,14 @@ export class CgTable {
79
84
  this.states[slot] === FULL &&
80
85
  this.hashes[slot] === hash &&
81
86
  node !== null &&
82
- isCongruentTo(node, decl, args, isEq)
87
+ isCongruentTo(node, decl, args)
83
88
  )
84
89
  return node;
85
90
  }
86
91
  return undefined;
87
92
  }
88
93
 
89
- private findNode(node: Enode, hash: number) {
94
+ private findNode(node: CgNode, hash: number) {
90
95
  const mask = this.states.length - 1;
91
96
  for (let slot = hash & mask; this.states[slot] !== EMPTY; slot = (slot + 1) & mask) {
92
97
  const candidate = this.nodes[slot];
@@ -101,8 +106,7 @@ export class CgTable {
101
106
  return undefined;
102
107
  }
103
108
 
104
- // Returns the congruence root for node, which is node itself when it is new.
105
- insert(node: Enode) {
109
+ insert(node: Node) {
106
110
  const hash = getNodeHash(node);
107
111
  const existing = this.findNode(node, hash);
108
112
  if (existing !== undefined) return existing;
@@ -115,20 +119,19 @@ export class CgTable {
115
119
  return node;
116
120
  }
117
121
 
118
- private place(slot: number, node: Enode, hash: number) {
122
+ private place(slot: number, node: Node, hash: number) {
119
123
  this.nodes[slot] = node;
120
124
  this.hashes[slot] = hash;
121
125
  this.states[slot] = FULL;
122
126
  this.numFull++;
123
127
  }
124
128
 
125
- // Drops the deleted slots, and doubles the table when it is more than a quarter full.
126
129
  private rebuild() {
127
130
  const nodes = this.nodes;
128
131
  const hashes = this.hashes;
129
132
  const states = this.states;
130
133
  const size = 4 * this.numFull > states.length ? 2 * states.length : states.length;
131
- this.nodes = Array<Enode | null>(size).fill(null);
134
+ this.nodes = Array<Node | null>(size).fill(null);
132
135
  this.hashes = new Int32Array(size);
133
136
  this.states = new Uint8Array(size);
134
137
  this.numFull = 0;
@@ -143,24 +146,22 @@ export class CgTable {
143
146
  }
144
147
  }
145
148
 
146
- // get_enode_eq_to: the congruence root of decl applied to nodes equal to args, if any.
147
- findFor(decl: number, args: Enode[], isEq: boolean) {
148
- return this.find(decl, args, isEq, getHash(decl, args, isEq));
149
+ findFor(decl: number, args: readonly CgNode[], isCommutativeTable: boolean) {
150
+ return this.find(decl, args, getHash(decl, args, isCommutativeTable));
149
151
  }
150
152
 
151
- // The congruence root of a node congruent to node.
152
- findCongruent(node: Enode) {
153
+ findCongruent(node: CgNode) {
153
154
  return this.findNode(node, getNodeHash(node));
154
155
  }
155
156
 
156
- private getSlot(node: Enode) {
157
+ private getSlot(node: CgNode) {
157
158
  const mask = this.states.length - 1;
158
159
  for (let slot = getNodeHash(node) & mask; this.states[slot] !== EMPTY; slot = (slot + 1) & mask)
159
160
  if (this.nodes[slot] === node) return slot;
160
161
  return -1;
161
162
  }
162
163
 
163
- erase(node: Enode) {
164
+ erase(node: CgNode) {
164
165
  const slot = this.getSlot(node);
165
166
  if (slot === -1) return;
166
167
  this.nodes[slot] = null;
@@ -168,8 +169,4 @@ export class CgTable {
168
169
  this.numFull--;
169
170
  this.numDeleted++;
170
171
  }
171
-
172
- contains(node: Enode) {
173
- return this.getSlot(node) !== -1;
174
- }
175
172
  }
@@ -0,0 +1,330 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_ARITH,
4
+ FAMILY_ARRAY,
5
+ FAMILY_BASIC,
6
+ FAMILY_BV,
7
+ FAMILY_CHAR,
8
+ FAMILY_DATATYPE,
9
+ FAMILY_FINITE_SET,
10
+ FAMILY_FPA,
11
+ FAMILY_LABEL,
12
+ FAMILY_MODEL_VALUE,
13
+ FAMILY_PB,
14
+ FAMILY_POLY,
15
+ FAMILY_RECFUN,
16
+ FAMILY_SEQ,
17
+ FAMILY_USER,
18
+ KIND_APP,
19
+ KIND_VAR,
20
+ OP_ADD,
21
+ OP_DISTINCT,
22
+ OP_DIV,
23
+ OP_EQ,
24
+ OP_GE,
25
+ OP_GT,
26
+ OP_IDIV,
27
+ OP_ITE,
28
+ OP_LE,
29
+ OP_LT,
30
+ OP_MOD,
31
+ OP_REM,
32
+ OP_MUL,
33
+ OP_NUM,
34
+ OP_SUB,
35
+ OP_TO_INT,
36
+ OP_TO_REAL,
37
+ OP_UMINUS,
38
+ SORT_BOOL,
39
+ SORT_INT,
40
+ SORT_REAL,
41
+ } from "./ast";
42
+ import { logicHasPb } from "./smt-logics";
43
+
44
+ interface LogicFlags {
45
+ isUf: boolean;
46
+ isDt: boolean;
47
+ isArrays: boolean;
48
+ isBvArrays: boolean;
49
+ isReals: boolean;
50
+ isInts: boolean;
51
+ isDiff: boolean;
52
+ isNonlinear: boolean;
53
+ isBvs: boolean;
54
+ isQuantifiers: boolean;
55
+ isAllowingCasts: boolean;
56
+ }
57
+
58
+ const NO_FLAGS: LogicFlags = {
59
+ isUf: false,
60
+ isDt: false,
61
+ isArrays: false,
62
+ isBvArrays: false,
63
+ isReals: false,
64
+ isInts: false,
65
+ isDiff: false,
66
+ isNonlinear: false,
67
+ isBvs: false,
68
+ isQuantifiers: false,
69
+ isAllowingCasts: false,
70
+ };
71
+
72
+ const STRING_FLAGS = {
73
+ isUf: true,
74
+ isBvs: true,
75
+ isInts: true,
76
+ isArrays: true,
77
+ isReals: true,
78
+ isQuantifiers: true,
79
+ };
80
+
81
+ const LOGICS = new Map<string, Partial<LogicFlags>>([
82
+ ["AUFLIA", { isUf: true, isArrays: true, isInts: true, isQuantifiers: true }],
83
+ ["AUFLIRA", { isUf: true, isArrays: true, isReals: true, isInts: true, isQuantifiers: true }],
84
+ [
85
+ "AUFNIRA",
86
+ {
87
+ isUf: true,
88
+ isArrays: true,
89
+ isReals: true,
90
+ isInts: true,
91
+ isNonlinear: true,
92
+ isQuantifiers: true,
93
+ },
94
+ ],
95
+ ["LRA", { isReals: true, isQuantifiers: true }],
96
+ ["QF_ABV", { isBvArrays: true, isBvs: true }],
97
+ ["QF_AUFBV", { isUf: true, isBvArrays: true, isBvs: true }],
98
+ ["QF_UFBV", { isUf: true, isBvs: true }],
99
+ ["QF_UFDT", { isUf: true, isDt: true }],
100
+ ["QF_DT", { isDt: true }],
101
+ ["QF_AUFLIA", { isUf: true, isArrays: true, isInts: true }],
102
+ ["QF_AX", { isArrays: true }],
103
+ ["QF_FF", {}],
104
+ ["QF_FFA", {}],
105
+ ["QF_BV", { isBvs: true }],
106
+ ["QF_IDL", { isInts: true, isDiff: true }],
107
+ ["QF_RDL", { isReals: true, isDiff: true }],
108
+ ["QF_LIA", { isInts: true }],
109
+ ["QF_LRA", { isReals: true }],
110
+ ["QF_NIA", { isInts: true, isNonlinear: true }],
111
+ ["QF_NRA", { isReals: true, isNonlinear: true }],
112
+ ["QF_NTA", { isReals: true, isNonlinear: true, isAllowingCasts: true }],
113
+ ["QF_UF", { isUf: true }],
114
+ ["QF_UFIDL", { isUf: true, isInts: true, isDiff: true }],
115
+ ["QF_UFLIA", { isUf: true, isInts: true }],
116
+ ["QF_UFLRA", { isUf: true, isReals: true }],
117
+ ["QF_UFNRA", { isUf: true, isReals: true, isNonlinear: true }],
118
+ ["UFLRA", { isUf: true, isReals: true, isQuantifiers: true }],
119
+ ["UFNIA", { isUf: true, isInts: true, isQuantifiers: true, isNonlinear: true }],
120
+ ["UFBV", { isUf: true, isBvs: true, isQuantifiers: true }],
121
+ ["QF_S", STRING_FLAGS],
122
+ ["QF_SLIA", STRING_FLAGS],
123
+ ["QF_FD", { isBvs: true, isUf: true, isInts: true, isDt: true, isNonlinear: true }],
124
+ ["SMTFD", { isBvs: true, isUf: true, isArrays: true }],
125
+ ]);
126
+
127
+ const FAMILY_NAMES = new Map([
128
+ [FAMILY_FINITE_SET, "finite_set"],
129
+ [FAMILY_DATATYPE, "datatype"],
130
+ [FAMILY_FPA, "fpa"],
131
+ [FAMILY_CHAR, "char"],
132
+ [FAMILY_PB, "pb"],
133
+ [FAMILY_RECFUN, "recfun"],
134
+ [FAMILY_POLY, "polymorphic"],
135
+ ]);
136
+
137
+ const NONLINEAR = "logic does not support nonlinear arithmetic";
138
+ const NON_DIFF = "logic only supports difference arithmetic";
139
+
140
+ export const createLogicChecker = (manager: AstManager, logic: string | undefined) => {
141
+ const known = logic === undefined ? undefined : LOGICS.get(logic);
142
+ const flags = { ...NO_FLAGS, ...known };
143
+
144
+ // Z3 rejects only the uninterpreted sorts of its null family, but declare-sort makes the sorts of
145
+ // its user sort family, which every logic accepts.
146
+ const checkSort = (sort: number): string | undefined => {
147
+ if (sort === SORT_BOOL) return undefined;
148
+ if (sort === SORT_INT) return flags.isInts ? undefined : "logic does not support integers";
149
+ if (sort === SORT_REAL) return flags.isReals ? undefined : "logic does not support reals";
150
+ if (manager.isBvSort(sort))
151
+ return flags.isBvs ? undefined : "logic does not support bitvectors";
152
+ if (manager.isDatatypeSort(sort))
153
+ return flags.isDt ? undefined : "logic does not support algebraic datatypes";
154
+ if (!manager.isArraySort(sort) || flags.isArrays) return undefined;
155
+ if (!flags.isBvArrays) return "logic does not support arrays";
156
+ const parameters = manager.getSortParameters(sort);
157
+ if (parameters.slice(0, -1).some((domain) => !manager.isBvSort(domain)))
158
+ return "logic supports only arrays from bitvectors to bitvectors";
159
+ return checkSort(manager.getArrayRange(sort));
160
+ };
161
+
162
+ const isIntNumeral = (expr: number) => {
163
+ const negated = manager.getOp(expr) === OP_UMINUS ? manager.getArg(expr, 0) : expr;
164
+ const real = manager.getOp(negated) === OP_TO_REAL ? manager.getArg(negated, 0) : negated;
165
+ return manager.getOp(real) === OP_NUM;
166
+ };
167
+
168
+ const isNumeral = (expr: number) => {
169
+ const negated = manager.getOp(expr) === OP_UMINUS ? manager.getArg(expr, 0) : expr;
170
+ return (
171
+ isIntNumeral(negated) ||
172
+ (manager.getOp(negated) === OP_DIV &&
173
+ isIntNumeral(manager.getArg(negated, 0)) &&
174
+ isIntNumeral(manager.getArg(negated, 1)))
175
+ );
176
+ };
177
+
178
+ const isArith = (expr: number) =>
179
+ manager.sorts[expr] === SORT_INT || manager.sorts[expr] === SORT_REAL;
180
+
181
+ const isDiffVar = (expr: number) =>
182
+ (manager.kinds[expr] === KIND_APP && manager.getFamily(expr) === FAMILY_USER) ||
183
+ manager.getOp(expr) === OP_ITE;
184
+
185
+ const isAddOrSub = (expr: number) =>
186
+ manager.getOp(expr) === OP_ADD || manager.getOp(expr) === OP_SUB;
187
+
188
+ const isOffset = (expr: number) => {
189
+ for (let current = expr; ;) {
190
+ const nonNumerals = manager.getArgs(current).filter((arg) => !isNumeral(arg));
191
+ if (nonNumerals.length > 1) return false;
192
+ if (nonNumerals.length === 0 || isDiffVar(nonNumerals[0])) return true;
193
+ if (!isAddOrSub(nonNumerals[0])) return false;
194
+ current = nonNumerals[0];
195
+ }
196
+ };
197
+
198
+ const isDiffArg = (expr: number) =>
199
+ isDiffVar(expr) || isNumeral(expr) || (isAddOrSub(expr) && isOffset(expr));
200
+
201
+ const hasSameArgs = (expr: number) => {
202
+ const args = manager.getArgs(expr);
203
+ return args.length > 0 && args.every((arg) => arg === args[0]);
204
+ };
205
+
206
+ const checkDiffPredicate = (expr: number) => {
207
+ const first = manager.getArg(expr, 0);
208
+ const second = manager.getArg(expr, 1);
209
+ if (!isArith(first) || (isDiffArg(first) && isDiffArg(second))) return undefined;
210
+ const [lhs, rhs] = isNumeral(first) ? [second, first] : [first, second];
211
+ if (!isNumeral(rhs) || manager.getOp(lhs) !== OP_SUB || manager.getNumArgs(lhs) !== 2)
212
+ return NON_DIFF;
213
+ const minuend = manager.getArg(lhs, 0);
214
+ const subtrahend = manager.getArg(lhs, 1);
215
+ if (isDiffVar(minuend) && isDiffVar(subtrahend)) return undefined;
216
+ if (manager.getOp(minuend) !== OP_ADD || manager.getOp(subtrahend) !== OP_ADD) return NON_DIFF;
217
+ return manager.getNumArgs(minuend) === manager.getNumArgs(subtrahend) &&
218
+ hasSameArgs(minuend) &&
219
+ hasSameArgs(subtrahend)
220
+ ? undefined
221
+ : NON_DIFF;
222
+ };
223
+
224
+ // check_diff_args tests the application itself once for each argument.
225
+ const checkDiffArgs = (expr: number) =>
226
+ manager.getNumArgs(expr) > 0 && isArith(expr) && !isDiffArg(expr) ? NON_DIFF : undefined;
227
+
228
+ const checkArith = (expr: number) => {
229
+ const op = manager.getOp(expr);
230
+ const args = manager.getArgs(expr);
231
+ if (op === OP_MUL && !flags.isNonlinear && args.filter((arg) => !isNumeral(arg)).length > 1)
232
+ return NONLINEAR;
233
+ if (
234
+ (op === OP_DIV || op === OP_IDIV || op === OP_REM || op === OP_MOD) &&
235
+ (args.length !== 2 || (!flags.isNonlinear && !isNumeral(args[1])))
236
+ )
237
+ return NONLINEAR;
238
+ if (flags.isDiff && (op === OP_LE || op === OP_LT || op === OP_GE || op === OP_GT)) {
239
+ const error = checkDiffPredicate(expr);
240
+ if (error !== undefined) return error;
241
+ }
242
+ if (
243
+ (!flags.isInts || !flags.isReals) &&
244
+ !flags.isAllowingCasts &&
245
+ (op === OP_TO_REAL || op === OP_TO_INT)
246
+ )
247
+ return "logic does not support casting operators";
248
+ return undefined;
249
+ };
250
+
251
+ const checkApp = (expr: number) => {
252
+ const sortError = checkSort(manager.sorts[expr]);
253
+ if (sortError !== undefined) return sortError;
254
+ const family = manager.getFamily(expr);
255
+ if (family === FAMILY_USER) {
256
+ if (!flags.isUf && manager.getNumArgs(expr) > 0)
257
+ return "logic does not support uninterpreted functions";
258
+ return flags.isDiff ? checkDiffArgs(expr) : undefined;
259
+ }
260
+ if (family === FAMILY_ARITH) return checkArith(expr);
261
+ if (family === FAMILY_BV) return undefined;
262
+ if (family === FAMILY_ARRAY) return flags.isDiff ? checkDiffArgs(expr) : undefined;
263
+ if (family === FAMILY_BASIC) {
264
+ if (!flags.isDiff) return undefined;
265
+ const op = manager.getOp(expr);
266
+ if (op === OP_EQ) return checkDiffPredicate(expr);
267
+ return op === OP_DISTINCT || op === OP_ITE ? checkDiffArgs(expr) : undefined;
268
+ }
269
+ if (family === FAMILY_MODEL_VALUE || family === FAMILY_LABEL) return undefined;
270
+ if (family === FAMILY_SEQ || manager.isCharSort(manager.sorts[expr])) return undefined;
271
+ if (family === FAMILY_DATATYPE && flags.isDt) return undefined;
272
+ if (family === FAMILY_PB && logic !== undefined && logicHasPb(logic)) return undefined;
273
+ return `logic does not support theory ${FAMILY_NAMES.get(family)}`;
274
+ };
275
+
276
+ const checkNode = (expr: number) => {
277
+ const kind = manager.kinds[expr];
278
+ if (kind === KIND_APP) return checkApp(expr);
279
+ if (!flags.isQuantifiers) return "logic does not support quantifiers";
280
+ return kind === KIND_VAR ? checkSort(manager.sorts[expr]) : undefined;
281
+ };
282
+
283
+ const getChildren = (expr: number) => {
284
+ if (manager.kinds[expr] === KIND_APP) return manager.getArgs(expr);
285
+ if (manager.kinds[expr] === KIND_VAR) return [];
286
+ const data = manager.getQuantifier(expr);
287
+ return [data.body, ...data.patterns, ...data.noPatterns];
288
+ };
289
+
290
+ // quick_for_each_expr visits each term once, after its arguments, and a quantifier's body
291
+ // before its patterns.
292
+ const checkExpr = (expr: number) => {
293
+ if (known === undefined) return undefined;
294
+ const visited = new Set([expr]);
295
+ const exprs = [expr];
296
+ const children = [getChildren(expr)];
297
+ const nextChildren = [0];
298
+ while (exprs.length > 0) {
299
+ const top = exprs.length - 1;
300
+ const child = children[top][nextChildren[top]++];
301
+ if (child === undefined) {
302
+ const error = checkNode(exprs.pop() as number);
303
+ if (error !== undefined) return error;
304
+ children.pop();
305
+ nextChildren.pop();
306
+ continue;
307
+ }
308
+ if (visited.has(child)) continue;
309
+ visited.add(child);
310
+ exprs.push(child);
311
+ children.push(getChildren(child));
312
+ nextChildren.push(0);
313
+ }
314
+ return undefined;
315
+ };
316
+
317
+ const checkDecl = (decl: number) => {
318
+ if (known === undefined) return undefined;
319
+ const funcDecl = manager.funcDecls[decl];
320
+ if (funcDecl.domain.length > 0 && !flags.isUf && funcDecl.family === FAMILY_USER)
321
+ return "logic does not support uninterpreted functions";
322
+ for (const sort of funcDecl.domain) {
323
+ const error = checkSort(sort);
324
+ if (error !== undefined) return error;
325
+ }
326
+ return checkSort(funcDecl.range);
327
+ };
328
+
329
+ return { checkExpr, checkDecl };
330
+ };
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_clause.h, src/smt/smt_b_justification.h,
2
- // src/util/small_object_allocator.cpp), MIT license, see z3-license.txt. Disjunctions of literals,
3
- // and the reasons a literal is assigned.
4
1
  import { SmtInvariantError } from "../../../errors";
5
2
  import type { Justification } from "./enode";
6
3
  import type { Literal } from "./literal";
@@ -11,16 +8,12 @@ export const CLS_LEARNED = 1;
11
8
  export const CLS_TH_AXIOM = 2;
12
9
  export const CLS_TH_LEMMA = 3;
13
10
 
14
- // b_justification(l) of BIN_CLAUSE kind: a binary clause propagated because the literal l became true.
15
11
  export class BinJustification {
16
12
  constructor(readonly literal: Literal) {}
17
13
  }
18
14
 
19
- // b_justification: a clause, a binary clause, a theory justification, an axiom, or a decision (null).
20
15
  export type BJustification = number | BinJustification | Justification | "axiom" | null;
21
16
 
22
- // The second header word packs Z3's bit fields: m_capacity:24, m_kind:2, m_reinit,
23
- // m_reinternalize_atoms, m_has_atoms, m_has_del_eh, m_has_justification and m_deleted.
24
17
  const CAPACITY_MASK = 0xffffff;
25
18
  const KIND_SHIFT = 24;
26
19
  const IS_REINIT = 1 << 26;
@@ -29,30 +22,18 @@ const HAS_ATOMS = 1 << 28;
29
22
  const HAS_DEL_EH = 1 << 29;
30
23
  const HAS_JUSTIFICATION = 1 << 30;
31
24
  const IS_DELETED = 1 << 31;
32
- // The words before the literals: m_num_literals and the bit fields.
33
25
  export const HEADER_SIZE = 2;
34
- // An atom word of a clause whose atoms were released.
35
26
  const NO_ATOM = -1;
36
27
 
37
- // The clauses live in one Int32Array, and a clause is the offset of its block, as a clause is the
38
- // address of its memory in Z3. A block holds the header, the literals, then the activity of a lemma,
39
- // the slots of the deletion handler and the justification, and the atoms with their signs, each
40
- // present only when used. Like small_object_allocator, a freed block goes on the free list of its size
41
- // for the next clause of that size, and the array never shrinks. A freed block keeps the next free
42
- // block in its first word and 0 in its second, which no clause has.
43
28
  export class ClauseStore {
44
- // Literal i of clause c is data[c + 2 + i]. Making a clause can replace the array, so a loop that
45
- // makes clauses reads it again.
46
29
  data = new Int32Array(1 << 16);
47
30
  private top = 0;
48
31
  private freeLists: (number | undefined)[] = [];
49
- // The deletion handlers and justifications, which a block refers to by slot.
50
32
  private delEhs: ((() => void) | null)[] = [];
51
33
  private freeDelEhSlots: number[] = [];
52
34
  private justifications: (Justification | null)[] = [];
53
35
  private freeJustificationSlots: number[] = [];
54
36
 
55
- // get_obj_size, in words.
56
37
  private getSize(flags: number) {
57
38
  const capacity = flags & CAPACITY_MASK;
58
39
  return (
@@ -81,7 +62,6 @@ export class ClauseStore {
81
62
  return block;
82
63
  }
83
64
 
84
- // clause::mk. The atoms are the atom of each literal, which the clause keeps with the literal's sign.
85
65
  mk(
86
66
  literals: Literal[],
87
67
  kind: number,
@@ -119,7 +99,6 @@ export class ClauseStore {
119
99
  return slot;
120
100
  }
121
101
 
122
- // deallocate: the block goes on its free list. The atoms must be released first.
123
102
  free(clause: Clause) {
124
103
  const data = this.data;
125
104
  const flags = data[clause + 1];
@@ -140,12 +119,10 @@ export class ClauseStore {
140
119
  setAt(this.freeLists, size, clause);
141
120
  }
142
121
 
143
- // The first word after the literals, where the activity of a lemma is.
144
122
  private getExtra(clause: Clause) {
145
123
  return clause + HEADER_SIZE + (this.data[clause + 1] & CAPACITY_MASK);
146
124
  }
147
125
 
148
- // A clause that was freed is not one any more, which the slower paths check.
149
126
  checkLive(clause: Clause) {
150
127
  if ((this.data[clause + 1] & CAPACITY_MASK) === 0)
151
128
  throw new SmtInvariantError("the clause was freed");
@@ -246,7 +223,6 @@ export class ClauseStore {
246
223
  return this.getSlotAddress(clause, HAS_JUSTIFICATION) + (flags & HAS_JUSTIFICATION ? 1 : 0);
247
224
  }
248
225
 
249
- // The atoms the clause still holds, or none once they are released.
250
226
  getAtoms(clause: Clause) {
251
227
  const address = this.getAtomsAddress(clause);
252
228
  if (address === -1 || this.data[address] === NO_ATOM) return [];
@@ -256,12 +232,10 @@ export class ClauseStore {
256
232
  return atoms;
257
233
  }
258
234
 
259
- // The sign of the literal of atom i, as the clause was made.
260
235
  getAtomSign(clause: Clause, index: number) {
261
236
  return (this.data[this.getAtomsAddress(clause) + index] & 1) === 1;
262
237
  }
263
238
 
264
- // Marks the atoms released, after their references are dropped.
265
239
  clearAtoms(clause: Clause) {
266
240
  const address = this.getAtomsAddress(clause);
267
241
  if (address === -1) return;
@@ -270,7 +244,6 @@ export class ClauseStore {
270
244
  }
271
245
  }
272
246
 
273
- // A clause is the offset of its block in the ClauseStore.
274
247
  export type Clause = number;
275
248
 
276
249
  const isLemmaKind = (kind: number) => kind === CLS_LEARNED || kind === CLS_TH_LEMMA;