tla-ts 0.0.9 → 0.0.10-dev.094b9b512

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 (622) 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 +40 -37
  5. package/dist/deciders.js +47 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +106 -10
  8. package/dist/index.d.ts +106 -10
  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 +2658 -410
  15. package/dist/prove.js +2657 -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 +129 -104
  21. package/dist/transfer.js +129 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +48 -62
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +599 -754
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +208 -54
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +361 -0
  40. package/src/cli/tlc.ts +309 -658
  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 +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +14 -53
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +169 -335
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +37 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +103 -153
  64. package/src/liveness.ts +150 -109
  65. package/src/obligations/action.ts +18 -43
  66. package/src/obligations/anonymize.ts +119 -90
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +2 -2
  69. package/src/obligations/expression.ts +38 -25
  70. package/src/obligations/format.ts +1 -9
  71. package/src/obligations/generate.ts +67 -63
  72. package/src/obligations/index.ts +38 -20
  73. package/src/obligations/levels.ts +28 -17
  74. package/src/obligations/module.ts +29 -54
  75. package/src/obligations/normalize.ts +31 -36
  76. package/src/obligations/operators.ts +1 -2
  77. package/src/obligations/pragma.ts +53 -25
  78. package/src/obligations/printer.ts +90 -57
  79. package/src/obligations/proof.ts +4 -5
  80. package/src/obligations/regroup.ts +1 -4
  81. package/src/obligations/simplify.ts +58 -62
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +51 -27
  84. package/src/obligations/substitution.ts +2 -4
  85. package/src/obligations/temporal.ts +13 -19
  86. package/src/obligations/tuples.ts +3 -9
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +57 -71
  89. package/src/parser.ts +961 -387
  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 +19 -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 -62
  101. package/src/prover/isabelle/isar/attrib.ts +219 -0
  102. package/src/prover/isabelle/isar/context.ts +336 -0
  103. package/src/prover/isabelle/isar/induct.ts +392 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +513 -225
  106. package/src/prover/isabelle/isar/proof.ts +569 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +234 -0
  108. package/src/prover/isabelle/isar/theory.ts +490 -89
  109. package/src/prover/isabelle/isar/toplevel.ts +341 -0
  110. package/src/prover/isabelle/isar/type-check.ts +100 -37
  111. package/src/prover/isabelle/provers/blast/blast.ts +17 -104
  112. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  113. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  114. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  115. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  116. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  118. package/src/prover/isabelle/provers/classical.ts +59 -60
  119. package/src/prover/isabelle/provers/hypsubst.ts +28 -51
  120. package/src/prover/isabelle/pure/bicompose.ts +25 -38
  121. package/src/prover/isabelle/pure/consts.ts +1 -7
  122. package/src/prover/isabelle/pure/conv.ts +3 -17
  123. package/src/prover/isabelle/pure/drule.ts +96 -44
  124. package/src/prover/isabelle/pure/envir.ts +3 -52
  125. package/src/prover/isabelle/pure/goal.ts +2 -8
  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 +2 -15
  129. package/src/prover/isabelle/pure/name.ts +2 -9
  130. package/src/prover/isabelle/pure/net.ts +3 -59
  131. package/src/prover/isabelle/pure/object-logic.ts +16 -15
  132. package/src/prover/isabelle/pure/pattern.ts +2 -19
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +17 -62
  134. package/src/prover/isabelle/pure/rewriter.ts +32 -73
  135. package/src/prover/isabelle/pure/search.ts +3 -10
  136. package/src/prover/isabelle/pure/seq.ts +1 -10
  137. package/src/prover/isabelle/pure/simplifier.ts +28 -15
  138. package/src/prover/isabelle/pure/table.ts +3 -32
  139. package/src/prover/isabelle/pure/tactic.ts +12 -22
  140. package/src/prover/isabelle/pure/tactical.ts +48 -47
  141. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  142. package/src/prover/isabelle/pure/term.ts +2 -43
  143. package/src/prover/isabelle/pure/thm.ts +27 -47
  144. package/src/prover/isabelle/pure/type.ts +2 -15
  145. package/src/prover/isabelle/pure/unify.ts +20 -30
  146. package/src/prover/isabelle/pure/variable.ts +3 -7
  147. package/src/prover/isabelle/tla/classical-setup.ts +18 -24
  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 +46 -43
  152. package/src/prover/isabelle/tools/intuitionistic.ts +29 -20
  153. package/src/prover/ocaml.ts +0 -6
  154. package/src/prover/prep/action.ts +32 -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 +0 -2
  159. package/src/prover/prep/methods.ts +137 -83
  160. package/src/prover/prep/normalize.ts +38 -36
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +371 -132
  163. package/src/prover/ptl/decide.ts +104 -44
  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 +61 -29
  170. package/src/prover/smt/data.ts +497 -387
  171. package/src/prover/smt/encode.ts +156 -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 +1025 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +63 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +182 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +112 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -15
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +60 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +43 -0
  185. package/src/prover/smt/solver/aig.ts +890 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +613 -48
  187. package/src/prover/smt/solver/arith-terms.ts +123 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +176 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +312 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -57
  192. package/src/prover/smt/solver/ast-lt.ts +166 -21
  193. package/src/prover/smt/solver/ast-util.ts +161 -7
  194. package/src/prover/smt/solver/ast.ts +1466 -178
  195. package/src/prover/smt/solver/auf-solver.ts +8 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +591 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +874 -0
  198. package/src/prover/smt/solver/bound-manager.ts +186 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +602 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +500 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +339 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +97 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1905 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +224 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +175 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +545 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +534 -0
  208. package/src/prover/smt/solver/card2bv.ts +112 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  210. package/src/prover/smt/solver/cg-table.ts +28 -34
  211. package/src/prover/smt/solver/check-logic.ts +326 -0
  212. package/src/prover/smt/solver/clause.ts +1 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +280 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +79 -12
  215. package/src/prover/smt/solver/context.ts +510 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +34 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +124 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +575 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +83 -0
  220. package/src/prover/smt/solver/demodulator.ts +789 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +68 -0
  222. package/src/prover/smt/solver/der.ts +40 -30
  223. package/src/prover/smt/solver/diff-neq.ts +207 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +67 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +513 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +267 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  228. package/src/prover/smt/solver/e-matching.ts +4 -35
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +130 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +558 -0
  231. package/src/prover/smt/solver/enode.ts +93 -22
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +219 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +404 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +659 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +895 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +528 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +419 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +308 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +164 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +750 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +451 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +620 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +885 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1203 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +333 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1094 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +900 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +299 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +343 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +31 -0
  253. package/src/prover/smt/solver/expr-ref.ts +1 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -6
  255. package/src/prover/smt/solver/expr2polynomial.ts +147 -0
  256. package/src/prover/smt/solver/factor.ts +152 -0
  257. package/src/prover/smt/solver/fd-solver.ts +269 -0
  258. package/src/prover/smt/solver/fingerprints.ts +16 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +149 -0
  260. package/src/prover/smt/solver/flat-literals.ts +1 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +873 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +619 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +641 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2246 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +75 -0
  267. package/src/prover/smt/solver/goal.ts +177 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +191 -0
  269. package/src/prover/smt/solver/guard-set.ts +220 -0
  270. package/src/prover/smt/solver/hash.ts +0 -8
  271. package/src/prover/smt/solver/hashtable.ts +27 -23
  272. package/src/prover/smt/solver/inf-eps.ts +64 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +102 -0
  274. package/src/prover/smt/solver/internalizer.ts +72 -130
  275. package/src/prover/smt/solver/lackr.ts +383 -0
  276. package/src/prover/smt/solver/lbool.ts +1 -2
  277. package/src/prover/smt/solver/lia2card.ts +269 -0
  278. package/src/prover/smt/solver/lia2pb.ts +141 -0
  279. package/src/prover/smt/solver/literal.ts +0 -3
  280. package/src/prover/smt/solver/logic-tactics.ts +349 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  283. package/src/prover/smt/solver/lp/containers.ts +12 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +24 -27
  285. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  287. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +9 -102
  289. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  293. package/src/prover/smt/solver/lp/int-cube.ts +18 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  295. package/src/prover/smt/solver/lp/lar-solver.ts +70 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +79 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  300. package/src/prover/smt/solver/lp/nex.ts +1 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  302. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +69 -132
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +24 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +184 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +293 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  320. package/src/prover/smt/solver/lp/nra-solver.ts +30 -54
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  327. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +6 -5
  329. package/src/prover/smt/solver/macro-finder.ts +533 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +117 -126
  331. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +29 -0
  333. package/src/prover/smt/solver/max-cliques.ts +107 -0
  334. package/src/prover/smt/solver/maxcore.ts +318 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +9 -20
  336. package/src/prover/smt/solver/maxlex.ts +123 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +99 -0
  338. package/src/prover/smt/solver/maxsmt.ts +93 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +477 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +102 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +280 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +49 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +280 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +624 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +845 -0
  346. package/src/prover/smt/solver/model-checker.ts +20 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +186 -39
  348. package/src/prover/smt/solver/model-finder.ts +15 -32
  349. package/src/prover/smt/solver/model-generator.ts +57 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +58 -111
  351. package/src/prover/smt/solver/model-printer.ts +215 -0
  352. package/src/prover/smt/solver/mpf.ts +712 -0
  353. package/src/prover/smt/solver/mus.ts +52 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +362 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +98 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +121 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +121 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +305 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +427 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +278 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +158 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +303 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +127 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +460 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-tactic.ts +192 -0
  367. package/src/prover/smt/solver/muz/rule-properties.ts +179 -0
  368. package/src/prover/smt/solver/muz/spacer-context.ts +1395 -0
  369. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +41 -0
  370. package/src/prover/smt/solver/muz/spacer-generalizers.ts +244 -0
  371. package/src/prover/smt/solver/muz/spacer-manager.ts +133 -0
  372. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  373. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +344 -0
  374. package/src/prover/smt/solver/muz/spacer-util.ts +309 -0
  375. package/src/prover/smt/solver/muz/substitution.ts +154 -0
  376. package/src/prover/smt/solver/nla2bv-tactic.ts +286 -0
  377. package/src/prover/smt/solver/nlqsat.ts +484 -0
  378. package/src/prover/smt/solver/nlsat/algebraic.ts +179 -159
  379. package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
  380. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  381. package/src/prover/smt/solver/nlsat/explain.ts +61 -69
  382. package/src/prover/smt/solver/nlsat/interval-set.ts +10 -51
  383. package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
  384. package/src/prover/smt/solver/nlsat/mpbq.ts +48 -14
  385. package/src/prover/smt/solver/nlsat/polynomial.ts +30 -160
  386. package/src/prover/smt/solver/nlsat/solver.ts +227 -99
  387. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +311 -0
  388. package/src/prover/smt/solver/nlsat/transcendentals.ts +369 -0
  389. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  390. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
  391. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  392. package/src/prover/smt/solver/nlsat-tactic.ts +83 -0
  393. package/src/prover/smt/solver/nnf.ts +108 -60
  394. package/src/prover/smt/solver/normalize-bounds.ts +54 -0
  395. package/src/prover/smt/solver/occf.ts +98 -0
  396. package/src/prover/smt/solver/opt-context.ts +787 -0
  397. package/src/prover/smt/solver/opt-nlsat.ts +366 -0
  398. package/src/prover/smt/solver/opt-pareto.ts +284 -0
  399. package/src/prover/smt/solver/opt-preprocess.ts +102 -0
  400. package/src/prover/smt/solver/opt-solver.ts +300 -0
  401. package/src/prover/smt/solver/opt-value.ts +56 -0
  402. package/src/prover/smt/solver/optsmt.ts +691 -0
  403. package/src/prover/smt/solver/parallel-tactic.ts +301 -0
  404. package/src/prover/smt/solver/pattern-inference.ts +19 -23
  405. package/src/prover/smt/solver/pb-rewriter.ts +296 -0
  406. package/src/prover/smt/solver/pb2bv-tactic.ts +542 -0
  407. package/src/prover/smt/solver/poly-rewriter.ts +203 -77
  408. package/src/prover/smt/solver/probes.ts +514 -0
  409. package/src/prover/smt/solver/propagate-values.ts +34 -30
  410. package/src/prover/smt/solver/proto-model.ts +648 -63
  411. package/src/prover/smt/solver/pull-quant.ts +29 -23
  412. package/src/prover/smt/solver/purify-arith.ts +598 -0
  413. package/src/prover/smt/solver/qe-arith-plugin.ts +1099 -0
  414. package/src/prover/smt/solver/qe-lite-der.ts +3 -31
  415. package/src/prover/smt/solver/qe-lite-fm.ts +5 -28
  416. package/src/prover/smt/solver/qe-lite.ts +40 -49
  417. package/src/prover/smt/solver/qe-mbp.ts +281 -0
  418. package/src/prover/smt/solver/qe.ts +1508 -0
  419. package/src/prover/smt/solver/qel.ts +26 -0
  420. package/src/prover/smt/solver/qi-queue.ts +1 -16
  421. package/src/prover/smt/solver/qsat.ts +840 -0
  422. package/src/prover/smt/solver/quant-hoist.ts +195 -0
  423. package/src/prover/smt/solver/quant-tactics.ts +18 -74
  424. package/src/prover/smt/solver/quantifier-analyzer.ts +27 -47
  425. package/src/prover/smt/solver/quantifier-manager.ts +9 -23
  426. package/src/prover/smt/solver/quasi-macros.ts +254 -0
  427. package/src/prover/smt/solver/random-gen.ts +1 -2
  428. package/src/prover/smt/solver/rational.ts +29 -8
  429. package/src/prover/smt/solver/recfun-decl-plugin.ts +248 -0
  430. package/src/prover/smt/solver/recfun-rewriter.ts +108 -0
  431. package/src/prover/smt/solver/reduce-args.ts +226 -0
  432. package/src/prover/smt/solver/reduce-bv-size.ts +120 -0
  433. package/src/prover/smt/solver/ref-vector.ts +1 -6
  434. package/src/prover/smt/solver/relevancy.ts +3 -16
  435. package/src/prover/smt/solver/rewriter-tpl.ts +49 -129
  436. package/src/prover/smt/solver/rewriter.ts +478 -120
  437. package/src/prover/smt/solver/rlimit.ts +27 -21
  438. package/src/prover/smt/solver/sat/asymm-branch.ts +314 -0
  439. package/src/prover/smt/solver/sat/big.ts +178 -0
  440. package/src/prover/smt/solver/sat/clause-use-list.ts +79 -0
  441. package/src/prover/smt/solver/sat/clause.ts +221 -0
  442. package/src/prover/smt/solver/sat/cleaner.ts +96 -0
  443. package/src/prover/smt/solver/sat/config.ts +125 -0
  444. package/src/prover/smt/solver/sat/consequences.ts +204 -0
  445. package/src/prover/smt/solver/sat/elim-eqs.ts +144 -0
  446. package/src/prover/smt/solver/sat/goal2sat.ts +528 -0
  447. package/src/prover/smt/solver/sat/inc-sat-solver.ts +388 -0
  448. package/src/prover/smt/solver/sat/model-converter.ts +156 -0
  449. package/src/prover/smt/solver/sat/pb-constraint.ts +264 -0
  450. package/src/prover/smt/solver/sat/pb-solver.ts +1553 -0
  451. package/src/prover/smt/solver/sat/probing.ts +169 -0
  452. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  453. package/src/prover/smt/solver/sat/sat2goal.ts +171 -0
  454. package/src/prover/smt/solver/sat/scc.ts +143 -0
  455. package/src/prover/smt/solver/sat/simplifier.ts +1662 -0
  456. package/src/prover/smt/solver/sat/solver.ts +2128 -0
  457. package/src/prover/smt/solver/sat/var-queue.ts +119 -0
  458. package/src/prover/smt/solver/sat/watch-list.ts +136 -0
  459. package/src/prover/smt/solver/search-tree.ts +285 -0
  460. package/src/prover/smt/solver/seq-axioms.ts +1013 -0
  461. package/src/prover/smt/solver/seq-decl-plugin.ts +823 -0
  462. package/src/prover/smt/solver/seq-derive.ts +1303 -0
  463. package/src/prover/smt/solver/seq-eq-approx.ts +238 -0
  464. package/src/prover/smt/solver/seq-eq-solver.ts +440 -0
  465. package/src/prover/smt/solver/seq-factory.ts +91 -0
  466. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  467. package/src/prover/smt/solver/seq-range-predicate.ts +225 -0
  468. package/src/prover/smt/solver/seq-re-rewriter.ts +1296 -0
  469. package/src/prover/smt/solver/seq-re-util.ts +777 -0
  470. package/src/prover/smt/solver/seq-regex-bisim.ts +145 -0
  471. package/src/prover/smt/solver/seq-regex-live.ts +202 -0
  472. package/src/prover/smt/solver/seq-regex-witness.ts +100 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2407 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +318 -0
  475. package/src/prover/smt/solver/seq-subset.ts +166 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +355 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +299 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +85 -0
  479. package/src/prover/smt/solver/smt-logics.ts +67 -0
  480. package/src/prover/smt/solver/smt-setup.ts +492 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +767 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +2423 -270
  483. package/src/prover/smt/solver/smtlib-script.ts +1493 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +931 -0
  485. package/src/prover/smt/solver/solver.ts +120 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +319 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  489. package/src/prover/smt/solver/tactic.ts +1936 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +206 -0
  491. package/src/prover/smt/solver/theory-array.ts +1275 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1239 -0
  493. package/src/prover/smt/solver/theory-char.ts +356 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +599 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +422 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +56 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -10
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +87 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +24 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +25 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +7 -27
  504. package/src/prover/smt/solver/theory-lra.ts +194 -8
  505. package/src/prover/smt/solver/theory-pb.ts +932 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +59 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +308 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +871 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1375 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +880 -0
  511. package/src/prover/smt/solver/theory-seq.ts +984 -0
  512. package/src/prover/smt/solver/theory.ts +175 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +487 -0
  514. package/src/prover/smt/solver/var-subst.ts +33 -35
  515. package/src/prover/smt/table.ts +1 -9
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -15
  535. package/src/prover/zenon/encode.ts +1 -8
  536. package/src/prover/zenon/eqrel.ts +2 -13
  537. package/src/prover/zenon/equality-rules.ts +0 -4
  538. package/src/prover/zenon/expr.ts +8 -26
  539. package/src/prover/zenon/index-table.ts +26 -57
  540. package/src/prover/zenon/isar-case.ts +9 -19
  541. package/src/prover/zenon/isar.ts +36 -64
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -20
  544. package/src/prover/zenon/mltoll.ts +66 -104
  545. package/src/prover/zenon/node.ts +20 -14
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +10 -12
  548. package/src/prover/zenon/phrase.ts +1 -11
  549. package/src/prover/zenon/proof.ts +0 -9
  550. package/src/prover/zenon/propositional-rules.ts +0 -5
  551. package/src/prover/zenon/rules.ts +2 -6
  552. package/src/prover/zenon/search.ts +11 -33
  553. package/src/prover/zenon/tla/functions.ts +59 -31
  554. package/src/prover/zenon/tla/llproof.ts +67 -76
  555. package/src/prover/zenon/tla/records.ts +57 -33
  556. package/src/prover/zenon/tla/rewrites.ts +12 -19
  557. package/src/prover/zenon/tla/sets.ts +88 -57
  558. package/src/prover/zenon/tla/terms.ts +0 -6
  559. package/src/prover/zenon/tla/tla.ts +66 -64
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -184
  562. package/src/runtime.ts +22 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +6 -34
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +1 -9
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +541 -163
  581. package/src/simulate.ts +709 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +0 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -31
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +266 -99
  589. package/src/symmetry.ts +33 -25
  590. package/src/tableau.ts +27 -24
  591. package/src/tlc/fingerprint.ts +183 -67
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +36 -47
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +139 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typescript/actions.ts +479 -0
  605. package/src/typescript/collections.ts +614 -0
  606. package/src/typescript/compile.ts +63 -0
  607. package/src/typescript/context.ts +94 -0
  608. package/src/typescript/emit.ts +121 -0
  609. package/src/typescript/expressions.ts +496 -0
  610. package/src/typescript/formula.ts +154 -0
  611. package/src/typescript/functions.ts +284 -0
  612. package/src/typescript/model.ts +162 -0
  613. package/src/typescript/names.ts +114 -0
  614. package/src/typescript/program.ts +48 -0
  615. package/src/typescript/properties.ts +139 -0
  616. package/src/typescript/scope.ts +112 -0
  617. package/src/typescript/steps.ts +167 -0
  618. package/src/typescript/types.ts +171 -0
  619. package/src/values.ts +832 -484
  620. package/src/worker.ts +7 -8
  621. package/src/prover/isabelle/isar/statement.ts +0 -57
  622. package/src/prover/tlaps-module.ts +0 -510
