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
@@ -1,7 +1,19 @@
1
- // Ported from Z3 (src/solver/assertions/asserted_formulas.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
- import { AstManager, KIND_APP, OP_AND, OP_EQ, OP_ITE, OP_NOT, OP_OR, SORT_BOOL } from "./ast";
2
+ import {
3
+ AstManager,
4
+ KIND_APP,
5
+ KIND_QUANTIFIER,
6
+ OP_AND,
7
+ OP_EQ,
8
+ OP_ITE,
9
+ OP_NOT,
10
+ OP_OR,
11
+ SORT_BOOL,
12
+ QUANTIFIER_FORALL,
13
+ } from "./ast";
4
14
  import { mkNot } from "./ast-util";
15
+ import { simplifyInjAxiom } from "./inj-axiom";
16
+ import { MacroManager } from "./macro-finder";
5
17
  import { DefinedNames, Nnf } from "./nnf";
6
18
  import { PatternInference } from "./pattern-inference";
7
19
  import { MaxBvSharing } from "./maximize-ac-sharing";
@@ -9,8 +21,9 @@ import { PullQuant } from "./pull-quant";
9
21
  import { RefVector } from "./ref-vector";
10
22
  import { KERNEL_REWRITER_OPTIONS, Rewriter } from "./rewriter";
11
23
  import { RewriterTpl } from "./rewriter-tpl";
24
+ import type { SmtConfig } from "./smt-setup";
12
25
 
