tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (587) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +120 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +829 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +2176 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,386 @@
1
+ import { SmtCanceledError, SmtTacticError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_ARITH,
5
+ FAMILY_BASIC,
6
+ FAMILY_USER,
7
+ KIND_APP,
8
+ OP_ADD,
9
+ OP_AND,
10
+ OP_EQ,
11
+ OP_GE,
12
+ OP_LE,
13
+ OP_MUL,
14
+ OP_TO_INT,
15
+ SORT_BOOL,
16
+ SORT_INT,
17
+ SORT_REAL,
18
+ } from "./ast";
19
+ import { Goal } from "./goal";
20
+ import { goal2nlsat } from "./goal2nlsat";
21
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
22
+ import type { AlgebraicManager, Anum } from "./nlsat/algebraic";
23
+ import { PolynomialManager, PolynomialRef } from "./nlsat/polynomial";
24
+ import { NlsatSolver } from "./nlsat/solver";
25
+ import { ProtoModel } from "./proto-model";
26
+ import { Rational } from "./rational";
27
+ import { RefVector } from "./ref-vector";
28
+ import { compileInternalTactic, convertModel, type TacticEnvironment } from "./tactic";
29
+
30
+ const PREPROCESSOR =
31
+ "(and-then (using-params simplify :elim_and true :blast_distinct true) " +
32
+ "(using-params purify-arith :complete false) propagate-values elim-term-ite " +
33
+ "(using-params purify-arith :complete false) " +
34
+ "(using-params simplify :elim_and true :blast_distinct true) tseitin-cnf-core " +
35
+ "(using-params simplify :elim_and true :blast_distinct true))";
36
+
37
+ interface NlsatSupremum {
38
+ value: Anum;
39
+ lower: Rational;
40
+ upper: Rational;
41
+ isOpen: boolean;
42
+ }
43
+
44
+ interface NlsatNoModel {
45
+ hasModel: false;
46
+ }
47
+
48
+ interface NlsatOptimum {
49
+ hasModel: true;
50
+ model: ProtoModel;
51
+ value: Anum;
52
+ lower: Rational;
53
+ upper: Rational;
54
+ isUnbounded: boolean;
55
+ sup: NlsatSupremum | null;
56
+ }
57
+
58
+ interface NlsatOptOutcome {
59
+ status: number;
60
+ result: NlsatNoModel | NlsatOptimum;
61
+ }
62
+
63
+ interface PreprocessedGoal {
64
+ status: typeof L_TRUE;
65
+ goal: Goal;
66
+ objective: number;
67
+ }
68
+
69
+ interface PreprocessedNothing {
70
+ status: typeof L_FALSE | typeof L_UNDEF;
71
+ }
72
+
73
+ const NO_MODEL: NlsatNoModel = { hasModel: false };
74
+
75
+ interface Loaded {
76
+ solver: NlsatSolver;
77
+ variable: number;
78
+ x2t: Map<number, number>;
79
+ a2b: Map<number, number>;
80
+ }
81
+
82
+ export const isInNraFragment = (manager: AstManager, exprs: readonly number[]) => {
83
+ const seen = new Set<number>();
84
+ const todo = [...exprs];
85
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
86
+ if (seen.has(expr)) continue;
87
+ seen.add(expr);
88
+ if (manager.kinds[expr] !== KIND_APP) return false;
89
+ const family = manager.getFamily(expr);
90
+ const isAllowed =
91
+ family === FAMILY_BASIC ||
92
+ family === FAMILY_ARITH ||
93
+ (family === FAMILY_USER && manager.getNumArgs(expr) === 0);
94
+ const sort = manager.sorts[expr];
95
+ if (!isAllowed || (sort !== SORT_BOOL && sort !== SORT_INT && sort !== SORT_REAL)) return false;
96
+ manager.pushArgs(expr, todo);
97
+ }
98
+ return true;
99
+ };
100
+
101
+ const getCoarseInterval = (
102
+ manager: AstManager,
103
+ am: AlgebraicManager,
104
+ value: Anum,
105
+ ): [Rational, Rational] => {
106
+ const pm = new PolynomialManager(manager.limit);
107
+ const p = new PolynomialRef(pm);
108
+ p.set(pm.toPolynomial(am.getPolynomial(value), 0));
109
+ const roots = am.isolateRoots(pm, p.get(), []);
110
+ p.reset();
111
+ const index = roots.findIndex((root) => am.compare(root, value) === 0);
112
+ const lower = index === 0 ? am.intLt(value) : am.select(roots[index - 1], value);
113
+ const upper = index + 1 === roots.length ? am.intGt(value) : am.select(value, roots[index + 1]);
114
+ return [am.toRational(lower), am.toRational(upper)];
115
+ };
116
+
117
+ export const mkAlgebraicEq = (manager: AstManager, term: number, value: Anum) => {
118
+ const am = manager.am;
119
+ if (am.isRational(value))
120
+ return manager.mkApp(OP_EQ, [term, manager.mkRealNumeral(am.toRational(value))], SORT_BOOL);
121
+ const coeffs = am.getPolynomial(value);
122
+ let polynomial = -1;
123
+ for (let index = coeffs.length - 1; index >= 0; index--) {
124
+ const coeff = manager.mkRealNumeral(Rational.of(coeffs[index]));
125
+ polynomial =
126
+ polynomial === -1
127
+ ? coeff
128
+ : manager.mkApp(
129
+ OP_ADD,
130
+ [manager.mkApp(OP_MUL, [polynomial, term], SORT_REAL), coeff],
131
+ SORT_REAL,
132
+ );
133
+ }
134
+ const [lower, upper] = getCoarseInterval(manager, am, value);
135
+ return manager.mkApp(
136
+ OP_AND,
137
+ [
138
+ manager.mkApp(OP_EQ, [polynomial, manager.mkRealNumeral(Rational.zero)], SORT_BOOL),
139
+ manager.mkApp(OP_GE, [term, manager.mkRealNumeral(lower)], SORT_BOOL),
140
+ manager.mkApp(OP_LE, [term, manager.mkRealNumeral(upper)], SORT_BOOL),
141
+ ],
142
+ SORT_BOOL,
143
+ );
144
+ };
145
+
146
+ const isOccurring = (manager: AstManager, target: number, expr: number) => {
147
+ const seen = new Set<number>();
148
+ const todo = [expr];
149
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
150
+ if (current === target) return true;
151
+ if (seen.has(current) || manager.kinds[current] !== KIND_APP) continue;
152
+ seen.add(current);
153
+ manager.pushArgs(current, todo);
154
+ }
155
+ return false;
156
+ };
157
+
158
+ const mkLowerBound = (solver: NlsatSolver, variable: number, value: Anum, isStrict: boolean) => {
159
+ const am = solver.am;
160
+ const pm = solver.pm;
161
+ const p = new PolynomialRef(pm);
162
+ if (am.isRational(value)) {
163
+ const rational = am.toRational(value);
164
+ p.set(pm.mkLinear([rational.den], [variable], -rational.num));
165
+ const literal = isStrict
166
+ ? solver.mkIneqLiteral("GT", [p.get()], [false])
167
+ : solver.mkIneqLiteral("LT", [p.get()], [false]) ^ 1;
168
+ p.reset();
169
+ return literal;
170
+ }
171
+ p.set(pm.toPolynomial(am.getPolynomial(value), variable));
172
+ const index = am.isolateRoots(pm, p.get(), []).findIndex((root) => am.compare(root, value) === 0);
173
+ const literal =
174
+ index === -1
175
+ ? null
176
+ : 2 * solver.mkRootAtom(isStrict ? "ROOT_GT" : "ROOT_GE", variable, index + 1, p.get());
177
+ p.reset();
178
+ return literal;
179
+ };
180
+
181
+ const getBracket = (solver: NlsatSolver, value: Anum): [Rational, Rational] => {
182
+ const am = solver.am;
183
+ if (!am.isRational(value)) return am.getInterval(value, 40);
184
+ const rational = am.toRational(value);
185
+ return [rational, rational];
186
+ };
187
+
188
+ export class NlsatOpt {
189
+ constructor(
190
+ private manager: AstManager,
191
+ private environment: TacticEnvironment,
192
+ ) {}
193
+
194
+ // hard, T = objective, lower <= T <= upper, normalized for goal2nlsat. T only occurs in these
195
+ // assertions, so preprocessing can only lose it by eliminating the objective.
196
+ private preprocess(
197
+ hard: readonly number[],
198
+ objective: number,
199
+ lower: Rational,
200
+ upper: Rational | null,
201
+ ): PreprocessedGoal | PreprocessedNothing {
202
+ const manager = this.manager;
203
+ const pinned = new RefVector(manager);
204
+ const pin = (expr: number) => {
205
+ pinned.push(expr);
206
+ return expr;
207
+ };
208
+ const target = pin(manager.mkFreshConst("opt.nlsat.obj", SORT_REAL));
209
+ const goal = new Goal(manager);
210
+ for (const form of hard) goal.assert(form);
211
+ goal.assert(pin(manager.mkApp(OP_EQ, [target, objective], SORT_BOOL)));
212
+ goal.assert(pin(manager.mkApp(OP_GE, [target, manager.mkRealNumeral(lower)], SORT_BOOL)));
213
+ if (upper !== null)
214
+ goal.assert(pin(manager.mkApp(OP_LE, [target, manager.mkRealNumeral(upper)], SORT_BOOL)));
215
+ const goals = (() => {
216
+ try {
217
+ return compileInternalTactic(this.environment, PREPROCESSOR)(goal);
218
+ } catch (error) {
219
+ if (!(error instanceof SmtTacticError)) throw error;
220
+ return null;
221
+ }
222
+ })();
223
+ pinned.reset();
224
+ const result = goals?.length === 1 ? goals[0] : null;
225
+ if (result === null) return { status: L_UNDEF };
226
+ if (result.isInconsistent) return { status: L_FALSE };
227
+ return result.forms.items.some((form) => isOccurring(manager, target, form))
228
+ ? { status: L_TRUE, goal: result, objective: target }
229
+ : { status: L_UNDEF };
230
+ }
231
+
232
+ // The objective is nlsat's first variable and its maximization target.
233
+ private load(goal: Goal, objective: number): Loaded | null {
234
+ const solver = new NlsatSolver(this.manager.limit);
235
+ const variable = solver.mkVar(false);
236
+ const x2t = new Map([[objective, variable]]);
237
+ const a2b = new Map<number, number>();
238
+ try {
239
+ goal2nlsat(this.manager, goal.forms.items, solver, x2t, a2b, null);
240
+ } catch (error) {
241
+ if (!(error instanceof SmtTacticError)) throw error;
242
+ return null;
243
+ }
244
+ solver.setMaxVar(variable);
245
+ return { solver, variable, x2t, a2b };
246
+ }
247
+
248
+ private extractModel(loaded: Loaded, goal: Goal, objective: number) {
249
+ const manager = this.manager;
250
+ const model = new ProtoModel(manager);
251
+ for (const [term, variable] of loaded.x2t) {
252
+ if (term === objective || !manager.isUninterpretedConst(term)) continue;
253
+ const value = loaded.solver.getValue(variable);
254
+ const isInt = manager.sorts[term] === SORT_INT;
255
+ const numeral =
256
+ isInt && !loaded.solver.am.isInt(value)
257
+ ? manager.mkApp(OP_TO_INT, [manager.mkAlgebraicNumeral(value)], SORT_INT)
258
+ : manager.mkAlgebraicNumeral(value, isInt ? SORT_INT : SORT_REAL);
259
+ model.registerConst(manager.decls[term], numeral);
260
+ }
261
+ for (const [atom, boolVar] of loaded.a2b) {
262
+ if (!manager.isUninterpretedConst(atom)) continue;
263
+ const value = loaded.solver.getBoolValue(boolVar);
264
+ if (value === L_UNDEF) continue;
265
+ model.registerConst(
266
+ manager.decls[atom],
267
+ value === L_TRUE ? manager.trueExpr : manager.falseExpr,
268
+ );
269
+ }
270
+ return convertModel(goal, model);
271
+ }
272
+
273
+ private getBoundedLimit(ticks: number, query: () => number) {
274
+ const limit = this.manager.limit;
275
+ if (ticks === 0 || !limit.inc()) return L_UNDEF;
276
+ limit.push(ticks);
277
+ try {
278
+ return query();
279
+ } catch (error) {
280
+ if (!(error instanceof SmtTacticError || error instanceof SmtCanceledError)) throw error;
281
+ return L_UNDEF;
282
+ } finally {
283
+ limit.pop();
284
+ }
285
+ }
286
+
287
+ private checkLimit(goal: Goal, objective: number, bound: Anum | null) {
288
+ const loaded = this.load(goal, objective);
289
+ if (loaded === null) return L_UNDEF;
290
+ return loaded.solver.checkLimit(loaded.variable, bound);
291
+ }
292
+
293
+ // Whether the objective is unbounded above over the assertions with objective >= lower.
294
+ proveUnbounded(hard: readonly number[], objective: number, lower: Rational) {
295
+ if (!isInNraFragment(this.manager, [...hard, objective])) return L_UNDEF;
296
+ const preprocessed = this.preprocess(hard, objective, lower, null);
297
+ if (preprocessed.status !== L_TRUE) return preprocessed.status;
298
+ return this.checkLimit(preprocessed.goal, preprocessed.objective, null);
299
+ }
300
+
301
+ // Refuting T >= sup, at a model below an open candidate supremum, proves a strict upper bound,
302
+ // but not that feasible values approach it.
303
+ private proveStrictUpperBound(loaded: Loaded, sup: Anum, best: Anum): NlsatSupremum | null {
304
+ const solver = loaded.solver;
305
+ if (solver.am.compare(sup, best) <= 0) return null;
306
+ const literal = mkLowerBound(solver, loaded.variable, sup, false);
307
+ if (literal === null) return null;
308
+ solver.mkExternalClause([literal], null);
309
+ if (solver.check() !== L_FALSE) return null;
310
+ const value = solver.am.copy(sup);
311
+ const bracket = getBracket(solver, value);
312
+ return { value, lower: bracket[0], upper: bracket[1], isOpen: false };
313
+ }
314
+
315
+ maximize(
316
+ hard: readonly number[],
317
+ objective: number,
318
+ lower: Rational,
319
+ upper: Rational | null,
320
+ maxRounds: number,
321
+ supremumRlimit: number,
322
+ ): NlsatOptOutcome {
323
+ if (!isInNraFragment(this.manager, [...hard, objective]))
324
+ return { status: L_UNDEF, result: NO_MODEL };
325
+ const preprocessed = this.preprocess(hard, objective, lower, upper);
326
+ if (preprocessed.status !== L_TRUE) return { status: preprocessed.status, result: NO_MODEL };
327
+ const goal = preprocessed.goal;
328
+ const loaded = this.load(goal, preprocessed.objective);
329
+ if (loaded === null) return { status: L_UNDEF, result: NO_MODEL };
330
+ const solver = loaded.solver;
331
+ const am = solver.am;
332
+ let status = L_UNDEF;
333
+ let best: Anum | null = null;
334
+ let sup: Anum | null = null;
335
+ let model: ProtoModel | null = null;
336
+ let isUnbounded = false;
337
+ let unboundedRounds = 0;
338
+ // A round without a candidate supremum is inconclusive, since bounds through later variables
339
+ // reach the objective only through conflicts, so five in a row probe for a feasible ray.
340
+ for (let round = 0; round < maxRounds && this.manager.limit.inc(); round++) {
341
+ status = solver.check();
342
+ if (status !== L_TRUE) break;
343
+ best = am.copy(solver.getValue(loaded.variable));
344
+ const found = solver.getMaxVarSup();
345
+ sup = found === null ? null : found.sup;
346
+ model?.decRef();
347
+ model = this.extractModel(loaded, goal, preprocessed.objective);
348
+ model.incRef();
349
+ if (sup === null) {
350
+ if (++unboundedRounds > 4) {
351
+ if (upper === null && this.checkLimit(goal, preprocessed.objective, null) === L_TRUE)
352
+ isUnbounded = true;
353
+ break;
354
+ }
355
+ } else unboundedRounds = 0;
356
+ const literal = mkLowerBound(solver, loaded.variable, best, true);
357
+ if (literal === null) {
358
+ status = L_UNDEF;
359
+ break;
360
+ }
361
+ solver.mkExternalClause([literal], null);
362
+ }
363
+ if (best === null || model === null)
364
+ return { status: status === L_FALSE ? L_FALSE : L_UNDEF, result: NO_MODEL };
365
+ const bracket = getBracket(solver, best);
366
+ const certified =
367
+ status === L_TRUE && sup !== null ? this.proveStrictUpperBound(loaded, sup, best) : null;
368
+ if (certified !== null)
369
+ certified.isOpen =
370
+ this.getBoundedLimit(supremumRlimit, () =>
371
+ this.checkLimit(goal, preprocessed.objective, certified.value),
372
+ ) === L_TRUE;
373
+ return {
374
+ status: status === L_FALSE || isUnbounded || certified?.isOpen === true ? L_TRUE : L_UNDEF,
375
+ result: {
376
+ hasModel: true,
377
+ model,
378
+ value: best,
379
+ lower: bracket[0],
380
+ upper: bracket[1],
381
+ isUnbounded,
382
+ sup: certified,
383
+ },
384
+ };
385
+ }
386
+ }
@@ -0,0 +1,301 @@
1
+ import { SmtTacticError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_ARITH,
5
+ FAMILY_BASIC,
6
+ KIND_APP,
7
+ OP_ADD,
8
+ OP_ALGEBRAIC_NUM,
9
+ OP_AND,
10
+ OP_DIV,
11
+ OP_GE,
12
+ OP_GT,
13
+ OP_LE,
14
+ OP_LT,
15
+ OP_MUL,
16
+ OP_NOT,
17
+ OP_NUM,
18
+ OP_OR,
19
+ OP_POWER,
20
+ OP_SUB,
21
+ OP_UMINUS,
22
+ SORT_BOOL,
23
+ SORT_REAL,
24
+ } from "./ast";
25
+ import { Goal } from "./goal";
26
+ import { goal2nlsat } from "./goal2nlsat";
27
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
28
+ import { NlsatSolver } from "./nlsat/solver";
29
+ import { getModelValueBound } from "./opt-solver";
30
+ import { mkPbGe, mkPbLe } from "./pb-rewriter";
31
+ import { ProtoModel } from "./proto-model";
32
+ import { Rational } from "./rational";
33
+ import { RefVector } from "./ref-vector";
34
+ import { compileInternalTactic, type TacticEnvironment } from "./tactic";
35
+
36
+ const SIMPLIFY = "(using-params simplify :elim_and true :blast_distinct true :expand_power true)";
37
+
38
+ const PREPROCESSOR =
39
+ `(and-then ${SIMPLIFY} (using-params purify-arith :complete false) elim-term-ite ` +
40
+ `(using-params purify-arith :complete false) ${SIMPLIFY} tseitin-cnf-core ${SIMPLIFY})`;
41
+
42
+ const REUSABLE_OPS = new Set([
43
+ OP_NUM,
44
+ OP_ALGEBRAIC_NUM,
45
+ OP_LE,
46
+ OP_GE,
47
+ OP_LT,
48
+ OP_GT,
49
+ OP_ADD,
50
+ OP_SUB,
51
+ OP_UMINUS,
52
+ OP_MUL,
53
+ ]);
54
+
55
+ export interface ParetoObjective {
56
+ term: number;
57
+ isMax: boolean;
58
+ isMaxsmt: boolean;
59
+ terms: readonly number[];
60
+ weights: readonly Rational[];
61
+ }
62
+
63
+ export const canReuseNlsatSolver = (manager: AstManager, terms: readonly number[]) => {
64
+ const seen = new Set<number>();
65
+ const todo = [...terms];
66
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
67
+ if (seen.has(expr)) continue;
68
+ seen.add(expr);
69
+ if (manager.kinds[expr] !== KIND_APP) return false;
70
+ manager.pushArgs(expr, todo);
71
+ const sort = manager.sorts[expr];
72
+ if (sort !== SORT_BOOL && sort !== SORT_REAL && !manager.isNumeral(expr)) return false;
73
+ if (manager.isUninterpretedConst(expr) || manager.getFamily(expr) === FAMILY_BASIC) continue;
74
+ if (manager.getFamily(expr) !== FAMILY_ARITH) return false;
75
+ const op = manager.getOp(expr);
76
+ if (REUSABLE_OPS.has(op)) continue;
77
+ if (op !== OP_DIV && op !== OP_POWER) return false;
78
+ const second = manager.getArg(expr, 1);
79
+ if (!manager.isNumeral(second)) return false;
80
+ const value = manager.getRationalValue(second);
81
+ if (value.isZero()) return false;
82
+ if (op === OP_POWER && (!value.isInt() || value.num < 0n || value.num > 0xffffffffn))
83
+ return false;
84
+ }
85
+ return true;
86
+ };
87
+
88
+ export interface ParetoSolver {
89
+ readonly model: ProtoModel | null;
90
+ reasonUnknown: string;
91
+ check(): number;
92
+ assert(expr: number): void;
93
+ push(): void;
94
+ pop(): void;
95
+ release(): void;
96
+ }
97
+
98
+ export class ParetoNlsatSolver implements ParetoSolver {
99
+ private assertions: RefVector;
100
+ private pinned: RefVector;
101
+ private tags: (number | null)[] = [];
102
+ private scopeTags: number[] = [];
103
+ private limits: number[] = [];
104
+ private head = 0;
105
+ private nextTag = 0;
106
+ private nlsat: NlsatSolver;
107
+ private t2x = new Map<number, number>();
108
+ private a2b = new Map<number, number>();
109
+ private preprocessor: (goal: Goal) => Goal[];
110
+ model: ProtoModel | null = null;
111
+ reasonUnknown = "";
112
+
113
+ constructor(
114
+ private manager: AstManager,
115
+ environment: TacticEnvironment,
116
+ private maxLemmas: number,
117
+ ) {
118
+ this.assertions = new RefVector(manager);
119
+ this.pinned = new RefVector(manager);
120
+ this.nlsat = new NlsatSolver(manager.limit);
121
+ this.nlsat.isReordering = false;
122
+ this.preprocessor = compileInternalTactic(environment, PREPROCESSOR);
123
+ }
124
+
125
+ private setModel(model: ProtoModel | null) {
126
+ model?.incRef();
127
+ this.model?.decRef();
128
+ this.model = model;
129
+ }
130
+
131
+ private internalize() {
132
+ const manager = this.manager;
133
+ while (this.head < this.assertions.size) {
134
+ const tag = this.tags[this.head];
135
+ let end = this.head + 1;
136
+ while (end < this.assertions.size && this.tags[end] === tag) end++;
137
+ const goal = new Goal(manager);
138
+ for (let index = this.head; index < end; index++) goal.assert(this.assertions.items[index]);
139
+ const goals = this.preprocessor(goal);
140
+ if (goals.length !== 1)
141
+ throw new SmtTacticError("Pareto nlsat preprocessing requires a single goal");
142
+ if (goals[0].isInconsistent) this.nlsat.mkExternalClause([], tag);
143
+ else {
144
+ const termCount = this.t2x.size;
145
+ const atomCount = this.a2b.size;
146
+ goal2nlsat(manager, goals[0].forms.items, this.nlsat, this.t2x, this.a2b, tag);
147
+ for (const term of [...this.t2x.keys()].slice(termCount)) this.pinned.push(term);
148
+ for (const atom of [...this.a2b.keys()].slice(atomCount)) this.pinned.push(atom);
149
+ }
150
+ goals[0].forms.reset();
151
+ this.head = end;
152
+ }
153
+ }
154
+
155
+ private extractModel() {
156
+ const manager = this.manager;
157
+ const model = new ProtoModel(manager);
158
+ const seen = new Set<number>();
159
+ const todo = this.assertions.items.toReversed();
160
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
161
+ if (seen.has(expr)) continue;
162
+ seen.add(expr);
163
+ todo.push(...manager.getArgs(expr).toReversed());
164
+ if (!manager.isUninterpretedConst(expr)) continue;
165
+ const variable = this.t2x.get(expr);
166
+ const boolVar = this.a2b.get(expr);
167
+ if (variable !== undefined)
168
+ model.registerConst(
169
+ manager.decls[expr],
170
+ manager.mkAlgebraicNumeral(this.nlsat.getValue(variable)),
171
+ );
172
+ else if (boolVar !== undefined && this.nlsat.getBoolValue(boolVar) !== L_UNDEF)
173
+ model.registerConst(
174
+ manager.decls[expr],
175
+ this.nlsat.getBoolValue(boolVar) === L_TRUE ? manager.trueExpr : manager.falseExpr,
176
+ );
177
+ }
178
+ this.setModel(model);
179
+ }
180
+
181
+ check() {
182
+ this.setModel(null);
183
+ this.reasonUnknown = "";
184
+ try {
185
+ this.internalize();
186
+ const status = this.nlsat.check();
187
+ if (status === L_TRUE) this.extractModel();
188
+ if (status === L_UNDEF) this.reasonUnknown = "incomplete nlsat search";
189
+ return status;
190
+ } catch (error) {
191
+ if (!(error instanceof SmtTacticError)) throw error;
192
+ this.reasonUnknown = error.message;
193
+ return L_UNDEF;
194
+ }
195
+ }
196
+
197
+ assert(expr: number) {
198
+ this.assertions.push(expr);
199
+ this.tags.push(this.scopeTags.at(-1) ?? null);
200
+ this.setModel(null);
201
+ }
202
+
203
+ push() {
204
+ this.limits.push(this.assertions.size);
205
+ this.scopeTags.push(++this.nextTag);
206
+ this.setModel(null);
207
+ }
208
+
209
+ pop() {
210
+ const limit = this.limits.pop();
211
+ const tag = this.scopeTags.pop();
212
+ if (limit === undefined || tag === undefined) return;
213
+ this.nlsat.retract(tag, this.maxLemmas);
214
+ while (this.assertions.size > limit) this.assertions.pop();
215
+ this.tags.length = limit;
216
+ this.head = Math.min(this.head, limit);
217
+ this.setModel(null);
218
+ }
219
+
220
+ release() {
221
+ this.setModel(null);
222
+ this.assertions.reset();
223
+ this.pinned.reset();
224
+ }
225
+ }
226
+
227
+ export const giaPareto = (
228
+ manager: AstManager,
229
+ solver: ParetoSolver,
230
+ objectives: readonly ParetoObjective[],
231
+ isExact: boolean,
232
+ ) => {
233
+ const pinned = new RefVector(manager);
234
+ const pin = (expr: number) => {
235
+ pinned.push(expr);
236
+ return expr;
237
+ };
238
+ // Without exact comparison, an irrational value becomes the endpoint of an isolating interval
239
+ // on the side that keeps the atom true in the model, since the SMT core does not internalize it.
240
+ const getComparable = (value: number, isGreater: boolean) => {
241
+ if (manager.isNumeral(value) || (isExact && manager.isAlgebraicNumeral(value))) return value;
242
+ const bound = getModelValueBound(manager, manager.am, value, isGreater);
243
+ return bound === undefined ? -1 : pin(manager.mkRealNumeral(bound));
244
+ };
245
+ const mkCmp = (isGe: boolean, model: ProtoModel, objective: ParetoObjective) => {
246
+ if (objective.isMaxsmt) {
247
+ let bound = Rational.zero;
248
+ for (const [index, term] of objective.terms.entries()) {
249
+ const value = model.eval(term, true);
250
+ if (value === manager.trueExpr) bound = bound.add(objective.weights[index]);
251
+ manager.decRef(value);
252
+ }
253
+ const terms = [...objective.terms];
254
+ return pin(
255
+ isGe
256
+ ? mkPbGe(manager, objective.weights, terms, bound)
257
+ : mkPbLe(manager, objective.weights, terms, bound),
258
+ );
259
+ }
260
+ const isGreater = objective.isMax ? isGe : !isGe;
261
+ const evaluated = model.eval(objective.term, true);
262
+ pin(evaluated);
263
+ manager.decRef(evaluated);
264
+ const value = getComparable(evaluated, isGreater);
265
+ const pair = isGreater ? [objective.term, value] : [value, objective.term];
266
+ return value === -1 ? manager.trueExpr : pin(manager.mkApp(OP_GE, pair, SORT_BOOL));
267
+ };
268
+ const mkAnd = (args: number[]) =>
269
+ args.length === 1 ? args[0] : pin(manager.mkApp(OP_AND, args, SORT_BOOL));
270
+ const mkOr = (args: number[]) =>
271
+ args.length === 1 ? args[0] : pin(manager.mkApp(OP_OR, args, SORT_BOOL));
272
+ const mkNot = (expr: number) =>
273
+ manager.isNot(expr) ? manager.getArg(expr, 0) : pin(manager.mkNot(expr));
274
+ let status = solver.check();
275
+ if (status !== L_TRUE) return { status, model: null };
276
+ let model = solver.model;
277
+ model?.incRef();
278
+ solver.push();
279
+ while (status === L_TRUE && model !== null && manager.limit.inc()) {
280
+ const current = model;
281
+ const dominating = objectives.map((objective) => mkCmp(true, current, objective));
282
+ const improving = objectives.map((objective) => mkNot(mkCmp(false, current, objective)));
283
+ solver.assert(mkAnd([...dominating, mkOr(improving)]));
284
+ status = solver.check();
285
+ if (status !== L_TRUE) break;
286
+ current.decRef();
287
+ model = solver.model;
288
+ model?.incRef();
289
+ }
290
+ solver.pop();
291
+ const dominant = model;
292
+ if (status !== L_FALSE || dominant === null) {
293
+ dominant?.decRef();
294
+ pinned.reset();
295
+ return { status: L_UNDEF, model: null };
296
+ }
297
+ const bounded = objectives.map((objective) => mkCmp(false, dominant, objective));
298
+ solver.assert(pin(manager.mkApp(OP_NOT, [mkAnd(bounded)], SORT_BOOL)));
299
+ pinned.reset();
300
+ return { status: L_TRUE, model: dominant };
301
+ };