@@ -0,0 +1,1239 @@
1
+ // Ported from Z3 (src/smt/theory_bv.h, src/smt/theory_bv.cpp, src/util/union_find.h), MIT license,
2
+ // see z3-license.txt.
3
+ import { SmtInvariantError, SmtUnsupportedError } from "../../../errors";
4
+ import {
5
+ FAMILY_BV,
6
+ OP_ADD,
7
+ OP_BADD,
8
+ OP_BAND,
9
+ OP_BASHR,
10
+ OP_BCOMP,
11
+ OP_BIT2BOOL,
12
+ OP_BLSHR,
13
+ OP_BMUL,
14
+ OP_BNAND,
15
+ OP_BNEG,
16
+ OP_BNOR,
17
+ OP_BNOT,
18
+ OP_BOR,
19
+ OP_BREDAND,
20
+ OP_BREDOR,
21
+ OP_BSDIV0,
22
+ OP_BSDIV_I,
23
+ OP_BSHL,
24
+ OP_BSMOD,
25
+ OP_BSMOD0,
26
+ OP_BSMOD_I,
27
+ OP_BSMUL_NO_OVFL,
28
+ OP_BSMUL_NO_UDFL,
29
+ OP_BSREM,
30
+ OP_BSREM0,
31
+ OP_BSREM_I,
32
+ OP_BSUB,
33
+ OP_BUDIV0,
34
+ OP_BUDIV_I,
35
+ OP_BUMUL_NO_OVFL,
36
+ OP_BUREM,
37
+ OP_BUREM0,
38
+ OP_BUREM_I,
39
+ OP_BV_NUM,
40
+ OP_BXNOR,
41
+ OP_BXOR,
42
+ OP_CONCAT,
43
+ OP_EXT_ROTATE_LEFT,
44
+ OP_EXT_ROTATE_RIGHT,
45
+ OP_EXTRACT,
46
+ OP_GE,
47
+ OP_IDIV,
48
+ OP_INT2BV,
49
+ OP_ITE,
50
+ OP_MKBV,
51
+ OP_MOD,
52
+ OP_ROTATE_LEFT,
53
+ OP_ROTATE_RIGHT,
54
+ OP_SIGN_EXT,
55
+ OP_SLEQ,
56
+ OP_UBV2INT,
57
+ OP_ULEQ,
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 type { Context } from "./context";
65
+ import { type Antecedents, Enode, Justification, TheoryJustification } from "./enode";
66
+ import { combineHash, hashU } from "./hash";
67
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
68
+ import {
69
+ type BoolVar,
70
+ FALSE_LITERAL,
71
+ getVar,
72
+ isNegated,
73
+ type Literal,
74
+ mkLiteral,
75
+ negate,
76
+ TRUE_BOOL_VAR,
77
+ TRUE_LITERAL,
78
+ } from "./literal";
79
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
80
+ import { Theory } from "./theory";
81
+
82
+ const NULL_THEORY_ID = -1;
83
+
84
+ interface VarPosOcc {
85
+ readonly thVar: number;
86
+ readonly index: number;
87
+ readonly next: VarPosOcc | null;
88
+ }
89
+
90
+ interface BitAtom {
91
+ readonly isBit: true;
92
+ occs: VarPosOcc | null;
93
+ }
94
+
95
+ interface LeAtom {
96
+ readonly isBit: false;
97
+ readonly literal: Literal;
98
+ readonly def: Literal;
99
+ }
100
+
101
+ interface ZeroOneBit {
102
+ readonly owner: number;
103
+ readonly index: number;
104
+ readonly isTrue: boolean;
105
+ }
106
+
107
+ interface BvDiseq {
108
+ readonly first: number;
109
+ readonly second: number;
110
+ readonly index: number;
111
+ }
112
+
113
+ export type Blast = (
114
+ blaster: BitBlaster,
115
+ bits: number[][],
116
+ parameter: number,
117
+ out: number[],
118
+ ) => void;
119
+
120
+ export const UNARY_BLASTS = new Map<number, Blast>([
121
+ [OP_BNEG, (blaster, bits, _parameter, out) => blaster.mkNeg(bits[0], out)],
122
+ [OP_BNOT, (blaster, bits, _parameter, out) => blaster.mkNotBits(bits[0], out)],
123
+ [OP_BREDAND, (blaster, bits, _parameter, out) => blaster.mkRedand(bits[0], out)],
124
+ [OP_BREDOR, (blaster, bits, _parameter, out) => blaster.mkRedor(bits[0], out)],
125
+ [OP_SIGN_EXT, (blaster, bits, parameter, out) => blaster.mkSignExtend(bits[0], parameter, out)],
126
+ [OP_ZERO_EXT, (blaster, bits, parameter, out) => blaster.mkZeroExtend(bits[0], parameter, out)],
127
+ [
128
+ OP_ROTATE_LEFT,
129
+ (blaster, bits, parameter, out) => blaster.mkRotateLeft(bits[0], parameter, out),
130
+ ],
131
+ [
132
+ OP_ROTATE_RIGHT,
133
+ (blaster, bits, parameter, out) => blaster.mkRotateRight(bits[0], parameter, out),
134
+ ],
135
+ ]);
136
+
137
+ export const BINARY_BLASTS = new Map<number, Blast>([
138
+ [OP_BUDIV_I, (blaster, bits, _parameter, out) => blaster.mkUdiv(bits[0], bits[1], out)],
139
+ [OP_BSDIV_I, (blaster, bits, _parameter, out) => blaster.mkSdiv(bits[0], bits[1], out)],
140
+ [OP_BUREM_I, (blaster, bits, _parameter, out) => blaster.mkUrem(bits[0], bits[1], out)],
141
+ [OP_BSREM_I, (blaster, bits, _parameter, out) => blaster.mkSrem(bits[0], bits[1], out)],
142
+ [OP_BSMOD_I, (blaster, bits, _parameter, out) => blaster.mkSmod(bits[0], bits[1], out)],
143
+ [OP_BSHL, (blaster, bits, _parameter, out) => blaster.mkShl(bits[0], bits[1], out)],
144
+ [OP_BLSHR, (blaster, bits, _parameter, out) => blaster.mkLshr(bits[0], bits[1], out)],
145
+ [OP_BASHR, (blaster, bits, _parameter, out) => blaster.mkAshr(bits[0], bits[1], out)],
146
+ [
147
+ OP_EXT_ROTATE_LEFT,
148
+ (blaster, bits, _parameter, out) => blaster.mkExtRotateLeft(bits[0], bits[1], out),
149
+ ],
150
+ [
151
+ OP_EXT_ROTATE_RIGHT,
152
+ (blaster, bits, _parameter, out) => blaster.mkExtRotateRight(bits[0], bits[1], out),
153
+ ],
154
+ [OP_BCOMP, (blaster, bits, _parameter, out) => blaster.mkComp(bits[0], bits[1], out)],
155
+ ]);
156
+
157
+ // MK_AC_BINARY: folded from the last argument to the first.
158
+ export const AC_BLASTS = new Map<number, Blast>([
159
+ [OP_BADD, (blaster, bits, _parameter, out) => blaster.mkAdder(bits[0], bits[1], out)],
160
+ [OP_BMUL, (blaster, bits, _parameter, out) => blaster.mkMultiplier(bits[0], bits[1], out)],
161
+ [OP_BAND, (blaster, bits, _parameter, out) => blaster.mkAndBits(bits[0], bits[1], out)],
162
+ [OP_BOR, (blaster, bits, _parameter, out) => blaster.mkOrBits(bits[0], bits[1], out)],
163
+ [OP_BXOR, (blaster, bits, _parameter, out) => blaster.mkXorBits(bits[0], bits[1], out)],
164
+ [OP_BNAND, (blaster, bits, _parameter, out) => blaster.mkNandBits(bits[0], bits[1], out)],
165
+ [OP_BNOR, (blaster, bits, _parameter, out) => blaster.mkNorBits(bits[0], bits[1], out)],
166
+ [OP_BXNOR, (blaster, bits, _parameter, out) => blaster.mkXnorBits(bits[0], bits[1], out)],
167
+ ]);
168
+
169
+ const DIVREM_OPS: ReadonlySet<number> = new Set([
170
+ OP_BUREM,
171
+ OP_BUREM_I,
172
+ OP_BSREM,
173
+ OP_BSREM_I,
174
+ OP_BSMOD,
175
+ OP_BSMOD_I,
176
+ OP_BUDIV_I,
177
+ OP_BSDIV_I,
178
+ ]);
179
+
180
+ // The division by zero, which the model interprets, and the divisions that hi_div0 rewrote.
181
+ const UNINTERPRETED_OPS: ReadonlySet<number> = new Set([
182
+ OP_BSDIV0,
183
+ OP_BUDIV0,
184
+ OP_BSREM0,
185
+ OP_BUREM0,
186
+ OP_BSMOD0,
187
+ OP_BSREM,
188
+ OP_BUREM,
189
+ OP_BSMOD,
190
+ ]);
191
+
192
+ const DIV0_OPS: ReadonlySet<number> = new Set([
193
+ OP_BSDIV0,
194
+ OP_BUDIV0,
195
+ OP_BSREM0,
196
+ OP_BUREM0,
197
+ OP_BSMOD0,
198
+ ]);
199
+
200
+ class BitEqJustification extends Justification {
201
+ constructor(
202
+ readonly fromTheory: number,
203
+ private first: Enode,
204
+ private second: Enode,
205
+ private antecedent: Literal,
206
+ ) {
207
+ super();
208
+ }
209
+
210
+ getAntecedents(antecedents: Antecedents) {
211
+ antecedents.markEq(this.first, this.second);
212
+ if (getVar(this.antecedent) !== TRUE_BOOL_VAR) antecedents.markLiteral(this.antecedent);
213
+ }
214
+ }
215
+
216
+ class FixedEqJustification extends Justification {
217
+ constructor(
218
+ readonly fromTheory: number,
219
+ private context: Context,
220
+ private firstBits: readonly Literal[],
221
+ private secondBits: readonly Literal[],
222
+ ) {
223
+ super();
224
+ }
225
+
226
+ getAntecedents(antecedents: Antecedents) {
227
+ for (const bits of [this.firstBits, this.secondBits])
228
+ for (const bit of bits)
229
+ if (getVar(bit) !== TRUE_BOOL_VAR)
230
+ antecedents.markLiteral(this.context.getAssignment(bit) === L_TRUE ? bit : negate(bit));
231
+ }
232
+ }
233
+
234
+ export class TheoryBv extends Theory {
235
+ readonly name = "bit-vector";
236
+ private blaster: BitBlaster;
237
+ private trail: (() => void)[] = [];
238
+ private trailLimits: number[] = [];
239
+ private finds: number[] = [];
240
+ private sizes: number[] = [];
241
+ private nexts: number[] = [];
242
+ private bits: Literal[][] = [];
243
+ private wpos: number[] = [];
244
+ private zeroOneBits: ZeroOneBit[][] = [];
245
+ private atoms: (BitAtom | LeAtom | undefined)[] = [];
246
+ private fixedVars = new Map<string, number>();
247
+ private eqActivity = new Uint8Array(256);
248
+ private propDiseqs: BvDiseq[] = [];
249
+ private propDiseqsHead = 0;
250
+ private propQueue: number[] = [];
251
+ private mergeAux: [number[], number[]] = [[], []];
252
+ private bv2ints: Enode[] = [];
253
+
254
+ constructor(context: Context) {
255
+ super(context, FAMILY_BV);
256
+ this.blaster = new BitBlaster(context.manager);
257
+ }
258
+
259
+ private getBvSize(thVar: number) {
260
+ const manager = this.manager;
261
+ return manager.getBvSize(manager.sorts[this.getExpr(thVar)]);
262
+ }
263
+
264
+ private find(thVar: number) {
265
+ let current = thVar;
266
+ while (this.finds[current] !== current) current = this.finds[current];
267
+ return current;
268
+ }
269
+
270
+ private merge(inputFirst: number, inputSecond: number) {
271
+ const firstRoot = this.find(inputFirst);
272
+ const secondRoot = this.find(inputSecond);
273
+ if (firstRoot === secondRoot) return;
274
+ const isSwapped = this.sizes[firstRoot] > this.sizes[secondRoot];
275
+ const joining = isSwapped ? secondRoot : firstRoot;
276
+ const root = isSwapped ? firstRoot : secondRoot;
277
+ this.mergeEh(
278
+ root,
279
+ joining,
280
+ isSwapped ? inputFirst : inputSecond,
281
+ isSwapped ? inputSecond : inputFirst,
282
+ );
283
+ this.finds[joining] = root;
284
+ this.sizes[root] += this.sizes[joining];
285
+ const next = this.nexts[joining];
286
+ this.nexts[joining] = this.nexts[root];
287
+ this.nexts[root] = next;
288
+ this.trail.push(() => {
289
+ this.sizes[root] -= this.sizes[joining];
290
+ this.finds[joining] = joining;
291
+ const restored = this.nexts[joining];
292
+ this.nexts[joining] = this.nexts[root];
293
+ this.nexts[root] = restored;
294
+ this.unmergeEh(root);
295
+ });
296
+ }
297
+
298
+ private mkVar(node: Enode) {
299
+ const thVar = this.varEnodes.length;
300
+ this.varEnodes.push(node);
301
+ this.finds.push(thVar);
302
+ this.sizes.push(1);
303
+ this.nexts.push(thVar);
304
+ this.trail.push(() => {
305
+ this.finds.pop();
306
+ this.sizes.pop();
307
+ this.nexts.pop();
308
+ });
309
+ this.bits.push([]);
310
+ this.wpos.push(0);
311
+ this.zeroOneBits.push([]);
312
+ this.context.attachThVar(node, this, thVar);
313
+ return thVar;
314
+ }
315
+
316
+ private insertAtom(boolVar: BoolVar, atom: BitAtom | LeAtom) {
317
+ this.atoms[boolVar] = atom;
318
+ this.trail.push(() => {
319
+ this.atoms[boolVar] = undefined;
320
+ });
321
+ }
322
+
323
+ private mkBits(thVar: number) {
324
+ const context = this.context;
325
+ const owner = this.getExpr(thVar);
326
+ const isRelevant = context.isRelevant(owner);
327
+ const bits = this.bits[thVar];
328
+ bits.length = 0;
329
+ const bitExprs = Array.from({ length: this.getBvSize(thVar) }, (_, index) =>
330
+ mkBvApp(this.manager, OP_BIT2BOOL, [owner], [index]),
331
+ );
332
+ context.internalizeAll(bitExprs, true);
333
+ for (const bitExpr of bitExprs) {
334
+ bits.push(mkLiteral(context.getBoolVar(bitExpr)));
335
+ if (isRelevant && !context.isRelevant(bitExpr)) context.markAsRelevant(bitExpr);
336
+ }
337
+ }
338
+
339
+ private mkBit2Bool(atom: number) {
340
+ const context = this.context;
341
+ const manager = this.manager;
342
+ const arg = manager.getArg(atom, 0);
343
+ if (!context.isEInternalized(arg)) {
344
+ context.internalize(arg, false);
345
+ this.getVar(this.getInternalizedEnode(arg));
346
+ }
347
+ const argVar = this.getInternalizedEnode(arg).getThVar(this.id);
348
+ const index = this.getParameter(atom, 0);
349
+ if (argVar < 0) this.getVar(this.getInternalizedEnode(arg));
350
+ else if (!context.isBInternalized(atom)) {
351
+ const boolVar = context.mkBoolVar(atom);
352
+ context.setVarTheory(boolVar, this.id);
353
+ this.insertAtom(boolVar, { isBit: true, occs: { thVar: argVar, index, next: null } });
354
+ const bit = this.bits[argVar][index];
355
+ if (bit !== undefined) {
356
+ context.mkThAxiom([bit, mkLiteral(boolVar, true)]);
357
+ context.mkThAxiom([negate(bit), mkLiteral(boolVar)]);
358
+ }
359
+ }
360
+ if (!manager.isBvNumeral(arg)) return;
361
+ const isOne = ((manager.getBvNumeralValue(arg) >> BigInt(index)) & 1n) === 1n;
362
+ const literal = context.getLiteral(atom);
363
+ context.markLiteralAsRelevant(literal);
364
+ context.mkThAxiom([isOne ? literal : negate(literal)]);
365
+ }
366
+
367
+ private getParameter(expr: number, index: number) {
368
+ const manager = this.manager;
369
+ return manager.funcDecls[manager.decls[expr]].parameters[index];
370
+ }
371
+
372
+ private getInternalizedEnode(expr: number) {
373
+ const node = this.context.getEnode(expr);
374
+ if (node === undefined) throw new SmtInvariantError("the term was not internalized");
375
+ return node;
376
+ }
377
+
378
+ private mkEnode(term: number) {
379
+ const context = this.context;
380
+ if (context.isEInternalized(term)) return this.getInternalizedEnode(term);
381
+ const node = context.mkEnode(term, false, false, false);
382
+ this.mkVar(node);
383
+ return node;
384
+ }
385
+
386
+ private getVar(node: Enode) {
387
+ const thVar = node.getThVar(this.id);
388
+ if (thVar >= 0) return thVar;
389
+ const created = this.mkVar(node);
390
+ this.mkBits(created);
391
+ return created;
392
+ }
393
+
394
+ private literalToExpr(literal: Literal) {
395
+ const manager = this.manager;
396
+ const atom = this.context.boolVar2Expr[getVar(literal)];
397
+ const expr =
398
+ literal === TRUE_LITERAL
399
+ ? manager.trueExpr
400
+ : literal === FALSE_LITERAL
401
+ ? manager.falseExpr
402
+ : isNegated(literal)
403
+ ? manager.mkNot(atom)
404
+ : atom;
405
+ manager.incRef(expr);
406
+ return expr;
407
+ }
408
+
409
+ private getBits(thVar: number) {
410
+ return this.bits[thVar].map((bit) => this.literalToExpr(bit));
411
+ }
412
+
413
+ private dropAll(exprs: number[]) {
414
+ for (const expr of exprs) this.manager.decRef(expr);
415
+ }
416
+
417
+ private addNewDiseqAxiom(first: number, second: number, index: number) {
418
+ this.propDiseqs.push({ first, second, index });
419
+ this.context.pushTrail(() => {
420
+ this.propDiseqs.pop();
421
+ });
422
+ }
423
+
424
+ private assertNewDiseqAxiom(first: number, second: number) {
425
+ const context = this.context;
426
+ const manager = this.manager;
427
+ const firstExpr = this.getExpr(first);
428
+ const secondExpr = this.getExpr(second);
429
+ const eq = manager.mkEq(firstExpr, secondExpr);
430
+ manager.incRef(eq);
431
+ context.mkThAxiom([negate(this.mkLiteral(eq))]);
432
+ const relevancy = context.relevancy;
433
+ if (relevancy.isEnabled) {
434
+ const handler = () => {
435
+ if (relevancy.isRelevant(firstExpr) && relevancy.isRelevant(secondExpr))
436
+ relevancy.markAsRelevant(eq);
437
+ };
438
+ relevancy.addHandler(firstExpr, handler);
439
+ relevancy.addHandler(secondExpr, handler);
440
+ }
441
+ manager.decRef(eq);
442
+ }
443
+
444
+ private registerTrueFalseBit(thVar: number, index: number) {
445
+ this.zeroOneBits[thVar].push({
446
+ owner: thVar,
447
+ index,
448
+ isTrue: this.bits[thVar][index] === TRUE_LITERAL,
449
+ });
450
+ }
451
+
452
+ private addBit(thVar: number, literal: Literal) {
453
+ const context = this.context;
454
+ const bits = this.bits[thVar];
455
+ const index = bits.length;
456
+ bits.push(literal);
457
+ const boolVar = getVar(literal);
458
+ if (boolVar === TRUE_BOOL_VAR) {
459
+ this.registerTrueFalseBit(thVar, index);
460
+ return;
461
+ }
462
+ const thId = context.getBoolVarTheory(boolVar);
463
+ if (thId === this.id) {
464
+ const atom = this.atoms[boolVar];
465
+ if (atom === undefined || !atom.isBit) return;
466
+ const negated = negate(literal);
467
+ const size = this.getBvSize(thVar);
468
+ for (let occ = atom.occs; occ !== null; occ = occ.next)
469
+ if (
470
+ occ.index === index &&
471
+ this.bits[occ.thVar][occ.index] === negated &&
472
+ this.getBvSize(occ.thVar) === size
473
+ )
474
+ this.addNewDiseqAxiom(thVar, occ.thVar, index);
475
+ const previous = atom.occs;
476
+ this.trail.push(() => {
477
+ atom.occs = previous;
478
+ });
479
+ atom.occs = { thVar, index, next: previous };
480
+ } else if (thId === NULL_THEORY_ID) {
481
+ context.setVarTheory(boolVar, this.id);
482
+ this.insertAtom(boolVar, { isBit: true, occs: { thVar, index, next: null } });
483
+ }
484
+ }
485
+
486
+ private initBits(node: Enode, bitExprs: number[]) {
487
+ const context = this.context;
488
+ const thVar = node.getThVar(this.id);
489
+ this.bits[thVar].length = 0;
490
+ context.internalizeAll(bitExprs, true);
491
+ for (const bitExpr of bitExprs) this.addBit(thVar, context.getLiteral(bitExpr));
492
+ this.findWpos(thVar);
493
+ }
494
+
495
+ private findWpos(thVar: number) {
496
+ const context = this.context;
497
+ const bits = this.bits[thVar];
498
+ const start = this.wpos[thVar];
499
+ for (let offset = 0; offset < bits.length; offset++) {
500
+ const position = (start + offset) % bits.length;
501
+ if (context.getAssignment(bits[position]) === L_UNDEF) {
502
+ this.wpos[thVar] = position;
503
+ return;
504
+ }
505
+ }
506
+ this.fixedVarEh(thVar);
507
+ }
508
+
509
+ private addFixedEq(inputFirst: number, inputSecond: number) {
510
+ const first = Math.min(inputFirst, inputSecond);
511
+ const second = Math.max(inputFirst, inputSecond);
512
+ const slot = combineHash(hashU(first), hashU(second)) & 0xff;
513
+ const activity = this.eqActivity[slot]++;
514
+ if (activity !== 0xff) return;
515
+ const context = this.context;
516
+ const manager = this.manager;
517
+ const firstExpr = this.getExpr(first);
518
+ const secondExpr = this.getExpr(second);
519
+ const classEq = this.mkEq(firstExpr, secondExpr, true);
520
+ context.markLiteralAsRelevant(classEq);
521
+ const literals: Literal[] = [];
522
+ for (let index = 0; index < this.getBvSize(first); index++) {
523
+ const firstBit = this.bits[first][index];
524
+ const secondBit = this.bits[second][index];
525
+ const firstBitExpr = mkBvApp(manager, OP_BIT2BOOL, [firstExpr], [index]);
526
+ manager.incRef(firstBitExpr);
527
+ const secondBitExpr = mkBvApp(manager, OP_BIT2BOOL, [secondExpr], [index]);
528
+ manager.incRef(secondBitExpr);
529
+ const eq = this.mkEq(firstBitExpr, secondBitExpr, true);
530
+ context.mkThAxiom([firstBit, negate(secondBit), negate(eq)]);
531
+ context.mkThAxiom([negate(firstBit), secondBit, negate(eq)]);
532
+ context.mkThAxiom([firstBit, secondBit, eq]);
533
+ context.mkThAxiom([negate(firstBit), negate(secondBit), eq]);
534
+ context.mkThAxiom([eq, negate(classEq)]);
535
+ literals.push(negate(eq));
536
+ manager.decRef(secondBitExpr);
537
+ manager.decRef(firstBitExpr);
538
+ }
539
+ literals.push(classEq);
540
+ context.mkThAxiom(literals);
541
+ }
542
+
543
+ private getFixedValue(thVar: number) {
544
+ const context = this.context;
545
+ let value = 0n;
546
+ let isFixed = true;
547
+ const bits = this.bits[thVar];
548
+ for (let index = 0; index < bits.length; index++) {
549
+ const assignment = context.getAssignment(bits[index]);
550
+ if (assignment === L_UNDEF) {
551
+ isFixed = false;
552
+ break;
553
+ }
554
+ if (assignment === L_TRUE) value += 1n << BigInt(index);
555
+ }
556
+ return { value, isFixed };
557
+ }
558
+
559
+ private fixedVarEh(thVar: number) {
560
+ const value = this.getFixedValue(thVar).value;
561
+ const size = this.getBvSize(thVar);
562
+ const key = `${size}:${value}`;
563
+ const other = this.fixedVars.get(key);
564
+ if (other === undefined) {
565
+ this.fixedVars.set(key, thVar);
566
+ return;
567
+ }
568
+ const otherValue = other < this.getNumVars() ? this.getFixedValue(other) : undefined;
569
+ if (
570
+ otherValue === undefined ||
571
+ this.getBvSize(other) !== size ||
572
+ !otherValue.isFixed ||
573
+ otherValue.value !== value
574
+ ) {
575
+ this.fixedVars.delete(key);
576
+ this.fixedVars.set(key, thVar);
577
+ return;
578
+ }
579
+ const node = this.getEnode(thVar);
580
+ const otherNode = this.getEnode(other);
581
+ if (node.root === otherNode.root) return;
582
+ this.addFixedEq(thVar, other);
583
+ const justification = new FixedEqJustification(
584
+ this.id,
585
+ this.context,
586
+ this.bits[thVar],
587
+ this.bits[other],
588
+ );
589
+ this.context.pushEq(node, otherNode, { kind: "justification", justification });
590
+ this.fixedVars.set(key, other);
591
+ }
592
+
593
+ private internalizeNum(term: number) {
594
+ const manager = this.manager;
595
+ const value = manager.getBvNumeralValue(term);
596
+ const size = manager.getBvSize(manager.sorts[term]);
597
+ const thVar = this.mkEnode(term).getThVar(this.id);
598
+ const bits = this.bits[thVar];
599
+ for (let index = 0; index < size; index++) {
600
+ bits.push(((value >> BigInt(index)) & 1n) === 1n ? TRUE_LITERAL : FALSE_LITERAL);
601
+ this.registerTrueFalseBit(thVar, index);
602
+ }
603
+ this.fixedVarEh(thVar);
604
+ }
605
+
606
+ private processArgs(term: number) {
607
+ const manager = this.manager;
608
+ this.context.internalizeAll(manager.getArgs(term), false);
609
+ }
610
+
611
+ private getArgBits(node: Enode, index: number) {
612
+ return this.getBits(this.getVar(node.getArg(index)));
613
+ }
614
+
615
+ private internalizeBlast(term: number, blast: Blast, isAssociative: boolean) {
616
+ this.processArgs(term);
617
+ const node = this.mkEnode(term);
618
+ const numArgs = node.numArgs;
619
+ const parameters = this.manager.funcDecls[this.manager.decls[term]].parameters;
620
+ if (!isAssociative) {
621
+ const args = Array.from({ length: numArgs }, (_, index) => this.getArgBits(node, index));
622
+ const bits: number[] = [];
623
+ blast(this.blaster, args, parameters[0], bits);
624
+ this.initBits(node, bits);
625
+ this.dropAll(bits);
626
+ for (let index = args.length - 1; index >= 0; index--) this.dropAll(args[index]);
627
+ return;
628
+ }
629
+ let argBits: number[] = [];
630
+ let bits = this.getArgBits(node, numArgs - 1);
631
+ let newBits: number[] = [];
632
+ for (let index = numArgs - 2; index >= 0; index--) {
633
+ this.dropAll(argBits);
634
+ argBits = this.getArgBits(node, index);
635
+ this.dropAll(newBits);
636
+ newBits = [];
637
+ blast(this.blaster, [argBits, bits], 0, newBits);
638
+ const swapped = bits;
639
+ bits = newBits;
640
+ newBits = swapped;
641
+ }
642
+ this.initBits(node, bits);
643
+ this.dropAll(newBits);
644
+ this.dropAll(bits);
645
+ this.dropAll(argBits);
646
+ }
647
+
648
+ private internalizeSub(term: number) {
649
+ this.processArgs(term);
650
+ const node = this.mkEnode(term);
651
+ const first = this.getArgBits(node, 0);
652
+ const second = this.getArgBits(node, 1);
653
+ const bits: number[] = [];
654
+ const carry = this.blaster.mkSubtracter(first, second, bits);
655
+ this.initBits(node, bits);
656
+ this.manager.decRef(carry);
657
+ this.dropAll(bits);
658
+ this.dropAll(second);
659
+ this.dropAll(first);
660
+ }
661
+
662
+ private internalizeConcat(term: number) {
663
+ this.processArgs(term);
664
+ const node = this.mkEnode(term);
665
+ const thVar = node.getThVar(this.id);
666
+ this.bits[thVar].length = 0;
667
+ for (let index = node.numArgs - 1; index >= 0; index--)
668
+ for (const bit of this.bits[this.getVar(node.getArg(index))]) this.addBit(thVar, bit);
669
+ this.findWpos(thVar);
670
+ }
671
+
672
+ private internalizeExtract(term: number) {
673
+ this.processArgs(term);
674
+ const node = this.mkEnode(term);
675
+ const thVar = node.getThVar(this.id);
676
+ const argBits = this.bits[this.getVar(node.getArg(0))];
677
+ this.bits[thVar].length = 0;
678
+ for (let index = this.getParameter(term, 1); index <= this.getParameter(term, 0); index++)
679
+ this.addBit(thVar, argBits[index]);
680
+ this.findWpos(thVar);
681
+ }
682
+
683
+ private internalizeMkbv(term: number) {
684
+ const manager = this.manager;
685
+ this.processArgs(term);
686
+ const node = this.mkEnode(term);
687
+ const bits = manager.getArgs(term);
688
+ for (const bit of bits) manager.incRef(bit);
689
+ this.initBits(node, bits);
690
+ this.dropAll(bits);
691
+ }
692
+
693
+ private internalizeBv2int(term: number) {
694
+ this.processArgs(term);
695
+ const node = this.mkEnode(term);
696
+ this.bv2ints.push(node);
697
+ this.context.pushTrail(() => {
698
+ this.bv2ints.pop();
699
+ });
700
+ if (!this.context.relevancy.isEnabled) this.assertBv2intAxiom(term);
701
+ }
702
+
703
+ private assertBv2intAxiom(term: number) {
704
+ const context = this.context;
705
+ const manager = this.manager;
706
+ const word = manager.getArg(term, 0);
707
+ const wordBits = this.getBits(this.getVar(this.getInternalizedEnode(word)));
708
+ const zero = manager.mkNumeral(0n);
709
+ const terms = wordBits.map((bit, index) =>
710
+ manager.mkApp(OP_ITE, [bit, manager.mkNumeral(1n << BigInt(index)), zero], SORT_INT),
711
+ );
712
+ const sum = terms.length === 1 ? terms[0] : manager.mkApp(OP_ADD, terms, SORT_INT);
713
+ manager.incRef(sum);
714
+ const rewritten = new Rewriter(manager, TACTIC_REWRITER_OPTIONS).rewrite(sum);
715
+ const literal = this.mkEq(term, rewritten, false);
716
+ context.markLiteralAsRelevant(literal);
717
+ context.mkThAxiom([literal]);
718
+ manager.decRef(rewritten);
719
+ manager.decRef(sum);
720
+ this.dropAll(wordBits);
721
+ }
722
+
723
+ private internalizeInt2bv(term: number) {
724
+ this.processArgs(term);
725
+ const node = this.mkEnode(term);
726
+ this.mkBits(node.getThVar(this.id));
727
+ const arg = node.getArg(0);
728
+ if (!this.isAttachedToVar(arg)) this.mkVar(arg);
729
+ if (!this.context.relevancy.isEnabled) this.assertInt2bvAxiom(term);
730
+ }
731
+
732
+ private assertInt2bvAxiom(term: number) {
733
+ const context = this.context;
734
+ const manager = this.manager;
735
+ const arg = manager.getArg(term, 0);
736
+ const size = manager.getBvSize(manager.sorts[term]);
737
+ const mkMod = (dividend: number, divisor: bigint) =>
738
+ manager.mkApp(OP_MOD, [dividend, manager.mkNumeral(divisor)], SORT_INT);
739
+ const value = mkBvApp(manager, OP_UBV2INT, [term]);
740
+ manager.incRef(value);
741
+ const remainder = mkMod(arg, 1n << BigInt(size));
742
+ manager.incRef(remainder);
743
+ const literal = this.mkEq(value, remainder, false);
744
+ context.markLiteralAsRelevant(literal);
745
+ context.mkThAxiom([literal]);
746
+ manager.decRef(remainder);
747
+ manager.decRef(value);
748
+ const termBits = this.getBits(this.getVar(this.getInternalizedEnode(term)));
749
+ for (let index = 0; index < size; index++) {
750
+ const divisor = 1n << BigInt(index);
751
+ const quotient =
752
+ index === 0 ? arg : manager.mkApp(OP_IDIV, [arg, manager.mkNumeral(divisor)], SORT_INT);
753
+ manager.incRef(quotient);
754
+ const isOne = context.mkEqAtom(mkMod(quotient, 2n), manager.mkNumeral(1n));
755
+ manager.incRef(isOne);
756
+ const bitLiteral = this.mkEq(termBits[index], isOne, false);
757
+ context.markLiteralAsRelevant(bitLiteral);
758
+ context.mkThAxiom([bitLiteral]);
759
+ manager.decRef(isOne);
760
+ const zero = manager.mkNumeral(0n);
761
+ manager.incRef(zero);
762
+ const isAbove = this.mkLiteral(
763
+ manager.mkApp(OP_GE, [arg, manager.mkNumeral(divisor)], SORT_BOOL),
764
+ );
765
+ const isNonNegative = this.mkLiteral(manager.mkApp(OP_GE, [arg, zero], SORT_BOOL));
766
+ const isZero = this.mkEq(quotient, zero, false);
767
+ for (const bound of [isAbove, isNonNegative, isZero]) context.markLiteralAsRelevant(bound);
768
+ context.mkThAxiom([isAbove, negate(isNonNegative), isZero]);
769
+ manager.decRef(zero);
770
+ manager.decRef(quotient);
771
+ }
772
+ this.dropAll(termBits);
773
+ }
774
+
775
+ internalizeTerm(term: number) {
776
+ const manager = this.manager;
777
+ const op = manager.getOp(term);
778
+ if (UNINTERPRETED_OPS.has(op)) return false;
779
+ // scoped_suspend_rlimit: the circuits count their steps but are never canceled.
780
+ const limit = manager.limit;
781
+ const wasSuspended = limit.isSuspended;
782
+ limit.isSuspended = true;
783
+ try {
784
+ this.internalizeTermCore(term, op);
785
+ if (DIVREM_OPS.has(op) && !this.context.relevancy.isEnabled)
786
+ this.assertDivremBoundAxiom(term);
787
+ } finally {
788
+ limit.isSuspended = wasSuspended;
789
+ }
790
+ return true;
791
+ }
792
+
793
+ private internalizeTermCore(term: number, op: number) {
794
+ if (op === OP_BV_NUM) this.internalizeNum(term);
795
+ else if (op === OP_BSUB) this.internalizeSub(term);
796
+ else if (op === OP_CONCAT) this.internalizeConcat(term);
797
+ else if (op === OP_EXTRACT) this.internalizeExtract(term);
798
+ else if (op === OP_MKBV) this.internalizeMkbv(term);
799
+ else if (op === OP_INT2BV) this.internalizeInt2bv(term);
800
+ else if (op === OP_UBV2INT) this.internalizeBv2int(term);
801
+ else {
802
+ const acBlast = AC_BLASTS.get(op);
803
+ const blast = acBlast ?? UNARY_BLASTS.get(op) ?? BINARY_BLASTS.get(op);
804
+ if (blast === undefined)
805
+ throw new SmtUnsupportedError(
806
+ `the bit-vector operator ${this.manager.funcDecls[this.manager.decls[term]].name}`,
807
+ );
808
+ this.internalizeBlast(term, blast, acBlast !== undefined);
809
+ }
810
+ }
811
+
812
+ internalizeAtom(atom: number) {
813
+ const op = this.manager.getOp(atom);
814
+ if (op === OP_BIT2BOOL) this.mkBit2Bool(atom);
815
+ else if (op === OP_ULEQ || op === OP_SLEQ) this.internalizeLe(atom, op === OP_SLEQ);
816
+ else if (op === OP_BUMUL_NO_OVFL || op === OP_BSMUL_NO_OVFL || op === OP_BSMUL_NO_UDFL)
817
+ this.internalizeNoOverflow(atom, op);
818
+ else
819
+ throw new SmtUnsupportedError(
820
+ `the bit-vector predicate ${this.manager.funcDecls[this.manager.decls[atom]].name}`,
821
+ );
822
+ return true;
823
+ }
824
+
825
+ private getAppArgBits(term: number, index: number) {
826
+ return this.getBits(this.getVar(this.getInternalizedEnode(this.manager.getArg(term, index))));
827
+ }
828
+
829
+ private mkDefinedAtom(atom: number, circuit: number) {
830
+ const context = this.context;
831
+ this.manager.incRef(circuit);
832
+ context.internalize(circuit, true);
833
+ const def = context.getLiteral(circuit);
834
+ const literal = mkLiteral(context.mkBoolVar(atom));
835
+ context.setVarTheory(getVar(literal), this.id);
836
+ this.insertAtom(getVar(literal), { isBit: false, literal, def });
837
+ context.mkThAxiom([literal, negate(def)]);
838
+ context.mkThAxiom([negate(literal), def]);
839
+ this.manager.decRef(circuit);
840
+ }
841
+
842
+ private internalizeNoOverflow(atom: number, op: number) {
843
+ this.processArgs(atom);
844
+ const first = this.getAppArgBits(atom, 0);
845
+ const second = this.getAppArgBits(atom, 1);
846
+ const blaster = this.blaster;
847
+ const circuit =
848
+ op === OP_BUMUL_NO_OVFL
849
+ ? blaster.mkUmulNoOverflow(first, second)
850
+ : op === OP_BSMUL_NO_OVFL
851
+ ? blaster.mkSmulNoOverflow(first, second)
852
+ : blaster.mkSmulNoUnderflow(first, second);
853
+ this.mkDefinedAtom(atom, circuit);
854
+ this.manager.decRef(circuit);
855
+ this.dropAll(second);
856
+ this.dropAll(first);
857
+ }
858
+
859
+ private internalizeLe(atom: number, isSigned: boolean) {
860
+ this.processArgs(atom);
861
+ const first = this.getAppArgBits(atom, 0);
862
+ const second = this.getAppArgBits(atom, 1);
863
+ if (!this.context.isBInternalized(atom)) {
864
+ const circuit = isSigned
865
+ ? this.blaster.mkSle(first, second)
866
+ : this.blaster.mkUle(first, second);
867
+ this.mkDefinedAtom(atom, circuit);
868
+ this.manager.decRef(circuit);
869
+ }
870
+ this.dropAll(second);
871
+ this.dropAll(first);
872
+ }
873
+
874
+ applySortCnstr(node: Enode) {
875
+ if (this.isAttachedToVar(node)) return;
876
+ this.mkBits(this.mkVar(node));
877
+ if (this.context.isRelevant(node.owner)) this.relevantEh(node.owner);
878
+ }
879
+
880
+ newEqEh(first: number, second: number) {
881
+ this.merge(first, second);
882
+ }
883
+
884
+ newDiseqEh(first: number, second: number) {
885
+ const manager = this.manager;
886
+ if (manager.isBvSort(manager.sorts[this.getExpr(first)])) this.expandDiseq(first, second);
887
+ }
888
+
889
+ private expandDiseq(inputFirst: number, inputSecond: number) {
890
+ const context = this.context;
891
+ const manager = this.manager;
892
+ const first = Math.min(inputFirst, inputSecond);
893
+ const second = Math.max(inputFirst, inputSecond);
894
+ const firstBits = this.bits[first];
895
+ const secondBits = this.bits[second];
896
+ for (let index = 0; index < firstBits.length; index++) {
897
+ if (firstBits[index] === negate(secondBits[index])) return;
898
+ const firstValue = context.getAssignment(firstBits[index]);
899
+ const secondValue = context.getAssignment(secondBits[index]);
900
+ if (firstValue !== L_UNDEF && secondValue !== L_UNDEF && firstValue !== secondValue) return;
901
+ }
902
+ const literals = [this.mkEq(this.getExpr(first), this.getExpr(second), true)];
903
+ for (let index = 0; index < firstBits.length; index++) {
904
+ const firstExpr = this.literalToExpr(firstBits[index]);
905
+ const secondExpr = this.literalToExpr(secondBits[index]);
906
+ const difference = this.blaster.mkXor(firstExpr, secondExpr);
907
+ context.internalize(difference, true);
908
+ literals.push(context.getLiteral(difference));
909
+ manager.decRef(difference);
910
+ manager.decRef(secondExpr);
911
+ manager.decRef(firstExpr);
912
+ }
913
+ context.mkThAxiom(literals);
914
+ }
915
+
916
+ assignEh(boolVar: BoolVar) {
917
+ const atom = this.atoms[boolVar];
918
+ if (atom === undefined || !atom.isBit) return;
919
+ const queue = this.propQueue;
920
+ queue.length = 0;
921
+ for (let occ = atom.occs; occ !== null; occ = occ.next) queue.push(occ.thVar, occ.index);
922
+ this.propagateBits();
923
+ }
924
+
925
+ private propagateBits() {
926
+ const context = this.context;
927
+ const queue = this.propQueue;
928
+ for (let entry = 0; entry < queue.length; entry += 2) {
929
+ const thVar = queue[entry];
930
+ const index = queue[entry + 1];
931
+ if (this.wpos[thVar] === index) this.findWpos(thVar);
932
+ const bit = this.bits[thVar][index];
933
+ const value = context.getAssignment(bit);
934
+ if (value === L_UNDEF) continue;
935
+ const antecedent = value === L_FALSE ? negate(bit) : bit;
936
+ for (let other = this.nexts[thVar]; other !== thVar; other = this.nexts[other]) {
937
+ const otherBit = this.bits[other][index];
938
+ if (bit === negate(otherBit)) {
939
+ this.addNewDiseqAxiom(thVar, other, index);
940
+ return;
941
+ }
942
+ if (value === context.getAssignment(otherBit)) continue;
943
+ this.assignBit(
944
+ value === L_FALSE ? negate(otherBit) : otherBit,
945
+ thVar,
946
+ other,
947
+ index,
948
+ antecedent,
949
+ false,
950
+ );
951
+ if (context.isInconsistent()) {
952
+ queue.length = 0;
953
+ return;
954
+ }
955
+ }
956
+ }
957
+ queue.length = 0;
958
+ }
959
+
960
+ private assignBit(
961
+ consequent: Literal,
962
+ first: number,
963
+ second: number,
964
+ index: number,
965
+ antecedent: Literal,
966
+ isPropagatingClass: boolean,
967
+ ) {
968
+ const context = this.context;
969
+ const justification = new BitEqJustification(
970
+ this.id,
971
+ this.getEnode(first),
972
+ this.getEnode(second),
973
+ antecedent,
974
+ );
975
+ if (consequent === FALSE_LITERAL) {
976
+ context.setConflict(justification, null);
977
+ return;
978
+ }
979
+ context.assign(consequent, justification);
980
+ const eq = this.mkEq(this.getExpr(first), this.getExpr(second), false);
981
+ const literals = [negate(consequent), antecedent, negate(eq)];
982
+ for (const literal of literals) context.markLiteralAsRelevant(literal);
983
+ context.mkThAxiom(literals);
984
+ if (this.wpos[second] === index) this.findWpos(second);
985
+ const atom = this.atoms[getVar(consequent)];
986
+ if (atom === undefined || !atom.isBit) return;
987
+ const root = this.find(second);
988
+ for (let occ = atom.occs; occ !== null; occ = occ.next)
989
+ if (isPropagatingClass || this.find(occ.thVar) !== root || occ.index !== index)
990
+ this.propQueue.push(occ.thVar, occ.index);
991
+ }
992
+
993
+ relevantEh(expr: number) {
994
+ const context = this.context;
995
+ const manager = this.manager;
996
+ if (context.relevancy.isEnabled && DIVREM_OPS.has(manager.getOp(expr))) {
997
+ context.markAsRelevant(manager.getArg(expr, 0));
998
+ context.markAsRelevant(manager.getArg(expr, 1));
999
+ this.assertDivremBoundAxiom(expr);
1000
+ }
1001
+ if (manager.isBool(expr)) {
1002
+ if (!context.isBInternalized(expr)) return;
1003
+ const atom = this.atoms[context.getBoolVar(expr)];
1004
+ if (atom !== undefined && !atom.isBit) context.markLiteralAsRelevant(atom.def);
1005
+ return;
1006
+ }
1007
+ const op = manager.getOp(expr);
1008
+ if (op === OP_UBV2INT || op === OP_INT2BV) {
1009
+ context.markAsRelevant(manager.getArg(expr, 0));
1010
+ if (op === OP_UBV2INT) this.assertBv2intAxiom(expr);
1011
+ else this.assertInt2bvAxiom(expr);
1012
+ return;
1013
+ }
1014
+ if (!context.isEInternalized(expr)) return;
1015
+ const thVar = this.getInternalizedEnode(expr).getThVar(this.id);
1016
+ if (thVar < 0) return;
1017
+ for (const bit of this.bits[thVar]) context.markLiteralAsRelevant(bit);
1018
+ }
1019
+
1020
+ pushScopeEh() {
1021
+ super.pushScopeEh();
1022
+ this.trailLimits.push(this.trail.length);
1023
+ }
1024
+
1025
+ popScopeEh(numScopes: number) {
1026
+ const newLevel = this.trailLimits.length - numScopes;
1027
+ const limit = this.trailLimits[newLevel];
1028
+ for (let index = this.trail.length - 1; index >= limit; index--) this.trail[index]();
1029
+ this.trail.length = limit;
1030
+ this.trailLimits.length = newLevel;
1031
+ const numOldVars = this.getOldNumVars(numScopes);
1032
+ this.bits.length = numOldVars;
1033
+ this.wpos.length = numOldVars;
1034
+ this.zeroOneBits.length = numOldVars;
1035
+ super.popScopeEh(numScopes);
1036
+ }
1037
+
1038
+ includeFuncInterp(decl: number) {
1039
+ return DIV0_OPS.has(this.manager.funcDecls[decl].op);
1040
+ }
1041
+
1042
+ private mergeEh(firstRoot: number, secondRoot: number, first: number, second: number) {
1043
+ if (!this.mergeZeroOneBits(firstRoot, secondRoot)) return;
1044
+ const context = this.context;
1045
+ this.propQueue.length = 0;
1046
+ const size = this.bits[first].length;
1047
+ if (size === 0 && this.bv2ints.length > 0) this.propagateBv2int(firstRoot);
1048
+ let isChanged = true;
1049
+ while (isChanged) {
1050
+ isChanged = false;
1051
+ for (let index = 0; index < size; index++) {
1052
+ const firstBit = this.bits[first][index];
1053
+ const secondBit = this.bits[second][index];
1054
+ if (firstBit === negate(secondBit)) {
1055
+ this.addNewDiseqAxiom(first, second, index);
1056
+ return;
1057
+ }
1058
+ const firstValue = context.getAssignment(firstBit);
1059
+ const secondValue = context.getAssignment(secondBit);
1060
+ if (firstValue === L_UNDEF && !context.isRelevant(context.boolVar2Expr[getVar(firstBit)]))
1061
+ context.markLiteralAsRelevant(firstBit);
1062
+ if (secondValue === L_UNDEF && !context.isRelevant(context.boolVar2Expr[getVar(secondBit)]))
1063
+ context.markLiteralAsRelevant(secondBit);
1064
+ if (firstValue === secondValue) continue;
1065
+ isChanged = true;
1066
+ if (firstValue !== L_UNDEF && secondBit !== FALSE_LITERAL && secondBit !== TRUE_LITERAL)
1067
+ this.assignBit(
1068
+ firstValue === L_FALSE ? negate(secondBit) : secondBit,
1069
+ first,
1070
+ second,
1071
+ index,
1072
+ firstValue === L_FALSE ? negate(firstBit) : firstBit,
1073
+ true,
1074
+ );
1075
+ else if (secondValue !== L_UNDEF)
1076
+ this.assignBit(
1077
+ secondValue === L_FALSE ? negate(firstBit) : firstBit,
1078
+ second,
1079
+ first,
1080
+ index,
1081
+ secondValue === L_FALSE ? negate(secondBit) : secondBit,
1082
+ true,
1083
+ );
1084
+ if (context.isInconsistent()) return;
1085
+ }
1086
+ }
1087
+ this.propagateBits();
1088
+ }
1089
+
1090
+ // int2bv(bv2int(x)) = x when the int2bv has the sort of x.
1091
+ private propagateBv2int(rootVar: number) {
1092
+ const manager = this.manager;
1093
+ const node = this.getEnode(rootVar);
1094
+ const propagate = (bv2int: Enode) => {
1095
+ const word = bv2int.getArg(0);
1096
+ for (const parent of node.root.parents) {
1097
+ if (
1098
+ manager.getOp(parent.owner) !== OP_INT2BV ||
1099
+ parent.root === word.root ||
1100
+ manager.sorts[parent.owner] !== manager.sorts[word.owner]
1101
+ )
1102
+ continue;
1103
+ const justification = new TheoryJustification(
1104
+ this.id,
1105
+ [],
1106
+ [node, parent.getArg(0), node, bv2int],
1107
+ );
1108
+ this.context.pushEq(parent, word, { kind: "justification", justification });
1109
+ return;
1110
+ }
1111
+ };
1112
+ if (this.bv2ints.length < node.classSize) {
1113
+ for (const bv2int of this.bv2ints) if (bv2int.root === node.root) propagate(bv2int);
1114
+ return;
1115
+ }
1116
+ let member = node;
1117
+ do {
1118
+ if (manager.getOp(member.owner) === OP_UBV2INT) propagate(member);
1119
+ member = member.next;
1120
+ } while (member !== node);
1121
+ }
1122
+
1123
+ private mergeZeroOneBits(firstRoot: number, secondRoot: number) {
1124
+ const secondBits = this.zeroOneBits[secondRoot];
1125
+ if (secondBits.length === 0) return true;
1126
+ const firstBits = this.zeroOneBits[firstRoot];
1127
+ const aux = this.mergeAux;
1128
+ const resetAux = () => {
1129
+ for (const bit of firstBits) aux[bit.isTrue ? 1 : 0][bit.index] = -1;
1130
+ };
1131
+ for (const bit of firstBits) aux[bit.isTrue ? 1 : 0][bit.index] = bit.owner;
1132
+ for (const bit of secondBits) {
1133
+ const conflicting = aux[bit.isTrue ? 0 : 1][bit.index] ?? -1;
1134
+ if (conflicting !== -1) {
1135
+ this.addNewDiseqAxiom(conflicting, bit.owner, bit.index);
1136
+ resetAux();
1137
+ return false;
1138
+ }
1139
+ if ((aux[bit.isTrue ? 1 : 0][bit.index] ?? -1) === -1) firstBits.push(bit);
1140
+ }
1141
+ resetAux();
1142
+ return true;
1143
+ }
1144
+
1145
+ private unmergeEh(root: number) {
1146
+ const bits = this.zeroOneBits[root];
1147
+ for (let index = bits.length - 1; index >= 0; index--)
1148
+ if (this.find(bits[index].owner) === root) {
1149
+ bits.length = index + 1;
1150
+ return;
1151
+ }
1152
+ bits.length = 0;
1153
+ }
1154
+
1155
+ canPropagate() {
1156
+ return this.propDiseqsHead < this.propDiseqs.length;
1157
+ }
1158
+
1159
+ propagate() {
1160
+ if (!this.canPropagate()) return;
1161
+ const context = this.context;
1162
+ const head = this.propDiseqsHead;
1163
+ context.pushTrail(() => {
1164
+ this.propDiseqsHead = head;
1165
+ });
1166
+ for (
1167
+ ;
1168
+ this.propDiseqsHead < this.propDiseqs.length && !context.isInconsistent();
1169
+ this.propDiseqsHead++
1170
+ ) {
1171
+ const diseq = this.propDiseqs[this.propDiseqsHead];
1172
+ this.assertNewDiseqAxiom(diseq.first, diseq.second);
1173
+ }
1174
+ }
1175
+
1176
+ private mkLiteral(expr: number) {
1177
+ const context = this.context;
1178
+ const manager = this.manager;
1179
+ manager.incRef(expr);
1180
+ const isNot = manager.isNot(expr);
1181
+ const atom = isNot ? manager.getArg(expr, 0) : expr;
1182
+ if (!context.isEInternalized(atom)) context.internalize(atom, false);
1183
+ const literal = context.getLiteral(atom);
1184
+ context.markLiteralAsRelevant(literal);
1185
+ manager.decRef(expr);
1186
+ return isNot ? negate(literal) : literal;
1187
+ }
1188
+
1189
+ private mkEq(first: number, second: number, isGateContext: boolean) {
1190
+ const context = this.context;
1191
+ const manager = this.manager;
1192
+ if (first === second) return TRUE_LITERAL;
1193
+ if (manager.areDistinct(first, second)) return FALSE_LITERAL;
1194
+ const eq = context.mkEqAtom(first, second);
1195
+ manager.incRef(eq);
1196
+ context.internalize(eq, isGateContext);
1197
+ const literal = context.getLiteral(eq);
1198
+ manager.decRef(eq);
1199
+ return literal;
1200
+ }
1201
+
1202
+ private assertDivremBoundAxiom(term: number) {
1203
+ const manager = this.manager;
1204
+ const op = manager.getOp(term);
1205
+ const dividend = manager.getArg(term, 0);
1206
+ const divisor = manager.getArg(term, 1);
1207
+ if (manager.isBvNumeral(divisor)) return;
1208
+ const sort = manager.sorts[term];
1209
+ const mkZero = () => manager.mkBvNumeral(0n, manager.getBvSize(sort));
1210
+ const mkAbs = (arg: number) => {
1211
+ const isNonNegative = mkBvApp(manager, OP_SLEQ, [mkZero(), arg]);
1212
+ manager.incRef(isNonNegative);
1213
+ const negation = mkBvApp(manager, OP_BNEG, [arg]);
1214
+ manager.incRef(negation);
1215
+ const result = manager.mkApp(OP_ITE, [isNonNegative, arg, negation], sort);
1216
+ manager.decRef(negation);
1217
+ manager.decRef(isNonNegative);
1218
+ return result;
1219
+ };
1220
+ const bound =
1221
+ op === OP_BUREM || op === OP_BUREM_I
1222
+ ? manager.mkNot(mkBvApp(manager, OP_ULEQ, [divisor, term]))
1223
+ : op === OP_BUDIV_I
1224
+ ? mkBvApp(manager, OP_ULEQ, [term, dividend])
1225
+ : op === OP_BSDIV_I
1226
+ ? mkBvApp(manager, OP_ULEQ, [mkAbs(term), mkAbs(dividend)])
1227
+ : manager.mkNot(mkBvApp(manager, OP_ULEQ, [mkAbs(divisor), mkAbs(term)]));
1228
+ const clause = [manager.mkEq(divisor, mkZero()), bound];
1229
+ for (const expr of clause) manager.incRef(expr);
1230
+ const literals = clause.map((expr) => this.mkLiteral(expr));
1231
+ this.context.mkThAxiom(literals);
1232
+ this.dropAll(clause);
1233
+ }
1234
+
1235
+ mkValue(node: Enode) {
1236
+ const thVar = this.getThVar(node);
1237
+ return this.manager.mkBvNumeral(this.getFixedValue(thVar).value, this.getBvSize(thVar));
1238
+ }
1239
+ }