13
- class PatternInferenceRw extends RewriterTpl {
26
+ export class PatternInferenceRw extends RewriterTpl {
14
27
  constructor(
15
28
  manager: AstManager,
16
29
  private inference: PatternInference,
@@ -21,9 +34,9 @@ class PatternInferenceRw extends RewriterTpl {
21
34
  reduceQuantifier(expr: number, body: number) {
22
35
  const manager = this.manager;
23
36
  const data = manager.getQuantifier(expr);
24
- if (!data.isForall || data.patterns.length > 0) return -1;
37
+ if (data.kind !== QUANTIFIER_FORALL || data.patterns.length > 0) return -1;
25
38
  const quantifier = manager.withTemporaries(() => {
26
- const inferred = this.inference.infer(data.sorts.length, body, data.weight);
39
+ const inferred = this.inference.infer(data.sorts.length, body, data.weight, data.noPatterns);
27
40
  const withPatterns = manager.mkQuantifier({ ...data, body, patterns: inferred.patterns });
28
41
  return inferred.weight === data.weight
29
42
  ? withPatterns
@@ -57,8 +70,8 @@ class PatternInferenceRw extends RewriterTpl {
57
70
 
58
71
  const isGreater = (manager: AstManager, left: number, right: number): boolean => {
59
72
  if (left === right) return false;
60
- const isLeftValue = manager.isUniqueValue(left);
61
- const isRightValue = manager.isUniqueValue(right);
73
+ const isLeftValue = manager.isValue(left);
74
+ const isRightValue = manager.isValue(right);
62
75
  if (!isLeftValue && isRightValue) return true;
63
76
  if (isLeftValue && !isRightValue) return false;
64
77
  if (manager.depths[left] !== manager.depths[right])
@@ -111,7 +124,7 @@ class Substitution {
111
124
 
112
125
  update(expr: number) {
113
126
  const manager = this.manager;
114
- if (manager.isGround(expr) && manager.getOp(expr) === OP_EQ) {
127
+ if (manager.isGroundApp(expr) && manager.getOp(expr) === OP_EQ) {
115
128
  const left = manager.getArg(expr, 0);
116
129
  const right = manager.getArg(expr, 1);
117
130
  if (isGreater(manager, left, right)) {
@@ -133,6 +146,7 @@ interface AssertedScope {
133
146
  isInconsistent: boolean;
134
147
  }
135
148
 
149
+ // Like Z3, it holds its formulas, so that expressions are deleted in Z3's order.
136
150
  export class AssertedFormulas {
137
151
  private formulas: RefVector;
138
152
  private qhead = 0;
@@ -140,18 +154,28 @@ export class AssertedFormulas {
140
154
  private rewriter: Rewriter;
141
155
  private isEliminatingAnd = false;
142
156
  private isReducePending = true;
157
+ private isNnfCnf = true;
158
+ private isEq2Ineq = false;
143
159
  private names: DefinedNames;
144
160
  private patternInference: PatternInferenceRw;
145
161
  private bvSharing: MaxBvSharing;
146
- private hasQuantifiers = false;
162
+ hasQuantifiers = false;
163
+ readonly macros: MacroManager;
147
164
  isInconsistent = false;
165
+ isPreprocessing = true;
148
166
  private numLazyScopes = 0;
149
167
  private scopes: AssertedScope[] = [];
150
168
 
151
- constructor(private manager: AstManager) {
169
+ constructor(
170
+ private manager: AstManager,
171
+ private isFindingMacros = false,
172
+ ) {
152
173
  this.formulas = new RefVector(manager);
174
+ this.macros = new MacroManager(manager);
153
175
  this.substitution = new Substitution(manager);
154
- this.rewriter = new Rewriter(manager, KERNEL_REWRITER_OPTIONS);
176
+ // set_eliminate_and turns coalesce_chars off when smt.string_solver is seq, its default, so
177
+ // string literals reach the seq theory as concatenations of units.
178
+ this.rewriter = new Rewriter(manager, { ...KERNEL_REWRITER_OPTIONS, isCoalescingChars: false });
155
179
  this.names = new DefinedNames(manager);
156
180
  this.patternInference = new PatternInferenceRw(manager, new PatternInference(manager));
157
181
  this.bvSharing = new MaxBvSharing(manager);
@@ -170,6 +194,7 @@ export class AssertedFormulas {
170
194
  this.scopes.pop();
171
195
  this.isInconsistent = scope.isInconsistent;
172
196
  this.bvSharing.popScope();
197
+ this.macros.popScope();
173
198
  this.names.pop();
174
199
  this.substitution.pop();
175
200
  this.formulas.shrink(scope.numFormulas);
@@ -182,6 +207,7 @@ export class AssertedFormulas {
182
207
  this.substitution.push();
183
208
  this.scopes.push({ numFormulas: this.formulas.size, isInconsistent: this.isInconsistent });
184
209
  this.names.push();
210
+ this.macros.pushScope();
185
211
  this.bvSharing.pushScope();
186
212
  }
187
213
  }
@@ -190,38 +216,65 @@ export class AssertedFormulas {
190
216
  this.forcePush();
191
217
  const manager = this.manager;
192
218
  if (this.isInconsistent || manager.isTrue(expr)) return;
219
+ if (manager.hasQuantifierFlags[expr]) this.hasQuantifiers = true;
220
+ this.isReducePending = true;
221
+ if (!this.isPreprocessing) {
222
+ this.pushAssertion(expr, this.formulas);
223
+ return;
224
+ }
193
225
  this.setEliminateAnd(false);
194
226
  const rewritten = this.rewriter.rewrite(expr);
195
- if (manager.hasQuantifierFlags[expr]) this.hasQuantifiers = true;
196
227
  this.pushAssertion(rewritten, this.formulas);
197
228
  manager.decRef(rewritten);
198
- this.isReducePending = true;
229
+ }
230
+
231
+ // The setup's parameters, which set_eliminate_and gives the rewriter.
232
+ setup(config: SmtConfig) {
233
+ this.isNnfCnf = config.isNnfCnf;
234
+ this.isEq2Ineq = config.isEq2Ineq;
235
+ this.isFindingMacros ||= config.isFindingMacros;
199
236
  }
200
237
 
201
238
  getNumFormulas() {
202
239
  return this.formulas.size;
203
240
  }
204
241
 
242
+ getFormulas() {
243
+ return this.formulas.items;
244
+ }
245
+
246
+ // Like internalize_assertions, nothing is committed once the formulas are inconsistent.
205
247
  reduce() {
206
248
  if (this.qhead === this.formulas.size) return [];
207
- if (!this.isInconsistent) this.reduceCore();
249
+ if (!this.isInconsistent && (this.hasQuantifiers || this.isPreprocessing)) this.reduceCore();
208
250
  if (this.isInconsistent) return [];
209
251
  const result = this.formulas.items.slice(this.qhead);
252
+ if (this.isFindingMacros) this.macros.markForbidden(result);
210
253
  for (const formula of result) this.substitution.update(formula);
211
254
  this.qhead = this.formulas.size;
212
255
  return result;
213
256
  }
214
257
 
215
258
  private reduceCore() {
259
+ if (this.macros.hasMacros()) this.findMacros();
216
260
  this.setEliminateAnd(false);
217
261
  this.propagateValues();
218
262
  if (this.isInconsistent) return;
219
- this.isReducePending = true;
220
- this.nnfCnf();
263
+ this.findMacros();
221
264
  if (this.isInconsistent) return;
265
+ if (this.isNnfCnf || this.hasQuantifiers) {
266
+ this.isReducePending = true;
267
+ this.nnfCnf();
268
+ if (this.isInconsistent) return;
269
+ }
222
270
  this.setEliminateAnd(true);
223
271
  this.reduceAsserted();
224
272
  if (this.isInconsistent) return;
273
+ if (this.hasQuantifiers && this.simplifyFormulas((formula) => this.refineInjAxiom(formula)))
274
+ this.isReducePending = true;
275
+ if (this.isInconsistent) return;
276
+ this.findMacros();
277
+ if (this.isInconsistent) return;
225
278
  if (
226
279
  this.hasQuantifiers &&
227
280
  this.simplifyFormulas((formula) => this.patternInference.rewrite(formula))
@@ -268,6 +321,23 @@ export class AssertedFormulas {
268
321
  result.push(expr);
269
322
  }
270
323
 
324
+ private refineInjAxiom(formula: number) {
325
+ const manager = this.manager;
326
+ const refined =
327
+ manager.kinds[formula] === KIND_QUANTIFIER ? simplifyInjAxiom(manager, formula) : undefined;
328
+ if (refined !== undefined) return refined;
329
+ manager.incRef(formula);
330
+ return formula;
331
+ }
332
+
333
+ private findMacros() {
334
+ if (!this.isFindingMacros || !this.hasQuantifiers) return;
335
+ this.isReducePending = true;
336
+ this.swapFormulas(this.macros.find(this.formulas.items.slice(this.qhead)));
337
+ this.flushCache();
338
+ this.reduceAsserted();
339
+ }
340
+
271
341
  private flushCache() {
272
342
  this.rewriter.setSubstitution(this.substitution.map);
273
343
  }
@@ -277,6 +347,7 @@ export class AssertedFormulas {
277
347
  this.isEliminatingAnd = isEliminatingAnd;
278
348
  this.isReducePending = true;
279
349
  this.rewriter.setEliminatingAnd(isEliminatingAnd);
350
+ this.rewriter.setEq2Ineq(this.isEq2Ineq);
280
351
  this.flushCache();
281
352
  }
282
353
 
@@ -1,10 +1,26 @@
1
- // Ported from Z3 (src/ast/ast_lt.cpp, src/util/symbol.cpp), MIT license, see z3-license.txt.
2
1
  import {
2
+ FAMILY_ARRAY,
3
+ FAMILY_BV,
4
+ FAMILY_CHAR,
5
+ FAMILY_DATATYPE,
6
+ FAMILY_FPA,
7
+ FAMILY_LABEL,
3
8
  FAMILY_MODEL_VALUE,
9
+ FAMILY_RECFUN,
10
+ FAMILY_SEQ,
4
11
  FAMILY_USER,
5
12
  KIND_APP,
6
13
  KIND_QUANTIFIER,
7
14
  KIND_VAR,
15
+ OP_ALGEBRAIC_NUM,
16
+ OP_BV_NUM,
17
+ OP_DT_ACCESSOR,
18
+ OP_DT_CONSTRUCTOR,
19
+ OP_DT_RECOGNISER,
20
+ OP_SEQ_SKOLEM,
21
+ OP_FPA_NUM,
22
+ OP_FUN_CASE_PRED,
23
+ OP_LABEL,
8
24
  OP_ITE,
9
25
  OP_NUM,
10
26
  OP_PATTERN,
@@ -12,27 +28,37 @@ import {
12
28
  type AstManager,
13
29
  type SmtSymbol,
14
30
  } from "./ast";
31
+ import { getAccessorConstructor } from "./datatype-decl-plugin";
15
32
  import { Rational } from "./rational";
16
33
 
17
34
  interface DeclKey {
18
35
  name: SmtSymbol;
19
- parameters: (number | Rational)[];
36
+ parameters: (number | Rational | SmtSymbol)[];
20
37
  domain: number[];
21
38
  range: number;
22
39
  }
23
40
 
24
41
  const PARAM_INT = 0;
25
- const PARAM_RATIONAL = 3;
42
+ const PARAM_AST = 1;
43
+ const PARAM_SYMBOL = 2;
44
+ const PARAM_ZSTRING = 3;
45
+ const PARAM_RATIONAL = 4;
46
+ const PARAM_EXTERNAL = 6;
26
47
 
27
48
  const compareValues = (first: number, second: number) =>
28
49
  first === second ? 0 : first < second ? -1 : 1;
29
50
 
30
- const compareParameters = (first: number | Rational, second: number | Rational) =>
51
+ const compareParameters = (
52
+ first: number | Rational | SmtSymbol,
53
+ second: number | Rational | SmtSymbol,
54
+ ) =>
31
55
  first instanceof Rational && second instanceof Rational
32
56
  ? first.compare(second)
33
57
  : typeof first === "number" && typeof second === "number"
34
58
  ? compareValues(first, second)
35
- : 0;
59
+ : typeof first === "string" && typeof second === "string"
60
+ ? compareNames(first, second)
61
+ : 0;
36
62
 
37
63
  const compareNames = (first: SmtSymbol, second: SmtSymbol) => {
38
64
  if (first === second) return 0;
@@ -42,6 +68,31 @@ const compareNames = (first: SmtSymbol, second: SmtSymbol) => {
42
68
  return first < second ? -1 : 1;
43
69
  };
44
70
 
71
+ const getSeqParameters = (manager: AstManager, expr: number) => {
72
+ const decl = manager.funcDecls[manager.decls[expr]];
73
+ const chars = manager.getString(expr);
74
+ if (chars !== undefined) return [PARAM_ZSTRING, String.fromCodePoint(...chars)];
75
+ const numbers = decl.parameters.flatMap((parameter) => [PARAM_INT, parameter]);
76
+ return decl.op === OP_SEQ_SKOLEM ? [PARAM_SYMBOL, decl.name, ...numbers] : numbers;
77
+ };
78
+
79
+ const getDatatypeParameters = (manager: AstManager, decl: number) => {
80
+ const funcDecl = manager.funcDecls[decl];
81
+ const name = funcDecl.name;
82
+ if (funcDecl.op === OP_DT_CONSTRUCTOR) return [PARAM_SYMBOL, name];
83
+ if (funcDecl.op === OP_DT_ACCESSOR)
84
+ return [
85
+ PARAM_SYMBOL,
86
+ name,
87
+ PARAM_SYMBOL,
88
+ manager.funcDecls[getAccessorConstructor(manager, decl)].name,
89
+ ];
90
+ const target = manager.funcDecls[funcDecl.parameters[0]].name;
91
+ return funcDecl.op === OP_DT_RECOGNISER
92
+ ? [PARAM_AST, target, PARAM_SYMBOL, name]
93
+ : [PARAM_AST, target];
94
+ };
95
+
45
96
  const getDeclKey = (manager: AstManager, expr: number): DeclKey => {
46
97
  const decl = manager.funcDecls[manager.decls[expr]];
47
98
  const range = manager.sorts[expr];
@@ -58,18 +109,118 @@ const getDeclKey = (manager: AstManager, expr: number): DeclKey => {
58
109
  }
59
110
  if (decl.family === FAMILY_MODEL_VALUE)
60
111
  return { name: decl.name, parameters: [PARAM_INT, manager.values[expr]], domain: [], range };
112
+ if (decl.op === OP_ALGEBRAIC_NUM)
113
+ return {
114
+ name: decl.name,
115
+ parameters: [PARAM_EXTERNAL, manager.getAlgebraicId(expr)],
116
+ domain: [],
117
+ range,
118
+ };
119
+ if (decl.op === OP_BV_NUM)
120
+ return {
121
+ name: decl.name,
122
+ parameters: [
123
+ PARAM_RATIONAL,
124
+ Rational.of(manager.getBvNumeralValue(expr)),
125
+ PARAM_INT,
126
+ manager.getBvSize(range),
127
+ ],
128
+ domain: [],
129
+ range,
130
+ };
131
+ if (decl.family === FAMILY_ARRAY)
132
+ return { name: decl.name, parameters: [], domain: decl.domain, range };
133
+ // A case predicate has the parameters (index, definition), and the others an integer.
134
+ if (decl.family === FAMILY_RECFUN)
135
+ return {
136
+ name: decl.name,
137
+ parameters:
138
+ decl.op === OP_FUN_CASE_PRED
139
+ ? [PARAM_INT, decl.parameters[0], PARAM_AST, manager.funcDecls[decl.parameters[1]].name]
140
+ : [PARAM_INT, decl.parameters[0]],
141
+ domain: decl.domain,
142
+ range,
143
+ };
144
+ if (decl.family === FAMILY_DATATYPE)
145
+ return {
146
+ name: decl.name,
147
+ parameters: getDatatypeParameters(manager, manager.decls[expr]),
148
+ domain: decl.domain,
149
+ range,
150
+ };
151
+ if (decl.family === FAMILY_BV || decl.family === FAMILY_FPA)
152
+ return {
153
+ name: decl.name,
154
+ parameters: decl.parameters.flatMap((parameter) => [
155
+ decl.op === OP_FPA_NUM ? PARAM_EXTERNAL : PARAM_INT,
156
+ parameter,
157
+ ]),
158
+ domain: decl.domain,
159
+ range,
160
+ };
161
+ if (decl.family === FAMILY_SEQ || decl.family === FAMILY_CHAR)
162
+ return {
163
+ name: decl.name,
164
+ parameters: getSeqParameters(manager, expr),
165
+ domain: decl.domain,
166
+ range,
167
+ };
168
+ if (decl.family === FAMILY_LABEL) {
169
+ const names = manager
170
+ .getLabelNames(manager.decls[expr])
171
+ .flatMap((name) => [PARAM_SYMBOL, name]);
172
+ return {
173
+ name: decl.name,
174
+ parameters:
175
+ decl.op === OP_LABEL
176
+ ? [PARAM_INT, manager.isLabelPositive(manager.decls[expr]) ? 1 : 0, ...names]
177
+ : names,
178
+ domain: decl.domain,
179
+ range,
180
+ };
181
+ }
61
182
  const builtin = manager.getBuiltinSignature(decl.op, manager.getArgs(expr));
62
183
  return { name: builtin.name, parameters: [], domain: builtin.domain, range };
63
184
  };
64
185
 
65
- const compareSorts = (manager: AstManager, first: number, second: number) =>
66
- first === second ? 0 : compareNames(manager.sortNames[first], manager.sortNames[second]);
186
+ const compareSorts = (manager: AstManager, first: number, second: number): number => {
187
+ if (first === second) return 0;
188
+ const byName =
189
+ compareNames(manager.sortNames[first], manager.sortNames[second]) ||
190
+ compareValues(manager.getBvSize(first), manager.getBvSize(second)) ||
191
+ compareValues(manager.getSbits(first), manager.getSbits(second));
192
+ if (byName !== 0) return byName;
193
+ const firstParameters = manager.getSortParameters(first);
194
+ const secondParameters = manager.getSortParameters(second);
195
+ const byCount = compareValues(firstParameters.length, secondParameters.length);
196
+ if (byCount !== 0) return byCount;
197
+ for (let index = 0; index < firstParameters.length; index++) {
198
+ const byParameter = compareSorts(manager, firstParameters[index], secondParameters[index]);
199
+ if (byParameter !== 0) return byParameter;
200
+ }
201
+ return 0;
202
+ };
67
203
 
68
204
  const isSameDeclKey = (manager: AstManager, first: number, second: number) => {
69
205
  const decl = manager.funcDecls[manager.decls[first]];
70
206
  if (decl.family === FAMILY_USER) return true;
71
- if (decl.op === OP_NUM || decl.op === OP_PATTERN || decl.family === FAMILY_MODEL_VALUE)
207
+ if (
208
+ decl.op === OP_NUM ||
209
+ decl.op === OP_BV_NUM ||
210
+ decl.op === OP_PATTERN ||
211
+ decl.family === FAMILY_MODEL_VALUE
212
+ )
72
213
  return false;
214
+ if (
215
+ decl.family === FAMILY_BV ||
216
+ decl.family === FAMILY_ARRAY ||
217
+ decl.family === FAMILY_DATATYPE ||
218
+ decl.family === FAMILY_FPA ||
219
+ decl.family === FAMILY_SEQ ||
220
+ decl.family === FAMILY_CHAR ||
221
+ decl.family === FAMILY_RECFUN
222
+ )
223
+ return true;
73
224
  const index = decl.op === OP_ITE ? 1 : 0;
74
225
  return (
75
226
  manager.sorts[first] === manager.sorts[second] &&
@@ -99,7 +250,7 @@ const compareDecls = (manager: AstManager, first: number, second: number) => {
99
250
  return compareSorts(manager, firstKey.range, secondKey.range);
100
251
  };
101
252
 
102
- const compareAsts = (manager: AstManager, first: number, second: number): number => {
253
+ export const compareAsts = (manager: AstManager, first: number, second: number): number => {
103
254
  if (first === second) return 0;
104
255
  const byKind = compareValues(manager.kinds[first], manager.kinds[second]);
105
256
  if (byKind !== 0) return byKind;
@@ -113,9 +264,10 @@ const compareAsts = (manager: AstManager, first: number, second: number): number
113
264
  const firstData = manager.getQuantifier(first);
114
265
  const secondData = manager.getQuantifier(second);
115
266
  const byHeader =
116
- compareValues(firstData.isForall ? 0 : 1, secondData.isForall ? 0 : 1) ||
267
+ compareValues(firstData.kind, secondData.kind) ||
117
268
  compareValues(firstData.sorts.length, secondData.sorts.length) ||
118
269
  compareValues(firstData.patterns.length, secondData.patterns.length) ||
270
+ compareValues(firstData.noPatterns.length, secondData.noPatterns.length) ||
119
271
  compareValues(firstData.weight, secondData.weight);
120
272
  if (byHeader !== 0) return byHeader;
121
273
  for (let index = 0; index < firstData.sorts.length; index++) {
@@ -124,8 +276,10 @@ const compareAsts = (manager: AstManager, first: number, second: number): number
124
276
  compareSorts(manager, firstData.sorts[index], secondData.sorts[index]);
125
277
  if (byDecl !== 0) return byDecl;
126
278
  }
127
- for (let index = 0; index < firstData.patterns.length; index++) {
128
- const byPattern = compareAsts(manager, firstData.patterns[index], secondData.patterns[index]);
279
+ const children = [...firstData.patterns, ...firstData.noPatterns];
280
+ const otherChildren = [...secondData.patterns, ...secondData.noPatterns];
281
+ for (let index = 0; index < children.length; index++) {
282
+ const byPattern = compareAsts(manager, children[index], otherChildren[index]);
129
283
  if (byPattern !== 0) return byPattern;
130
284
  }
131
285
  return compareAsts(manager, firstData.body, secondData.body);
@@ -1,7 +1,36 @@
1
- // Ported from Z3 (src/ast/ast_util.cpp), MIT license, see z3-license.txt.
2
- import { OP_AND, OP_IMPLIES, OP_NOT, OP_OR, type AstManager } from "./ast";
1
+ import {
2
+ KIND_APP,
3
+ KIND_QUANTIFIER,
4
+ OP_ADD,
5
+ OP_AND,
6
+ OP_DIV,
7
+ OP_DIV0,
8
+ OP_IDIV,
9
+ OP_IDIV0,
10
+ OP_IMPLIES,
11
+ OP_MOD,
12
+ OP_MOD0,
13
+ OP_MUL,
14
+ OP_NOT,
15
+ OP_OR,
16
+ OP_POWER,
17
+ OP_POWER0,
18
+ OP_REM,
19
+ OP_SEQ_CONCAT,
20
+ OP_SUB,
21
+ OP_TO_INT,
22
+ OP_TO_REAL,
23
+ OP_UMINUS,
24
+ OP_XOR,
25
+ type AstManager,
26
+ } from "./ast";
27
+ import { isAssociativeBvOp } from "./bv-decl-plugin";
28
+ import { Rational } from "./rational";
3
29
  import { RefVector } from "./ref-vector";
4
30
 
31
+ export const isAppOf = (manager: AstManager, expr: number, op: number) =>
32
+ manager.kinds[expr] === KIND_APP && manager.getOp(expr) === op;
33
+
5
34
  export const mkNot = (manager: AstManager, expr: number) =>
6
35
  manager.isNot(expr)
7
36
  ? manager.getArg(expr, 0)
@@ -84,3 +113,132 @@ export const pushNotOwned = (manager: AstManager, expr: number): number => {
84
113
  args.reset();
85
114
  return result;
86
115
  };
116
+
117
+ const ASSOCIATIVE_OPS = new Set([OP_AND, OP_OR, OP_XOR, OP_ADD, OP_MUL, OP_SEQ_CONCAT]);
118
+
119
+ export const isAssociativeOp = (op: number) => ASSOCIATIVE_OPS.has(op) || isAssociativeBvOp(op);
120
+
121
+ // Like Z3, marks only the expressions with several references, and counts an associative
122
+ // application of n arguments as n - 1 binary ones.
123
+ export const getNumExprs = (manager: AstManager, root: number) => {
124
+ const marked = new Set<number>();
125
+ const isUnvisited = (expr: number) => {
126
+ if (manager.getRefCount(expr) <= 1) return true;
127
+ if (marked.has(expr)) return false;
128
+ marked.add(expr);
129
+ return true;
130
+ };
131
+ const todo = [root];
132
+ let count = 0;
133
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
134
+ const kind = manager.kinds[expr];
135
+ if (kind === KIND_QUANTIFIER) {
136
+ const data = manager.getQuantifier(expr);
137
+ for (const child of [data.body, ...data.patterns, ...data.noPatterns])
138
+ if (isUnvisited(child)) todo.push(child);
139
+ count++;
140
+ continue;
141
+ }
142
+ if (kind !== KIND_APP) {
143
+ count++;
144
+ continue;
145
+ }
146
+ const op = manager.getOp(expr);
147
+ const numArgs = manager.getNumArgs(expr);
148
+ count += isAssociativeOp(op) ? numArgs - 1 : 1;
149
+ for (let index = 0; index < numArgs; index++) {
150
+ const arg = manager.getArg(expr, index);
151
+ if (isUnvisited(arg)) todo.push(arg);
152
+ }
153
+ }
154
+ return count;
155
+ };
156
+
157
+ export const getExtendedNumeral = (manager: AstManager, expr: number) => {
158
+ if (manager.isNumeral(expr)) return manager.getRationalValue(expr);
159
+ const todo = [{ term: expr, isVisited: false, isNegated: false }];
160
+ const values: Rational[] = [];
161
+ for (let frame = todo.pop(); frame !== undefined; frame = todo.pop()) {
162
+ if (frame.isVisited) {
163
+ const op = manager.getOp(frame.term);
164
+ const numArgs = manager.getNumArgs(frame.term);
165
+ const operands = values.splice(values.length - (op === OP_TO_INT ? 1 : numArgs));
166
+ const value =
167
+ op === OP_TO_INT
168
+ ? operands[0].floor()
169
+ : op === OP_ADD
170
+ ? operands.reduce((sum, operand) => sum.add(operand), Rational.zero)
171
+ : op === OP_MUL
172
+ ? operands.reduce((product, operand) => product.mul(operand), Rational.one)
173
+ : op === OP_DIV
174
+ ? operands[1].isZero()
175
+ ? undefined
176
+ : operands[0].div(operands[1])
177
+ : operands[0].sub(operands[1]);
178
+ if (value === undefined) return undefined;
179
+ values.push(frame.isNegated ? value.neg() : value);
180
+ continue;
181
+ }
182
+ let term = frame.term;
183
+ let isNegated = frame.isNegated;
184
+ while (manager.getOp(term) === OP_UMINUS || manager.getOp(term) === OP_TO_REAL) {
185
+ if (manager.getOp(term) === OP_UMINUS) isNegated = !isNegated;
186
+ term = manager.getArg(term, 0);
187
+ }
188
+ if (manager.isNumeral(term)) {
189
+ const value = manager.getRationalValue(term);
190
+ values.push(isNegated ? value.neg() : value);
191
+ continue;
192
+ }
193
+ const op = manager.getOp(term);
194
+ if (
195
+ manager.kinds[term] !== KIND_APP ||
196
+ (op !== OP_TO_INT &&
197
+ op !== OP_ADD &&
198
+ op !== OP_MUL &&
199
+ !(op === OP_SUB && manager.getNumArgs(term) === 2) &&
200
+ op !== OP_DIV)
201
+ )
202
+ return undefined;
203
+ todo.push({ term, isVisited: true, isNegated });
204
+ for (let index = manager.getNumArgs(term); index-- > 0;)
205
+ todo.push({ term: manager.getArg(term, index), isVisited: false, isNegated: false });
206
+ }
207
+ return values[values.length - 1];
208
+ };
209
+
210
+ const isZeroNumeral = (manager: AstManager, expr: number) =>
211
+ manager.isNumeral(expr) && manager.getRationalValue(expr).isZero();
212
+
213
+ // m.is_considered_uninterpreted and arith_util's.
214
+ const isConsideredUninterpreted = (manager: AstManager, expr: number) => {
215
+ const op = manager.getOp(expr);
216
+ const args = manager.getArgs(expr);
217
+ if (manager.isUninterpreted(expr)) return true;
218
+ if (op === OP_DIV0 || op === OP_IDIV0 || op === OP_MOD0 || op === OP_POWER0) return true;
219
+ if ((op === OP_DIV || op === OP_IDIV || op === OP_MOD || op === OP_REM) && args.length === 2)
220
+ return isZeroNumeral(manager, args[1]);
221
+ return (
222
+ op === OP_POWER &&
223
+ args.length === 2 &&
224
+ isZeroNumeral(manager, args[0]) &&
225
+ isZeroNumeral(manager, args[1])
226
+ );
227
+ };
228
+
229
+ export const hasUninterpreted = (manager: AstManager, expr: number) => {
230
+ const visited = new Set<number>();
231
+ const todo = [expr];
232
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
233
+ if (visited.has(current)) continue;
234
+ visited.add(current);
235
+ if (manager.kinds[current] === KIND_QUANTIFIER) {
236
+ todo.push(manager.getQuantifier(current).body);
237
+ continue;
238
+ }
239
+ if (manager.kinds[current] !== KIND_APP || manager.getNumArgs(current) === 0) continue;
240
+ if (isConsideredUninterpreted(manager, current)) return true;
241
+ manager.pushArgs(current, todo);
242
+ }
243
+ return false;
244
+ };