tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.4a2a53c48

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 (570) 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 +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +3 -0
  8. package/dist/index.d.ts +3 -0
  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.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +45 -42
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +42 -39
  19. package/dist/transfer.js +44 -41
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -36
  24. package/src/builtins.ts +4 -13
  25. package/src/check-failure.ts +116 -0
  26. package/src/check-trace.ts +282 -0
  27. package/src/check.ts +353 -549
  28. package/src/cli/options.ts +6 -31
  29. package/src/cli/shared.ts +1 -1
  30. package/src/cli/tlapm.ts +433 -70
  31. package/src/cli/tlc-arguments.ts +222 -210
  32. package/src/cli/tlc-output.ts +687 -0
  33. package/src/cli/tlc-usage.ts +1 -2
  34. package/src/cli/tlc.ts +49 -702
  35. package/src/cli/xml-exporter.ts +23 -33
  36. package/src/codegen.ts +5 -10
  37. package/src/coverage.ts +3 -10
  38. package/src/dependencies.ts +30 -14
  39. package/src/dfid.ts +16 -16
  40. package/src/environment-config.ts +315 -0
  41. package/src/environment.ts +55 -338
  42. package/src/errors.ts +33 -5
  43. package/src/evaluate.ts +5 -4
  44. package/src/exit-codes.ts +1 -0
  45. package/src/fingerprints.ts +65 -1
  46. package/src/instances.ts +47 -10
  47. package/src/java-hash.ts +7 -0
  48. package/src/json.ts +4 -7
  49. package/src/levels.ts +39 -42
  50. package/src/lexer.ts +5 -3
  51. package/src/liveness-checker.ts +553 -237
  52. package/src/liveness.ts +94 -86
  53. package/src/obligations/action.ts +14 -17
  54. package/src/obligations/anonymize.ts +37 -16
  55. package/src/obligations/enabled-axioms.ts +218 -0
  56. package/src/obligations/equality.ts +1 -3
  57. package/src/obligations/expression.ts +36 -8
  58. package/src/obligations/format.ts +0 -2
  59. package/src/obligations/generate.ts +66 -54
  60. package/src/obligations/index.ts +38 -8
  61. package/src/obligations/levels.ts +24 -11
  62. package/src/obligations/module.ts +28 -41
  63. package/src/obligations/normalize.ts +26 -14
  64. package/src/obligations/operators.ts +0 -2
  65. package/src/obligations/pragma.ts +53 -16
  66. package/src/obligations/printer.ts +43 -13
  67. package/src/obligations/proof.ts +3 -2
  68. package/src/obligations/regroup.ts +0 -2
  69. package/src/obligations/simplify.ts +55 -50
  70. package/src/obligations/source.ts +118 -74
  71. package/src/obligations/subexpression.ts +45 -18
  72. package/src/obligations/substitution.ts +1 -3
  73. package/src/obligations/temporal.ts +5 -7
  74. package/src/obligations/tuples.ts +0 -2
  75. package/src/parallel-worker.ts +10 -30
  76. package/src/parallel.ts +24 -47
  77. package/src/parser.ts +580 -180
  78. package/src/pretty-print.ts +1 -1
  79. package/src/prover/decide-pool.ts +3 -3
  80. package/src/prover/deciders.ts +12 -9
  81. package/src/prover/isabelle/decide.ts +3 -25
  82. package/src/prover/isabelle/encode.ts +72 -42
  83. package/src/prover/isabelle/isar/attrib.ts +250 -0
  84. package/src/prover/isabelle/isar/context.ts +335 -0
  85. package/src/prover/isabelle/isar/induct.ts +382 -0
  86. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  87. package/src/prover/isabelle/isar/method.ts +509 -212
  88. package/src/prover/isabelle/isar/proof.ts +570 -14
  89. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  90. package/src/prover/isabelle/isar/theory.ts +487 -76
  91. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  92. package/src/prover/isabelle/isar/type-check.ts +89 -14
  93. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  94. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  95. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  96. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  97. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  98. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  99. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  100. package/src/prover/isabelle/provers/classical.ts +45 -20
  101. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  102. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  103. package/src/prover/isabelle/pure/consts.ts +0 -2
  104. package/src/prover/isabelle/pure/conv.ts +2 -10
  105. package/src/prover/isabelle/pure/drule.ts +72 -6
  106. package/src/prover/isabelle/pure/envir.ts +0 -2
  107. package/src/prover/isabelle/pure/goal.ts +1 -3
  108. package/src/prover/isabelle/pure/logic.ts +1 -3
  109. package/src/prover/isabelle/pure/name.ts +0 -2
  110. package/src/prover/isabelle/pure/net.ts +0 -2
  111. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  112. package/src/prover/isabelle/pure/pattern.ts +0 -2
  113. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  114. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  115. package/src/prover/isabelle/pure/search.ts +0 -2
  116. package/src/prover/isabelle/pure/seq.ts +0 -2
  117. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  118. package/src/prover/isabelle/pure/table.ts +2 -3
  119. package/src/prover/isabelle/pure/tactic.ts +0 -2
  120. package/src/prover/isabelle/pure/tactical.ts +42 -37
  121. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  122. package/src/prover/isabelle/pure/term.ts +0 -2
  123. package/src/prover/isabelle/pure/thm.ts +14 -13
  124. package/src/prover/isabelle/pure/type.ts +0 -2
  125. package/src/prover/isabelle/pure/unify.ts +0 -2
  126. package/src/prover/isabelle/pure/variable.ts +0 -2
  127. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  128. package/src/prover/isabelle/tla/context.ts +58 -11
  129. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  130. package/src/prover/isabelle/tla/logic.ts +49 -21
  131. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  132. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  133. package/src/prover/ocaml.ts +4 -1
  134. package/src/prover/prep/action.ts +30 -31
  135. package/src/prover/prep/enabled-axioms.ts +11 -2
  136. package/src/prover/prep/fingerprint.ts +2 -5
  137. package/src/prover/prep/methods.ts +181 -51
  138. package/src/prover/prep/normalize.ts +38 -9
  139. package/src/prover/prove.ts +395 -94
  140. package/src/prover/ptl/decide.ts +95 -50
  141. package/src/prover/ptl/encode.ts +2 -3
  142. package/src/prover/ptl/tableau.ts +28 -2
  143. package/src/prover/smt/arithmetic.ts +310 -0
  144. package/src/prover/smt/axioms.ts +12 -8
  145. package/src/prover/smt/context.ts +43 -8
  146. package/src/prover/smt/data.ts +498 -379
  147. package/src/prover/smt/encode.ts +148 -57
  148. package/src/prover/smt/extensionality.ts +5 -3
  149. package/src/prover/smt/flatten.ts +4 -6
  150. package/src/prover/smt/format.ts +28 -4
  151. package/src/prover/smt/instances.ts +7 -1
  152. package/src/prover/smt/layout.ts +91 -0
  153. package/src/prover/smt/rewrite.ts +1021 -618
  154. package/src/prover/smt/simplify.ts +441 -0
  155. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  156. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  157. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  158. package/src/prover/smt/solver/act-cache.ts +0 -1
  159. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  160. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  161. package/src/prover/smt/solver/aig.ts +889 -0
  162. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  163. package/src/prover/smt/solver/arith-terms.ts +121 -0
  164. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  165. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  166. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  167. package/src/prover/smt/solver/ast-lt.ts +166 -12
  168. package/src/prover/smt/solver/ast-util.ts +160 -2
  169. package/src/prover/smt/solver/ast.ts +1427 -41
  170. package/src/prover/smt/solver/auf-solver.ts +2 -6
  171. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  172. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  173. package/src/prover/smt/solver/bound-manager.ts +196 -0
  174. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  175. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  176. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  177. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  178. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  179. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  180. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  181. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  182. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  183. package/src/prover/smt/solver/card2bv.ts +110 -0
  184. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  185. package/src/prover/smt/solver/cg-table.ts +39 -25
  186. package/src/prover/smt/solver/check-logic.ts +330 -0
  187. package/src/prover/smt/solver/clause.ts +0 -1
  188. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  189. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  190. package/src/prover/smt/solver/context.ts +516 -115
  191. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  192. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  193. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  194. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  195. package/src/prover/smt/solver/demodulator.ts +786 -0
  196. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  197. package/src/prover/smt/solver/der.ts +38 -10
  198. package/src/prover/smt/solver/diff-neq.ts +206 -0
  199. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  200. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  201. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  202. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  203. package/src/prover/smt/solver/e-matching.ts +7 -8
  204. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  205. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  206. package/src/prover/smt/solver/enode.ts +100 -3
  207. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  208. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  209. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  210. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  211. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  212. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  213. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  214. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  215. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  216. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  217. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  218. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  219. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  220. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  221. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  222. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  223. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  224. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  225. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  226. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  227. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  228. package/src/prover/smt/solver/expr-ref.ts +0 -1
  229. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  230. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  231. package/src/prover/smt/solver/factor.ts +141 -0
  232. package/src/prover/smt/solver/fd-solver.ts +265 -0
  233. package/src/prover/smt/solver/fingerprints.ts +15 -15
  234. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  235. package/src/prover/smt/solver/flat-literals.ts +0 -1
  236. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  237. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  238. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  239. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  240. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  241. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  242. package/src/prover/smt/solver/goal.ts +175 -15
  243. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  244. package/src/prover/smt/solver/guard-set.ts +219 -0
  245. package/src/prover/smt/solver/hash.ts +0 -1
  246. package/src/prover/smt/solver/hashtable.ts +30 -16
  247. package/src/prover/smt/solver/inf-eps.ts +63 -0
  248. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  249. package/src/prover/smt/solver/internalizer.ts +110 -38
  250. package/src/prover/smt/solver/lackr.ts +381 -0
  251. package/src/prover/smt/solver/lbool.ts +0 -1
  252. package/src/prover/smt/solver/lia2card.ts +268 -0
  253. package/src/prover/smt/solver/lia2pb.ts +154 -0
  254. package/src/prover/smt/solver/literal.ts +0 -1
  255. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  256. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  257. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  258. package/src/prover/smt/solver/lp/containers.ts +0 -1
  259. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  260. package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
  261. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  262. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  263. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  264. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  265. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  266. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  267. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  268. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  269. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  270. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  271. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  272. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  273. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  274. package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
  275. package/src/prover/smt/solver/lp/nex.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
  278. package/src/prover/smt/solver/lp/nla-core.ts +42 -11
  279. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  280. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  282. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
  283. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  284. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  285. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  288. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  289. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  290. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  291. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  293. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  295. package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
  296. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  297. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  298. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  299. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  300. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  301. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  302. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  303. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  304. package/src/prover/smt/solver/macro-finder.ts +530 -0
  305. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  306. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  307. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  308. package/src/prover/smt/solver/max-cliques.ts +105 -0
  309. package/src/prover/smt/solver/maxcore.ts +309 -0
  310. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  311. package/src/prover/smt/solver/maxlex.ts +115 -0
  312. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  313. package/src/prover/smt/solver/maxsmt.ts +92 -0
  314. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  315. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  316. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  317. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  318. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  319. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  320. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  321. package/src/prover/smt/solver/model-checker.ts +18 -27
  322. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  323. package/src/prover/smt/solver/model-finder.ts +12 -18
  324. package/src/prover/smt/solver/model-generator.ts +56 -29
  325. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  326. package/src/prover/smt/solver/model-printer.ts +214 -0
  327. package/src/prover/smt/solver/mpf.ts +711 -0
  328. package/src/prover/smt/solver/mus.ts +51 -0
  329. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  330. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  331. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  332. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  333. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  334. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  335. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  336. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  337. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  338. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  339. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  340. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  341. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  342. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  343. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  344. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  345. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  346. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  347. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  348. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  349. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  350. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  351. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  352. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  353. package/src/prover/smt/solver/nlqsat.ts +484 -0
  354. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  355. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  356. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  357. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  358. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  359. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  360. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  361. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  362. package/src/prover/smt/solver/nlsat/solver.ts +234 -36
  363. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  364. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  365. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  366. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  367. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  368. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  369. package/src/prover/smt/solver/nnf.ts +105 -23
  370. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  371. package/src/prover/smt/solver/occf.ts +97 -0
  372. package/src/prover/smt/solver/opt-context.ts +787 -0
  373. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  374. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  375. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  376. package/src/prover/smt/solver/opt-solver.ts +308 -0
  377. package/src/prover/smt/solver/opt-value.ts +55 -0
  378. package/src/prover/smt/solver/optsmt.ts +692 -0
  379. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  380. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  381. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  382. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  383. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  384. package/src/prover/smt/solver/probes.ts +512 -0
  385. package/src/prover/smt/solver/propagate-values.ts +37 -21
  386. package/src/prover/smt/solver/proto-model.ts +648 -19
  387. package/src/prover/smt/solver/pull-quant.ts +28 -12
  388. package/src/prover/smt/solver/purify-arith.ts +632 -0
  389. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  390. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  391. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  392. package/src/prover/smt/solver/qe-lite.ts +37 -17
  393. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  394. package/src/prover/smt/solver/qe.ts +1498 -0
  395. package/src/prover/smt/solver/qel.ts +25 -0
  396. package/src/prover/smt/solver/qi-queue.ts +0 -1
  397. package/src/prover/smt/solver/qsat.ts +814 -0
  398. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  399. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  400. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  401. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  402. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  403. package/src/prover/smt/solver/random-gen.ts +0 -1
  404. package/src/prover/smt/solver/rational.ts +45 -1
  405. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  406. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  407. package/src/prover/smt/solver/reduce-args.ts +225 -0
  408. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  409. package/src/prover/smt/solver/ref-vector.ts +0 -1
  410. package/src/prover/smt/solver/relevancy.ts +1 -2
  411. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  412. package/src/prover/smt/solver/rewriter.ts +475 -36
  413. package/src/prover/smt/solver/rlimit.ts +25 -2
  414. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  415. package/src/prover/smt/solver/sat/big.ts +177 -0
  416. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  417. package/src/prover/smt/solver/sat/clause.ts +203 -0
  418. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  419. package/src/prover/smt/solver/sat/config.ts +122 -0
  420. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  421. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  422. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  423. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  424. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  425. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  426. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  427. package/src/prover/smt/solver/sat/probing.ts +170 -0
  428. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  429. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  430. package/src/prover/smt/solver/sat/scc.ts +142 -0
  431. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  432. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  433. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  434. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  435. package/src/prover/smt/solver/search-tree.ts +284 -0
  436. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  437. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  438. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  439. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  440. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  441. package/src/prover/smt/solver/seq-factory.ts +89 -0
  442. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  443. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  444. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  445. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  446. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  447. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  448. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  449. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  450. package/src/prover/smt/solver/seq-subset.ts +165 -0
  451. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  452. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  453. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  454. package/src/prover/smt/solver/smt-logics.ts +66 -0
  455. package/src/prover/smt/solver/smt-setup.ts +496 -0
  456. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  457. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  458. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  459. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  460. package/src/prover/smt/solver/solver.ts +113 -22
  461. package/src/prover/smt/solver/static-features.ts +314 -0
  462. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  463. package/src/prover/smt/solver/tactic.ts +1986 -0
  464. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  465. package/src/prover/smt/solver/theory-array.ts +1240 -0
  466. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  467. package/src/prover/smt/solver/theory-char.ts +355 -0
  468. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  469. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  470. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  471. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  472. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  473. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  474. package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
  475. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  476. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  477. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  478. package/src/prover/smt/solver/theory-lra.ts +188 -1
  479. package/src/prover/smt/solver/theory-pb.ts +934 -0
  480. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  481. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  482. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  483. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  484. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  485. package/src/prover/smt/solver/theory-seq.ts +961 -0
  486. package/src/prover/smt/solver/theory.ts +189 -0
  487. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  488. package/src/prover/smt/solver/var-subst.ts +36 -14
  489. package/src/prover/smt/table.ts +3 -2
  490. package/src/prover/smt/types.ts +146 -0
  491. package/src/prover/tlapm/cache.ts +50 -19
  492. package/src/prover/tlapm/tlapm.ts +15 -9
  493. package/src/prover/tlapm-library.ts +3208 -0
  494. package/src/prover/verdict.ts +9 -0
  495. package/src/prover/zenon/check/check.ts +1 -2
  496. package/src/prover/zenon/check/records.ts +1 -1
  497. package/src/prover/zenon/check/relations.ts +2 -1
  498. package/src/prover/zenon/check/rewrites.ts +2 -15
  499. package/src/prover/zenon/check/sets.ts +40 -58
  500. package/src/prover/zenon/check/terms.ts +1 -2
  501. package/src/prover/zenon/decide.ts +10 -7
  502. package/src/prover/zenon/encode.ts +0 -2
  503. package/src/prover/zenon/eqrel.ts +2 -2
  504. package/src/prover/zenon/equality-rules.ts +0 -2
  505. package/src/prover/zenon/expr.ts +7 -2
  506. package/src/prover/zenon/index-table.ts +9 -21
  507. package/src/prover/zenon/isar-case.ts +0 -2
  508. package/src/prover/zenon/isar.ts +35 -37
  509. package/src/prover/zenon/llproof.ts +2 -13
  510. package/src/prover/zenon/mltoll.ts +12 -30
  511. package/src/prover/zenon/node.ts +20 -5
  512. package/src/prover/zenon/parse.ts +9 -8
  513. package/src/prover/zenon/phrase.ts +0 -2
  514. package/src/prover/zenon/proof.ts +0 -2
  515. package/src/prover/zenon/propositional-rules.ts +0 -2
  516. package/src/prover/zenon/rules.ts +0 -2
  517. package/src/prover/zenon/search.ts +11 -19
  518. package/src/prover/zenon/tla/functions.ts +2 -4
  519. package/src/prover/zenon/tla/llproof.ts +9 -13
  520. package/src/prover/zenon/tla/records.ts +1 -8
  521. package/src/prover/zenon/tla/rewrites.ts +0 -2
  522. package/src/prover/zenon/tla/sets.ts +22 -22
  523. package/src/prover/zenon/tla/terms.ts +0 -2
  524. package/src/prover/zenon/tla/tla.ts +7 -8
  525. package/src/resolve.ts +56 -74
  526. package/src/runtime.ts +4 -0
  527. package/src/sany/generation.ts +394 -0
  528. package/src/sany/generator-def-entries.ts +210 -0
  529. package/src/sany/generator-definitions.ts +686 -0
  530. package/src/sany/generator-expressions.ts +1100 -0
  531. package/src/sany/generator-proofs.ts +662 -0
  532. package/src/sany/generator.ts +155 -2625
  533. package/src/sany/levels.ts +0 -2
  534. package/src/sany/lexer.ts +17 -16
  535. package/src/sany/linter.ts +0 -2
  536. package/src/sany/nodes.ts +6 -13
  537. package/src/sany/report.ts +3 -6
  538. package/src/sany/selectors.ts +35 -38
  539. package/src/sany/xml.ts +23 -55
  540. package/src/search.ts +205 -43
  541. package/src/simulate.ts +160 -133
  542. package/src/spec-description.ts +33 -48
  543. package/src/standard-definitions.ts +4 -0
  544. package/src/standard-modules.ts +16 -32
  545. package/src/state-graph.ts +2 -9
  546. package/src/substitution-levels.ts +5 -4
  547. package/src/successors.ts +6 -8
  548. package/src/symmetry.ts +2 -2
  549. package/src/tableau.ts +2 -2
  550. package/src/tlc/fingerprint.ts +81 -9
  551. package/src/tlc/messages.ts +20 -15
  552. package/src/tlc/order.ts +2 -9
  553. package/src/tlc/random.ts +4 -4
  554. package/src/tlc/replay.ts +8 -15
  555. package/src/tlc/summary.ts +29 -14
  556. package/src/tlc/tlc-operators.ts +2 -3
  557. package/src/tlc/tlcext-operators.ts +44 -12
  558. package/src/tlc/trace-spec.ts +25 -45
  559. package/src/typed-tier.ts +6535 -0
  560. package/src/typescript/actions.ts +2 -4
  561. package/src/typescript/collections.ts +34 -20
  562. package/src/typescript/compile.ts +1 -3
  563. package/src/typescript/formula.ts +5 -3
  564. package/src/typescript/model.ts +4 -5
  565. package/src/typescript/steps.ts +20 -18
  566. package/src/values.ts +63 -158
  567. package/src/prover/isabelle/isar/statement.ts +0 -52
  568. package/src/prover/smt/solver/z3-license.txt +0 -10
  569. package/src/prover/tlaps-module.ts +0 -510
  570. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,961 @@
