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,852 @@
1
+ import {
2
+ type AstManager,
3
+ OP_GE,
4
+ OP_LE,
5
+ OP_SEQ_CONCAT,
6
+ OP_SEQ_LENGTH,
7
+ OP_SEQ_MAP,
8
+ OP_SEQ_MAPI,
9
+ OP_SEQ_NTH_U,
10
+ OP_SEQ_UNIT,
11
+ OP_SUB,
12
+ SORT_BOOL,
13
+ SORT_INT,
14
+ } from "./ast";
15
+ import type { Context } from "./context";
16
+ import { type Enode, TheoryJustification } from "./enode";
17
+ import { L_TRUE, L_UNDEF } from "./lbool";
18
+ import { FALSE_LITERAL, type Literal, mkLiteral, negate, TRUE_LITERAL } from "./literal";
19
+ import { type Dependency, linearize, mkJoin, mkLeaf } from "./lp/dependency";
20
+ import { Rational } from "./rational";
21
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
22
+ import { SeqAxioms } from "./seq-axioms";
23
+ import { getConcatUnits, isEmptySeq, mkConcatOf, mkEmptySeq, mkSeqApp } from "./seq-decl-plugin";
24
+ import { SeqEqSolver } from "./seq-eq-solver";
25
+ import { SeqRewriter } from "./seq-rewriter";
26
+ import type { SeqSkolem } from "./seq-skolem";
27
+ import { Theory } from "./theory";
28
+
29
+ interface Assumption {
30
+ first: Enode | undefined;
31
+ second: Enode | undefined;
32
+ literal: Literal | undefined;
33
+ }
34
+
35
+ export interface DepEq {
36
+ id: number;
37
+ ls: number[];
38
+ rs: number[];
39
+ dep: Dependency;
40
+ }
41
+
42
+ export interface DecomposedEq {
43
+ ls: number[];
44
+ rs: number[];
45
+ }
46
+
47
+ export interface Ne {
48
+ left: number;
49
+ right: number;
50
+ eqs: DecomposedEq[];
51
+ literals: Literal[];
52
+ dep: Dependency;
53
+ }
54
+
55
+ interface Nc {
56
+ contains: number;
57
+ lengthGreater: Literal;
58
+ dep: Dependency;
59
+ }
60
+
61
+ interface ExprDep {
62
+ expr: number;
63
+ dep: Dependency;
64
+ }
65
+
66
+ class ScopedVector<T> {
67
+ items: T[] = [];
68
+ private undoIndexes: number[] = [];
69
+ private undoValues: T[] = [];
70
+ private sizes: number[] = [];
71
+ private undoLimits: number[] = [];
72
+
73
+ get size() {
74
+ return this.items.length;
75
+ }
76
+
77
+ push(item: T) {
78
+ this.items.push(item);
79
+ }
80
+
81
+ set(index: number, item: T) {
82
+ this.undoIndexes.push(index);
83
+ this.undoValues.push(this.items[index]);
84
+ this.items[index] = item;
85
+ }
86
+
87
+ eraseAndSwap(index: number) {
88
+ const last = this.items.length - 1;
89
+ if (index !== last) this.set(index, this.items[last]);
90
+ this.undoIndexes.push(last);
91
+ this.undoValues.push(this.items[last]);
92
+ this.items.pop();
93
+ }
94
+
95
+ pushScope() {
96
+ this.sizes.push(this.items.length);
97
+ this.undoLimits.push(this.undoIndexes.length);
98
+ }
99
+
100
+ popScope(numScopes: number) {
101
+ if (numScopes === 0) return;
102
+ const level = this.sizes.length - numScopes;
103
+ const limit = this.undoLimits[level];
104
+ for (let index = this.undoIndexes.length - 1; index >= limit; index--)
105
+ this.items[this.undoIndexes[index]] = this.undoValues[index];
106
+ this.undoIndexes.length = limit;
107
+ this.undoValues.length = limit;
108
+ this.items.length = this.sizes[level];
109
+ this.sizes.length = level;
110
+ this.undoLimits.length = level;
111
+ }
112
+ }
113
+
114
+ class TrailStack {
115
+ private undos: (() => void)[] = [];
116
+ private limits: number[] = [];
117
+
118
+ push(undo: () => void) {
119
+ this.undos.push(undo);
120
+ }
121
+
122
+ pushScope() {
123
+ this.limits.push(this.undos.length);
124
+ }
125
+
126
+ popScope(numScopes: number) {
127
+ if (numScopes === 0) return;
128
+ const level = this.limits.length - numScopes;
129
+ const limit = this.limits[level];
130
+ for (let index = this.undos.length - 1; index >= limit; index--) this.undos[index]();
131
+ this.undos.length = limit;
132
+ this.limits.length = level;
133
+ }
134
+ }
135
+
136
+ const INSERT = 0;
137
+ const DELETE = 1;
138
+
139
+ class SolutionMap {
140
+ private map = new Map<number, ExprDep>();
141
+ private cache = new Map<number, ExprDep>();
142
+ private updates: number[] = [];
143
+ private lefts: number[] = [];
144
+ private rights: number[] = [];
145
+ private deps: Dependency[] = [];
146
+ private limits: number[] = [];
147
+
148
+ private reducesTo(input: number, expr: number) {
149
+ let current = input;
150
+ while (current !== expr) {
151
+ const value = this.map.get(current);
152
+ if (value === undefined) return false;
153
+ current = value.expr;
154
+ }
155
+ return true;
156
+ }
157
+
158
+ update(expr: number, rep: number, dep: Dependency) {
159
+ if (expr === rep || this.reducesTo(rep, expr)) return;
160
+ this.cache.clear();
161
+ const value = this.map.get(expr);
162
+ if (value !== undefined) this.addTrail(DELETE, expr, value.expr, value.dep);
163
+ this.map.set(expr, { expr: rep, dep });
164
+ this.addTrail(INSERT, expr, rep, dep);
165
+ }
166
+
167
+ private addTrail(op: number, left: number, right: number, dep: Dependency) {
168
+ this.updates.push(op);
169
+ this.lefts.push(left);
170
+ this.rights.push(right);
171
+ this.deps.push(dep);
172
+ }
173
+
174
+ addCache(expr: number, rep: number, dep: Dependency) {
175
+ this.cache.set(expr, { expr: rep, dep });
176
+ }
177
+
178
+ findCache(expr: number) {
179
+ return this.cache.get(expr);
180
+ }
181
+
182
+ findWithDep(input: number) {
183
+ let dep: Dependency = null;
184
+ let expr = input;
185
+ for (let value = this.map.get(expr); value !== undefined; value = this.map.get(expr)) {
186
+ dep = mkJoin(dep, value.dep);
187
+ expr = value.expr;
188
+ }
189
+ return { expr, dep };
190
+ }
191
+
192
+ find(input: number) {
193
+ let expr = input;
194
+ for (let value = this.map.get(expr); value !== undefined; value = this.map.get(expr))
195
+ expr = value.expr;
196
+ return expr;
197
+ }
198
+
199
+ find1(expr: number) {
200
+ return this.map.get(expr);
201
+ }
202
+
203
+ isRoot(expr: number) {
204
+ return !this.map.has(expr);
205
+ }
206
+
207
+ pushScope() {
208
+ this.limits.push(this.updates.length);
209
+ }
210
+
211
+ popScope(numScopes: number) {
212
+ if (numScopes === 0) return;
213
+ this.cache.clear();
214
+ const start = this.limits[this.limits.length - numScopes];
215
+ for (let index = this.updates.length - 1; index >= start; index--) {
216
+ if (this.updates[index] === INSERT) this.map.delete(this.lefts[index]);
217
+ else this.map.set(this.lefts[index], { expr: this.rights[index], dep: this.deps[index] });
218
+ }
219
+ this.updates.length = start;
220
+ this.lefts.length = start;
221
+ this.rights.length = start;
222
+ this.deps.length = start;
223
+ this.limits.length -= numScopes;
224
+ }
225
+ }
226
+
227
+ class ExclusionTable {
228
+ private table = new Set<string>();
229
+ private lefts: number[] = [];
230
+ private rights: number[] = [];
231
+ private limits: number[] = [];
232
+
233
+ constructor(private manager: AstManager) {}
234
+
235
+ private getKey(first: number, second: number) {
236
+ return this.manager.ids[first] > this.manager.ids[second]
237
+ ? `${second},${first}`
238
+ : `${first},${second}`;
239
+ }
240
+
241
+ contains(first: number, second: number) {
242
+ return this.table.has(this.getKey(first, second));
243
+ }
244
+
245
+ update(first: number, second: number) {
246
+ const key = this.getKey(first, second);
247
+ if (first === second || this.table.has(key)) return;
248
+ this.lefts.push(first);
249
+ this.rights.push(second);
250
+ this.table.add(key);
251
+ }
252
+
253
+ pushScope() {
254
+ this.limits.push(this.lefts.length);
255
+ }
256
+
257
+ popScope(numScopes: number) {
258
+ if (numScopes === 0) return;
259
+ const start = this.limits[this.limits.length - numScopes];
260
+ for (let index = start; index < this.lefts.length; index++)
261
+ this.table.delete(this.getKey(this.lefts[index], this.rights[index]));
262
+ this.lefts.length = start;
263
+ this.rights.length = start;
264
+ this.limits.length -= numScopes;
265
+ }
266
+ }
267
+
268
+ class UnionFind {
269
+ private finds: number[] = [];
270
+ private sizes: number[] = [];
271
+ private nexts: number[] = [];
272
+
273
+ constructor(private trail: TrailStack) {}
274
+
275
+ mkVar() {
276
+ const thVar = this.finds.length;
277
+ this.finds.push(thVar);
278
+ this.sizes.push(1);
279
+ this.nexts.push(thVar);
280
+ this.trail.push(() => {
281
+ this.finds.pop();
282
+ this.sizes.pop();
283
+ this.nexts.pop();
284
+ });
285
+ }
286
+
287
+ find(input: number) {
288
+ let thVar = input;
289
+ while (this.finds[thVar] !== thVar) thVar = this.finds[thVar];
290
+ return thVar;
291
+ }
292
+
293
+ merge(first: number, second: number) {
294
+ let firstRoot = this.find(first);
295
+ let secondRoot = this.find(second);
296
+ if (firstRoot === secondRoot) return;
297
+ if (this.sizes[firstRoot] > this.sizes[secondRoot]) {
298
+ const swapped = firstRoot;
299
+ firstRoot = secondRoot;
300
+ secondRoot = swapped;
301
+ }
302
+ this.finds[firstRoot] = secondRoot;
303
+ this.sizes[secondRoot] += this.sizes[firstRoot];
304
+ const next = this.nexts[firstRoot];
305
+ this.nexts[firstRoot] = this.nexts[secondRoot];
306
+ this.nexts[secondRoot] = next;
307
+ const root = firstRoot;
308
+ const other = secondRoot;
309
+ this.trail.push(() => {
310
+ const restored = this.nexts[root];
311
+ this.nexts[root] = this.nexts[other];
312
+ this.nexts[other] = restored;
313
+ this.sizes[other] -= this.sizes[root];
314
+ this.finds[root] = root;
315
+ });
316
+ }
317
+ }
318
+
319
+ export abstract class TheorySeqState extends Theory {
320
+ protected assumptions: Assumption[] = [];
321
+ private assumptionLimits: number[] = [];
322
+ protected rep = new SolutionMap();
323
+ protected eqs = new ScopedVector<DepEq>();
324
+ protected nqs = new ScopedVector<Ne>();
325
+ protected ncs = new ScopedVector<Nc>();
326
+ protected lts = new ScopedVector<number>();
327
+ protected recfuns = new ScopedVector<number>();
328
+ protected isLtsChecked = false;
329
+ protected eqId = 0;
330
+ protected unionFind: UnionFind;
331
+ protected overlapLeft = new Map<number, boolean>();
332
+ protected overlapRight = new Map<number, boolean>();
333
+ protected exclude: ExclusionTable;
334
+ protected axioms: number[] = [];
335
+ protected axiomSet = new Set<number>();
336
+ protected axiomsHead = 0;
337
+ protected intStrings: number[] = [];
338
+ protected hasLengthSet = new Set<number>();
339
+ protected lengths: number[] = [];
340
+ protected lengthLimits: number[] = [];
341
+ protected replay: (() => void)[] = [];
342
+ protected strRewriter: Rewriter;
343
+ protected rewriter: Rewriter;
344
+ protected seqRewriter: SeqRewriter;
345
+ protected ax: SeqAxioms;
346
+ protected sk: SeqSkolem;
347
+ protected eqSolver: SeqEqSolver;
348
+ protected trailStack = new TrailStack();
349
+ protected maxUnfoldingDepth = 1;
350
+ protected maxUnfoldingLiteral: Literal | undefined;
351
+ protected unhandledExpr: number | undefined;
352
+ protected hasSeq: boolean;
353
+ protected isNewSolution = false;
354
+ protected isNewPropagation = false;
355
+ protected fixed = new Set<number>();
356
+ protected expandTodo: number[] = [];
357
+ protected eqDeps: Dependency = null;
358
+ protected nthEq2Cache = new Set<string>();
359
+ protected branchStart = new Map<number, number>();
360
+
361
+ constructor(context: Context, family: number) {
362
+ super(context, family);
363
+ const manager = context.manager;
364
+ this.unionFind = new UnionFind(this.trailStack);
365
+ this.exclude = new ExclusionTable(manager);
366
+ this.rewriter = new Rewriter(manager, { ...TACTIC_REWRITER_OPTIONS, isCoalescingChars: false });
367
+ this.strRewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
368
+ this.seqRewriter = new SeqRewriter(manager);
369
+ this.ax = new SeqAxioms(manager, {
370
+ rewrite: (expr) => this.rewrite(expr),
371
+ mkEqLiteral: (first, second) => this.mkEqLiteral(first, second, false),
372
+ ensureEnode: (expr) => this.ensureEnodeOf(expr),
373
+ getLiteral: (expr) => context.getLiteral(expr),
374
+ forcePhase: (literal) => context.forcePhase(literal),
375
+ addAxiom: (literals) => this.addAxiom(literals),
376
+ pushTrail: (undo) => context.pushTrail(undo),
377
+ });
378
+ this.sk = this.ax.skolem;
379
+ this.eqSolver = new SeqEqSolver(
380
+ manager,
381
+ {
382
+ addConsequence: (isUsingDeps, clause) => this.addConsequence(isUsingDeps, clause),
383
+ addSolution: (variable, term) => {
384
+ this.addSolution(variable, term, this.eqDeps);
385
+ },
386
+ expr2rep: (expr) => this.expr2rep(expr),
387
+ getLength: (expr) => {
388
+ const value = this.getLengthValue(expr);
389
+ return { isKnown: value !== undefined, value: value ?? Rational.zero };
390
+ },
391
+ },
392
+ this.ax,
393
+ );
394
+ this.hasSeq = manager.isSeqUsed;
395
+ }
396
+
397
+ protected keep(expr: number) {
398
+ this.manager.incRef(expr);
399
+ return expr;
400
+ }
401
+
402
+ protected rewrite(expr: number) {
403
+ return this.rewriter.rewrite(expr);
404
+ }
405
+
406
+ protected isSeq(expr: number) {
407
+ return this.manager.isSeqSort(this.manager.sorts[expr]);
408
+ }
409
+
410
+ protected isRe(expr: number) {
411
+ return this.manager.isReSort(this.manager.sorts[expr]);
412
+ }
413
+
414
+ protected isOp(expr: number, op: number) {
415
+ return this.manager.getOp(expr) === op;
416
+ }
417
+
418
+ protected isConcat(expr: number) {
419
+ return this.isOp(expr, OP_SEQ_CONCAT) && this.manager.getNumArgs(expr) === 2;
420
+ }
421
+
422
+ protected isEmpty(expr: number) {
423
+ return isEmptySeq(this.manager, expr);
424
+ }
425
+
426
+ protected isUnit(expr: number) {
427
+ return this.isOp(expr, OP_SEQ_UNIT);
428
+ }
429
+
430
+ protected isString(expr: number) {
431
+ return this.manager.getString(expr) !== undefined;
432
+ }
433
+
434
+ protected isNthU(expr: number) {
435
+ return this.isOp(expr, OP_SEQ_NTH_U);
436
+ }
437
+
438
+ protected mkInt(value: number | bigint) {
439
+ return this.manager.mkNumeral(BigInt(value));
440
+ }
441
+
442
+ protected mkArith(op: number, args: number[]) {
443
+ return this.manager.mkApp(op, args, op === OP_GE || op === OP_LE ? SORT_BOOL : SORT_INT);
444
+ }
445
+
446
+ protected mkConcat(args: readonly number[], sort?: number) {
447
+ return mkConcatOf(this.manager, args, sort ?? this.manager.sorts[args[0]]);
448
+ }
449
+
450
+ protected mkConcat2(first: number, second: number) {
451
+ return mkSeqApp(this.manager, OP_SEQ_CONCAT, [first, second]);
452
+ }
453
+
454
+ protected mkEmpty(sort: number) {
455
+ return mkEmptySeq(this.manager, sort);
456
+ }
457
+
458
+ protected mkLen(seq: number) {
459
+ return this.seqRewriter.mkLengthOf(seq);
460
+ }
461
+
462
+ protected mkSub(first: number, second: number) {
463
+ return this.rewrite(this.mkArith(OP_SUB, [first, second]));
464
+ }
465
+
466
+ protected mkLength(seq: number) {
467
+ return mkSeqApp(this.manager, OP_SEQ_LENGTH, [seq]);
468
+ }
469
+
470
+ protected getConcatUnits(expr: number, result: number[]) {
471
+ return getConcatUnits(this.manager, expr, result);
472
+ }
473
+
474
+ protected mkEqDep(left: number, right: number, dep: Dependency): DepEq {
475
+ const ls = this.getConcatUnits(left, []).map((expr) => this.keep(expr));
476
+ const rs = this.getConcatUnits(right, []).map((expr) => this.keep(expr));
477
+ return { id: this.eqId++, ls, rs, dep };
478
+ }
479
+
480
+ protected mkDepEq(id: number, ls: readonly number[], rs: readonly number[], dep: Dependency) {
481
+ return {
482
+ id,
483
+ ls: ls.map((expr) => this.keep(expr)),
484
+ rs: rs.map((expr) => this.keep(expr)),
485
+ dep,
486
+ };
487
+ }
488
+
489
+ protected mkAssumption(assumption: Assumption) {
490
+ this.assumptions.push(assumption);
491
+ return mkLeaf(this.assumptions.length - 1);
492
+ }
493
+
494
+ protected mkLiteralLeaf(literal: Literal) {
495
+ return this.mkAssumption({ first: undefined, second: undefined, literal });
496
+ }
497
+
498
+ protected mkJoinLiteral(dep: Dependency, literal: Literal) {
499
+ return mkJoin(dep, this.mkLiteralLeaf(literal));
500
+ }
501
+
502
+ protected mkJoinLiterals(input: Dependency, literals: readonly Literal[]) {
503
+ let dep = input;
504
+ for (const literal of literals) dep = this.mkJoinLiteral(dep, literal);
505
+ return dep;
506
+ }
507
+
508
+ protected linearizeOf(dep: Dependency, eqs: Enode[], literals: Literal[]) {
509
+ for (const index of linearize([dep])) {
510
+ const assumption = this.assumptions[index];
511
+ if (assumption.literal !== undefined && assumption.literal !== TRUE_LITERAL)
512
+ literals.push(assumption.literal);
513
+ if (assumption.first !== undefined) eqs.push(assumption.first, assumption.second!);
514
+ }
515
+ }
516
+
517
+ protected pushScopeDeps() {
518
+ this.assumptionLimits.push(this.assumptions.length);
519
+ }
520
+
521
+ protected popScopeDeps(numScopes: number) {
522
+ const level = this.assumptionLimits.length - numScopes;
523
+ this.assumptions.length = this.assumptionLimits[level];
524
+ this.assumptionLimits.length = level;
525
+ }
526
+
527
+ private getEnodeOf(expr: number) {
528
+ return this.context.isEInternalized(expr) ? this.context.getEnode(expr) : undefined;
529
+ }
530
+
531
+ protected getNumValue(expr: number) {
532
+ const node = this.getEnodeOf(expr);
533
+ if (node === undefined) return undefined;
534
+ let next = node;
535
+ do {
536
+ const value = this.context.arith?.getValueOf(next);
537
+ if (value !== undefined) return value.isInt() ? value : undefined;
538
+ next = next.next;
539
+ } while (next !== node);
540
+ return undefined;
541
+ }
542
+
543
+ protected lowerBound(expr: number) {
544
+ const node = this.getEnodeOf(expr);
545
+ const bound = node === undefined ? undefined : this.context.arith?.getLower(node);
546
+ return bound !== undefined && !bound.isStrict && bound.value.isInt() ? bound.value : undefined;
547
+ }
548
+
549
+ protected upperBound(expr: number) {
550
+ const node = this.getEnodeOf(expr);
551
+ const bound = node === undefined ? undefined : this.context.arith?.getUpper(node);
552
+ return bound !== undefined && !bound.isStrict && bound.value.isInt() ? bound.value : undefined;
553
+ }
554
+
555
+ protected lowerBound2(seq: number) {
556
+ const node = this.getEnodeOf(this.mkLen(seq));
557
+ if (node === undefined) return undefined;
558
+ let lower: Rational | undefined;
559
+ let isStrict = false;
560
+ let next = node;
561
+ do {
562
+ const bound = this.context.arith?.getLower(next);
563
+ if (
564
+ bound !== undefined &&
565
+ (lower === undefined ||
566
+ bound.value.compare(lower) > 0 ||
567
+ (bound.value.equals(lower) && bound.isStrict))
568
+ ) {
569
+ lower = bound.value;
570
+ isStrict = bound.isStrict;
571
+ }
572
+ next = next.next;
573
+ } while (next !== node);
574
+ return isStrict ? undefined : lower;
575
+ }
576
+
577
+ protected getLengthValue(input: number) {
578
+ const manager = this.manager;
579
+ let value = Rational.zero;
580
+ const todo = [input];
581
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
582
+ const op = manager.getOp(expr);
583
+ const chars = manager.getString(expr);
584
+ if (this.isConcat(expr)) todo.push(manager.getArg(expr, 0), manager.getArg(expr, 1));
585
+ else if (op === OP_SEQ_UNIT) value = value.add(Rational.one);
586
+ else if (this.isEmpty(expr)) continue;
587
+ else if (this.isOp(expr, OP_SEQ_MAP)) todo.push(manager.getArg(expr, 1));
588
+ else if (this.isOp(expr, OP_SEQ_MAPI)) todo.push(manager.getArg(expr, 2));
589
+ else if (chars !== undefined) value = value.add(Rational.of(BigInt(chars.length)));
590
+ else {
591
+ const length = this.mkLen(expr);
592
+ if (!this.hasLength(expr)) {
593
+ this.addAxiomOf(this.mkLiteralOf(this.mkArith(OP_GE, [length, this.mkInt(0)])));
594
+ return undefined;
595
+ }
596
+ const node = this.getEnodeOf(length);
597
+ const lengthValue = node === undefined ? undefined : this.context.arith?.getValueOf(node);
598
+ if (lengthValue === undefined || lengthValue.isNegative()) return undefined;
599
+ value = value.add(lengthValue);
600
+ }
601
+ }
602
+ return value.isInt() ? value : undefined;
603
+ }
604
+
605
+ protected hasLength(expr: number) {
606
+ return this.hasLengthSet.has(expr);
607
+ }
608
+
609
+ protected expr2rep(expr: number) {
610
+ const context = this.context;
611
+ const manager = this.manager;
612
+ if (manager.isBool(expr) && context.isBInternalized(expr)) {
613
+ const value = context.getAssignment(mkLiteral(context.getBoolVar(expr)));
614
+ if (value === L_TRUE) return manager.trueExpr;
615
+ if (value !== L_UNDEF) return manager.falseExpr;
616
+ }
617
+ if (!context.isEInternalized(expr)) return expr;
618
+ return context.getEnode(expr)!.root.owner;
619
+ }
620
+
621
+ protected mkEqEmpty(expr: number, isPositive = true) {
622
+ const manager = this.manager;
623
+ if (this.isEmpty(expr)) return TRUE_LITERAL;
624
+ for (const unit of this.getConcatUnits(expr, [])) {
625
+ if (this.isUnit(unit)) return FALSE_LITERAL;
626
+ const chars = manager.getString(unit);
627
+ if (chars !== undefined && chars.length > 0) return FALSE_LITERAL;
628
+ }
629
+ const literal = this.mkEqLiteral(expr, this.mkEmpty(manager.sorts[expr]), false);
630
+ this.context.forcePhase(isPositive ? literal : negate(literal));
631
+ this.context.markLiteralAsRelevant(literal);
632
+ return literal;
633
+ }
634
+
635
+ protected mkSeqEq(first: number, second: number) {
636
+ return this.mkLiteralOf(this.sk.mkEq(first, second));
637
+ }
638
+
639
+ protected mkSimplifiedLiteral(expr: number) {
640
+ return this.mkLiteralOf(this.rewrite(expr));
641
+ }
642
+
643
+ protected mkGeLiteral(expr: number, bound: number | bigint) {
644
+ return this.mkLiteralOf(this.mkArith(OP_GE, [expr, this.mkInt(bound)]));
645
+ }
646
+
647
+ protected mkLeLiteral(expr: number, bound: number | bigint) {
648
+ return this.mkLiteralOf(this.mkArith(OP_LE, [expr, this.mkInt(bound)]));
649
+ }
650
+
651
+ protected addAxiomOf(...inputs: Literal[]) {
652
+ if (inputs.includes(TRUE_LITERAL)) return;
653
+ this.addAxiom(inputs.filter((literal) => literal !== FALSE_LITERAL));
654
+ }
655
+
656
+ protected addAxiom(literals: Literal[]) {
657
+ const context = this.context;
658
+ for (const literal of literals)
659
+ if (context.getAssignment(literal) === L_TRUE && context.getAssignLevel(literal) === 0)
660
+ return;
661
+ for (const literal of literals) context.markLiteralAsRelevant(literal);
662
+ this.isNewPropagation = true;
663
+ context.mkThAxiom(literals);
664
+ }
665
+
666
+ protected propagateLit(dep: Dependency, antecedents: readonly Literal[], literal: Literal) {
667
+ const context = this.context;
668
+ if (literal === TRUE_LITERAL || context.getAssignment(literal) === L_TRUE) return false;
669
+ const literals = [...antecedents];
670
+ if (literal === FALSE_LITERAL) {
671
+ this.setConflict(dep, literals);
672
+ return true;
673
+ }
674
+ context.markLiteralAsRelevant(literal);
675
+ const eqs: Enode[] = [];
676
+ this.linearizeOf(dep, eqs, literals);
677
+ this.isNewPropagation = true;
678
+ context.assign(literal, new TheoryJustification(this.id, literals, eqs));
679
+ return true;
680
+ }
681
+
682
+ protected setConflict(dep: Dependency, antecedents: readonly Literal[] = []) {
683
+ const eqs: Enode[] = [];
684
+ const literals = [...antecedents];
685
+ this.linearizeOf(dep, eqs, literals);
686
+ this.isNewPropagation = true;
687
+ this.context.setConflict(new TheoryJustification(this.id, literals, eqs), null);
688
+ }
689
+
690
+ protected conflictOrAxiom(literals: Literal[], dep: Dependency) {
691
+ const context = this.context;
692
+ if (literals.every((literal) => context.getAssignment(literal) === L_TRUE)) {
693
+ this.setConflict(dep, literals);
694
+ return;
695
+ }
696
+ const clause = literals.map((literal) => negate(literal));
697
+ const eqs: Enode[] = [];
698
+ const depLiterals: Literal[] = [];
699
+ this.linearizeOf(dep, eqs, depLiterals);
700
+ for (const literal of depLiterals) clause.push(negate(literal));
701
+ for (let index = 0; index < eqs.length; index += 2)
702
+ clause.push(negate(this.mkEqLiteral(eqs[index].owner, eqs[index + 1].owner, false)));
703
+ this.addAxiom(clause);
704
+ }
705
+
706
+ protected propagateEqNodes(dep: Dependency, first: Enode, second: Enode) {
707
+ if (first.root === second.root) return false;
708
+ const literals: Literal[] = [];
709
+ const eqs: Enode[] = [];
710
+ this.linearizeOf(dep, eqs, literals);
711
+ this.context.pushEq(first, second, {
712
+ kind: "justification",
713
+ justification: new TheoryJustification(this.id, literals, eqs),
714
+ });
715
+ this.isNewPropagation = true;
716
+ this.enforceLengthCoherence(first, second);
717
+ return true;
718
+ }
719
+
720
+ protected propagateEq(
721
+ inputDep: Dependency,
722
+ antecedents: readonly Literal[],
723
+ firstExpr: number,
724
+ secondExpr: number,
725
+ isAddingToEqs = true,
726
+ ) {
727
+ const context = this.context;
728
+ const manager = this.manager;
729
+ manager.incRef(firstExpr);
730
+ manager.incRef(secondExpr);
731
+ const first = this.ensureEnodeOf(firstExpr);
732
+ const second = this.ensureEnodeOf(secondExpr);
733
+ manager.decRef(secondExpr);
734
+ manager.decRef(firstExpr);
735
+ if (first.root === second.root) return false;
736
+ context.markAsRelevant(first.owner);
737
+ context.markAsRelevant(second.owner);
738
+ const literals = [...antecedents];
739
+ const eqs: Enode[] = [];
740
+ this.linearizeOf(inputDep, eqs, literals);
741
+ if (isAddingToEqs) this.newEqEhOf(this.mkJoinLiterals(inputDep, antecedents), first, second);
742
+ this.isNewPropagation = true;
743
+ context.pushEq(first, second, {
744
+ kind: "justification",
745
+ justification: new TheoryJustification(this.id, literals, eqs),
746
+ });
747
+ return true;
748
+ }
749
+
750
+ protected enforceLengthCoherence(first: Enode, second: Enode) {
751
+ const firstExpr = first.owner;
752
+ const secondExpr = second.owner;
753
+ if (this.isOp(firstExpr, OP_SEQ_CONCAT) && this.isOp(secondExpr, OP_SEQ_CONCAT)) return;
754
+ if (this.hasLength(firstExpr) && !this.hasLength(secondExpr)) this.addLengthToEqc(secondExpr);
755
+ else if (this.hasLength(secondExpr) && !this.hasLength(firstExpr))
756
+ this.addLengthToEqc(firstExpr);
757
+ }
758
+
759
+ protected addLength(length: number) {
760
+ const expr = this.manager.getArg(length, 0);
761
+ if (this.hasLength(expr)) return;
762
+ this.lengths.push(this.keep(length));
763
+ this.hasLengthSet.add(expr);
764
+ this.trailStack.push(() => {
765
+ this.lengths.pop();
766
+ });
767
+ this.trailStack.push(() => {
768
+ this.hasLengthSet.delete(expr);
769
+ });
770
+ }
771
+
772
+ protected addLengthToEqc(expr: number) {
773
+ const first = this.ensureEnodeOf(expr);
774
+ let node = first;
775
+ let isChanged = false;
776
+ do {
777
+ const owner = node.owner;
778
+ if (!this.hasLength(owner)) {
779
+ const length = this.mkLength(owner);
780
+ this.addLength(length);
781
+ this.ensureEnodeOf(length);
782
+ isChanged = true;
783
+ }
784
+ node = node.next;
785
+ } while (node !== first);
786
+ return isChanged;
787
+ }
788
+
789
+ protected addConsequence(isUsingDeps: boolean, clause: number[]) {
790
+ const dep = isUsingDeps ? this.eqDeps : null;
791
+ this.isNewPropagation = true;
792
+ if (clause.length === 1) {
793
+ this.propagateLit(dep, [], this.mkLiteralOf(clause[0]));
794
+ return;
795
+ }
796
+ const eqs: Enode[] = [];
797
+ const literals: Literal[] = [];
798
+ this.linearizeOf(dep, eqs, literals);
799
+ const axiom = literals.map((literal) => negate(literal));
800
+ for (let index = 0; index < eqs.length; index += 2)
801
+ axiom.push(negate(this.mkEqLiteral(eqs[index].owner, eqs[index + 1].owner, false)));
802
+ for (const expr of clause) axiom.push(this.mkLiteralOf(expr));
803
+ this.addAxiom(axiom);
804
+ }
805
+
806
+ protected addSolution(left: number, right: number, dep: Dependency) {
807
+ if (left === right) return false;
808
+ this.isNewSolution = true;
809
+ this.rep.update(this.keep(left), this.keep(right), dep);
810
+ const first = this.ensureEnodeOf(left);
811
+ const second = this.ensureEnodeOf(right);
812
+ const lengthParents: number[] = [];
813
+ const isSeq = this.isSeq(right);
814
+ if (isSeq)
815
+ for (const node of [first, second])
816
+ for (const parent of node.parents)
817
+ if (this.isOp(parent.owner, OP_SEQ_LENGTH)) lengthParents.push(parent.owner);
818
+ this.propagateEqNodes(dep, first, second);
819
+ if (isSeq) {
820
+ const length = this.rewrite(this.mkLength(right));
821
+ for (const parent of lengthParents) this.propagateEq(dep, [], parent, length, false);
822
+ }
823
+ return true;
824
+ }
825
+
826
+ protected isVar(expr: number) {
827
+ return this.eqSolver.isVar(expr);
828
+ }
829
+
830
+ protected setEmpty(expr: number) {
831
+ const isZeroLength = this.mkEqLiteral(this.mkInt(0), this.mkLen(expr), false);
832
+ this.addAxiomOf(negate(isZeroLength), this.mkEqEmpty(expr));
833
+ return true;
834
+ }
835
+
836
+ protected decompose(expr: number) {
837
+ return this.sk.decompose(expr);
838
+ }
839
+
840
+ protected mkDecompose(expr: number) {
841
+ const decomposition = this.decompose(expr);
842
+ const isEmpty = this.mkEqEmpty(expr);
843
+ this.addAxiomOf(negate(isEmpty), this.mkEqEmpty(decomposition.tail));
844
+ this.addAxiomOf(
845
+ isEmpty,
846
+ this.mkEqLiteral(expr, this.mkConcat2(decomposition.head, decomposition.tail), false),
847
+ );
848
+ return decomposition;
849
+ }
850
+
851
+ protected abstract newEqEhOf(dep: Dependency, first: Enode, second: Enode): void;
852
+ }