tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.c92e6a4ea

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 (586) 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 +37 -0
  8. package/dist/index.d.ts +37 -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 -44
  15. package/dist/run.js +45 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +44 -41
  19. package/dist/transfer.js +45 -42
  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 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +578 -757
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +27 -62
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +246 -240
  35. package/src/cli/tlc-output.ts +686 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +59 -707
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +73 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +34 -107
  47. package/src/exit-codes.ts +3 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +634 -306
  57. package/src/liveness.ts +104 -120
  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 +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  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 +118 -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 +55 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  310. package/src/prover/smt/solver/lp/pdd.ts +725 -289
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -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 +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -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 +814 -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 +8 -16
  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 +261 -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 +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  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 +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -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 +2127 -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 +1010 -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 +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  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 +1986 -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 +1200 -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 +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +17 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +244 -53
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +36 -50
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +70 -29
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -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/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,884 @@
1
+ import { SmtCanceledError, SmtTacticError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_ARITH,
5
+ KIND_APP,
6
+ KIND_QUANTIFIER,
7
+ OP_ADD,
8
+ OP_DIV,
9
+ OP_GE,
10
+ OP_ITE,
11
+ OP_LE,
12
+ OP_MUL,
13
+ OP_NOT,
14
+ OP_OR,
15
+ OP_SUB,
16
+ OP_TO_REAL,
17
+ OP_UMINUS,
18
+ SORT_BOOL,
19
+ SORT_INT,
20
+ SORT_REAL,
21
+ } from "./ast";
22
+ import { type Dependency, type Goal, joinDependencies } from "./goal";
23
+ import type { ProtoModel } from "./proto-model";
24
+ import { getGcd, getLcm, Rational } from "./rational";
25
+ import { RefVector } from "./ref-vector";
26
+ import { UINT_MAX } from "./sat/clause";
27
+
28
+ export interface FmOptions {
29
+ isRealOnly: boolean;
30
+ limit: number;
31
+ cutoff1: number;
32
+ cutoff2: number;
33
+ extra: number;
34
+ isOcc: boolean;
35
+ }
36
+
37
+ // lits \/ (as[0]*xs[0] + ... + as[n-1]*xs[n-1] <= c), with < when strict. A literal is the index
38
+ // of a Boolean constant, negative when negated.
39
+ interface Constraint {
40
+ id: number;
41
+ lits: number[];
42
+ xs: number[];
43
+ as: Rational[];
44
+ c: Rational;
45
+ isStrict: boolean;
46
+ isDead: boolean;
47
+ dependency: Dependency | undefined;
48
+ }
49
+
50
+ class ConstraintSet {
51
+ private id2pos: number[] = [];
52
+ private set: Constraint[] = [];
53
+
54
+ get isEmpty() {
55
+ return this.set.length === 0;
56
+ }
57
+
58
+ insert(constraint: Constraint) {
59
+ if (this.id2pos[constraint.id] !== undefined && this.id2pos[constraint.id] !== -1) return;
60
+ this.id2pos[constraint.id] = this.set.length;
61
+ this.set.push(constraint);
62
+ }
63
+
64
+ erase(constraint: Constraint) {
65
+ const pos = this.id2pos[constraint.id];
66
+ if (pos === undefined || pos === -1) return;
67
+ this.id2pos[constraint.id] = -1;
68
+ const last = this.set.length - 1;
69
+ if (pos !== last) {
70
+ const lastConstraint = this.set[last];
71
+ this.set[pos] = lastConstraint;
72
+ this.id2pos[lastConstraint.id] = pos;
73
+ }
74
+ this.set.pop();
75
+ }
76
+
77
+ pop() {
78
+ const constraint = this.set.pop() as Constraint;
79
+ this.id2pos[constraint.id] = -1;
80
+ return constraint;
81
+ }
82
+ }
83
+
84
+ class IdGen {
85
+ private next = 0;
86
+ private free: number[] = [];
87
+
88
+ mk() {
89
+ return this.free.pop() ?? this.next++;
90
+ }
91
+
92
+ recycle(id: number) {
93
+ this.free.push(id);
94
+ }
95
+ }
96
+
97
+ class Fm {
98
+ private bvar2expr: RefVector;
99
+ private bvar2sign: number[] = [0];
100
+ private expr2bvar = new Map<number, number>();
101
+ private isInts: boolean[] = [];
102
+ private forbidden: boolean[] = [];
103
+ private var2expr: RefVector;
104
+ private expr2var = new Map<number, number>();
105
+ private var2pos: number[] = [];
106
+ private lowers: Constraint[][] = [];
107
+ private uppers: Constraint[][] = [];
108
+ private forbiddenSet = new Set<number>();
109
+ private idGen = new IdGen();
110
+ private counter = 0;
111
+ private isInconsistent = false;
112
+ private inconsistentCore: Dependency | undefined;
113
+ private subTodo = new ConstraintSet();
114
+ readonly converter: { decl: number; clauses: RefVector }[] = [];
115
+
116
+ constructor(
117
+ private manager: AstManager,
118
+ private goal: Goal,
119
+ private options: FmOptions,
120
+ ) {
121
+ this.bvar2expr = new RefVector(manager);
122
+ this.bvar2expr.push(-1);
123
+ this.var2expr = new RefVector(manager);
124
+ }
125
+
126
+ private isLiteral(expr: number) {
127
+ const manager = this.manager;
128
+ return (
129
+ manager.isUninterpretedConst(expr) ||
130
+ (manager.isNot(expr) && manager.isUninterpretedConst(manager.getArg(expr, 0)))
131
+ );
132
+ }
133
+
134
+ private getVar(expr: number) {
135
+ const manager = this.manager;
136
+ if (manager.isUninterpretedConst(expr)) return expr;
137
+ if (manager.getOp(expr) === OP_TO_REAL && manager.isUninterpretedConst(manager.getArg(expr, 0)))
138
+ return manager.getArg(expr, 0);
139
+ return undefined;
140
+ }
141
+
142
+ private getMulArgs(expr: number) {
143
+ const manager = this.manager;
144
+ return manager.getOp(expr) === OP_MUL && manager.getNumArgs(expr) === 2
145
+ ? manager.getArgs(expr)
146
+ : undefined;
147
+ }
148
+
149
+ private getLinearMonVar(expr: number) {
150
+ const args = this.getMulArgs(expr);
151
+ if (args !== undefined && this.manager.isNumeral(args[0])) {
152
+ const variable = this.getVar(args[1]);
153
+ if (variable !== undefined) return variable;
154
+ }
155
+ return this.getVar(expr);
156
+ }
157
+
158
+ private getMonomials(expr: number) {
159
+ const manager = this.manager;
160
+ return manager.getOp(expr) === OP_ADD ? manager.getArgs(expr) : [expr];
161
+ }
162
+
163
+ private isLinearPol(expr: number) {
164
+ const manager = this.manager;
165
+ const visited = new Set<number>();
166
+ let isAllForbidden = true;
167
+ for (const monomial of this.getMonomials(expr)) {
168
+ const variable = this.getLinearMonVar(monomial);
169
+ if (variable === undefined || visited.has(variable)) return false;
170
+ visited.add(variable);
171
+ if (
172
+ !this.forbiddenSet.has(manager.decls[variable]) &&
173
+ (!this.options.isRealOnly || manager.sorts[variable] !== SORT_INT)
174
+ )
175
+ isAllForbidden = false;
176
+ }
177
+ return !isAllForbidden;
178
+ }
179
+
180
+ private isLinearIneq(expr: number) {
181
+ const manager = this.manager;
182
+ const atom = manager.isNot(expr) ? manager.getArg(expr, 0) : expr;
183
+ const op = manager.getOp(atom);
184
+ if (op !== OP_LE && op !== OP_GE) return false;
185
+ if (!manager.isNumeral(manager.getArg(atom, 1))) return false;
186
+ return this.isLinearPol(manager.getArg(atom, 0));
187
+ }
188
+
189
+ private isOcc(expr: number) {
190
+ const manager = this.manager;
191
+ if (this.options.isOcc && manager.getOp(expr) === OP_OR) {
192
+ let isFound = false;
193
+ for (const arg of manager.getArgs(expr)) {
194
+ if (this.isLiteral(arg)) continue;
195
+ if (!this.isLinearIneq(arg) || isFound) return false;
196
+ isFound = true;
197
+ }
198
+ return isFound;
199
+ }
200
+ return this.isLinearIneq(expr);
201
+ }
202
+
203
+ private delConstraint(constraint: Constraint) {
204
+ this.subTodo.erase(constraint);
205
+ this.idGen.recycle(constraint.id);
206
+ }
207
+
208
+ private mkConstraint(
209
+ lits: number[],
210
+ xs: number[],
211
+ as: Rational[],
212
+ c: Rational,
213
+ isStrict: boolean,
214
+ dependency: Dependency | undefined,
215
+ ): Constraint {
216
+ return {
217
+ id: this.idGen.mk(),
218
+ lits: [...lits],
219
+ xs: [...xs],
220
+ as: [...as],
221
+ c,
222
+ isStrict,
223
+ isDead: false,
224
+ dependency,
225
+ };
226
+ }
227
+
228
+ private normalizeCoeffs(constraint: Constraint) {
229
+ if (constraint.xs.length === 0) return;
230
+ let gcd = constraint.c.num < 0n ? -constraint.c.num : constraint.c.num;
231
+ for (const coeff of constraint.as) {
232
+ if (gcd === 1n) break;
233
+ gcd = getGcd(coeff.num, gcd);
234
+ }
235
+ if (gcd === 1n) return;
236
+ const divisor = Rational.of(gcd);
237
+ constraint.c = constraint.c.div(divisor);
238
+ constraint.as = constraint.as.map((coeff) => coeff.div(divisor));
239
+ }
240
+
241
+ private subsumes(first: Constraint, second: Constraint) {
242
+ if (first === second) return false;
243
+ if (first.lits.length > second.lits.length) return false;
244
+ if (first.xs.length !== second.xs.length) return false;
245
+ if (first.c.compare(second.c) > 0) return false;
246
+ if (!first.isStrict && second.isStrict && first.c.equals(second.c)) return false;
247
+ this.counter += first.lits.length + second.lits.length;
248
+ for (const [index, variable] of first.xs.entries()) this.var2pos[variable] = index;
249
+ let isFailed = false;
250
+ for (const [index, variable] of second.xs.entries()) {
251
+ const pos = this.var2pos[variable];
252
+ if (pos === UINT_MAX || !first.as[pos].equals(second.as[index])) {
253
+ isFailed = true;
254
+ break;
255
+ }
256
+ }
257
+ for (const variable of first.xs) this.var2pos[variable] = UINT_MAX;
258
+ if (isFailed) return false;
259
+ for (const lit of second.lits) this.bvar2sign[Math.abs(lit)] = lit < 0 ? -1 : 1;
260
+ for (const lit of first.lits)
261
+ if (this.bvar2sign[Math.abs(lit)] !== (lit < 0 ? -1 : 1)) {
262
+ isFailed = true;
263
+ break;
264
+ }
265
+ for (const lit of second.lits) this.bvar2sign[Math.abs(lit)] = 0;
266
+ return !isFailed;
267
+ }
268
+
269
+ private backwardSubsumption(constraint: Constraint) {
270
+ if (constraint.xs.length === 0) return;
271
+ let best = UINT_MAX;
272
+ let bestSize = UINT_MAX;
273
+ let isBestLower = false;
274
+ for (const [index, variable] of constraint.xs.entries()) {
275
+ if (this.forbidden[variable]) continue;
276
+ const isNegative = constraint.as[index].isNegative();
277
+ const list = isNegative ? this.lowers[variable] : this.uppers[variable];
278
+ if (list.length < bestSize) {
279
+ best = variable;
280
+ bestSize = list.length;
281
+ isBestLower = isNegative;
282
+ }
283
+ }
284
+ if (bestSize === 0 || best === UINT_MAX) return;
285
+ const list = isBestLower ? this.lowers[best] : this.uppers[best];
286
+ this.counter += list.length;
287
+ let kept = 0;
288
+ for (const other of list) {
289
+ if (other.isDead) continue;
290
+ if (this.subsumes(constraint, other)) {
291
+ other.isDead = true;
292
+ continue;
293
+ }
294
+ list[kept++] = other;
295
+ }
296
+ list.length = kept;
297
+ }
298
+
299
+ private subsume() {
300
+ while (!this.subTodo.isEmpty) {
301
+ const constraint = this.subTodo.pop();
302
+ if (!constraint.isDead) this.backwardSubsumption(constraint);
303
+ }
304
+ }
305
+
306
+ private initForbiddenSet() {
307
+ const manager = this.manager;
308
+ const visited = new Set<number>();
309
+ for (const form of this.goal.forms.items) {
310
+ if (this.isOcc(form)) continue;
311
+ const todo = [form];
312
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
313
+ if (visited.has(expr)) continue;
314
+ visited.add(expr);
315
+ if (manager.kinds[expr] === KIND_QUANTIFIER) {
316
+ const data = manager.getQuantifier(expr);
317
+ todo.push(data.body, ...data.patterns, ...data.noPatterns);
318
+ continue;
319
+ }
320
+ if (manager.kinds[expr] !== KIND_APP) continue;
321
+ if (
322
+ manager.isUninterpretedConst(expr) &&
323
+ manager.getSortFamily(manager.sorts[expr]) === FAMILY_ARITH
324
+ )
325
+ this.forbiddenSet.add(manager.decls[expr]);
326
+ manager.pushArgs(expr, todo);
327
+ }
328
+ }
329
+ }
330
+
331
+ private isAllInt(constraint: Constraint) {
332
+ return constraint.xs.every((variable) => this.isInts[variable]);
333
+ }
334
+
335
+ private toExpr(constraint: Constraint) {
336
+ const manager = this.manager;
337
+ let ineq = -1;
338
+ if (constraint.xs.length === 0) {
339
+ if (constraint.c.isPositive() || (!constraint.isStrict && constraint.c.isZero()))
340
+ return manager.trueExpr;
341
+ } else {
342
+ const isIntConstraint = this.isAllInt(constraint);
343
+ const sort = isIntConstraint ? SORT_INT : SORT_REAL;
344
+ const monomials = constraint.xs.map((variable, index) => {
345
+ const expr = this.var2expr.items[variable];
346
+ const term =
347
+ !isIntConstraint && this.isInts[variable]
348
+ ? manager.mkApp(OP_TO_REAL, [expr], SORT_REAL)
349
+ : expr;
350
+ const coeff = constraint.as[index];
351
+ return coeff.equals(Rational.one)
352
+ ? term
353
+ : manager.mkApp(OP_MUL, [manager.mkNumeralOfSort(coeff, sort), term], sort);
354
+ });
355
+ const lhs = monomials.length === 1 ? monomials[0] : manager.mkApp(OP_ADD, monomials, sort);
356
+ const rhs = manager.mkNumeralOfSort(constraint.c, sort);
357
+ ineq = constraint.isStrict
358
+ ? manager.mkApp(OP_NOT, [manager.mkApp(OP_GE, [lhs, rhs], SORT_BOOL)], SORT_BOOL)
359
+ : manager.mkApp(OP_LE, [lhs, rhs], SORT_BOOL);
360
+ }
361
+ if (constraint.lits.length === 0) return ineq === -1 ? manager.falseExpr : ineq;
362
+ const lits = constraint.lits.map((lit) => {
363
+ const atom = this.bvar2expr.items[Math.abs(lit)];
364
+ return lit < 0 ? manager.mkApp(OP_NOT, [atom], SORT_BOOL) : atom;
365
+ });
366
+ if (ineq !== -1) lits.push(ineq);
367
+ return lits.length === 1 ? lits[0] : manager.mkApp(OP_OR, lits, SORT_BOOL);
368
+ }
369
+
370
+ private toVar(expr: number) {
371
+ const manager = this.manager;
372
+ const existing = this.expr2var.get(expr);
373
+ if (existing !== undefined) return existing;
374
+ const variable = this.var2expr.size;
375
+ this.var2expr.push(expr);
376
+ const isInt = manager.sorts[expr] === SORT_INT;
377
+ this.isInts.push(isInt);
378
+ this.var2pos.push(UINT_MAX);
379
+ this.expr2var.set(expr, variable);
380
+ this.lowers.push([]);
381
+ this.uppers.push([]);
382
+ this.forbidden.push(
383
+ this.forbiddenSet.has(manager.decls[expr]) || (this.options.isRealOnly && isInt),
384
+ );
385
+ return variable;
386
+ }
387
+
388
+ private toLiteral(expr: number) {
389
+ const manager = this.manager;
390
+ const isNegated = manager.isNot(expr);
391
+ const atom = isNegated ? manager.getArg(expr, 0) : expr;
392
+ let bvar = this.expr2bvar.get(atom);
393
+ if (bvar === undefined) {
394
+ bvar = this.bvar2expr.size;
395
+ this.bvar2expr.push(atom);
396
+ this.bvar2sign.push(0);
397
+ this.expr2bvar.set(atom, bvar);
398
+ }
399
+ return isNegated ? -bvar : bvar;
400
+ }
401
+
402
+ private addConstraint(form: number, dependency: Dependency | undefined) {
403
+ const manager = this.manager;
404
+ const lits: number[] = [];
405
+ const xs: number[] = [];
406
+ let as: Rational[] = [];
407
+ let c = Rational.zero;
408
+ let isStrict = false;
409
+ const args = manager.getOp(form) === OP_OR ? manager.getArgs(form) : [form];
410
+ for (const arg of args) {
411
+ if (this.isLiteral(arg)) {
412
+ lits.push(this.toLiteral(arg));
413
+ continue;
414
+ }
415
+ let isNegated = manager.isNot(arg);
416
+ const atom = isNegated ? manager.getArg(arg, 0) : arg;
417
+ isStrict = isNegated;
418
+ if (manager.getOp(atom) === OP_GE) isNegated = !isNegated;
419
+ const [lhs, rhs] = manager.getArgs(atom);
420
+ c = manager.getRationalValue(rhs);
421
+ if (isNegated) c = c.neg();
422
+ let isAllInt = true;
423
+ for (const monomial of this.getMonomials(lhs)) {
424
+ const mulArgs = this.getMulArgs(monomial);
425
+ let coeff = mulArgs === undefined ? Rational.one : manager.getRationalValue(mulArgs[0]);
426
+ if (isNegated) coeff = coeff.neg();
427
+ const variable = this.toVar(
428
+ this.getVar(mulArgs === undefined ? monomial : mulArgs[1]) as number,
429
+ );
430
+ xs.push(variable);
431
+ as.push(coeff);
432
+ if (!this.isInts[variable]) isAllInt = false;
433
+ }
434
+ const lcm = as.reduce((value, coeff) => getLcm(value, coeff.den), c.den);
435
+ if (lcm !== 1n) {
436
+ const factor = Rational.of(lcm);
437
+ c = c.mul(factor);
438
+ as = as.map((coeff) => coeff.mul(factor));
439
+ }
440
+ if (isAllInt && isStrict) {
441
+ isStrict = false;
442
+ c = c.sub(Rational.one);
443
+ }
444
+ }
445
+ this.registerConstraint(this.mkConstraint(lits, xs, as, c, isStrict, dependency));
446
+ }
447
+
448
+ private isFalse(constraint: Constraint) {
449
+ return (
450
+ constraint.lits.length === 0 &&
451
+ constraint.xs.length === 0 &&
452
+ (constraint.c.isNegative() || (constraint.isStrict && constraint.c.isZero()))
453
+ );
454
+ }
455
+
456
+ private registerConstraint(constraint: Constraint) {
457
+ this.normalizeCoeffs(constraint);
458
+ if (this.isFalse(constraint)) {
459
+ this.delConstraint(constraint);
460
+ this.isInconsistent = true;
461
+ return;
462
+ }
463
+ let isIndexed = false;
464
+ for (const [index, variable] of constraint.xs.entries()) {
465
+ if (this.forbidden[variable]) continue;
466
+ isIndexed = true;
467
+ if (constraint.as[index].isNegative()) this.lowers[variable].push(constraint);
468
+ else this.uppers[variable].push(constraint);
469
+ }
470
+ if (isIndexed) {
471
+ this.subTodo.insert(constraint);
472
+ return;
473
+ }
474
+ this.goal.assert(this.toExpr(constraint), constraint.dependency);
475
+ this.delConstraint(constraint);
476
+ }
477
+
478
+ private getCost(variable: number) {
479
+ return Math.min(this.lowers[variable].length * this.uppers[variable].length, UINT_MAX);
480
+ }
481
+
482
+ private sortCandidates() {
483
+ const candidates: { variable: number; cost: number }[] = [];
484
+ for (let variable = 0; variable < this.isInts.length; variable++)
485
+ if (!this.forbidden[variable]) candidates.push({ variable, cost: this.getCost(variable) });
486
+ const getKey = (candidate: { variable: number; cost: number }) =>
487
+ candidate.cost === 0
488
+ ? [0, candidate.variable, 0]
489
+ : [1, this.isInts[candidate.variable] ? 1 : 0, candidate.cost];
490
+ return candidates
491
+ .sort((first, second) => {
492
+ const firstKey = getKey(first);
493
+ const secondKey = getKey(second);
494
+ return (
495
+ firstKey[0] - secondKey[0] || firstKey[1] - secondKey[1] || firstKey[2] - secondKey[2]
496
+ );
497
+ })
498
+ .map((candidate) => candidate.variable);
499
+ }
500
+
501
+ private cleanupConstraints(list: Constraint[]) {
502
+ let kept = 0;
503
+ for (const constraint of list) if (!constraint.isDead) list[kept++] = constraint;
504
+ list.length = kept;
505
+ }
506
+
507
+ // The coefficient of variable is unit in all of list, or undefined when a variable is real.
508
+ private getUnitCoeff(list: Constraint[], variable: number) {
509
+ let isUnit = true;
510
+ for (const constraint of list)
511
+ for (const [index, other] of constraint.xs.entries()) {
512
+ if (!this.isInts[other]) return undefined;
513
+ if (other === variable) {
514
+ const coeff = constraint.as[index];
515
+ if (!coeff.equals(Rational.one) && !coeff.equals(Rational.minusOne)) isUnit = false;
516
+ }
517
+ }
518
+ return isUnit;
519
+ }
520
+
521
+ private canEliminate(variable: number) {
522
+ if (!this.isInts[variable]) return true;
523
+ const isLowerUnit = this.getUnitCoeff(this.lowers[variable], variable);
524
+ if (isLowerUnit === undefined) return false;
525
+ const isUpperUnit = this.getUnitCoeff(this.uppers[variable], variable);
526
+ return isUpperUnit !== undefined && (isLowerUnit || isUpperUnit);
527
+ }
528
+
529
+ private markConstraintsDead(variable: number) {
530
+ const clauses = new RefVector(this.manager);
531
+ for (const constraint of [...this.lowers[variable], ...this.uppers[variable]])
532
+ clauses.push(this.toExpr(constraint));
533
+ const decl = this.manager.decls[this.var2expr.items[variable]];
534
+ this.manager.incDeclRef(decl);
535
+ this.converter.push({ decl, clauses });
536
+ for (const constraint of this.lowers[variable]) constraint.isDead = true;
537
+ for (const constraint of this.uppers[variable]) constraint.isDead = true;
538
+ }
539
+
540
+ private getCoeff(constraint: Constraint, variable: number) {
541
+ return constraint.as[constraint.xs.indexOf(variable)];
542
+ }
543
+
544
+ private resolve(lower: Constraint, upper: Constraint, variable: number) {
545
+ this.counter += lower.xs.length + upper.xs.length + lower.lits.length + upper.lits.length;
546
+ const a = this.getCoeff(lower, variable).neg();
547
+ const b = this.getCoeff(upper, variable);
548
+ let newXs: number[] = [];
549
+ let newAs: Rational[] = [];
550
+ let newC = lower.c.mul(b).add(upper.c.mul(a));
551
+ let isNewStrict = lower.isStrict || upper.isStrict;
552
+ for (const [index, other] of lower.xs.entries()) {
553
+ if (other === variable) continue;
554
+ this.var2pos[other] = newXs.length;
555
+ newXs.push(other);
556
+ newAs.push(lower.as[index].mul(b));
557
+ }
558
+ for (const [index, other] of upper.xs.entries()) {
559
+ if (other === variable) continue;
560
+ const pos = this.var2pos[other];
561
+ if (pos === UINT_MAX) {
562
+ newXs.push(other);
563
+ newAs.push(upper.as[index].mul(a));
564
+ } else newAs[pos] = newAs[pos].add(upper.as[index].mul(a));
565
+ }
566
+ let isAllInt = true;
567
+ const kept = newAs.map((coeff) => !coeff.isZero());
568
+ newXs = newXs.filter((_other, index) => kept[index]);
569
+ newAs = newAs.filter((_coeff, index) => kept[index]);
570
+ for (const other of newXs) if (!this.isInts[other]) isAllInt = false;
571
+ if (isAllInt && isNewStrict) {
572
+ isNewStrict = false;
573
+ newC = newC.sub(Rational.one);
574
+ }
575
+ for (const other of lower.xs) this.var2pos[other] = UINT_MAX;
576
+ if (newXs.length === 0 && (newC.isPositive() || (!isNewStrict && newC.isZero())))
577
+ return undefined;
578
+ const newLits: number[] = [];
579
+ for (const lit of lower.lits) {
580
+ this.bvar2sign[Math.abs(lit)] = lit < 0 ? -1 : 1;
581
+ newLits.push(lit);
582
+ }
583
+ let isTautology = false;
584
+ for (const lit of upper.lits) {
585
+ const sign = this.bvar2sign[Math.abs(lit)];
586
+ if (sign === 0) newLits.push(lit);
587
+ else if ((sign === -1 && lit > 0) || (sign === 1 && lit < 0)) {
588
+ isTautology = true;
589
+ break;
590
+ }
591
+ }
592
+ for (const lit of lower.lits) this.bvar2sign[Math.abs(lit)] = 0;
593
+ if (isTautology) return undefined;
594
+ const newDependency = joinDependencies(lower.dependency, upper.dependency);
595
+ if (
596
+ newLits.length === 0 &&
597
+ newXs.length === 0 &&
598
+ (newC.isNegative() || (isNewStrict && newC.isZero()))
599
+ ) {
600
+ this.isInconsistent = true;
601
+ this.inconsistentCore = newDependency;
602
+ return undefined;
603
+ }
604
+ return this.mkConstraint(newLits, newXs, newAs, newC, isNewStrict, newDependency);
605
+ }
606
+
607
+ private tryEliminate(variable: number) {
608
+ const lowers = this.lowers[variable];
609
+ const uppers = this.uppers[variable];
610
+ this.cleanupConstraints(lowers);
611
+ this.cleanupConstraints(uppers);
612
+ if (lowers.length === 0 || uppers.length === 0) {
613
+ this.markConstraintsDead(variable);
614
+ return true;
615
+ }
616
+ const numLowers = lowers.length;
617
+ const numUppers = uppers.length;
618
+ if (numLowers > this.options.cutoff1 && numUppers > this.options.cutoff1) return false;
619
+ if (numLowers * numUppers > this.options.cutoff2) return false;
620
+ if (!this.canEliminate(variable)) return false;
621
+ this.counter += numLowers * numUppers;
622
+ const limit = numLowers + numUppers + this.options.extra;
623
+ const newConstraints: Constraint[] = [];
624
+ for (const lower of lowers)
625
+ for (const upper of uppers) {
626
+ if (this.isInconsistent || newConstraints.length > limit) {
627
+ for (const constraint of newConstraints) this.delConstraint(constraint);
628
+ return false;
629
+ }
630
+ const resolved = this.resolve(lower, upper, variable);
631
+ if (resolved !== undefined) newConstraints.push(resolved);
632
+ }
633
+ this.markConstraintsDead(variable);
634
+ this.counter += newConstraints.length;
635
+ for (const constraint of newConstraints) {
636
+ this.backwardSubsumption(constraint);
637
+ this.registerConstraint(constraint);
638
+ }
639
+ return true;
640
+ }
641
+
642
+ private copyRemaining(lists: Constraint[][]) {
643
+ for (const list of lists)
644
+ for (const constraint of list) {
645
+ if (constraint.isDead) continue;
646
+ constraint.isDead = true;
647
+ this.goal.assert(this.toExpr(constraint), constraint.dependency);
648
+ }
649
+ }
650
+
651
+ run() {
652
+ const manager = this.manager;
653
+ const goal = this.goal;
654
+ this.initForbiddenSet();
655
+ const forms = new RefVector(manager);
656
+ for (const form of goal.forms.items) forms.push(form);
657
+ const dependencies = goal.dependencies;
658
+ goal.reset();
659
+ goal.depth++;
660
+ for (const [index, form] of forms.items.entries()) {
661
+ if (this.isInconsistent) break;
662
+ if (this.isOcc(form)) this.addConstraint(form, dependencies[index]);
663
+ else goal.assert(form, dependencies[index]);
664
+ }
665
+ forms.reset();
666
+ if (this.isInconsistent) {
667
+ goal.reset();
668
+ goal.assert(manager.falseExpr, this.inconsistentCore);
669
+ return false;
670
+ }
671
+ this.subsume();
672
+ for (const variable of this.sortCandidates()) {
673
+ if (!manager.limit.inc()) throw new SmtCanceledError();
674
+ if (this.counter > this.options.limit) break;
675
+ this.counter++;
676
+ this.tryEliminate(variable);
677
+ if (this.isInconsistent) {
678
+ goal.reset();
679
+ goal.assert(manager.falseExpr, this.inconsistentCore);
680
+ return false;
681
+ }
682
+ }
683
+ this.copyRemaining(this.uppers);
684
+ this.copyRemaining(this.lowers);
685
+ return true;
686
+ }
687
+
688
+ release() {
689
+ this.bvar2expr.reset();
690
+ this.var2expr.reset();
691
+ }
692
+ }
693
+
694
+ interface Bound {
695
+ value: Rational;
696
+ expr: number;
697
+ }
698
+
699
+ const LOWER = 1;
700
+ const UPPER = 2;
701
+
702
+ class FmModelConverter {
703
+ constructor(
704
+ private manager: AstManager,
705
+ private entries: { decl: number; clauses: RefVector }[],
706
+ ) {}
707
+
708
+ private evaluate(model: ProtoModel, expr: number) {
709
+ const value = model.eval(expr, true);
710
+ this.manager.releaseLater(value);
711
+ return value;
712
+ }
713
+
714
+ private process(
715
+ model: ProtoModel,
716
+ decl: number,
717
+ clause: number,
718
+ ): { kind: number; bound: Bound } | undefined {
719
+ const manager = this.manager;
720
+ const isInt = manager.funcDecls[decl].range === SORT_INT;
721
+ const lits = manager.getOp(clause) === OP_OR ? manager.getArgs(clause) : [clause];
722
+ let result: { kind: number; bound: Bound } | undefined;
723
+ for (const lit of lits) {
724
+ if (
725
+ manager.isUninterpretedConst(lit) ||
726
+ (manager.isNot(lit) && manager.isUninterpretedConst(manager.getArg(lit, 0)))
727
+ ) {
728
+ if (manager.isTrue(this.evaluate(model, lit))) return undefined;
729
+ continue;
730
+ }
731
+ let isNegated = manager.isNot(lit);
732
+ const atom = isNegated ? manager.getArg(lit, 0) : lit;
733
+ const isStrict = isNegated;
734
+ if (manager.getOp(atom) === OP_GE) isNegated = !isNegated;
735
+ const [lhs, rhs] = manager.getArgs(atom);
736
+ if (!manager.isNumeral(rhs)) return undefined;
737
+ let c = manager.getRationalValue(rhs);
738
+ if (isNegated) c = c.neg();
739
+ let cExpr = -1;
740
+ let coeff = Rational.zero;
741
+ const monomials = manager.getOp(lhs) === OP_ADD ? manager.getArgs(lhs) : [lhs];
742
+ for (const monomial of monomials) {
743
+ const mulArgs =
744
+ manager.getOp(monomial) === OP_MUL && manager.getNumArgs(monomial) === 2
745
+ ? manager.getArgs(monomial)
746
+ : undefined;
747
+ if (mulArgs !== undefined && !manager.isNumeral(mulArgs[0])) return undefined;
748
+ const factor = mulArgs === undefined ? Rational.one : manager.getRationalValue(mulArgs[0]);
749
+ const inner = mulArgs === undefined ? monomial : mulArgs[1];
750
+ const variable = manager.getOp(inner) === OP_TO_REAL ? manager.getArg(inner, 0) : inner;
751
+ if (!manager.isUninterpretedConst(variable)) return undefined;
752
+ if (manager.decls[variable] === decl) {
753
+ coeff = isNegated ? factor.neg() : factor;
754
+ continue;
755
+ }
756
+ const value = this.evaluate(model, monomial);
757
+ if (manager.isNumeral(value)) {
758
+ const numeral = manager.getRationalValue(value);
759
+ c = c.sub(isNegated ? numeral.neg() : numeral);
760
+ continue;
761
+ }
762
+ const term = isNegated ? manager.mkApp(OP_UMINUS, [value], manager.sorts[value]) : value;
763
+ cExpr =
764
+ cExpr === -1
765
+ ? manager.mkApp(OP_UMINUS, [term], manager.sorts[term])
766
+ : manager.mkApp(OP_SUB, [cExpr, term], manager.sorts[term]);
767
+ }
768
+ if (isInt && isStrict) c = c.sub(Rational.one);
769
+ const kind = coeff.isNegative() ? LOWER : UPPER;
770
+ c = c.div(coeff);
771
+ if (cExpr !== -1)
772
+ cExpr = manager.mkApp(
773
+ OP_DIV,
774
+ [cExpr, manager.mkNumeralOfSort(coeff, SORT_REAL)],
775
+ SORT_REAL,
776
+ );
777
+ if (isInt) c = kind === LOWER ? c.ceil() : c.floor();
778
+ result = { kind, bound: { value: c, expr: cExpr } };
779
+ }
780
+ return result;
781
+ }
782
+
783
+ convert(model: ProtoModel) {
784
+ const manager = this.manager;
785
+ const mkIte = (isMax: boolean, first: number, second: number) => {
786
+ const condition = manager.mkApp(OP_GE, [first, second], SORT_BOOL);
787
+ return manager.mkApp(
788
+ OP_ITE,
789
+ isMax ? [condition, first, second] : [condition, second, first],
790
+ manager.sorts[first],
791
+ );
792
+ };
793
+ const outer = manager.beginTemporaries();
794
+ for (let index = this.entries.length - 1; index >= 0; index--) {
795
+ const entry = this.entries[index];
796
+ const decl = entry.decl;
797
+ let lower: Rational | undefined;
798
+ let upper: Rational | undefined;
799
+ let lowerExpr = -1;
800
+ let upperExpr = -1;
801
+ for (const clause of entry.clauses.items) {
802
+ if (!manager.limit.inc()) throw new SmtTacticError("canceled");
803
+ const processed = this.process(model, decl, clause);
804
+ if (processed === undefined) continue;
805
+ const bound = processed.bound;
806
+ if (processed.kind === LOWER) {
807
+ if (bound.expr !== -1)
808
+ lowerExpr = lowerExpr === -1 ? bound.expr : mkIte(true, lowerExpr, bound.expr);
809
+ else if (lower === undefined || bound.value.compare(lower) > 0) lower = bound.value;
810
+ } else if (bound.expr !== -1)
811
+ upperExpr = upperExpr === -1 ? bound.expr : mkIte(false, upperExpr, bound.expr);
812
+ else if (upper === undefined || bound.value.compare(upper) < 0) upper = bound.value;
813
+ }
814
+ const value =
815
+ manager.funcDecls[decl].range === SORT_INT
816
+ ? this.getIntValue(lower, upper, lowerExpr, upperExpr, mkIte)
817
+ : this.getRealValue(lower, upper, lowerExpr, upperExpr, mkIte);
818
+ model.registerConst(decl, value);
819
+ }
820
+ manager.endTemporaries(outer);
821
+ return model;
822
+ }
823
+
824
+ private getIntValue(
825
+ lower: Rational | undefined,
826
+ upper: Rational | undefined,
827
+ lowerExpr: number,
828
+ upperExpr: number,
829
+ mkIte: (isMax: boolean, first: number, second: number) => number,
830
+ ) {
831
+ const manager = this.manager;
832
+ if (lowerExpr !== -1)
833
+ return lower === undefined
834
+ ? lowerExpr
835
+ : mkIte(true, lowerExpr, manager.mkNumeralOfSort(lower, SORT_INT));
836
+ if (upperExpr !== -1)
837
+ return upper === undefined
838
+ ? upperExpr
839
+ : mkIte(false, upperExpr, manager.mkNumeralOfSort(upper, SORT_INT));
840
+ return manager.mkNumeralOfSort(lower ?? upper ?? Rational.zero, SORT_INT);
841
+ }
842
+
843
+ private getRealValue(
844
+ lower: Rational | undefined,
845
+ upper: Rational | undefined,
846
+ inputLowerExpr: number,
847
+ inputUpperExpr: number,
848
+ mkIte: (isMax: boolean, first: number, second: number) => number,
849
+ ) {
850
+ const manager = this.manager;
851
+ const real = (value: Rational) => manager.mkNumeralOfSort(value, SORT_REAL);
852
+ const lowerExpr =
853
+ inputLowerExpr !== -1 && lower !== undefined
854
+ ? mkIte(true, inputLowerExpr, real(lower))
855
+ : inputLowerExpr;
856
+ const upperExpr =
857
+ inputUpperExpr !== -1 && upper !== undefined
858
+ ? mkIte(false, inputUpperExpr, real(upper))
859
+ : inputUpperExpr;
860
+ const two = Rational.of(2n);
861
+ if (lowerExpr !== -1 && upperExpr !== -1)
862
+ return manager.mkApp(
863
+ OP_DIV,
864
+ [manager.mkApp(OP_ADD, [lowerExpr, upperExpr], SORT_REAL), real(two)],
865
+ SORT_REAL,
866
+ );
867
+ if (lowerExpr !== -1) return manager.mkApp(OP_ADD, [lowerExpr, real(Rational.one)], SORT_REAL);
868
+ if (upperExpr !== -1) return manager.mkApp(OP_SUB, [upperExpr, real(Rational.one)], SORT_REAL);
869
+ if (lower !== undefined && upper !== undefined) return real(upper.add(lower).div(two));
870
+ if (lower !== undefined) return real(lower.add(Rational.one));
871
+ if (upper !== undefined) return real(upper.sub(Rational.one));
872
+ return real(Rational.zero);
873
+ }
874
+ }
875
+
876
+ export const fm = (manager: AstManager, goal: Goal, options: FmOptions) => {
877
+ if (goal.isProofsEnabled) throw new SmtTacticError("fm does not support proof production");
878
+ const eliminator = new Fm(manager, goal, options);
879
+ const isConsistent = eliminator.run();
880
+ eliminator.release();
881
+ if (!isConsistent) return;
882
+ const converter = new FmModelConverter(manager, eliminator.converter);
883
+ goal.addModelConversion((model) => converter.convert(model));
884
+ };