tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479

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 (587) 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 +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  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 +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  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 +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  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 +120 -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 +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -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 +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -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 +829 -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 +22 -25
  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 +262 -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 +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  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 +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -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 +2107 -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 +995 -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 +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -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 +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -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 +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  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 +2176 -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 +1210 -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 +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -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 +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -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/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,748 @@
1
+ import { SmtUnsupportedError } from "../../../../errors";
2
+ import {
3
+ OP_ADD,
4
+ OP_BADD,
5
+ OP_BIT2BOOL,
6
+ OP_BNAND,
7
+ OP_BNEG,
8
+ OP_BNEG_OVFL,
9
+ OP_BNOR,
10
+ OP_BNOT,
11
+ OP_BSADD_OVFL,
12
+ OP_BSDIV,
13
+ OP_BSDIV0,
14
+ OP_BSDIV_I,
15
+ OP_BSDIV_OVFL,
16
+ OP_BSMOD,
17
+ OP_BSMOD0,
18
+ OP_BSMOD_I,
19
+ OP_BSMUL_NO_OVFL,
20
+ OP_BSMUL_NO_UDFL,
21
+ OP_BSMUL_OVFL,
22
+ OP_BSREM,
23
+ OP_BSREM0,
24
+ OP_BSREM_I,
25
+ OP_BSSUB_OVFL,
26
+ OP_BSUB,
27
+ OP_BUADD_OVFL,
28
+ OP_BUDIV,
29
+ OP_BUDIV0,
30
+ OP_BUDIV_I,
31
+ OP_BUMUL_NO_OVFL,
32
+ OP_BUMUL_OVFL,
33
+ OP_BUREM,
34
+ OP_BUREM0,
35
+ OP_BUREM_I,
36
+ OP_BUSUB_OVFL,
37
+ OP_BV_NUM,
38
+ OP_BXNOR,
39
+ OP_CARRY,
40
+ OP_CONCAT,
41
+ OP_EXTRACT,
42
+ OP_IDIV,
43
+ OP_INT2BV,
44
+ OP_ITE,
45
+ OP_MKBV,
46
+ OP_MOD,
47
+ OP_REPEAT,
48
+ OP_SGEQ,
49
+ OP_SGT,
50
+ OP_SLEQ,
51
+ OP_SLT,
52
+ OP_UBV2INT,
53
+ OP_UGEQ,
54
+ OP_UGT,
55
+ OP_ULEQ,
56
+ OP_ULT,
57
+ OP_XOR3,
58
+ OP_ZERO_EXT,
59
+ SORT_BOOL,
60
+ SORT_INT,
61
+ } from "../ast";
62
+ import { BitBlaster } from "../bit-blaster";
63
+ import { mkBvApp } from "../bv-decl-plugin";
64
+ import { mkBvDivremBound } from "../bv-divrem-bounds";
65
+ import { L_UNDEF } from "../lbool";
66
+ import { UnionFind } from "../lp/union-find";
67
+ import { NULL_LITERAL } from "../sat/clause";
68
+ import { AC_BLASTS, BINARY_BLASTS, type Blast, UNARY_BLASTS } from "../theory-bv";
69
+ import { BvAckerman } from "./bv-ackerman";
70
+ import { type Enode, NULL_THEORY_VAR } from "./egraph";
71
+ import type { EufSolver } from "./euf-solver";
72
+ import { ThSolver } from "./th-solver";
73
+
74
+ interface ZeroOneBit {
75
+ readonly owner: number;
76
+ readonly index: number;
77
+ readonly isTrue: boolean;
78
+ }
79
+
80
+ export interface EqOccurs {
81
+ readonly bv1: number;
82
+ readonly bv2: number;
83
+ readonly index: number;
84
+ readonly v1: number;
85
+ readonly v2: number;
86
+ readonly lit: number;
87
+ readonly node: Enode;
88
+ next: EqOccurs | null;
89
+ prev: EqOccurs | null;
90
+ }
91
+
92
+ export interface VarPosOcc {
93
+ readonly thVar: number;
94
+ readonly index: number;
95
+ readonly next: VarPosOcc | null;
96
+ }
97
+
98
+ export interface BvAtom {
99
+ readonly boolVar: number;
100
+ eqs: EqOccurs | null;
101
+ occs: VarPosOcc | null;
102
+ readonly lit: number;
103
+ readonly def: number;
104
+ }
105
+
106
+ interface LeOp {
107
+ readonly isSigned: boolean;
108
+ readonly isReversed: boolean;
109
+ readonly isNegated: boolean;
110
+ }
111
+
112
+ const LE_OPS = new Map<number, LeOp>([
113
+ [OP_ULEQ, { isSigned: false, isReversed: false, isNegated: false }],
114
+ [OP_SLEQ, { isSigned: true, isReversed: false, isNegated: false }],
115
+ [OP_UGEQ, { isSigned: false, isReversed: true, isNegated: false }],
116
+ [OP_SGEQ, { isSigned: true, isReversed: true, isNegated: false }],
117
+ [OP_ULT, { isSigned: false, isReversed: true, isNegated: true }],
118
+ [OP_SLT, { isSigned: true, isReversed: true, isNegated: true }],
119
+ [OP_UGT, { isSigned: false, isReversed: false, isNegated: true }],
120
+ [OP_SGT, { isSigned: true, isReversed: false, isNegated: true }],
121
+ ]);
122
+
123
+ const DIVREM_I_OPS: ReadonlySet<number> = new Set([
124
+ OP_BSDIV_I,
125
+ OP_BUDIV_I,
126
+ OP_BUREM_I,
127
+ OP_BSREM_I,
128
+ OP_BSMOD_I,
129
+ ]);
130
+
131
+ // The divisions that hi_div0 defines through their _i counterparts.
132
+ const INTERP_OPS = new Map<number, number>([
133
+ [OP_BUDIV, OP_BUDIV_I],
134
+ [OP_BSDIV, OP_BSDIV_I],
135
+ [OP_BSREM, OP_BSREM_I],
136
+ [OP_BUREM, OP_BUREM_I],
137
+ [OP_BSMOD, OP_BSMOD_I],
138
+ ]);
139
+
140
+ const DIV0_OPS: ReadonlySet<number> = new Set([
141
+ OP_BSDIV0,
142
+ OP_BUDIV0,
143
+ OP_BSREM0,
144
+ OP_BUREM0,
145
+ OP_BSMOD0,
146
+ ]);
147
+
148
+ const NO_OVERFLOW_OPS: ReadonlySet<number> = new Set([
149
+ OP_BUMUL_NO_OVFL,
150
+ OP_BSMUL_NO_OVFL,
151
+ OP_BSMUL_NO_UDFL,
152
+ ]);
153
+
154
+ const OVERFLOW_OPS: ReadonlySet<number> = new Set([
155
+ OP_BUMUL_OVFL,
156
+ OP_BSMUL_OVFL,
157
+ OP_BSDIV_OVFL,
158
+ OP_BNEG_OVFL,
159
+ OP_BUADD_OVFL,
160
+ OP_BSADD_OVFL,
161
+ OP_BUSUB_OVFL,
162
+ OP_BSSUB_OVFL,
163
+ ]);
164
+
165
+ export abstract class BvInternalize extends ThSolver {
166
+ protected abstract fixedVarEh(thVar: number): void;
167
+ protected abstract findWpos(thVar: number): boolean;
168
+ protected abstract findNewDiseqAxioms(atom: BvAtom, thVar: number, index: number): void;
169
+
170
+ protected readonly blaster: BitBlaster;
171
+ protected readonly find: UnionFind;
172
+ protected readonly ackerman = new BvAckerman(this);
173
+ readonly bits: number[][] = [];
174
+ protected wpos: number[] = [];
175
+ protected zeroOneBits: ZeroOneBit[][] = [];
176
+ protected boolVar2atom: (BvAtom | undefined)[] = [];
177
+ protected trueLit = NULL_LITERAL;
178
+ protected bv2ints: Enode[] = [];
179
+
180
+ constructor(ctx: EufSolver, id: number) {
181
+ super(ctx, "bv", id);
182
+ this.blaster = new BitBlaster(ctx.manager);
183
+ this.find = new UnionFind(ctx.trail);
184
+ }
185
+
186
+ protected isBv(thVar: number) {
187
+ const manager = this.manager;
188
+ return manager.isBvSort(manager.sorts[this.var2expr(thVar)]);
189
+ }
190
+
191
+ protected getBvSize(thVar: number) {
192
+ const manager = this.manager;
193
+ return manager.getBvSize(manager.sorts[this.var2expr(thVar)]);
194
+ }
195
+
196
+ private getParameter(expr: number, index: number) {
197
+ const manager = this.manager;
198
+ return manager.funcDecls[manager.decls[expr]].parameters[index];
199
+ }
200
+
201
+ protected getBv2a(boolVar: number) {
202
+ return this.boolVar2atom[boolVar];
203
+ }
204
+
205
+ private insertBv2a(boolVar: number, atom: BvAtom) {
206
+ while (this.boolVar2atom.length <= boolVar) this.boolVar2atom.push(undefined);
207
+ this.boolVar2atom[boolVar] = atom;
208
+ this.ctx.trail.push(() => {
209
+ this.boolVar2atom[boolVar] = undefined;
210
+ });
211
+ }
212
+
213
+ override mkVar(node: Enode) {
214
+ const thVar = super.mkVar(node);
215
+ this.find.mkVar();
216
+ this.bits.push([]);
217
+ this.wpos.push(0);
218
+ this.zeroOneBits.push([]);
219
+ this.ctx.egraph.addThVar(node, thVar, this.id);
220
+ return thVar;
221
+ }
222
+
223
+ override applySortCnstr(node: Enode) {
224
+ this.forcePush();
225
+ this.getVar(node);
226
+ }
227
+
228
+ internalize(expr: number, isSign: boolean, isRoot: boolean) {
229
+ this.forcePush();
230
+ if (!this.visitRec(expr, isSign, isRoot)) return NULL_LITERAL;
231
+ const lit = this.expr2literal(expr);
232
+ return isSign ? lit ^ 1 : lit;
233
+ }
234
+
235
+ internalizeTerm(expr: number) {
236
+ this.forcePush();
237
+ this.visitRec(expr, false, false);
238
+ }
239
+
240
+ protected override visit(expr: number) {
241
+ const manager = this.manager;
242
+ if (!manager.isApp(expr) || manager.getFamily(expr) !== this.id) {
243
+ this.ctx.internalizeTerm(expr);
244
+ return true;
245
+ }
246
+ this.stack.push({ expr, index: 0 });
247
+ return false;
248
+ }
249
+
250
+ protected override visited(expr: number) {
251
+ const node = this.expr2enode(expr);
252
+ return node !== undefined && node.getThVar(this.id) !== NULL_THEORY_VAR;
253
+ }
254
+
255
+ protected override postVisit(expr: number) {
256
+ if (this.visited(expr)) return true;
257
+ this.mkVar(this.expr2enode(expr) ?? this.mkEnode(expr));
258
+ this.internalizeCircuit(expr);
259
+ return true;
260
+ }
261
+
262
+ private internalizeCircuit(expr: number) {
263
+ const manager = this.manager;
264
+ const op = manager.getOp(expr);
265
+ const numArgs = manager.getNumArgs(expr);
266
+ const unary =
267
+ (op === OP_BNAND || op === OP_BNOR || op === OP_BXNOR) && numArgs === 1
268
+ ? UNARY_BLASTS.get(OP_BNOT)
269
+ : UNARY_BLASTS.get(op);
270
+ const binary = BINARY_BLASTS.get(op) ?? AC_BLASTS.get(op);
271
+ const le = LE_OPS.get(op);
272
+ const interp = INTERP_OPS.get(op);
273
+ if (op === OP_BV_NUM) this.internalizeNum(expr);
274
+ else if (unary !== undefined) this.internalizeUnary(expr, unary);
275
+ else if (binary !== undefined) {
276
+ this.internalizeBinary(expr, binary);
277
+ if (DIVREM_I_OPS.has(op)) this.assertBvDivremBoundAxiom(expr);
278
+ } else if (NO_OVERFLOW_OPS.has(op)) this.internalizeNovfl(expr, op);
279
+ else if (OVERFLOW_OPS.has(op)) this.internalizeOverflow(expr, op);
280
+ else if (op === OP_BIT2BOOL) this.internalizeBit2bool(expr);
281
+ else if (le !== undefined) this.internalizeLe(expr, le);
282
+ else if (op === OP_XOR3) this.internalizeXor3(expr);
283
+ else if (op === OP_CARRY) this.internalizeCarry(expr);
284
+ else if (op === OP_BSUB) this.internalizeSub(expr);
285
+ else if (op === OP_CONCAT) this.internalizeConcat(expr);
286
+ else if (op === OP_EXTRACT) this.internalizeExtract(expr);
287
+ else if (op === OP_REPEAT) this.internalizeRepeat(expr);
288
+ else if (op === OP_MKBV) this.initBits(expr, manager.getArgs(expr));
289
+ else if (op === OP_INT2BV) this.internalizeInt2bv(expr);
290
+ else if (op === OP_UBV2INT) this.assertBv2intAxiom(expr);
291
+ else if (interp !== undefined) this.internalizeInterp(expr, interp);
292
+ else if (!DIV0_OPS.has(op))
293
+ throw new SmtUnsupportedError(`the bit-vector operator ${manager.getDeclName(expr)}`);
294
+ }
295
+
296
+ protected mkBits(thVar: number) {
297
+ const manager = this.manager;
298
+ const expr = this.var2expr(thVar);
299
+ const size = this.getBvSize(thVar);
300
+ const bits = this.bits[thVar];
301
+ bits.length = 0;
302
+ for (let index = 0; index < size; index++) {
303
+ const bit2bool = mkBvApp(manager, OP_BIT2BOOL, [expr], [index]);
304
+ bits.push(NULL_LITERAL);
305
+ const lit = this.ctx.internalize(bit2bool, false, false);
306
+ if (bits[index] === NULL_LITERAL) bits[index] = lit;
307
+ }
308
+ }
309
+
310
+ protected getVar(node: Enode) {
311
+ const existing = node.getThVar(this.id);
312
+ if (existing !== NULL_THEORY_VAR) return existing;
313
+ const thVar = this.mkVar(node);
314
+ if (this.isBv(thVar)) this.mkBits(thVar);
315
+ return thVar;
316
+ }
317
+
318
+ private getArgVar(node: Enode, index: number) {
319
+ return this.getVar(this.expr2enode(this.manager.getArg(node.owner, index)) as Enode);
320
+ }
321
+
322
+ private getBits(thVar: number) {
323
+ const manager = this.manager;
324
+ return this.bits[thVar].map((lit) => {
325
+ const expr = this.literal2expr(lit);
326
+ manager.incRef(expr);
327
+ return expr;
328
+ });
329
+ }
330
+
331
+ private getArgBits(expr: number, index: number) {
332
+ return this.getBits(this.getVar(this.expr2enode(this.manager.getArg(expr, index)) as Enode));
333
+ }
334
+
335
+ private dropAll(exprs: readonly number[]) {
336
+ for (const expr of exprs) this.manager.decRef(expr);
337
+ }
338
+
339
+ private registerTrueFalseBit(thVar: number, index: number) {
340
+ this.zeroOneBits[thVar].push({
341
+ owner: thVar,
342
+ index,
343
+ isTrue: this.bits[thVar][index] === this.mkTrue(),
344
+ });
345
+ }
346
+
347
+ protected addBit(thVar: number, lit: number) {
348
+ const index = this.bits[thVar].length;
349
+ this.bits[thVar].push(lit);
350
+ this.s.setExternal(lit >> 1);
351
+ const node = this.boolVar2enode(lit >> 1) as Enode;
352
+ if (node.getThVar(this.id) === NULL_THEORY_VAR) this.mkVar(node);
353
+ this.setBitEh(thVar, lit, index);
354
+ }
355
+
356
+ protected mkAtom(boolVar: number) {
357
+ const existing = this.getBv2a(boolVar);
358
+ if (existing !== undefined) return existing;
359
+ const atom: BvAtom = { boolVar, eqs: null, occs: null, lit: NULL_LITERAL, def: NULL_LITERAL };
360
+ this.insertBv2a(boolVar, atom);
361
+ return atom;
362
+ }
363
+
364
+ protected setBitEh(thVar: number, lit: number, index: number) {
365
+ if (lit >> 1 === this.mkTrue() >> 1) {
366
+ this.registerTrueFalseBit(thVar, index);
367
+ return;
368
+ }
369
+ const atom = this.mkAtom(lit >> 1);
370
+ if (atom.occs !== null) this.findNewDiseqAxioms(atom, thVar, index);
371
+ const occs = atom.occs;
372
+ this.ctx.trail.push(() => {
373
+ atom.occs = occs;
374
+ });
375
+ atom.occs = { thVar, index, next: occs };
376
+ }
377
+
378
+ private initBits(expr: number, bitExprs: readonly number[]) {
379
+ const ctx = this.ctx;
380
+ const thVar = (this.expr2enode(expr) as Enode).getThVar(this.id);
381
+ const bits = this.bits[thVar];
382
+ if (bits.length > 0) {
383
+ bitExprs.forEach((bitExpr, index) => {
384
+ const lit = ctx.internalize(bitExpr, false, false);
385
+ this.addClause([lit ^ 1, bits[index]]);
386
+ this.addClause([lit, bits[index] ^ 1]);
387
+ });
388
+ return;
389
+ }
390
+ for (const bitExpr of bitExprs) this.addBit(thVar, ctx.internalize(bitExpr, false, false));
391
+ for (const bitExpr of bitExprs) this.getVar(this.expr2enode(bitExpr) as Enode);
392
+ this.findWpos(thVar);
393
+ }
394
+
395
+ protected mkTrue() {
396
+ if (this.trueLit !== NULL_LITERAL) return this.trueLit;
397
+ this.ctx.trail.push(() => {
398
+ this.trueLit = NULL_LITERAL;
399
+ });
400
+ this.trueLit = this.ctx.internalize(this.manager.trueExpr, false, true);
401
+ this.s.assignUnit(this.trueLit);
402
+ return this.trueLit;
403
+ }
404
+
405
+ private internalizeNum(expr: number) {
406
+ const manager = this.manager;
407
+ const value = manager.getBvNumeralValue(expr);
408
+ const thVar = (this.expr2enode(expr) as Enode).getThVar(this.id);
409
+ const trueLit = this.mkTrue();
410
+ for (let index = 0; index < this.getBvSize(thVar); index++) {
411
+ this.bits[thVar].push(((value >> BigInt(index)) & 1n) === 1n ? trueLit : trueLit ^ 1);
412
+ this.registerTrueFalseBit(thVar, index);
413
+ }
414
+ this.fixedVarEh(thVar);
415
+ }
416
+
417
+ // n = bv2int(k) = ite(bit2bool(k[sz-1]), 2^{sz-1}, 0) + ... + ite(bit2bool(k[0]), 1, 0)
418
+ private assertBv2intAxiom(expr: number) {
419
+ const manager = this.manager;
420
+ const wordBits = this.getBits(this.getVar(this.expr2enode(manager.getArg(expr, 0)) as Enode));
421
+ const zero = manager.mkNumeral(0n);
422
+ const terms = wordBits.map((bit, index) =>
423
+ manager.mkApp(OP_ITE, [bit, manager.mkNumeral(1n << BigInt(index)), zero], SORT_INT),
424
+ );
425
+ const sum = terms.length === 1 ? terms[0] : manager.mkApp(OP_ADD, terms, SORT_INT);
426
+ const lit = this.eqInternalize(expr, sum);
427
+ this.bv2ints.push(this.expr2enode(expr) as Enode);
428
+ this.ctx.trail.push(() => this.bv2ints.pop());
429
+ this.addUnit(lit);
430
+ this.dropAll(wordBits);
431
+ }
432
+
433
+ private internalizeInt2bv(expr: number) {
434
+ const node = this.expr2enode(expr) as Enode;
435
+ this.mkBits(node.getThVar(this.id));
436
+ this.getVar(node.getArg(0));
437
+ this.assertInt2bvAxiom(expr);
438
+ }
439
+
440
+ // bv2int(n) = e mod 2^bit_width, and bit2bool(i, n) = ((e div 2^i) mod 2 = 1), where n = int2bv(e)
441
+ private assertInt2bvAxiom(expr: number) {
442
+ const manager = this.manager;
443
+ const arg = manager.getArg(expr, 0);
444
+ const size = manager.getBvSize(manager.sorts[expr]);
445
+ const mkMod = (dividend: number, divisor: bigint) =>
446
+ manager.mkApp(OP_MOD, [dividend, manager.mkNumeral(divisor)], SORT_INT);
447
+ this.addUnit(
448
+ this.eqInternalize(mkBvApp(manager, OP_UBV2INT, [expr]), mkMod(arg, 1n << BigInt(size))),
449
+ );
450
+ const bits = this.getBits(this.getVar(this.expr2enode(expr) as Enode));
451
+ for (let index = 0; index < size; index++) {
452
+ const quotient =
453
+ index === 0
454
+ ? arg
455
+ : manager.mkApp(OP_IDIV, [arg, manager.mkNumeral(1n << BigInt(index))], SORT_INT);
456
+ const isOne = this.mkEq(mkMod(quotient, 2n), manager.mkNumeral(1n));
457
+ this.addUnit(this.eqInternalize(bits[index], isOne));
458
+ }
459
+ this.dropAll(bits);
460
+ }
461
+
462
+ private internalizeLe(expr: number, le: LeOp) {
463
+ const first = this.getArgBits(expr, le.isReversed ? 1 : 0);
464
+ const second = this.getArgBits(expr, le.isReversed ? 0 : 1);
465
+ const circuit = le.isSigned
466
+ ? this.blaster.mkSle(first, second)
467
+ : this.blaster.mkUle(first, second);
468
+ const def = this.ctx.internalize(circuit, false, false);
469
+ this.addDef(le.isNegated ? def ^ 1 : def, this.expr2literal(expr));
470
+ this.manager.decRef(circuit);
471
+ this.dropAll(second);
472
+ this.dropAll(first);
473
+ }
474
+
475
+ private argLits(expr: number) {
476
+ return this.manager.getArgs(expr).map((arg) => this.expr2literal(arg));
477
+ }
478
+
479
+ private internalizeCarry(expr: number) {
480
+ const result = this.expr2literal(expr);
481
+ const [first, second, third] = this.argLits(expr);
482
+ this.addClause([result ^ 1, first, second]);
483
+ this.addClause([result ^ 1, first, third]);
484
+ this.addClause([result ^ 1, second, third]);
485
+ this.addClause([result, first ^ 1, second ^ 1]);
486
+ this.addClause([result, first ^ 1, third ^ 1]);
487
+ this.addClause([result, second ^ 1, third ^ 1]);
488
+ }
489
+
490
+ private internalizeXor3(expr: number) {
491
+ const result = this.expr2literal(expr);
492
+ const [first, second, third] = this.argLits(expr);
493
+ this.addClause([result ^ 1, first, second, third]);
494
+ this.addClause([result ^ 1, first ^ 1, second ^ 1, third]);
495
+ this.addClause([result ^ 1, first ^ 1, second, third ^ 1]);
496
+ this.addClause([result ^ 1, first, second ^ 1, third ^ 1]);
497
+ this.addClause([result, first ^ 1, second, third]);
498
+ this.addClause([result, first, second ^ 1, third]);
499
+ this.addClause([result, first, second, third ^ 1]);
500
+ this.addClause([result, first ^ 1, second ^ 1, third ^ 1]);
501
+ }
502
+
503
+ private assertBvDivremBoundAxiom(expr: number) {
504
+ const clause = mkBvDivremBound(this.manager, expr);
505
+ if (clause.length === 0) return;
506
+ this.addClause(clause.map((lit) => this.mkLiteral(lit)));
507
+ }
508
+
509
+ private internalizeInterp(expr: number, op: number) {
510
+ const manager = this.manager;
511
+ this.mkBits((this.expr2enode(expr) as Enode).getThVar(this.id));
512
+ if (!manager.isHiDiv0)
513
+ throw new SmtUnsupportedError(`sat.euf ${manager.getDeclName(expr)} without hi_div0`);
514
+ this.addUnit(this.eqInternalize(expr, mkBvApp(manager, op, manager.getArgs(expr))));
515
+ }
516
+
517
+ private internalizeUnary(expr: number, blast: Blast) {
518
+ const argBits = this.getArgBits(expr, 0);
519
+ const bits: number[] = [];
520
+ blast(this.blaster, [argBits], this.getParameter(expr, 0) ?? 0, bits);
521
+ this.initBits(expr, bits);
522
+ this.dropAll(bits);
523
+ this.dropAll(argBits);
524
+ }
525
+
526
+ private internalizeBinary(expr: number, blast: Blast) {
527
+ let bits = this.getArgBits(expr, 0);
528
+ for (let index = 1; index < this.manager.getNumArgs(expr); index++) {
529
+ const argBits = this.getArgBits(expr, index);
530
+ const newBits: number[] = [];
531
+ blast(this.blaster, [bits, argBits], 0, newBits);
532
+ this.dropAll(bits);
533
+ this.dropAll(argBits);
534
+ bits = newBits;
535
+ }
536
+ this.initBits(expr, bits);
537
+ this.dropAll(bits);
538
+ }
539
+
540
+ private internalizeNovfl(expr: number, op: number) {
541
+ const first = this.getArgBits(expr, 0);
542
+ const second = this.getArgBits(expr, 1);
543
+ const blaster = this.blaster;
544
+ const circuit =
545
+ op === OP_BUMUL_NO_OVFL
546
+ ? blaster.mkUmulNoOverflow(first, second)
547
+ : op === OP_BSMUL_NO_OVFL
548
+ ? blaster.mkSmulNoOverflow(first, second)
549
+ : blaster.mkSmulNoUnderflow(first, second);
550
+ this.addDef(this.ctx.internalize(circuit, false, false), this.expr2literal(expr));
551
+ this.manager.decRef(circuit);
552
+ this.dropAll(second);
553
+ this.dropAll(first);
554
+ }
555
+
556
+ private addDef(def: number, lit: number) {
557
+ this.insertBv2a(lit >> 1, { boolVar: lit >> 1, eqs: null, occs: null, lit, def });
558
+ this.addClause([lit, def ^ 1]);
559
+ this.addClause([def, lit ^ 1]);
560
+ }
561
+
562
+ private mkOverflowDef(expr: number, op: number) {
563
+ const manager = this.manager;
564
+ const first = manager.getArg(expr, 0);
565
+ const size = manager.getBvSize(manager.sorts[first]);
566
+ const bv = (bvOp: number, args: number[], parameters: number[] = []) =>
567
+ mkBvApp(manager, bvOp, args, parameters);
568
+ const mkMinSigned = () => manager.mkBvNumeral(1n << BigInt(size - 1), size);
569
+ if (op === OP_BNEG_OVFL) return manager.mkEq(first, mkMinSigned());
570
+ const second = manager.getArg(expr, 1);
571
+ if (op === OP_BUMUL_OVFL) return manager.mkNot(bv(OP_BUMUL_NO_OVFL, [first, second]));
572
+ if (op === OP_BSMUL_OVFL) {
573
+ const noOverflow = bv(OP_BSMUL_NO_OVFL, [first, second]);
574
+ const noUnderflow = bv(OP_BSMUL_NO_UDFL, [first, second]);
575
+ const overflow = manager.mkNot(noOverflow);
576
+ return manager.mkOr([overflow, manager.mkNot(noUnderflow)]);
577
+ }
578
+ if (op === OP_BUADD_OVFL) {
579
+ const firstExt = bv(OP_ZERO_EXT, [first], [1]);
580
+ const secondExt = bv(OP_ZERO_EXT, [second], [1]);
581
+ const carry = bv(OP_EXTRACT, [bv(OP_BADD, [firstExt, secondExt])], [size, size]);
582
+ return manager.mkEq(carry, manager.mkBvNumeral(1n, 1));
583
+ }
584
+ if (op === OP_BSADD_OVFL) {
585
+ const zero = manager.mkBvNumeral(0n, size);
586
+ const sum = bv(OP_BADD, [first, second]);
587
+ const firstPos = bv(OP_SLT, [zero, first]);
588
+ const secondPos = bv(OP_SLT, [zero, second]);
589
+ const sumNonPos = bv(OP_SLEQ, [sum, zero]);
590
+ const overflow = manager.mkAnd([firstPos, secondPos, sumNonPos]);
591
+ const firstNeg = bv(OP_SLT, [first, zero]);
592
+ const secondNeg = bv(OP_SLT, [second, zero]);
593
+ const sumNonNeg = bv(OP_SLEQ, [zero, sum]);
594
+ return manager.mkOr([overflow, manager.mkAnd([firstNeg, secondNeg, sumNonNeg])]);
595
+ }
596
+ if (op === OP_BUSUB_OVFL) return manager.mkNot(bv(OP_ULEQ, [second, first]));
597
+ if (op === OP_BSSUB_OVFL) {
598
+ const minSigned = mkMinSigned();
599
+ const saddo = bv(OP_BSADD_OVFL, [first, bv(OP_BNEG, [second])]);
600
+ const firstNonNeg = bv(OP_SLEQ, [manager.mkBvNumeral(0n, size), first]);
601
+ const isSecondMin = manager.mkEq(second, minSigned);
602
+ return manager.mkApp(OP_ITE, [isSecondMin, firstNonNeg, saddo], SORT_BOOL);
603
+ }
604
+ const minSigned = mkMinSigned();
605
+ const minusOne = manager.mkBvNumeral((1n << BigInt(size)) - 1n, size);
606
+ const isFirstMin = manager.mkEq(first, minSigned);
607
+ return manager.mkAnd([isFirstMin, manager.mkEq(second, minusOne)]);
608
+ }
609
+
610
+ private internalizeOverflow(expr: number, op: number) {
611
+ const def = this.mkOverflowDef(expr, op);
612
+ this.addDef(this.ctx.internalize(def, false, false), this.expr2literal(expr));
613
+ }
614
+
615
+ private internalizeConcat(expr: number) {
616
+ const node = this.expr2enode(expr) as Enode;
617
+ const thVar = node.getThVar(this.id);
618
+ this.bits[thVar].length = 0;
619
+ for (let index = node.numArgs - 1; index >= 0; index--)
620
+ for (const lit of this.bits[this.getArgVar(node, index)]) this.addBit(thVar, lit);
621
+ this.findWpos(thVar);
622
+ }
623
+
624
+ private internalizeSub(expr: number) {
625
+ const first = this.getArgBits(expr, 0);
626
+ const second = this.getArgBits(expr, 1);
627
+ const bits: number[] = [];
628
+ const carry = this.blaster.mkSubtracter(first, second, bits);
629
+ this.initBits(expr, bits);
630
+ this.manager.decRef(carry);
631
+ this.dropAll(bits);
632
+ this.dropAll(second);
633
+ this.dropAll(first);
634
+ }
635
+
636
+ private internalizeExtract(expr: number) {
637
+ const node = this.expr2enode(expr) as Enode;
638
+ const thVar = node.getThVar(this.id);
639
+ const argVar = this.getArgVar(node, 0);
640
+ this.bits[thVar].length = 0;
641
+ for (let index = this.getParameter(expr, 1); index <= this.getParameter(expr, 0); index++)
642
+ this.addBit(thVar, this.bits[argVar][index]);
643
+ this.findWpos(thVar);
644
+ }
645
+
646
+ private internalizeRepeat(expr: number) {
647
+ const manager = this.manager;
648
+ const arg = manager.getArg(expr, 0);
649
+ const concat = mkBvApp(
650
+ manager,
651
+ OP_CONCAT,
652
+ Array.from({ length: this.getParameter(expr, 0) }, () => arg),
653
+ );
654
+ this.mkBits((this.expr2enode(expr) as Enode).getThVar(this.id));
655
+ this.addUnit(this.eqInternalize(expr, concat));
656
+ }
657
+
658
+ private internalizeBit2bool(expr: number) {
659
+ const manager = this.manager;
660
+ const index = this.getParameter(expr, 0);
661
+ const arg = manager.getArg(expr, 0);
662
+ const argNode = this.expr2enode(arg) as Enode;
663
+ if (argNode.getThVar(this.id) === NULL_THEORY_VAR) this.mkVar(argNode);
664
+ const argVar = argNode.getThVar(this.id);
665
+ const lit = this.expr2literal(expr);
666
+ const lit0 = this.bits[argVar][index];
667
+ if (lit0 === NULL_LITERAL) {
668
+ this.bits[argVar][index] = lit;
669
+ this.insertBv2a(lit >> 1, {
670
+ boolVar: lit >> 1,
671
+ eqs: null,
672
+ occs: { thVar: argVar, index, next: null },
673
+ lit: NULL_LITERAL,
674
+ def: NULL_LITERAL,
675
+ });
676
+ } else if (lit !== lit0) {
677
+ this.addClause([lit0, lit ^ 1]);
678
+ this.addClause([lit0 ^ 1, lit]);
679
+ }
680
+ if (manager.isBvNumeral(arg))
681
+ this.addUnit(((manager.getBvNumeralValue(arg) >> BigInt(index)) & 1n) === 0n ? lit ^ 1 : lit);
682
+ }
683
+
684
+ override eqInternalized(node: Enode) {
685
+ const lit = 2 * node.boolVar;
686
+ const v1 = node.getArg(0).getThVar(this.id);
687
+ const v2 = node.getArg(1).getThVar(this.id);
688
+ const firstBits = this.bits[v1];
689
+ const secondBits = this.bits[v2];
690
+ if (firstBits.length === 1) {
691
+ const bit1 = firstBits[0];
692
+ const bit2 = secondBits[0];
693
+ this.addClause([lit ^ 1, bit1 ^ 1, bit2]);
694
+ this.addClause([lit ^ 1, bit2 ^ 1, bit1]);
695
+ this.addClause([bit1 ^ 1, bit2 ^ 1, lit]);
696
+ this.addClause([bit2, bit1, lit]);
697
+ return;
698
+ }
699
+ const s = this.s;
700
+ for (let index = 0; index < firstBits.length; index++) {
701
+ const bit1 = firstBits[index];
702
+ const bit2 = secondBits[index];
703
+ const isReversed =
704
+ s.value(bit1) !== L_UNDEF || (s.value(bit2) === L_UNDEF && this.random() % 2 === 0);
705
+ if (isReversed) this.addEqOccurs(bit2 >> 1, bit1 >> 1, index, v2, v1, lit, node);
706
+ else this.addEqOccurs(bit1 >> 1, bit2 >> 1, index, v1, v2, lit, node);
707
+ }
708
+ }
709
+
710
+ protected addEqOccurs(
711
+ bv1: number,
712
+ bv2: number,
713
+ index: number,
714
+ v1: number,
715
+ v2: number,
716
+ lit: number,
717
+ node: Enode,
718
+ ) {
719
+ const atom = this.mkAtom(bv1);
720
+ this.ctx.trail.push(() => {
721
+ atom.eqs = (atom.eqs as EqOccurs).next;
722
+ if (atom.eqs !== null) atom.eqs.prev = null;
723
+ });
724
+ const next = atom.eqs;
725
+ atom.eqs = { bv1, bv2, index, v1, v2, lit, node, next, prev: null };
726
+ if (next !== null) next.prev = atom.eqs;
727
+ }
728
+
729
+ assertAckerman(inputV1: number, inputV2: number) {
730
+ if (inputV1 === inputV2) return;
731
+ const manager = this.manager;
732
+ const v1 = Math.min(inputV1, inputV2);
733
+ const v2 = Math.max(inputV1, inputV2);
734
+ const first = this.var2expr(v1);
735
+ const second = this.var2expr(v2);
736
+ const eq = this.ctx.internalize(this.mkEq(first, second), false, false);
737
+ const lits = [eq];
738
+ for (let index = 0; index < this.bits[v1].length; index++) {
739
+ const bitEq = this.eqInternalize(
740
+ mkBvApp(manager, OP_BIT2BOOL, [first], [index]),
741
+ mkBvApp(manager, OP_BIT2BOOL, [second], [index]),
742
+ );
743
+ this.addClause([bitEq, eq ^ 1]);
744
+ lits.push(bitEq ^ 1);
745
+ }
746
+ this.addClause(lits, true);
747
+ }
748
+ }