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,1210 @@
1
+ import { SmtInvariantError, SmtUnsupportedError } from "../../../errors";
2
+ import {
3
+ FAMILY_BV,
4
+ OP_ADD,
5
+ OP_BADD,
6
+ OP_BAND,
7
+ OP_BASHR,
8
+ OP_BCOMP,
9
+ OP_BIT2BOOL,
10
+ OP_BLSHR,
11
+ OP_BMUL,
12
+ OP_BNAND,
13
+ OP_BNEG,
14
+ OP_BNOR,
15
+ OP_BNOT,
16
+ OP_BOR,
17
+ OP_BREDAND,
18
+ OP_BREDOR,
19
+ OP_BSDIV0,
20
+ OP_BSDIV_I,
21
+ OP_BSHL,
22
+ OP_BSMOD,
23
+ OP_BSMOD0,
24
+ OP_BSMOD_I,
25
+ OP_BSMUL_NO_OVFL,
26
+ OP_BSMUL_NO_UDFL,
27
+ OP_BSREM,
28
+ OP_BSREM0,
29
+ OP_BSREM_I,
30
+ OP_BSUB,
31
+ OP_BUDIV0,
32
+ OP_BUDIV_I,
33
+ OP_BUMUL_NO_OVFL,
34
+ OP_BUREM,
35
+ OP_BUREM0,
36
+ OP_BUREM_I,
37
+ OP_BV_NUM,
38
+ OP_BXNOR,
39
+ OP_BXOR,
40
+ OP_CONCAT,
41
+ OP_EXT_ROTATE_LEFT,
42
+ OP_EXT_ROTATE_RIGHT,
43
+ OP_EXTRACT,
44
+ OP_GE,
45
+ OP_IDIV,
46
+ OP_INT2BV,
47
+ OP_ITE,
48
+ OP_MKBV,
49
+ OP_MOD,
50
+ OP_ROTATE_LEFT,
51
+ OP_ROTATE_RIGHT,
52
+ OP_SIGN_EXT,
53
+ OP_SLEQ,
54
+ OP_UBV2INT,
55
+ OP_ULEQ,
56
+ OP_ZERO_EXT,
57
+ SORT_BOOL,
58
+ SORT_INT,
59
+ } from "./ast";
60
+ import { BitBlaster } from "./bit-blaster";
61
+ import { mkBvApp } from "./bv-decl-plugin";
62
+ import type { Context } from "./context";
63
+ import { type Antecedents, Enode, Justification, TheoryJustification } from "./enode";
64
+ import { combineHash, hashU } from "./hash";
65
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
66
+ import {
67
+ type BoolVar,
68
+ FALSE_LITERAL,
69
+ getVar,
70
+ isNegated,
71
+ type Literal,
72
+ mkLiteral,
73
+ negate,
74
+ TRUE_BOOL_VAR,
75
+ TRUE_LITERAL,
76
+ } from "./literal";
77
+ import { UnionFind } from "./lp/union-find";
78
+ import type { ProtoModel } from "./proto-model";
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 unionFind = new UnionFind(this.trail);
240
+ private bits: Literal[][] = [];
241
+ private wpos: number[] = [];
242
+ private zeroOneBits: ZeroOneBit[][] = [];
243
+ private atoms: (BitAtom | LeAtom | undefined)[] = [];
244
+ private fixedVars = new Map<string, number>();
245
+ private eqActivity = new Uint8Array(256);
246
+ private propDiseqs: BvDiseq[] = [];
247
+ private propDiseqsHead = 0;
248
+ private propQueue: number[] = [];
249
+ private mergeAux: [number[], number[]] = [[], []];
250
+ private bv2ints: Enode[] = [];
251
+ private model: ProtoModel | undefined;
252
+
253
+ constructor(context: Context) {
254
+ super(context, FAMILY_BV);
255
+ this.blaster = new BitBlaster(context.manager);
256
+ this.unionFind.handler = {
257
+ mergeEh: (root, joining, second, first) => this.mergeEh(root, joining, second, first),
258
+ unmergeEh: (root) => this.unmergeEh(root),
259
+ };
260
+ }
261
+
262
+ private getBvSize(thVar: number) {
263
+ const manager = this.manager;
264
+ return manager.getBvSize(manager.sorts[this.getExpr(thVar)]);
265
+ }
266
+
267
+ private mkVar(node: Enode) {
268
+ const thVar = this.varEnodes.length;
269
+ this.varEnodes.push(node);
270
+ this.unionFind.mkVar();
271
+ this.bits.push([]);
272
+ this.wpos.push(0);
273
+ this.zeroOneBits.push([]);
274
+ this.context.attachThVar(node, this, thVar);
275
+ return thVar;
276
+ }
277
+
278
+ private insertAtom(boolVar: BoolVar, atom: BitAtom | LeAtom) {
279
+ this.atoms[boolVar] = atom;
280
+ this.trail.push(() => {
281
+ this.atoms[boolVar] = undefined;
282
+ });
283
+ }
284
+
285
+ private mkBits(thVar: number) {
286
+ const context = this.context;
287
+ const owner = this.getExpr(thVar);
288
+ const isRelevant = context.isRelevant(owner);
289
+ const bits = this.bits[thVar];
290
+ bits.length = 0;
291
+ const bitExprs = Array.from({ length: this.getBvSize(thVar) }, (_value, index) =>
292
+ mkBvApp(this.manager, OP_BIT2BOOL, [owner], [index]),
293
+ );
294
+ context.internalizeAll(bitExprs, true);
295
+ for (const bitExpr of bitExprs) {
296
+ bits.push(mkLiteral(context.getBoolVar(bitExpr)));
297
+ if (isRelevant && !context.isRelevant(bitExpr)) context.markAsRelevant(bitExpr);
298
+ }
299
+ }
300
+
301
+ private mkBit2Bool(atom: number) {
302
+ const context = this.context;
303
+ const manager = this.manager;
304
+ const arg = manager.getArg(atom, 0);
305
+ if (!context.isEInternalized(arg)) {
306
+ context.internalize(arg, false);
307
+ this.getVar(this.getInternalizedEnode(arg));
308
+ }
309
+ const argVar = this.getInternalizedEnode(arg).getThVar(this.id);
310
+ const index = this.getParameter(atom, 0);
311
+ if (argVar < 0) this.getVar(this.getInternalizedEnode(arg));
312
+ else if (!context.isBInternalized(atom)) {
313
+ const boolVar = context.mkBoolVar(atom);
314
+ context.setVarTheory(boolVar, this.id);
315
+ this.insertAtom(boolVar, { isBit: true, occs: { thVar: argVar, index, next: null } });
316
+ const bit = this.bits[argVar][index];
317
+ if (bit !== undefined) {
318
+ context.mkThAxiom([bit, mkLiteral(boolVar, true)]);
319
+ context.mkThAxiom([negate(bit), mkLiteral(boolVar)]);
320
+ }
321
+ }
322
+ if (!manager.isBvNumeral(arg)) return;
323
+ const isOne = ((manager.getBvNumeralValue(arg) >> BigInt(index)) & 1n) === 1n;
324
+ const literal = context.getLiteral(atom);
325
+ context.markLiteralAsRelevant(literal);
326
+ context.mkThAxiom([isOne ? literal : negate(literal)]);
327
+ }
328
+
329
+ private getParameter(expr: number, index: number) {
330
+ const manager = this.manager;
331
+ return manager.funcDecls[manager.decls[expr]].parameters[index];
332
+ }
333
+
334
+ private getInternalizedEnode(expr: number) {
335
+ const node = this.context.getEnode(expr);
336
+ if (node === undefined) throw new SmtInvariantError("the term was not internalized");
337
+ return node;
338
+ }
339
+
340
+ private mkEnode(term: number) {
341
+ const context = this.context;
342
+ if (context.isEInternalized(term)) return this.getInternalizedEnode(term);
343
+ const node = context.mkEnode(term, false, false, false);
344
+ this.mkVar(node);
345
+ return node;
346
+ }
347
+
348
+ private getVar(node: Enode) {
349
+ const thVar = node.getThVar(this.id);
350
+ if (thVar >= 0) return thVar;
351
+ const created = this.mkVar(node);
352
+ this.mkBits(created);
353
+ return created;
354
+ }
355
+
356
+ private literalToExpr(literal: Literal) {
357
+ const manager = this.manager;
358
+ const atom = this.context.boolVar2Expr[getVar(literal)];
359
+ const expr =
360
+ literal === TRUE_LITERAL
361
+ ? manager.trueExpr
362
+ : literal === FALSE_LITERAL
363
+ ? manager.falseExpr
364
+ : isNegated(literal)
365
+ ? manager.mkNot(atom)
366
+ : atom;
367
+ manager.incRef(expr);
368
+ return expr;
369
+ }
370
+
371
+ private getBits(thVar: number) {
372
+ return this.bits[thVar].map((bit) => this.literalToExpr(bit));
373
+ }
374
+
375
+ private dropAll(exprs: number[]) {
376
+ for (const expr of exprs) this.manager.decRef(expr);
377
+ }
378
+
379
+ private addNewDiseqAxiom(first: number, second: number, index: number) {
380
+ this.propDiseqs.push({ first, second, index });
381
+ this.context.pushTrail(() => {
382
+ this.propDiseqs.pop();
383
+ });
384
+ }
385
+
386
+ private assertNewDiseqAxiom(first: number, second: number) {
387
+ const context = this.context;
388
+ const manager = this.manager;
389
+ const firstExpr = this.getExpr(first);
390
+ const secondExpr = this.getExpr(second);
391
+ const eq = manager.mkEq(firstExpr, secondExpr);
392
+ manager.incRef(eq);
393
+ context.mkThAxiom([negate(this.mkLiteral(eq))]);
394
+ const relevancy = context.relevancy;
395
+ if (relevancy.isEnabled) {
396
+ const handler = () => {
397
+ if (relevancy.isRelevant(firstExpr) && relevancy.isRelevant(secondExpr))
398
+ relevancy.markAsRelevant(eq);
399
+ };
400
+ relevancy.addHandler(firstExpr, handler);
401
+ relevancy.addHandler(secondExpr, handler);
402
+ }
403
+ manager.decRef(eq);
404
+ }
405
+
406
+ private registerTrueFalseBit(thVar: number, index: number) {
407
+ this.zeroOneBits[thVar].push({
408
+ owner: thVar,
409
+ index,
410
+ isTrue: this.bits[thVar][index] === TRUE_LITERAL,
411
+ });
412
+ }
413
+
414
+ private addBit(thVar: number, literal: Literal) {
415
+ const context = this.context;
416
+ const bits = this.bits[thVar];
417
+ const index = bits.length;
418
+ bits.push(literal);
419
+ const boolVar = getVar(literal);
420
+ if (boolVar === TRUE_BOOL_VAR) {
421
+ this.registerTrueFalseBit(thVar, index);
422
+ return;
423
+ }
424
+ const thId = context.getBoolVarTheory(boolVar);
425
+ if (thId === this.id) {
426
+ const atom = this.atoms[boolVar];
427
+ if (atom === undefined || !atom.isBit) return;
428
+ const negated = negate(literal);
429
+ const size = this.getBvSize(thVar);
430
+ for (let occ = atom.occs; occ !== null; occ = occ.next)
431
+ if (
432
+ occ.index === index &&
433
+ this.bits[occ.thVar][occ.index] === negated &&
434
+ this.getBvSize(occ.thVar) === size
435
+ )
436
+ this.addNewDiseqAxiom(thVar, occ.thVar, index);
437
+ const previous = atom.occs;
438
+ this.trail.push(() => {
439
+ atom.occs = previous;
440
+ });
441
+ atom.occs = { thVar, index, next: previous };
442
+ } else if (thId === NULL_THEORY_ID) {
443
+ context.setVarTheory(boolVar, this.id);
444
+ this.insertAtom(boolVar, { isBit: true, occs: { thVar, index, next: null } });
445
+ }
446
+ }
447
+
448
+ private initBits(node: Enode, bitExprs: number[]) {
449
+ const context = this.context;
450
+ const thVar = node.getThVar(this.id);
451
+ this.bits[thVar].length = 0;
452
+ context.internalizeAll(bitExprs, true);
453
+ for (const bitExpr of bitExprs) this.addBit(thVar, context.getLiteral(bitExpr));
454
+ this.findWpos(thVar);
455
+ }
456
+
457
+ private findWpos(thVar: number) {
458
+ const context = this.context;
459
+ const bits = this.bits[thVar];
460
+ const start = this.wpos[thVar];
461
+ for (let offset = 0; offset < bits.length; offset++) {
462
+ const position = (start + offset) % bits.length;
463
+ if (context.getAssignment(bits[position]) === L_UNDEF) {
464
+ this.wpos[thVar] = position;
465
+ return;
466
+ }
467
+ }
468
+ this.fixedVarEh(thVar);
469
+ }
470
+
471
+ private addFixedEq(inputFirst: number, inputSecond: number) {
472
+ const first = Math.min(inputFirst, inputSecond);
473
+ const second = Math.max(inputFirst, inputSecond);
474
+ const slot = combineHash(hashU(first), hashU(second)) & 0xff;
475
+ const activity = this.eqActivity[slot]++;
476
+ if (activity !== 0xff) return;
477
+ const context = this.context;
478
+ const manager = this.manager;
479
+ const firstExpr = this.getExpr(first);
480
+ const secondExpr = this.getExpr(second);
481
+ const classEq = this.mkEq(firstExpr, secondExpr, true);
482
+ context.markLiteralAsRelevant(classEq);
483
+ const literals: Literal[] = [];
484
+ for (let index = 0; index < this.getBvSize(first); index++) {
485
+ const firstBit = this.bits[first][index];
486
+ const secondBit = this.bits[second][index];
487
+ const firstBitExpr = mkBvApp(manager, OP_BIT2BOOL, [firstExpr], [index]);
488
+ manager.incRef(firstBitExpr);
489
+ const secondBitExpr = mkBvApp(manager, OP_BIT2BOOL, [secondExpr], [index]);
490
+ manager.incRef(secondBitExpr);
491
+ const eq = this.mkEq(firstBitExpr, secondBitExpr, true);
492
+ context.mkThAxiom([firstBit, negate(secondBit), negate(eq)]);
493
+ context.mkThAxiom([negate(firstBit), secondBit, negate(eq)]);
494
+ context.mkThAxiom([firstBit, secondBit, eq]);
495
+ context.mkThAxiom([negate(firstBit), negate(secondBit), eq]);
496
+ context.mkThAxiom([eq, negate(classEq)]);
497
+ literals.push(negate(eq));
498
+ manager.decRef(secondBitExpr);
499
+ manager.decRef(firstBitExpr);
500
+ }
501
+ literals.push(classEq);
502
+ context.mkThAxiom(literals);
503
+ }
504
+
505
+ private getFixedValue(thVar: number) {
506
+ const context = this.context;
507
+ let value = 0n;
508
+ let isFixed = true;
509
+ const bits = this.bits[thVar];
510
+ for (let index = 0; index < bits.length; index++) {
511
+ const assignment = context.getAssignment(bits[index]);
512
+ if (assignment === L_UNDEF) {
513
+ isFixed = false;
514
+ break;
515
+ }
516
+ if (assignment === L_TRUE) value += 1n << BigInt(index);
517
+ }
518
+ return { value, isFixed };
519
+ }
520
+
521
+ private fixedVarEh(thVar: number) {
522
+ const value = this.getFixedValue(thVar).value;
523
+ const size = this.getBvSize(thVar);
524
+ const key = `${size}:${value}`;
525
+ const other = this.fixedVars.get(key);
526
+ if (other === undefined) {
527
+ this.fixedVars.set(key, thVar);
528
+ return;
529
+ }
530
+ const otherValue = other < this.getNumVars() ? this.getFixedValue(other) : undefined;
531
+ if (
532
+ otherValue === undefined ||
533
+ this.getBvSize(other) !== size ||
534
+ !otherValue.isFixed ||
535
+ otherValue.value !== value
536
+ ) {
537
+ this.fixedVars.delete(key);
538
+ this.fixedVars.set(key, thVar);
539
+ return;
540
+ }
541
+ const node = this.getEnode(thVar);
542
+ const otherNode = this.getEnode(other);
543
+ if (node.root === otherNode.root) return;
544
+ this.addFixedEq(thVar, other);
545
+ const justification = new FixedEqJustification(
546
+ this.id,
547
+ this.context,
548
+ this.bits[thVar],
549
+ this.bits[other],
550
+ );
551
+ this.context.pushEq(node, otherNode, { kind: "justification", justification });
552
+ this.fixedVars.set(key, other);
553
+ }
554
+
555
+ private internalizeNum(term: number) {
556
+ const manager = this.manager;
557
+ const value = manager.getBvNumeralValue(term);
558
+ const size = manager.getBvSize(manager.sorts[term]);
559
+ const thVar = this.mkEnode(term).getThVar(this.id);
560
+ const bits = this.bits[thVar];
561
+ for (let index = 0; index < size; index++) {
562
+ bits.push(((value >> BigInt(index)) & 1n) === 1n ? TRUE_LITERAL : FALSE_LITERAL);
563
+ this.registerTrueFalseBit(thVar, index);
564
+ }
565
+ this.fixedVarEh(thVar);
566
+ }
567
+
568
+ private processArgs(term: number) {
569
+ const manager = this.manager;
570
+ this.context.internalizeAll(manager.getArgs(term), false);
571
+ }
572
+
573
+ private getArgBits(node: Enode, index: number) {
574
+ return this.getBits(this.getVar(node.getArg(index)));
575
+ }
576
+
577
+ private internalizeBlast(term: number, blast: Blast, isAssociative: boolean) {
578
+ this.processArgs(term);
579
+ const node = this.mkEnode(term);
580
+ const numArgs = node.numArgs;
581
+ const parameters = this.manager.funcDecls[this.manager.decls[term]].parameters;
582
+ if (!isAssociative) {
583
+ const args = Array.from({ length: numArgs }, (_value, index) => this.getArgBits(node, index));
584
+ const bits: number[] = [];
585
+ blast(this.blaster, args, parameters[0], bits);
586
+ this.initBits(node, bits);
587
+ this.dropAll(bits);
588
+ for (let index = args.length - 1; index >= 0; index--) this.dropAll(args[index]);
589
+ return;
590
+ }
591
+ let argBits: number[] = [];
592
+ let bits = this.getArgBits(node, numArgs - 1);
593
+ let newBits: number[] = [];
594
+ for (let index = numArgs - 2; index >= 0; index--) {
595
+ this.dropAll(argBits);
596
+ argBits = this.getArgBits(node, index);
597
+ this.dropAll(newBits);
598
+ newBits = [];
599
+ blast(this.blaster, [argBits, bits], 0, newBits);
600
+ const swapped = bits;
601
+ bits = newBits;
602
+ newBits = swapped;
603
+ }
604
+ this.initBits(node, bits);
605
+ this.dropAll(newBits);
606
+ this.dropAll(bits);
607
+ this.dropAll(argBits);
608
+ }
609
+
610
+ private internalizeSub(term: number) {
611
+ this.processArgs(term);
612
+ const node = this.mkEnode(term);
613
+ const first = this.getArgBits(node, 0);
614
+ const second = this.getArgBits(node, 1);
615
+ const bits: number[] = [];
616
+ const carry = this.blaster.mkSubtracter(first, second, bits);
617
+ this.initBits(node, bits);
618
+ this.manager.decRef(carry);
619
+ this.dropAll(bits);
620
+ this.dropAll(second);
621
+ this.dropAll(first);
622
+ }
623
+
624
+ private internalizeConcat(term: number) {
625
+ this.processArgs(term);
626
+ const node = this.mkEnode(term);
627
+ const thVar = node.getThVar(this.id);
628
+ this.bits[thVar].length = 0;
629
+ for (let index = node.numArgs - 1; index >= 0; index--)
630
+ for (const bit of this.bits[this.getVar(node.getArg(index))]) this.addBit(thVar, bit);
631
+ this.findWpos(thVar);
632
+ }
633
+
634
+ private internalizeExtract(term: number) {
635
+ this.processArgs(term);
636
+ const node = this.mkEnode(term);
637
+ const thVar = node.getThVar(this.id);
638
+ const argBits = this.bits[this.getVar(node.getArg(0))];
639
+ this.bits[thVar].length = 0;
640
+ for (let index = this.getParameter(term, 1); index <= this.getParameter(term, 0); index++)
641
+ this.addBit(thVar, argBits[index]);
642
+ this.findWpos(thVar);
643
+ }
644
+
645
+ private internalizeMkbv(term: number) {
646
+ const manager = this.manager;
647
+ this.processArgs(term);
648
+ const node = this.mkEnode(term);
649
+ const bits = manager.getArgs(term);
650
+ for (const bit of bits) manager.incRef(bit);
651
+ this.initBits(node, bits);
652
+ this.dropAll(bits);
653
+ }
654
+
655
+ private internalizeBv2int(term: number) {
656
+ this.processArgs(term);
657
+ const node = this.mkEnode(term);
658
+ this.bv2ints.push(node);
659
+ this.context.pushTrail(() => {
660
+ this.bv2ints.pop();
661
+ });
662
+ if (!this.context.relevancy.isEnabled) this.assertBv2intAxiom(term);
663
+ }
664
+
665
+ private assertBv2intAxiom(term: number) {
666
+ const context = this.context;
667
+ const manager = this.manager;
668
+ const word = manager.getArg(term, 0);
669
+ const wordBits = this.getBits(this.getVar(this.getInternalizedEnode(word)));
670
+ const zero = manager.mkNumeral(0n);
671
+ const terms = wordBits.map((bit, index) =>
672
+ manager.mkApp(OP_ITE, [bit, manager.mkNumeral(1n << BigInt(index)), zero], SORT_INT),
673
+ );
674
+ const sum = terms.length === 1 ? terms[0] : manager.mkApp(OP_ADD, terms, SORT_INT);
675
+ manager.incRef(sum);
676
+ const rewritten = new Rewriter(manager, TACTIC_REWRITER_OPTIONS).rewrite(sum);
677
+ const literal = this.mkEq(term, rewritten, false);
678
+ context.markLiteralAsRelevant(literal);
679
+ context.mkThAxiom([literal]);
680
+ manager.decRef(rewritten);
681
+ manager.decRef(sum);
682
+ this.dropAll(wordBits);
683
+ }
684
+
685
+ private internalizeInt2bv(term: number) {
686
+ this.processArgs(term);
687
+ const node = this.mkEnode(term);
688
+ this.mkBits(node.getThVar(this.id));
689
+ const arg = node.getArg(0);
690
+ if (!this.isAttachedToVar(arg)) this.mkVar(arg);
691
+ if (!this.context.relevancy.isEnabled) this.assertInt2bvAxiom(term);
692
+ }
693
+
694
+ private assertInt2bvAxiom(term: number) {
695
+ const context = this.context;
696
+ const manager = this.manager;
697
+ const arg = manager.getArg(term, 0);
698
+ const size = manager.getBvSize(manager.sorts[term]);
699
+ const mkMod = (dividend: number, divisor: bigint) =>
700
+ manager.mkApp(OP_MOD, [dividend, manager.mkNumeral(divisor)], SORT_INT);
701
+ const value = mkBvApp(manager, OP_UBV2INT, [term]);
702
+ manager.incRef(value);
703
+ const remainder = mkMod(arg, 1n << BigInt(size));
704
+ manager.incRef(remainder);
705
+ const literal = this.mkEq(value, remainder, false);
706
+ context.markLiteralAsRelevant(literal);
707
+ context.mkThAxiom([literal]);
708
+ manager.decRef(remainder);
709
+ manager.decRef(value);
710
+ const termBits = this.getBits(this.getVar(this.getInternalizedEnode(term)));
711
+ for (let index = 0; index < size; index++) {
712
+ const divisor = 1n << BigInt(index);
713
+ const quotient =
714
+ index === 0 ? arg : manager.mkApp(OP_IDIV, [arg, manager.mkNumeral(divisor)], SORT_INT);
715
+ manager.incRef(quotient);
716
+ const isOne = context.mkEqAtom(mkMod(quotient, 2n), manager.mkNumeral(1n));
717
+ manager.incRef(isOne);
718
+ const bitLiteral = this.mkEq(termBits[index], isOne, false);
719
+ context.markLiteralAsRelevant(bitLiteral);
720
+ context.mkThAxiom([bitLiteral]);
721
+ manager.decRef(isOne);
722
+ const zero = manager.mkNumeral(0n);
723
+ manager.incRef(zero);
724
+ const isAbove = this.mkLiteral(
725
+ manager.mkApp(OP_GE, [arg, manager.mkNumeral(divisor)], SORT_BOOL),
726
+ );
727
+ const isNonNegative = this.mkLiteral(manager.mkApp(OP_GE, [arg, zero], SORT_BOOL));
728
+ const isZero = this.mkEq(quotient, zero, false);
729
+ for (const bound of [isAbove, isNonNegative, isZero]) context.markLiteralAsRelevant(bound);
730
+ context.mkThAxiom([isAbove, negate(isNonNegative), isZero]);
731
+ manager.decRef(zero);
732
+ manager.decRef(quotient);
733
+ }
734
+ this.dropAll(termBits);
735
+ }
736
+
737
+ internalizeTerm(term: number) {
738
+ const manager = this.manager;
739
+ const op = manager.getOp(term);
740
+ if (UNINTERPRETED_OPS.has(op)) return false;
741
+ // scoped_suspend_rlimit: the circuits count their steps but are never canceled.
742
+ const limit = manager.limit;
743
+ const wasSuspended = limit.isSuspended;
744
+ limit.isSuspended = true;
745
+ try {
746
+ this.internalizeTermCore(term, op);
747
+ if (DIVREM_OPS.has(op) && !this.context.relevancy.isEnabled)
748
+ this.assertDivremBoundAxiom(term);
749
+ } finally {
750
+ limit.isSuspended = wasSuspended;
751
+ }
752
+ return true;
753
+ }
754
+
755
+ private internalizeTermCore(term: number, op: number) {
756
+ if (op === OP_BV_NUM) this.internalizeNum(term);
757
+ else if (op === OP_BSUB) this.internalizeSub(term);
758
+ else if (op === OP_CONCAT) this.internalizeConcat(term);
759
+ else if (op === OP_EXTRACT) this.internalizeExtract(term);
760
+ else if (op === OP_MKBV) this.internalizeMkbv(term);
761
+ else if (op === OP_INT2BV) this.internalizeInt2bv(term);
762
+ else if (op === OP_UBV2INT) this.internalizeBv2int(term);
763
+ else {
764
+ const acBlast = AC_BLASTS.get(op);
765
+ const blast = acBlast ?? UNARY_BLASTS.get(op) ?? BINARY_BLASTS.get(op);
766
+ if (blast === undefined)
767
+ throw new SmtUnsupportedError(
768
+ `the bit-vector operator ${this.manager.funcDecls[this.manager.decls[term]].name}`,
769
+ );
770
+ this.internalizeBlast(term, blast, acBlast !== undefined);
771
+ }
772
+ }
773
+
774
+ internalizeAtom(atom: number) {
775
+ const op = this.manager.getOp(atom);
776
+ if (op === OP_BIT2BOOL) this.mkBit2Bool(atom);
777
+ else if (op === OP_ULEQ || op === OP_SLEQ) this.internalizeLe(atom, op === OP_SLEQ);
778
+ else if (op === OP_BUMUL_NO_OVFL || op === OP_BSMUL_NO_OVFL || op === OP_BSMUL_NO_UDFL)
779
+ this.internalizeNoOverflow(atom, op);
780
+ else
781
+ throw new SmtUnsupportedError(
782
+ `the bit-vector predicate ${this.manager.funcDecls[this.manager.decls[atom]].name}`,
783
+ );
784
+ return true;
785
+ }
786
+
787
+ private getAppArgBits(term: number, index: number) {
788
+ return this.getBits(this.getVar(this.getInternalizedEnode(this.manager.getArg(term, index))));
789
+ }
790
+
791
+ private mkDefinedAtom(atom: number, circuit: number) {
792
+ const context = this.context;
793
+ this.manager.incRef(circuit);
794
+ context.internalize(circuit, true);
795
+ const def = context.getLiteral(circuit);
796
+ const literal = mkLiteral(context.mkBoolVar(atom));
797
+ context.setVarTheory(getVar(literal), this.id);
798
+ this.insertAtom(getVar(literal), { isBit: false, literal, def });
799
+ context.mkThAxiom([literal, negate(def)]);
800
+ context.mkThAxiom([negate(literal), def]);
801
+ this.manager.decRef(circuit);
802
+ }
803
+
804
+ private internalizeNoOverflow(atom: number, op: number) {
805
+ this.processArgs(atom);
806
+ const first = this.getAppArgBits(atom, 0);
807
+ const second = this.getAppArgBits(atom, 1);
808
+ const blaster = this.blaster;
809
+ const circuit =
810
+ op === OP_BUMUL_NO_OVFL
811
+ ? blaster.mkUmulNoOverflow(first, second)
812
+ : op === OP_BSMUL_NO_OVFL
813
+ ? blaster.mkSmulNoOverflow(first, second)
814
+ : blaster.mkSmulNoUnderflow(first, second);
815
+ this.mkDefinedAtom(atom, circuit);
816
+ this.manager.decRef(circuit);
817
+ this.dropAll(second);
818
+ this.dropAll(first);
819
+ }
820
+
821
+ private internalizeLe(atom: number, isSigned: boolean) {
822
+ this.processArgs(atom);
823
+ const first = this.getAppArgBits(atom, 0);
824
+ const second = this.getAppArgBits(atom, 1);
825
+ if (!this.context.isBInternalized(atom)) {
826
+ const circuit = isSigned
827
+ ? this.blaster.mkSle(first, second)
828
+ : this.blaster.mkUle(first, second);
829
+ this.mkDefinedAtom(atom, circuit);
830
+ this.manager.decRef(circuit);
831
+ }
832
+ this.dropAll(second);
833
+ this.dropAll(first);
834
+ }
835
+
836
+ applySortCnstr(node: Enode) {
837
+ if (this.isAttachedToVar(node)) return;
838
+ this.mkBits(this.mkVar(node));
839
+ if (this.context.isRelevant(node.owner)) this.relevantEh(node.owner);
840
+ }
841
+
842
+ newEqEh(first: number, second: number) {
843
+ this.unionFind.merge(first, second);
844
+ }
845
+
846
+ newDiseqEh(first: number, second: number) {
847
+ const manager = this.manager;
848
+ if (manager.isBvSort(manager.sorts[this.getExpr(first)])) this.expandDiseq(first, second);
849
+ }
850
+
851
+ private expandDiseq(inputFirst: number, inputSecond: number) {
852
+ const context = this.context;
853
+ const manager = this.manager;
854
+ const first = Math.min(inputFirst, inputSecond);
855
+ const second = Math.max(inputFirst, inputSecond);
856
+ const firstBits = this.bits[first];
857
+ const secondBits = this.bits[second];
858
+ for (let index = 0; index < firstBits.length; index++) {
859
+ if (firstBits[index] === negate(secondBits[index])) return;
860
+ const firstValue = context.getAssignment(firstBits[index]);
861
+ const secondValue = context.getAssignment(secondBits[index]);
862
+ if (firstValue !== L_UNDEF && secondValue !== L_UNDEF && firstValue !== secondValue) return;
863
+ }
864
+ const literals = [this.mkEq(this.getExpr(first), this.getExpr(second), true)];
865
+ for (let index = 0; index < firstBits.length; index++) {
866
+ const firstExpr = this.literalToExpr(firstBits[index]);
867
+ const secondExpr = this.literalToExpr(secondBits[index]);
868
+ const difference = this.blaster.mkXor(firstExpr, secondExpr);
869
+ context.internalize(difference, true);
870
+ literals.push(context.getLiteral(difference));
871
+ manager.decRef(difference);
872
+ manager.decRef(secondExpr);
873
+ manager.decRef(firstExpr);
874
+ }
875
+ context.mkThAxiom(literals);
876
+ }
877
+
878
+ assignEh(boolVar: BoolVar) {
879
+ const atom = this.atoms[boolVar];
880
+ if (atom === undefined || !atom.isBit) return;
881
+ const queue = this.propQueue;
882
+ queue.length = 0;
883
+ for (let occ = atom.occs; occ !== null; occ = occ.next) queue.push(occ.thVar, occ.index);
884
+ this.propagateBits();
885
+ }
886
+
887
+ private propagateBits() {
888
+ const context = this.context;
889
+ const unionFind = this.unionFind;
890
+ const queue = this.propQueue;
891
+ for (let entry = 0; entry < queue.length; entry += 2) {
892
+ const thVar = queue[entry];
893
+ const index = queue[entry + 1];
894
+ if (this.wpos[thVar] === index) this.findWpos(thVar);
895
+ const bit = this.bits[thVar][index];
896
+ const value = context.getAssignment(bit);
897
+ if (value === L_UNDEF) continue;
898
+ const antecedent = value === L_FALSE ? negate(bit) : bit;
899
+ for (let other = unionFind.next(thVar); other !== thVar; other = unionFind.next(other)) {
900
+ const otherBit = this.bits[other][index];
901
+ if (bit === negate(otherBit)) {
902
+ this.addNewDiseqAxiom(thVar, other, index);
903
+ return;
904
+ }
905
+ if (value === context.getAssignment(otherBit)) continue;
906
+ this.assignBit(
907
+ value === L_FALSE ? negate(otherBit) : otherBit,
908
+ thVar,
909
+ other,
910
+ index,
911
+ antecedent,
912
+ false,
913
+ );
914
+ if (context.isInconsistent()) {
915
+ queue.length = 0;
916
+ return;
917
+ }
918
+ }
919
+ }
920
+ queue.length = 0;
921
+ }
922
+
923
+ private assignBit(
924
+ consequent: Literal,
925
+ first: number,
926
+ second: number,
927
+ index: number,
928
+ antecedent: Literal,
929
+ isPropagatingClass: boolean,
930
+ ) {
931
+ const context = this.context;
932
+ const justification = new BitEqJustification(
933
+ this.id,
934
+ this.getEnode(first),
935
+ this.getEnode(second),
936
+ antecedent,
937
+ );
938
+ if (consequent === FALSE_LITERAL) {
939
+ context.setConflict(justification, null);
940
+ return;
941
+ }
942
+ context.assign(consequent, justification);
943
+ const eq = this.mkEq(this.getExpr(first), this.getExpr(second), false);
944
+ const literals = [negate(consequent), antecedent, negate(eq)];
945
+ for (const literal of literals) context.markLiteralAsRelevant(literal);
946
+ context.mkThAxiom(literals);
947
+ if (this.wpos[second] === index) this.findWpos(second);
948
+ const atom = this.atoms[getVar(consequent)];
949
+ if (atom === undefined || !atom.isBit) return;
950
+ const root = this.unionFind.find(second);
951
+ for (let occ = atom.occs; occ !== null; occ = occ.next)
952
+ if (isPropagatingClass || this.unionFind.find(occ.thVar) !== root || occ.index !== index)
953
+ this.propQueue.push(occ.thVar, occ.index);
954
+ }
955
+
956
+ relevantEh(expr: number) {
957
+ const context = this.context;
958
+ const manager = this.manager;
959
+ if (context.relevancy.isEnabled && DIVREM_OPS.has(manager.getOp(expr))) {
960
+ context.markAsRelevant(manager.getArg(expr, 0));
961
+ context.markAsRelevant(manager.getArg(expr, 1));
962
+ this.assertDivremBoundAxiom(expr);
963
+ }
964
+ if (manager.isBool(expr)) {
965
+ if (!context.isBInternalized(expr)) return;
966
+ const atom = this.atoms[context.getBoolVar(expr)];
967
+ if (atom !== undefined && !atom.isBit) context.markLiteralAsRelevant(atom.def);
968
+ return;
969
+ }
970
+ const op = manager.getOp(expr);
971
+ if (op === OP_UBV2INT || op === OP_INT2BV) {
972
+ context.markAsRelevant(manager.getArg(expr, 0));
973
+ if (op === OP_UBV2INT) this.assertBv2intAxiom(expr);
974
+ else this.assertInt2bvAxiom(expr);
975
+ return;
976
+ }
977
+ if (!context.isEInternalized(expr)) return;
978
+ const thVar = this.getInternalizedEnode(expr).getThVar(this.id);
979
+ if (thVar < 0) return;
980
+ for (const bit of this.bits[thVar]) context.markLiteralAsRelevant(bit);
981
+ }
982
+
983
+ pushScopeEh() {
984
+ super.pushScopeEh();
985
+ this.trailLimits.push(this.trail.length);
986
+ }
987
+
988
+ popScopeEh(numScopes: number) {
989
+ const newLevel = this.trailLimits.length - numScopes;
990
+ const limit = this.trailLimits[newLevel];
991
+ for (let index = this.trail.length - 1; index >= limit; index--) this.trail[index]();
992
+ this.trail.length = limit;
993
+ this.trailLimits.length = newLevel;
994
+ const numOldVars = this.getOldNumVars(numScopes);
995
+ this.bits.length = numOldVars;
996
+ this.wpos.length = numOldVars;
997
+ this.zeroOneBits.length = numOldVars;
998
+ super.popScopeEh(numScopes);
999
+ }
1000
+
1001
+ includeFuncInterp(decl: number) {
1002
+ return DIV0_OPS.has(this.manager.funcDecls[decl].op);
1003
+ }
1004
+
1005
+ private mergeEh(firstRoot: number, secondRoot: number, first: number, second: number) {
1006
+ if (!this.mergeZeroOneBits(firstRoot, secondRoot)) return;
1007
+ const context = this.context;
1008
+ this.propQueue.length = 0;
1009
+ const size = this.bits[first].length;
1010
+ if (size === 0 && this.bv2ints.length > 0) this.propagateBv2int(firstRoot);
1011
+ let isChanged = true;
1012
+ while (isChanged) {
1013
+ isChanged = false;
1014
+ for (let index = 0; index < size; index++) {
1015
+ const firstBit = this.bits[first][index];
1016
+ const secondBit = this.bits[second][index];
1017
+ if (firstBit === negate(secondBit)) {
1018
+ this.addNewDiseqAxiom(first, second, index);
1019
+ return;
1020
+ }
1021
+ const firstValue = context.getAssignment(firstBit);
1022
+ const secondValue = context.getAssignment(secondBit);
1023
+ if (firstValue === L_UNDEF && !context.isRelevant(context.boolVar2Expr[getVar(firstBit)]))
1024
+ context.markLiteralAsRelevant(firstBit);
1025
+ if (secondValue === L_UNDEF && !context.isRelevant(context.boolVar2Expr[getVar(secondBit)]))
1026
+ context.markLiteralAsRelevant(secondBit);
1027
+ if (firstValue === secondValue) continue;
1028
+ isChanged = true;
1029
+ if (firstValue !== L_UNDEF && secondBit !== FALSE_LITERAL && secondBit !== TRUE_LITERAL)
1030
+ this.assignBit(
1031
+ firstValue === L_FALSE ? negate(secondBit) : secondBit,
1032
+ first,
1033
+ second,
1034
+ index,
1035
+ firstValue === L_FALSE ? negate(firstBit) : firstBit,
1036
+ true,
1037
+ );
1038
+ else if (secondValue !== L_UNDEF)
1039
+ this.assignBit(
1040
+ secondValue === L_FALSE ? negate(firstBit) : firstBit,
1041
+ second,
1042
+ first,
1043
+ index,
1044
+ secondValue === L_FALSE ? negate(secondBit) : secondBit,
1045
+ true,
1046
+ );
1047
+ if (context.isInconsistent()) return;
1048
+ }
1049
+ }
1050
+ this.propagateBits();
1051
+ }
1052
+
1053
+ // int2bv(bv2int(x)) = x when the int2bv has the sort of x.
1054
+ private propagateBv2int(rootVar: number) {
1055
+ const manager = this.manager;
1056
+ const node = this.getEnode(rootVar);
1057
+ const propagate = (bv2int: Enode) => {
1058
+ const word = bv2int.getArg(0);
1059
+ for (const parent of node.root.parents) {
1060
+ if (
1061
+ manager.getOp(parent.owner) !== OP_INT2BV ||
1062
+ parent.root === word.root ||
1063
+ manager.sorts[parent.owner] !== manager.sorts[word.owner]
1064
+ )
1065
+ continue;
1066
+ const justification = new TheoryJustification(
1067
+ this.id,
1068
+ [],
1069
+ [node, parent.getArg(0), node, bv2int],
1070
+ );
1071
+ this.context.pushEq(parent, word, { kind: "justification", justification });
1072
+ return;
1073
+ }
1074
+ };
1075
+ if (this.bv2ints.length < node.classSize) {
1076
+ for (const bv2int of this.bv2ints) if (bv2int.root === node.root) propagate(bv2int);
1077
+ return;
1078
+ }
1079
+ let member = node;
1080
+ do {
1081
+ if (manager.getOp(member.owner) === OP_UBV2INT) propagate(member);
1082
+ member = member.next;
1083
+ } while (member !== node);
1084
+ }
1085
+
1086
+ private mergeZeroOneBits(firstRoot: number, secondRoot: number) {
1087
+ const secondBits = this.zeroOneBits[secondRoot];
1088
+ if (secondBits.length === 0) return true;
1089
+ const firstBits = this.zeroOneBits[firstRoot];
1090
+ const aux = this.mergeAux;
1091
+ const resetAux = () => {
1092
+ for (const bit of firstBits) aux[bit.isTrue ? 1 : 0][bit.index] = -1;
1093
+ };
1094
+ for (const bit of firstBits) aux[bit.isTrue ? 1 : 0][bit.index] = bit.owner;
1095
+ for (const bit of secondBits) {
1096
+ const conflicting = aux[bit.isTrue ? 0 : 1][bit.index] ?? -1;
1097
+ if (conflicting !== -1) {
1098
+ this.addNewDiseqAxiom(conflicting, bit.owner, bit.index);
1099
+ resetAux();
1100
+ return false;
1101
+ }
1102
+ if ((aux[bit.isTrue ? 1 : 0][bit.index] ?? -1) === -1) firstBits.push(bit);
1103
+ }
1104
+ resetAux();
1105
+ return true;
1106
+ }
1107
+
1108
+ private unmergeEh(root: number) {
1109
+ const bits = this.zeroOneBits[root];
1110
+ for (let index = bits.length - 1; index >= 0; index--)
1111
+ if (this.unionFind.find(bits[index].owner) === root) {
1112
+ bits.length = index + 1;
1113
+ return;
1114
+ }
1115
+ bits.length = 0;
1116
+ }
1117
+
1118
+ canPropagate() {
1119
+ return this.propDiseqsHead < this.propDiseqs.length;
1120
+ }
1121
+
1122
+ propagate() {
1123
+ if (!this.canPropagate()) return;
1124
+ const context = this.context;
1125
+ const head = this.propDiseqsHead;
1126
+ context.pushTrail(() => {
1127
+ this.propDiseqsHead = head;
1128
+ });
1129
+ for (
1130
+ ;
1131
+ this.propDiseqsHead < this.propDiseqs.length && !context.isInconsistent();
1132
+ this.propDiseqsHead++
1133
+ ) {
1134
+ const diseq = this.propDiseqs[this.propDiseqsHead];
1135
+ this.assertNewDiseqAxiom(diseq.first, diseq.second);
1136
+ }
1137
+ }
1138
+
1139
+ private mkLiteral(expr: number) {
1140
+ const context = this.context;
1141
+ const manager = this.manager;
1142
+ manager.incRef(expr);
1143
+ const isNot = manager.isNot(expr);
1144
+ const atom = isNot ? manager.getArg(expr, 0) : expr;
1145
+ if (!context.isEInternalized(atom)) context.internalize(atom, false);
1146
+ const literal = context.getLiteral(atom);
1147
+ context.markLiteralAsRelevant(literal);
1148
+ manager.decRef(expr);
1149
+ return isNot ? negate(literal) : literal;
1150
+ }
1151
+
1152
+ private mkEq(first: number, second: number, isGateContext: boolean) {
1153
+ const context = this.context;
1154
+ const manager = this.manager;
1155
+ if (first === second) return TRUE_LITERAL;
1156
+ if (manager.areDistinct(first, second)) return FALSE_LITERAL;
1157
+ const eq = context.mkEqAtom(first, second);
1158
+ manager.incRef(eq);
1159
+ context.internalize(eq, isGateContext);
1160
+ const literal = context.getLiteral(eq);
1161
+ manager.decRef(eq);
1162
+ return literal;
1163
+ }
1164
+
1165
+ private assertDivremBoundAxiom(term: number) {
1166
+ const manager = this.manager;
1167
+ const op = manager.getOp(term);
1168
+ const dividend = manager.getArg(term, 0);
1169
+ const divisor = manager.getArg(term, 1);
1170
+ if (manager.isBvNumeral(divisor)) return;
1171
+ const sort = manager.sorts[term];
1172
+ const mkZero = () => manager.mkBvNumeral(0n, manager.getBvSize(sort));
1173
+ const mkAbs = (arg: number) => {
1174
+ const isNonNegative = mkBvApp(manager, OP_SLEQ, [mkZero(), arg]);
1175
+ manager.incRef(isNonNegative);
1176
+ const negation = mkBvApp(manager, OP_BNEG, [arg]);
1177
+ manager.incRef(negation);
1178
+ const result = manager.mkApp(OP_ITE, [isNonNegative, arg, negation], sort);
1179
+ manager.decRef(negation);
1180
+ manager.decRef(isNonNegative);
1181
+ return result;
1182
+ };
1183
+ const bound =
1184
+ op === OP_BUREM || op === OP_BUREM_I
1185
+ ? manager.mkNot(mkBvApp(manager, OP_ULEQ, [divisor, term]))
1186
+ : op === OP_BUDIV_I
1187
+ ? mkBvApp(manager, OP_ULEQ, [term, dividend])
1188
+ : op === OP_BSDIV_I
1189
+ ? mkBvApp(manager, OP_ULEQ, [mkAbs(term), mkAbs(dividend)])
1190
+ : manager.mkNot(mkBvApp(manager, OP_ULEQ, [mkAbs(divisor), mkAbs(term)]));
1191
+ const clause = [manager.mkEq(divisor, mkZero()), bound];
1192
+ for (const expr of clause) manager.incRef(expr);
1193
+ const literals = clause.map((expr) => this.mkLiteral(expr));
1194
+ this.context.mkThAxiom(literals);
1195
+ this.dropAll(clause);
1196
+ }
1197
+
1198
+ initModel(model: ProtoModel) {
1199
+ this.model = model;
1200
+ }
1201
+
1202
+ mkValue(node: Enode) {
1203
+ const model = this.model;
1204
+ if (model === undefined) throw new SmtInvariantError("the model was not initialized");
1205
+ const thVar = this.getThVar(node);
1206
+ const value = this.manager.mkBvNumeral(this.getFixedValue(thVar).value, this.getBvSize(thVar));
1207
+ model.registerValue(value);
1208
+ return value;
1209
+ }
1210
+ }