1
+ import { SmtUnsupportedError } from "../../../errors";
2
+ import {
3
+ FAMILY_SEQ,
4
+ OP_EQ,
5
+ OP_SEQ_AT,
6
+ OP_SEQ_CONTAINS,
7
+ OP_SEQ_EXTRACT,
8
+ OP_SEQ_FOLDL,
9
+ OP_SEQ_FOLDLI,
10
+ OP_SEQ_INDEX,
11
+ OP_SEQ_IN_RE,
12
+ OP_SEQ_LAST_INDEX,
13
+ OP_SEQ_LENGTH,
14
+ OP_SEQ_MAP,
15
+ OP_SEQ_MAPI,
16
+ OP_SEQ_NTH_I,
17
+ OP_SEQ_NTH_U,
18
+ OP_SEQ_POWER,
19
+ OP_SEQ_PREFIX,
20
+ OP_SEQ_REPLACE,
21
+ OP_SEQ_REPLACE_ALL,
22
+ OP_SEQ_REPLACE_RE,
23
+ OP_SEQ_REPLACE_RE_ALL,
24
+ OP_SEQ_SUFFIX,
25
+ OP_SEQ_UNIT,
26
+ OP_STRING_FROM_CODE,
27
+ OP_STRING_IS_DIGIT,
28
+ OP_STRING_ITOS,
29
+ OP_STRING_LE,
30
+ OP_STRING_LT,
31
+ OP_STRING_SBVTOS,
32
+ OP_STRING_STOI,
33
+ OP_STRING_TO_CODE,
34
+ OP_STRING_UBVTOS,
35
+ SORT_BOOL,
36
+ } from "./ast";
37
+ import type { Context } from "./context";
38
+ import type { Enode } from "./enode";
39
+ import { ObjMap } from "./hashtable";
40
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
41
+ import {
42
+ type BoolVar,
43
+ FALSE_LITERAL,
44
+ type Literal,
45
+ mkLiteral,
46
+ negate,
47
+ TRUE_LITERAL,
48
+ } from "./literal";
49
+ import type { ProtoModel } from "./proto-model";
50
+ import { mkSeqApp } from "./seq-decl-plugin";
51
+ import type { SeqFactory } from "./seq-factory";
52
+ import { type DependentValue, FC_CONTINUE, FC_DONE, FC_GIVEUP } from "./theory";
53
+ import { TheorySeqRegex } from "./theory-seq-regex";
54
+
55
+ const MAX_UNFOLDING = 0x3fffffff;
56
+ const MAX_PAD = 1 << 16;
57
+ const SOURCE_UNIT = 0;
58
+ const SOURCE_INT = 1;
59
+ const SOURCE_STRING = 2;
60
+
61
+ const compareCodes = (first: readonly number[], second: readonly number[]) => {
62
+ for (let index = 0; index < first.length && index < second.length; index++)
63
+ if (first[index] !== second[index]) return first[index] - second[index];
64
+ return first.length - second.length;
65
+ };
66
+
67
+ export class TheorySeq extends TheorySeqRegex {
68
+ readonly name = "seq";
69
+ private factory: SeqFactory | undefined;
70
+ private limitMap: ObjMap<number>;
71
+
72
+ constructor(context: Context) {
73
+ super(context, FAMILY_SEQ);
74
+ this.limitMap = new ObjMap((key) => context.manager.hashes[key]);
75
+ }
76
+
77
+ finalCheckEh() {
78
+ if (!this.hasSeq) return FC_DONE;
79
+ this.isNewPropagation = false;
80
+ if (this.simplifyAndSolveEqs()) return FC_CONTINUE;
81
+ if (this.checkEquationConflict()) return FC_CONTINUE;
82
+ if (this.checkLts()) return FC_CONTINUE;
83
+ if (this.solveNqs(0)) return FC_CONTINUE;
84
+ if (this.checkFixedLength(true, false)) return FC_CONTINUE;
85
+ if (this.checkFixedLength(false, false)) return FC_CONTINUE;
86
+ if (this.checkFixedLength(false, true)) return FC_CONTINUE;
87
+ if (this.checkContains()) return FC_CONTINUE;
88
+ if (this.checkIntString()) return FC_CONTINUE;
89
+ if (this.reduceLengthEq()) return FC_CONTINUE;
90
+ if (this.branchUnitVariable()) return FC_CONTINUE;
91
+ if (this.branchBinaryVariable()) return FC_CONTINUE;
92
+ if (this.branchVariable()) return FC_CONTINUE;
93
+ if (this.checkLengthCoherence()) return FC_CONTINUE;
94
+ if (!this.checkExtensionality()) return FC_CONTINUE;
95
+ if (this.branchNqs()) return FC_CONTINUE;
96
+ if (this.branchItos()) return FC_CONTINUE;
97
+ if (this.checkFixedLength(false, true)) return FC_CONTINUE;
98
+ if (this.solveRecfuns()) return FC_CONTINUE;
99
+ if (this.finalCheckRegex()) return FC_CONTINUE;
100
+ if (this.unhandledExpr !== undefined) return FC_GIVEUP;
101
+ return this.eqs.size === 0 && this.ncs.size === 0 ? FC_DONE : FC_GIVEUP;
102
+ }
103
+
104
+ private simplifyAndSolveEqs() {
105
+ this.isNewSolution = true;
106
+ while (this.isNewSolution && !this.context.isInconsistent()) {
107
+ this.isNewSolution = false;
108
+ this.solveEqs(0);
109
+ }
110
+ return this.isNewPropagation || this.context.isInconsistent();
111
+ }
112
+
113
+ private mkVar(node: Enode) {
114
+ const expr = node.owner;
115
+ if (!this.isSeq(expr) && !this.isRe(expr) && !this.isNthU(expr)) return -1;
116
+ if (this.isAttachedToVar(node)) return node.getThVar(this.id);
117
+ const thVar = this.varEnodes.length;
118
+ this.varEnodes.push(node);
119
+ this.unionFind.mkVar();
120
+ this.context.attachThVar(node, this, thVar);
121
+ this.context.markAsRelevant(expr);
122
+ return thVar;
123
+ }
124
+
125
+ internalizeAtom(atom: number) {
126
+ return this.internalizeTerm(atom);
127
+ }
128
+
129
+ internalizeTerm(term: number) {
130
+ const context = this.context;
131
+ const manager = this.manager;
132
+ this.hasSeq = true;
133
+ const op = manager.getOp(term);
134
+ if (op === OP_SEQ_IN_RE) this.mkVar(this.ensureEnodeOf(manager.getArg(term, 0)));
135
+ if (op === OP_STRING_UBVTOS || op === OP_STRING_SBVTOS)
136
+ throw new SmtUnsupportedError("str.from_ubv in the theory of sequences");
137
+ if (op === OP_SEQ_LENGTH) this.mkVar(this.ensureEnodeOf(manager.getArg(term, 0)));
138
+ const existing = context.getEnode(term);
139
+ if (existing !== undefined) {
140
+ this.mkVar(existing);
141
+ return true;
142
+ }
143
+ const isBool = manager.isBool(term);
144
+ if (isBool && (op === OP_SEQ_IN_RE || this.sk.isSkolem(term))) {
145
+ context.setVarTheory(context.mkBoolVar(term), this.id);
146
+ context.markAsRelevant(term);
147
+ return true;
148
+ }
149
+ for (const arg of manager.getArgs(term)) this.mkVar(this.ensureEnodeOf(arg));
150
+ if (isBool) {
151
+ context.setVarTheory(context.mkBoolVar(term), this.id);
152
+ context.markAsRelevant(term);
153
+ }
154
+ this.mkVar(context.getEnode(term) ?? context.mkEnode(term, false, isBool, true));
155
+ if (!context.relevancy.isEnabled) this.relevantEh(term);
156
+ return true;
157
+ }
158
+
159
+ internalizeEqEh(eq: number) {
160
+ const context = this.context;
161
+ for (const arg of this.manager.getArgs(eq)) this.mkVar(context.getEnode(arg)!);
162
+ }
163
+
164
+ applySortCnstr(node: Enode) {
165
+ this.mkVar(node);
166
+ }
167
+
168
+ isBetaRedex(parent: Enode, node: Enode) {
169
+ const op = this.manager.getOp(parent.owner);
170
+ if (op !== OP_SEQ_MAP && op !== OP_SEQ_MAPI && op !== OP_SEQ_FOLDL && op !== OP_SEQ_FOLDLI)
171
+ return false;
172
+ return parent.getArg(0).root === node.root;
173
+ }
174
+
175
+ includeFuncInterp(decl: number) {
176
+ return this.manager.funcDecls[decl].op === OP_SEQ_NTH_U;
177
+ }
178
+
179
+ private checkFixedLength(isZero: boolean, isCheckingLongStrings: boolean) {
180
+ let isFound = false;
181
+ for (let index = 0; index < this.lengths.length; index++)
182
+ if (this.fixedLength(this.lengths[index], isZero, isCheckingLongStrings)) isFound = true;
183
+ return isFound;
184
+ }
185
+
186
+ private fixedLength(length: number, isZero: boolean, isCheckingLongStrings: boolean) {
187
+ const manager = this.manager;
188
+ const context = this.context;
189
+ const expr = manager.getArg(length, 0);
190
+ if (!this.isVar(expr)) return false;
191
+ const lower = this.lowerBound(length);
192
+ if (lower === undefined) return false;
193
+ const upper = this.upperBound(length);
194
+ if (upper === undefined || !lower.equals(upper)) return false;
195
+ if (isZero ? !lower.isZero() : lower.isNegative() || lower.num > 0xffffffffn) return false;
196
+ const sk = this.sk;
197
+ if (
198
+ sk.isTail(expr) ||
199
+ sk.isSeqFirst(expr) ||
200
+ sk.isIndexofLeft(expr) ||
201
+ sk.isIndexofRight(expr) ||
202
+ this.fixed.has(expr)
203
+ )
204
+ return false;
205
+ const isLength = this.mkEqLiteral(length, manager.mkNumeral(lower.num), false);
206
+ if (context.getAssignment(isLength) === L_FALSE) return false;
207
+ if (!isCheckingLongStrings && lower.num > 20n && !isZero) return false;
208
+ this.fixed.add(this.keep(expr));
209
+ this.trailStack.push(() => {
210
+ this.fixed.delete(expr);
211
+ });
212
+ let seq = expr;
213
+ if (lower.isZero()) seq = this.mkEmpty(manager.sorts[expr]);
214
+ else if (!isZero) {
215
+ const elems: number[] = [];
216
+ for (let index = 0n; index < lower.num; index++) {
217
+ const decomposition = this.decompose(seq);
218
+ elems.push(decomposition.head);
219
+ seq = decomposition.tail;
220
+ }
221
+ seq = this.mkConcat(elems);
222
+ }
223
+ const eq = this.mkSeqEq(seq, expr);
224
+ if (context.getAssignment(eq) === L_TRUE) return false;
225
+ this.addAxiomOf(negate(isLength), eq);
226
+ if (context.scopeLevel !== context.baseLevel) {
227
+ const kept = this.keep(length);
228
+ this.trailStack.push(() => {
229
+ this.replay.push(() => {
230
+ this.fixedLength(kept, false, false);
231
+ });
232
+ });
233
+ }
234
+ return true;
235
+ }
236
+
237
+ private checkContains() {
238
+ for (let index = 0; !this.context.isInconsistent() && index < this.ncs.size; index++)
239
+ if (this.solveNc(index)) this.ncs.eraseAndSwap(index--);
240
+ return this.isNewPropagation || this.context.isInconsistent();
241
+ }
242
+
243
+ private solveNc(index: number) {
244
+ const manager = this.manager;
245
+ const nc = this.ncs.items[index];
246
+ const text = manager.getArg(nc.contains, 0);
247
+ const pattern = manager.getArg(nc.contains, 1);
248
+ const value = this.context.getAssignment(nc.lengthGreater);
249
+ if (value === L_TRUE) {
250
+ this.addLengthToEqc(text);
251
+ this.addLengthToEqc(pattern);
252
+ return true;
253
+ }
254
+ if (value === L_UNDEF) {
255
+ this.context.markLiteralAsRelevant(nc.lengthGreater);
256
+ this.isNewPropagation = true;
257
+ return false;
258
+ }
259
+ if (!this.sk.isTail(text)) this.addLengthLimit(text, this.maxUnfoldingDepth, true);
260
+ this.ax.unrollNotContains(nc.contains);
261
+ return true;
262
+ }
263
+
264
+ private checkLts() {
265
+ const manager = this.manager;
266
+ const context = this.context;
267
+ if (this.lts.size === 0 || this.isLtsChecked) return false;
268
+ const size = this.lts.size;
269
+ this.trailStack.push(() => {
270
+ this.isLtsChecked = false;
271
+ });
272
+ this.isLtsChecked = true;
273
+ const orient = (predicate: number) => {
274
+ let first = manager.getArg(predicate, 0);
275
+ let second = manager.getArg(predicate, 1);
276
+ let literal = context.getLiteral(predicate);
277
+ let isStrict = manager.getOp(predicate) === OP_STRING_LT;
278
+ if (context.getAssignment(literal) === L_FALSE) {
279
+ const swapped = first;
280
+ first = second;
281
+ second = swapped;
282
+ literal = negate(literal);
283
+ isStrict = !isStrict;
284
+ }
285
+ return { first, second, literal, isStrict };
286
+ };
287
+ for (let index = 0; index + 1 < size; index++) {
288
+ const outer = orient(this.lts.items[index]);
289
+ for (let other = index + 1; other < size; other++) {
290
+ const inner = orient(this.lts.items[other]);
291
+ if (context.getEnode(outer.second)!.root !== context.getEnode(inner.first)!.root) continue;
292
+ const eq =
293
+ outer.second === inner.first
294
+ ? TRUE_LITERAL
295
+ : this.mkEqLiteral(outer.second, inner.first, false);
296
+ const isStrict = outer.isStrict || inner.isStrict;
297
+ const lower = manager.getString(outer.first);
298
+ const upper = manager.getString(inner.second);
299
+ if (lower !== undefined && upper !== undefined) {
300
+ const comparison = compareCodes(lower, upper);
301
+ if (isStrict ? comparison >= 0 : comparison > 0)
302
+ this.addAxiomOf(negate(outer.literal), negate(inner.literal), negate(eq));
303
+ continue;
304
+ }
305
+ const bound = mkSeqApp(manager, isStrict ? OP_STRING_LT : OP_STRING_LE, [
306
+ outer.first,
307
+ inner.second,
308
+ ]);
309
+ this.addAxiomOf(
310
+ negate(outer.literal),
311
+ negate(inner.literal),
312
+ negate(eq),
313
+ this.mkLiteralOf(bound),
314
+ );
315
+ }
316
+ }
317
+ return true;
318
+ }
319
+
320
+ private checkIntString() {
321
+ let isChanged = false;
322
+ for (const expr of this.intStrings) if (this.checkIntStringOf(expr)) isChanged = true;
323
+ return isChanged;
324
+ }
325
+
326
+ private checkIntStringOf(expr: number) {
327
+ const manager = this.manager;
328
+ if (this.context.isInconsistent()) return true;
329
+ const arg = manager.getArg(expr, 0);
330
+ if (
331
+ this.isOp(expr, OP_STRING_ITOS) &&
332
+ !this.isOp(arg, OP_STRING_STOI) &&
333
+ this.addLengthToEqc(expr)
334
+ )
335
+ return true;
336
+ return (
337
+ this.isOp(expr, OP_STRING_STOI) && !this.isOp(arg, OP_STRING_ITOS) && this.addLengthToEqc(arg)
338
+ );
339
+ }
340
+
341
+ private branchItos() {
342
+ let isChanged = false;
343
+ for (const expr of this.intStrings) if (this.branchItosOf(expr)) isChanged = true;
344
+ return isChanged;
345
+ }
346
+
347
+ private branchItosOf(expr: number) {
348
+ const manager = this.manager;
349
+ const context = this.context;
350
+ if (context.isInconsistent()) return true;
351
+ if (!this.isOp(expr, OP_STRING_ITOS) || !context.isEInternalized(expr)) return false;
352
+ if (this.isString(context.getEnode(expr)!.root.owner)) return false;
353
+ const number = manager.getArg(expr, 0);
354
+ const value = this.getNumValue(number);
355
+ if (value === undefined || value.isNegative()) return false;
356
+ const digits = [...value.num.toString()].map((digit) => digit.charCodeAt(0));
357
+ const eq = this.mkEqLiteral(expr, manager.mkString(digits), false);
358
+ const assignment = context.getAssignment(eq);
359
+ if (assignment === L_TRUE) return false;
360
+ if (assignment === L_FALSE)
361
+ this.addAxiomOf(negate(this.mkEqLiteral(number, manager.mkNumeral(value.num), false)), eq);
362
+ else {
363
+ context.forcePhase(eq);
364
+ context.markLiteralAsRelevant(eq);
365
+ }
366
+ return true;
367
+ }
368
+
369
+ private solveRecfuns() {
370
+ for (let index = 0; index < this.recfuns.size && !this.context.isInconsistent(); index++) {
371
+ const term = this.recfuns.items[index];
372
+ const state = { dep: null, isChanged: false };
373
+ const canonical = this.canonize(term, state);
374
+ if (canonical !== undefined && canonical !== term) {
375
+ this.addSolution(term, canonical, state.dep);
376
+ this.recfuns.eraseAndSwap(index--);
377
+ }
378
+ }
379
+ return this.isNewPropagation || this.context.isInconsistent();
380
+ }
381
+
382
+ private addLengthLimit(input: number, limit: number, isSearching: boolean) {
383
+ const manager = this.manager;
384
+ const todo = [input];
385
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
386
+ if (this.isConcat(expr)) {
387
+ todo.push(...manager.getArgs(expr));
388
+ continue;
389
+ }
390
+ if (this.isUnit(expr) || this.isEmpty(expr)) continue;
391
+ if (this.sk.isSkolem(expr)) {
392
+ for (const arg of manager.getArgs(expr))
393
+ if (this.isSeq(arg) || this.sk.isSkolem(arg)) todo.push(arg);
394
+ continue;
395
+ }
396
+ const tracker = this.keep(this.ax.lengthLimit(expr, limit));
397
+ const previous = this.limitMap.get(expr);
398
+ if (previous !== undefined && limit <= previous) continue;
399
+ this.limitMap.set(this.keep(expr), limit);
400
+ this.lengthLimits.push(tracker);
401
+ this.trailStack.push(() => {
402
+ this.lengthLimits.pop();
403
+ });
404
+ this.trailStack.push(() => {
405
+ if (previous === undefined) this.limitMap.delete(expr);
406
+ else this.limitMap.set(expr, previous);
407
+ });
408
+ if (isSearching) {
409
+ const depth = this.sk.mkMaxUnfoldingDepth(this.maxUnfoldingDepth);
410
+ this.addAxiomOf(negate(this.mkLiteralOf(depth)), this.mkLiteralOf(tracker));
411
+ }
412
+ }
413
+ }
414
+
415
+ assignEh(boolVar: BoolVar, isTrue: boolean) {
416
+ const manager = this.manager;
417
+ const context = this.context;
418
+ const expr = context.boolVar2Expr[boolVar];
419
+ const literal = mkLiteral(boolVar, !isTrue);
420
+ const op = manager.getOp(expr);
421
+ if (op === OP_SEQ_PREFIX || op === OP_SEQ_SUFFIX) {
422
+ if (!isTrue) {
423
+ this.propagateNotAffix(expr);
424
+ return;
425
+ }
426
+ const first = this.rewrite(manager.getArg(expr, 0));
427
+ const second = this.rewrite(manager.getArg(expr, 1));
428
+ const isPrefix = op === OP_SEQ_PREFIX;
429
+ const inverse = isPrefix
430
+ ? this.sk.mkPrefixInv(first, second)
431
+ : this.sk.mkSuffixInv(first, second);
432
+ const whole = isPrefix ? this.mkConcat2(first, inverse) : this.mkConcat2(inverse, first);
433
+ this.propagateEq(null, [literal], whole, second, true);
434
+ this.propagateEq(null, [literal], this.mkLen(whole), this.mkLen(second), false);
435
+ return;
436
+ }
437
+ if (op === OP_SEQ_CONTAINS) {
438
+ if (this.canonizes(isTrue, expr)) return;
439
+ const text = this.rewrite(manager.getArg(expr, 0));
440
+ const pattern = this.rewrite(manager.getArg(expr, 1));
441
+ if (isTrue) {
442
+ const left = this.sk.mkContainsLeft(text, pattern);
443
+ const right = this.sk.mkContainsRight(text, pattern);
444
+ const whole = this.mkConcat([left, pattern, right]);
445
+ const original = manager.getArg(expr, 0);
446
+ this.propagateEq(null, [literal], whole, original, true);
447
+ this.propagateEq(null, [literal], this.mkLen(whole), this.mkLen(original), false);
448
+ return;
449
+ }
450
+ this.propagateLit(null, [literal], negate(this.mkEqEmpty(pattern)));
451
+ const dep = this.mkLiteralLeaf(literal);
452
+ const isShorter = this.mkLeLiteral(this.mkSub(this.mkLen(text), this.mkLen(pattern)), -1);
453
+ context.forcePhase(isShorter);
454
+ this.ncs.push({ contains: this.keep(expr), lengthGreater: isShorter, dep });
455
+ return;
456
+ }
457
+ if (this.sk.getAccept(expr) !== undefined) {
458
+ if (isTrue) this.propagateAccept(literal);
459
+ return;
460
+ }
461
+ if (this.sk.isEq(expr)) {
462
+ if (isTrue)
463
+ this.propagateEq(null, [literal], manager.getArg(expr, 0), manager.getArg(expr, 1), true);
464
+ return;
465
+ }
466
+ if (op === OP_SEQ_IN_RE) {
467
+ this.propagateInRe(literal);
468
+ return;
469
+ }
470
+ if (this.sk.getLengthLimit(expr) !== undefined) {
471
+ if (isTrue) this.propagateLengthLimit(expr);
472
+ return;
473
+ }
474
+ if (op === OP_STRING_LT || op === OP_STRING_LE) {
475
+ this.assignLt(expr, literal, isTrue);
476
+ return;
477
+ }
478
+ if (
479
+ op === OP_SEQ_NTH_I ||
480
+ op === OP_SEQ_NTH_U ||
481
+ this.sk.isSkolem(expr) ||
482
+ op === OP_STRING_IS_DIGIT ||
483
+ op === OP_SEQ_FOLDL ||
484
+ op === OP_SEQ_FOLDLI
485
+ )
486
+ return;
487
+ throw new SmtUnsupportedError(
488
+ `the sequence atom ${manager.funcDecls[manager.decls[expr]].name}`,
489
+ );
490
+ }
491
+
492
+ private assignLt(expr: number, literal: Literal, isTrue: boolean) {
493
+ const manager = this.manager;
494
+ const context = this.context;
495
+ this.lts.push(this.keep(expr));
496
+ const getBound = (predicate: number) => {
497
+ const first = manager.getArg(predicate, 0);
498
+ const second = manager.getArg(predicate, 1);
499
+ const firstChars = manager.getString(first);
500
+ const secondChars = manager.getString(second);
501
+ if (firstChars !== undefined && secondChars === undefined)
502
+ return { isLower: true, bound: firstChars, variable: second };
503
+ if (firstChars === undefined && secondChars !== undefined)
504
+ return { isLower: false, bound: secondChars, variable: first };
505
+ return undefined;
506
+ };
507
+ const own = isTrue && manager.getOp(expr) === OP_STRING_LT ? getBound(expr) : undefined;
508
+ if (own === undefined || !context.isEInternalized(own.variable)) return;
509
+ const root = context.getEnode(own.variable)!.root;
510
+ for (const predicate of this.lts.items) {
511
+ if (predicate === expr || manager.getOp(predicate) !== OP_STRING_LT) continue;
512
+ const predicateLiteral = context.getLiteral(predicate);
513
+ if (predicateLiteral === TRUE_LITERAL || predicateLiteral === FALSE_LITERAL) continue;
514
+ if (context.getAssignment(predicateLiteral) !== L_TRUE) continue;
515
+ const other = getBound(predicate);
516
+ if (other === undefined || other.isLower === own.isLower) continue;
517
+ if (!context.isEInternalized(other.variable)) continue;
518
+ if (context.getEnode(other.variable)!.root !== root) continue;
519
+ const lower = own.isLower ? own.bound : other.bound;
520
+ const upper = own.isLower ? other.bound : own.bound;
521
+ if (compareCodes(lower, upper) >= 0) {
522
+ this.setConflict(null, [literal, predicateLiteral]);
523
+ return;
524
+ }
525
+ }
526
+ }
527
+
528
+ newEqEh(first: number, second: number) {
529
+ const firstNode = this.getEnode(first);
530
+ const secondNode = this.getEnode(second);
531
+ if (this.isRe(firstNode.owner)) {
532
+ this.propagateReEq(firstNode.owner, secondNode.owner);
533
+ return;
534
+ }
535
+ if (!this.isSeq(firstNode.owner)) return;
536
+ this.newEqEhOf(
537
+ this.mkAssumption({ first: firstNode, second: secondNode, literal: undefined }),
538
+ firstNode,
539
+ secondNode,
540
+ );
541
+ }
542
+
543
+ newDiseqEh(first: number, second: number) {
544
+ const manager = this.manager;
545
+ const context = this.context;
546
+ const firstNode = this.getEnode(first);
547
+ const secondNode = this.getEnode(second);
548
+ let left = firstNode.owner;
549
+ let right = secondNode.owner;
550
+ if (firstNode.root === secondNode.root) return;
551
+ if (this.isRe(left)) {
552
+ this.propagateReNe(left, right);
553
+ return;
554
+ }
555
+ if (!this.isSeq(left)) return;
556
+ this.exclude.update(this.keep(left), this.keep(right));
557
+ if (this.rewrite(manager.mkApp(OP_EQ, [left, right], SORT_BOOL)) === manager.falseExpr) return;
558
+ const literal = this.mkEqLiteral(left, right, false);
559
+ context.markLiteralAsRelevant(literal);
560
+ if (this.isEmpty(right)) {
561
+ const swapped = left;
562
+ left = right;
563
+ right = swapped;
564
+ }
565
+ const dep = this.mkLiteralLeaf(negate(literal));
566
+ this.nqs.push({ left, right, eqs: [{ ls: [left], rs: [right] }], literals: [], dep });
567
+ if (context.getAssignment(literal) !== L_UNDEF) this.solveNqs(this.nqs.size - 1);
568
+ }
569
+
570
+ pushScopeEh() {
571
+ super.pushScopeEh();
572
+ this.rep.pushScope();
573
+ this.exclude.pushScope();
574
+ this.pushScopeDeps();
575
+ this.trailStack.pushScope();
576
+ const axiomsHead = this.axiomsHead;
577
+ this.trailStack.push(() => {
578
+ this.axiomsHead = axiomsHead;
579
+ });
580
+ this.eqs.pushScope();
581
+ this.nqs.pushScope();
582
+ this.ncs.pushScope();
583
+ this.lts.pushScope();
584
+ this.recfuns.pushScope();
585
+ }
586
+
587
+ popScopeEh(numScopes: number) {
588
+ const context = this.context;
589
+ this.trailStack.popScope(numScopes);
590
+ super.popScopeEh(numScopes);
591
+ this.popScopeDeps(numScopes);
592
+ this.rep.popScope(numScopes);
593
+ this.exclude.popScope(numScopes);
594
+ this.eqs.popScope(numScopes);
595
+ this.nqs.popScope(numScopes);
596
+ this.ncs.popScope(numScopes);
597
+ this.lts.popScope(numScopes);
598
+ this.recfuns.popScope(numScopes);
599
+ this.rewriter.reset();
600
+ if (context.baseLevel > context.scopeLevel - numScopes) this.replay = [];
601
+ }
602
+
603
+ relevantEh(expr: number) {
604
+ const manager = this.manager;
605
+ const op = manager.getOp(expr);
606
+ if (
607
+ op === OP_SEQ_INDEX ||
608
+ op === OP_SEQ_REPLACE ||
609
+ op === OP_SEQ_EXTRACT ||
610
+ op === OP_SEQ_AT ||
611
+ op === OP_SEQ_NTH_I ||
612
+ this.isEmpty(expr) ||
613
+ this.isString(expr) ||
614
+ op === OP_STRING_ITOS ||
615
+ op === OP_STRING_STOI ||
616
+ op === OP_STRING_LT ||
617
+ op === OP_STRING_IS_DIGIT ||
618
+ op === OP_STRING_FROM_CODE ||
619
+ op === OP_STRING_TO_CODE ||
620
+ op === OP_SEQ_UNIT ||
621
+ op === OP_SEQ_POWER ||
622
+ op === OP_SEQ_LAST_INDEX ||
623
+ op === OP_SEQ_LENGTH ||
624
+ op === OP_STRING_LE
625
+ )
626
+ this.enqueAxiom(expr);
627
+ if (op === OP_STRING_ITOS || op === OP_STRING_STOI) {
628
+ this.intStrings.push(this.keep(expr));
629
+ this.trailStack.push(() => {
630
+ this.intStrings.pop();
631
+ });
632
+ }
633
+ if (op === OP_SEQ_FOLDL || op === OP_SEQ_FOLDLI || op === OP_SEQ_MAP || op === OP_SEQ_MAPI) {
634
+ this.addLengthToEqc(manager.getArg(expr, manager.getNumArgs(expr) - 1));
635
+ this.recfuns.push(this.keep(expr));
636
+ }
637
+ if (this.sk.isTail(expr))
638
+ this.addLengthLimit(manager.getArg(expr, 0), this.maxUnfoldingDepth, true);
639
+ if (op === OP_SEQ_LENGTH) {
640
+ const arg = manager.getArg(expr, 0);
641
+ if (!this.hasLength(arg) && this.context.isEInternalized(arg)) this.addLengthToEqc(arg);
642
+ }
643
+ if (op === OP_SEQ_REPLACE_ALL || op === OP_SEQ_REPLACE_RE || op === OP_SEQ_REPLACE_RE_ALL)
644
+ this.addUnhandledExpr(expr);
645
+ }
646
+
647
+ canPropagate() {
648
+ return this.axiomsHead < this.axioms.length || this.replay.length > 0 || this.isNewSolution;
649
+ }
650
+
651
+ propagate() {
652
+ const context = this.context;
653
+ while (this.axiomsHead < this.axioms.length && !context.isInconsistent()) {
654
+ this.dequeAxiom(this.axioms[this.axiomsHead]);
655
+ this.axiomsHead++;
656
+ }
657
+ while (this.replay.length > 0 && !context.isInconsistent()) {
658
+ this.replay[this.replay.length - 1]();
659
+ this.replay.pop();
660
+ }
661
+ if (this.isNewSolution) {
662
+ this.simplifyAndSolveEqs();
663
+ this.isNewSolution = false;
664
+ }
665
+ }
666
+
667
+ private enqueAxiom(expr: number) {
668
+ if (this.axiomSet.has(expr)) return;
669
+ this.axioms.push(this.keep(expr));
670
+ this.axiomSet.add(expr);
671
+ this.trailStack.push(() => {
672
+ this.axioms.pop();
673
+ });
674
+ this.trailStack.push(() => {
675
+ this.axiomSet.delete(expr);
676
+ });
677
+ }
678
+
679
+ private dequeAxiom(expr: number) {
680
+ const manager = this.manager;
681
+ const ax = this.ax;
682
+ const op = manager.getOp(expr);
683
+ if (op === OP_SEQ_LENGTH) {
684
+ this.addLength(expr);
685
+ ax.lengthAxiom(expr);
686
+ if (this.context.scopeLevel !== this.context.baseLevel)
687
+ this.trailStack.push(() => {
688
+ this.replay.push(() => {
689
+ this.enqueAxiom(expr);
690
+ });
691
+ });
692
+ } else if (this.isEmpty(expr) && !this.hasLength(expr) && this.hasLengthSet.size > 0)
693
+ this.addLengthToEqc(expr);
694
+ else if (op === OP_SEQ_INDEX) ax.indexofAxiom(expr);
695
+ else if (op === OP_SEQ_LAST_INDEX) ax.lastIndexofAxiom(expr);
696
+ else if (op === OP_SEQ_REPLACE) ax.replaceAxiom(expr);
697
+ else if (op === OP_SEQ_EXTRACT) ax.extractAxiom(expr);
698
+ else if (op === OP_SEQ_AT) ax.atAxiom(expr);
699
+ else if (op === OP_SEQ_NTH_I) ax.nthAxiom(expr);
700
+ else if (this.isString(expr)) this.addElimStringAxiom(expr);
701
+ else if (op === OP_STRING_ITOS) {
702
+ ax.itosAxiom(expr);
703
+ this.addLengthLimit(expr, this.maxUnfoldingDepth, true);
704
+ } else if (op === OP_STRING_STOI) {
705
+ ax.stoiAxiom(expr);
706
+ this.addLengthLimit(expr, this.maxUnfoldingDepth, true);
707
+ } else if (op === OP_STRING_LT) ax.ltAxiom(expr);
708
+ else if (op === OP_STRING_LE) ax.leAxiom(expr);
709
+ else if (op === OP_SEQ_UNIT) ax.unitAxiom(expr);
710
+ else if (op === OP_SEQ_POWER) {
711
+ ax.powerAxiom(expr);
712
+ this.addLengthLimit(expr, this.maxUnfoldingDepth, true);
713
+ } else if (op === OP_STRING_IS_DIGIT) ax.isDigitAxiom(expr);
714
+ else if (op === OP_STRING_FROM_CODE) ax.strFromCodeAxiom(expr);
715
+ else if (op === OP_STRING_TO_CODE) ax.strToCodeAxiom(expr);
716
+ }
717
+
718
+ private addElimStringAxiom(expr: number) {
719
+ const manager = this.manager;
720
+ const chars = manager.getString(expr)!;
721
+ if (chars.length === 0) return;
722
+ const mkUnit = (code: number) => mkSeqApp(manager, OP_SEQ_UNIT, [manager.mkChar(code)]);
723
+ let result = mkUnit(chars[chars.length - 1]);
724
+ for (let index = chars.length - 1; index-- > 0;)
725
+ result = this.mkConcat2(mkUnit(chars[index]), result);
726
+ this.addAxiomOf(this.mkEqLiteral(expr, result, false));
727
+ this.rep.update(this.keep(expr), this.keep(result), null);
728
+ this.isNewSolution = true;
729
+ }
730
+
731
+ private propagateLengthLimit(expr: number) {
732
+ const manager = this.manager;
733
+ const limit = this.sk.getLengthLimit(expr)!;
734
+ const op = manager.getOp(limit.seq);
735
+ if (op === OP_STRING_STOI) this.ax.stoiAxiomOf(limit.seq, limit.limit);
736
+ if (op === OP_STRING_ITOS) this.ax.itosAxiomOf(limit.seq, limit.limit);
737
+ if (op === OP_SEQ_POWER) this.ax.powerUnfoldAxiom(limit.seq, limit.limit);
738
+ }
739
+
740
+ private propagateNotAffix(expr: number) {
741
+ const literal = this.context.getLiteral(expr);
742
+ const state = { dep: null, isChanged: false };
743
+ const canonical = this.canonize(expr, state);
744
+ if (canonical === this.manager.trueExpr) {
745
+ this.propagateLit(state.dep, [], literal);
746
+ return;
747
+ }
748
+ this.propagateLit(
749
+ null,
750
+ [negate(literal)],
751
+ negate(this.mkEqEmpty(this.manager.getArg(expr, 0))),
752
+ );
753
+ if (this.isOp(expr, OP_SEQ_PREFIX)) this.ax.prefixAxiom(expr);
754
+ else this.ax.suffixAxiom(expr);
755
+ }
756
+
757
+ private canonizes(isTrue: boolean, expr: number) {
758
+ const manager = this.manager;
759
+ const state = { dep: null, isChanged: false };
760
+ const canonical = this.canonize(expr, state) ?? expr;
761
+ if (
762
+ (canonical === manager.trueExpr && !isTrue) ||
763
+ (canonical === manager.falseExpr && isTrue)
764
+ ) {
765
+ const literal = this.context.getLiteral(expr);
766
+ this.propagateLit(state.dep, [], isTrue ? negate(literal) : literal);
767
+ return true;
768
+ }
769
+ return (
770
+ (canonical === manager.falseExpr && !isTrue) || (canonical === manager.trueExpr && isTrue)
771
+ );
772
+ }
773
+
774
+ addTheoryAssumptions(assumptions: number[]) {
775
+ if (!this.hasSeq) return;
776
+ const depth = this.sk.mkMaxUnfoldingDepth(this.maxUnfoldingDepth);
777
+ const previous = this.maxUnfoldingLiteral;
778
+ this.trailStack.push(() => {
779
+ this.maxUnfoldingLiteral = previous;
780
+ });
781
+ this.maxUnfoldingLiteral = this.mkLiteralOf(depth);
782
+ assumptions.push(this.keep(depth));
783
+ for (const [seq, limit] of this.limitMap.entries())
784
+ if (limit > 0) assumptions.push(this.keep(this.sk.mkLengthLimit(seq, limit)));
785
+ }
786
+
787
+ shouldResearch(unsatCore: readonly number[]) {
788
+ if (!this.hasSeq) return false;
789
+ let minLimit = Infinity;
790
+ let minSeq: number | undefined;
791
+ let count = 0;
792
+ let hasMaxUnfolding = false;
793
+ for (const expr of unsatCore) {
794
+ const limit = this.sk.getLengthLimit(expr);
795
+ if (this.sk.isMaxUnfolding(expr)) hasMaxUnfolding = true;
796
+ else if (limit !== undefined) {
797
+ if (limit.limit < minLimit) {
798
+ minLimit = limit.limit;
799
+ minSeq = limit.seq;
800
+ count = 0;
801
+ } else if (limit.limit === minLimit && this.context.getRandomValue() % ++count === 0)
802
+ minSeq = limit.seq;
803
+ }
804
+ }
805
+ if (minSeq !== undefined && minLimit < MAX_UNFOLDING) {
806
+ this.maxUnfoldingDepth++;
807
+ let limit = minLimit * 2;
808
+ if (this.isSeq(minSeq)) {
809
+ limit = Math.max(this.getMinLength(minSeq), limit);
810
+ const lower = this.lowerBound2(minSeq);
811
+ if (lower !== undefined && !lower.isNegative() && lower.num <= 0xffffffffn)
812
+ limit = Math.max(Number(lower.num), limit);
813
+ }
814
+ this.addLengthLimit(minSeq, limit, false);
815
+ return true;
816
+ }
817
+ if (hasMaxUnfolding) {
818
+ this.maxUnfoldingDepth = Math.floor((1 + 3 * this.maxUnfoldingDepth) / 2);
819
+ return true;
820
+ }
821
+ if (minLimit !== Infinity) throw new SmtUnsupportedError("a deeper unfolding of sequences");
822
+ return false;
823
+ }
824
+
825
+ initModel(model: ProtoModel) {
826
+ this.rep.pushScope();
827
+ const factory = model.getSeqFactory();
828
+ this.factory = factory;
829
+ for (const ne of this.nqs.items) {
830
+ factory.registerValue(ne.left);
831
+ factory.registerValue(ne.right);
832
+ }
833
+ for (const ne of this.nqs.items)
834
+ for (const eq of ne.eqs) {
835
+ this.initModelOf(eq.ls);
836
+ this.initModelOf(eq.rs);
837
+ }
838
+ }
839
+
840
+ private initModelOf(exprs: readonly number[]) {
841
+ for (const expr of exprs) {
842
+ const state = { dep: null, isChanged: false };
843
+ const canonical = this.canonize(expr, state) ?? expr;
844
+ if (this.isVar(canonical)) {
845
+ const fresh = this.keep(this.factory!.getFreshValue(this.manager.sorts[canonical]));
846
+ this.rep.update(this.keep(canonical), fresh, state.dep);
847
+ }
848
+ }
849
+ }
850
+
851
+ finalizeModel() {
852
+ this.rep.popScope(1);
853
+ }
854
+
855
+ mkValue(node: Enode): number | DependentValue {
856
+ const manager = this.manager;
857
+ const context = this.context;
858
+ const expr = this.getIteValue(node.owner);
859
+ if (!this.isSeq(expr)) return this.mkValueOf(expr);
860
+ const concats: number[] = [];
861
+ const todo = [expr];
862
+ for (let next = todo.pop(); next !== undefined; next = todo.pop()) {
863
+ const current = this.rep.find(this.getIteValue(this.rep.find(next)));
864
+ if (this.isConcat(current)) todo.push(manager.getArg(current, 1), manager.getArg(current, 0));
865
+ else concats.push(current);
866
+ }
867
+ const sort = manager.sorts[expr];
868
+ const dependencies: Enode[] = [];
869
+ const sources: number[] = [];
870
+ const strings: number[] = [];
871
+ for (const concat of concats) {
872
+ const arg = manager.getNumArgs(concat) > 0 ? manager.getArg(concat, 0) : -1;
873
+ if (this.isUnit(concat)) {
874
+ if (context.isEInternalized(arg)) {
875
+ dependencies.push(context.getEnode(arg)!);
876
+ sources.push(SOURCE_UNIT);
877
+ } else if (manager.isValue(arg)) {
878
+ strings.push(concat);
879
+ sources.push(SOURCE_STRING);
880
+ }
881
+ } else if (this.isOp(concat, OP_STRING_ITOS)) {
882
+ if (context.isEInternalized(arg)) {
883
+ dependencies.push(context.getEnode(arg)!);
884
+ sources.push(SOURCE_INT);
885
+ }
886
+ } else if (this.isString(concat)) {
887
+ strings.push(concat);
888
+ sources.push(SOURCE_STRING);
889
+ } else {
890
+ strings.push(this.mkValueOf(concat));
891
+ sources.push(SOURCE_STRING);
892
+ }
893
+ }
894
+ return {
895
+ dependencies,
896
+ mkValue: (values) => this.mkSeqValue(sort, sources, strings, values),
897
+ };
898
+ }
899
+
900
+ private mkSeqValue(
901
+ sort: number,
902
+ sources: readonly number[],
903
+ strings: readonly number[],
904
+ values: readonly number[],
905
+ ) {
906
+ const manager = this.manager;
907
+ let valueIndex = 0;
908
+ let stringIndex = 0;
909
+ if (manager.isStringSort(sort)) {
910
+ const codes: number[] = [];
911
+ for (const source of sources) {
912
+ if (source === SOURCE_UNIT) codes.push(manager.getChar(values[valueIndex++]));
913
+ else if (source === SOURCE_STRING) {
914
+ const string = strings[stringIndex++];
915
+ const canonical = this.canonize(string, { dep: null, isChanged: false }) ?? string;
916
+ const chars = manager.getString(this.strRewriter.rewrite(canonical));
917
+ if (chars !== undefined) codes.push(...chars);
918
+ } else {
919
+ const value = manager.getNumeral(values[valueIndex++])!;
920
+ if (value >= 0n) for (const digit of value.toString()) codes.push(digit.charCodeAt(0));
921
+ }
922
+ }
923
+ return this.keep(manager.mkString(codes));
924
+ }
925
+ const args = sources.map((source) =>
926
+ source === SOURCE_UNIT
927
+ ? mkSeqApp(manager, OP_SEQ_UNIT, [values[valueIndex++]])
928
+ : strings[stringIndex++],
929
+ );
930
+ return this.keep(this.strRewriter.rewrite(this.mkConcat(args, sort)));
931
+ }
932
+
933
+ private mkValueOf(input: number) {
934
+ const manager = this.manager;
935
+ const factory = this.factory!;
936
+ const expr = this.getIteValue(input);
937
+ let result = this.rep.find(expr);
938
+ if (this.isVar(result)) result = factory.getFreshValue(manager.sorts[result]);
939
+ else result = this.rewrite(result);
940
+ if (this.isSeq(result) && !manager.isValue(result)) {
941
+ const fresh = factory.getFreshValue(manager.sorts[result]);
942
+ const chars = manager.getString(fresh);
943
+ const lower = chars === undefined ? undefined : this.lowerBound2(expr);
944
+ result = fresh;
945
+ if (
946
+ chars !== undefined &&
947
+ lower !== undefined &&
948
+ lower.isPositive() &&
949
+ lower.num <= BigInt(MAX_PAD) &&
950
+ BigInt(chars.length) < lower.num
951
+ ) {
952
+ const padded = [...chars];
953
+ while (padded.length < Number(lower.num)) padded.push(97);
954
+ result = manager.mkString(padded);
955
+ }
956
+ }
957
+ this.keep(result);
958
+ this.rep.update(this.keep(expr), result, null);
959
+ return result;
960
+ }
961
+ }