tla-ts 0.0.10-dev.cb7650c54 → 0.0.10-dev.d618a2d79
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.
- package/dist/deciders.cjs +29 -29
- package/dist/deciders.js +29 -29
- package/dist/prove.cjs +17 -17
- package/dist/prove.js +57 -57
- package/dist/run.cjs +15 -15
- package/dist/run.js +38 -38
- package/dist/transfer.cjs +12 -12
- package/dist/transfer.js +5 -5
- package/dist/worker.cjs +1 -1
- package/dist/worker.js +1 -1
- package/package.json +1 -1
- package/src/check-trace.ts +2 -16
- package/src/check.ts +23 -6
- package/src/cli/tlc-output.ts +3 -3
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +15 -1
- package/src/environment.ts +10 -5
- package/src/exit-codes.ts +1 -0
- package/src/liveness-checker.ts +27 -4
- package/src/obligations/action.ts +0 -2
- package/src/obligations/anonymize.ts +0 -2
- package/src/obligations/equality.ts +0 -2
- package/src/obligations/expression.ts +0 -2
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +0 -2
- package/src/obligations/levels.ts +0 -2
- package/src/obligations/module.ts +0 -2
- package/src/obligations/normalize.ts +0 -2
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/printer.ts +0 -2
- package/src/obligations/proof.ts +0 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +0 -2
- package/src/obligations/subexpression.ts +0 -2
- package/src/obligations/substitution.ts +0 -2
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/pretty-print.ts +1 -1
- package/src/prover/isabelle/encode.ts +0 -2
- package/src/prover/isabelle/isar/attrib.ts +0 -4
- package/src/prover/isabelle/isar/context.ts +0 -4
- package/src/prover/isabelle/isar/induct.ts +0 -4
- package/src/prover/isabelle/isar/method.ts +0 -2
- package/src/prover/isabelle/isar/proof.ts +0 -2
- package/src/prover/isabelle/isar/rule-cases.ts +0 -2
- package/src/prover/isabelle/isar/toplevel.ts +0 -4
- package/src/prover/isabelle/isar/type-check.ts +0 -2
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +0 -2
- package/src/prover/isabelle/provers/hypsubst.ts +0 -2
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +0 -2
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +0 -2
- package/src/prover/isabelle/pure/logic.ts +0 -2
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +0 -2
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +0 -2
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +0 -2
- package/src/prover/isabelle/pure/table.ts +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +0 -2
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +0 -2
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
- package/src/prover/smt/solver/ackr-helper.ts +0 -3
- package/src/prover/smt/solver/ackr-model-converter.ts +0 -1
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
- package/src/prover/smt/solver/aig-tactic.ts +0 -1
- package/src/prover/smt/solver/aig.ts +2 -3
- package/src/prover/smt/solver/arith-rewriter.ts +0 -1
- package/src/prover/smt/solver/arith-terms.ts +0 -2
- package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/array-rewriter.ts +0 -1
- package/src/prover/smt/solver/asserted-formulas.ts +0 -1
- package/src/prover/smt/solver/ast-lt.ts +0 -1
- package/src/prover/smt/solver/ast-util.ts +0 -2
- package/src/prover/smt/solver/ast.ts +0 -1
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +0 -3
- package/src/prover/smt/solver/bit-blaster.ts +0 -3
- package/src/prover/smt/solver/bound-manager.ts +0 -1
- package/src/prover/smt/solver/bound-simplifier.ts +0 -2
- package/src/prover/smt/solver/bv-bound-chk.ts +0 -2
- package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
- package/src/prover/smt/solver/bv-rewriter.ts +0 -2
- package/src/prover/smt/solver/bv1-blast.ts +0 -2
- package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
- package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
- package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
- package/src/prover/smt/solver/card2bv.ts +0 -2
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +0 -2
- package/src/prover/smt/solver/check-logic.ts +0 -1
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
- package/src/prover/smt/solver/conflict-resolution.ts +0 -1
- package/src/prover/smt/solver/context.ts +0 -1
- package/src/prover/smt/solver/ctx-simplify.ts +0 -1
- package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
- package/src/prover/smt/solver/datatype-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
- package/src/prover/smt/solver/demodulator.ts +0 -3
- package/src/prover/smt/solver/dependent-expr-state.ts +0 -3
- package/src/prover/smt/solver/der.ts +0 -1
- package/src/prover/smt/solver/diff-neq.ts +0 -1
- package/src/prover/smt/solver/distribute-forall.ts +0 -1
- package/src/prover/smt/solver/dom-simplify.ts +0 -2
- package/src/prover/smt/solver/dt2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +0 -1
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
- package/src/prover/smt/solver/elim-uncnstr.ts +0 -2
- package/src/prover/smt/solver/enode.ts +0 -1
- package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/arith-internalize.ts +0 -2
- package/src/prover/smt/solver/euf/arith-solver.ts +0 -1
- package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/array-internalize.ts +0 -2
- package/src/prover/smt/solver/euf/array-solver.ts +0 -2
- package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
- package/src/prover/smt/solver/euf/bv-internalize.ts +0 -2
- package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
- package/src/prover/smt/solver/euf/dt-solver.ts +0 -2
- package/src/prover/smt/solver/euf/egraph.ts +2 -3
- package/src/prover/smt/solver/euf/euf-solver.ts +0 -3
- package/src/prover/smt/solver/euf/fpa-solver.ts +0 -2
- package/src/prover/smt/solver/euf/mam.ts +0 -2
- package/src/prover/smt/solver/euf/q-ematch.ts +0 -2
- package/src/prover/smt/solver/euf/q-mbi.ts +0 -2
- package/src/prover/smt/solver/euf/q-model-fixer.ts +0 -3
- package/src/prover/smt/solver/euf/q-solver.ts +0 -2
- package/src/prover/smt/solver/euf/th-solver.ts +0 -2
- package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
- package/src/prover/smt/solver/expr2polynomial.ts +0 -1
- package/src/prover/smt/solver/factor.ts +0 -1
- package/src/prover/smt/solver/fd-solver.ts +0 -3
- package/src/prover/smt/solver/fingerprints.ts +0 -1
- package/src/prover/smt/solver/fix-dl-var.ts +0 -1
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +0 -1
- package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/fpa-rewriter.ts +0 -1
- package/src/prover/smt/solver/fpa2bv-converter.ts +0 -1
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
- package/src/prover/smt/solver/fpa2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/goal.ts +0 -1
- package/src/prover/smt/solver/goal2nlsat.ts +0 -2
- package/src/prover/smt/solver/guard-set.ts +0 -1
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +0 -1
- package/src/prover/smt/solver/inf-eps.ts +1 -2
- package/src/prover/smt/solver/inj-axiom.ts +0 -1
- package/src/prover/smt/solver/internalizer.ts +0 -1
- package/src/prover/smt/solver/lackr.ts +0 -2
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +0 -1
- package/src/prover/smt/solver/lia2pb.ts +0 -1
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +0 -4
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +0 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +0 -1
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +0 -1
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +25 -6
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +0 -1
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +0 -2
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +97 -62
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +0 -1
- package/src/prover/smt/solver/macro-finder.ts +0 -3
- package/src/prover/smt/solver/mam-compiler.ts +0 -1
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +0 -2
- package/src/prover/smt/solver/max-cliques.ts +0 -2
- package/src/prover/smt/solver/maxcore.ts +1 -2
- package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -1
- package/src/prover/smt/solver/maxlex.ts +0 -1
- package/src/prover/smt/solver/maxsmt-base.ts +0 -1
- package/src/prover/smt/solver/maxsmt.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-arith.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +0 -2
- package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +0 -1
- package/src/prover/smt/solver/model-based-opt.ts +0 -1
- package/src/prover/smt/solver/model-checker.ts +0 -1
- package/src/prover/smt/solver/model-evaluator.ts +0 -1
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +0 -1
- package/src/prover/smt/solver/model-macro-solver.ts +0 -1
- package/src/prover/smt/solver/model-printer.ts +0 -1
- package/src/prover/smt/solver/mpf.ts +0 -1
- package/src/prover/smt/solver/mus.ts +0 -1
- package/src/prover/smt/solver/muz/dl-context.ts +0 -2
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +0 -2
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +0 -2
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -2
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +0 -1
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +0 -1
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +0 -2
- package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -1
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -2
- package/src/prover/smt/solver/muz/dl-rule.ts +0 -2
- package/src/prover/smt/solver/muz/hnf.ts +0 -1
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +0 -2
- package/src/prover/smt/solver/muz/horn-tactic.ts +0 -2
- package/src/prover/smt/solver/muz/rule-properties.ts +0 -1
- package/src/prover/smt/solver/muz/spacer-context.ts +0 -1
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +0 -1
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
- package/src/prover/smt/solver/muz/spacer-manager.ts +0 -2
- package/src/prover/smt/solver/muz/spacer-pdr.ts +0 -1
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +1 -2
- package/src/prover/smt/solver/muz/spacer-util.ts +0 -1
- package/src/prover/smt/solver/muz/substitution.ts +0 -2
- package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/nlqsat.ts +2 -2
- package/src/prover/smt/solver/nlsat/algebraic.ts +0 -2
- package/src/prover/smt/solver/nlsat/atoms.ts +0 -2
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +0 -1
- package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
- package/src/prover/smt/solver/nlsat/levelwise.ts +2 -3
- package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat/solver.ts +5 -13
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
- package/src/prover/smt/solver/nlsat/transcendentals.ts +0 -2
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +0 -3
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +0 -1
- package/src/prover/smt/solver/nnf.ts +0 -1
- package/src/prover/smt/solver/normalize-bounds.ts +0 -1
- package/src/prover/smt/solver/occf.ts +0 -1
- package/src/prover/smt/solver/opt-context.ts +1 -2
- package/src/prover/smt/solver/opt-nlsat.ts +0 -1
- package/src/prover/smt/solver/opt-pareto.ts +0 -2
- package/src/prover/smt/solver/opt-preprocess.ts +0 -1
- package/src/prover/smt/solver/opt-solver.ts +0 -1
- package/src/prover/smt/solver/opt-value.ts +0 -1
- package/src/prover/smt/solver/optsmt.ts +0 -2
- package/src/prover/smt/solver/parallel-tactic.ts +0 -2
- package/src/prover/smt/solver/pattern-inference.ts +0 -1
- package/src/prover/smt/solver/pb-rewriter.ts +0 -3
- package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/poly-rewriter.ts +0 -1
- package/src/prover/smt/solver/probes.ts +2 -4
- package/src/prover/smt/solver/propagate-values.ts +0 -1
- package/src/prover/smt/solver/proto-model.ts +0 -1
- package/src/prover/smt/solver/pull-quant.ts +0 -1
- package/src/prover/smt/solver/purify-arith.ts +0 -1
- package/src/prover/smt/solver/qe-arith-plugin.ts +0 -2
- package/src/prover/smt/solver/qe-lite-der.ts +0 -1
- package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
- package/src/prover/smt/solver/qe-lite.ts +0 -1
- package/src/prover/smt/solver/qe-mbp.ts +0 -1
- package/src/prover/smt/solver/qe.ts +0 -2
- package/src/prover/smt/solver/qel.ts +0 -1
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +0 -1
- package/src/prover/smt/solver/quant-hoist.ts +0 -1
- package/src/prover/smt/solver/quant-tactics.ts +0 -1
- package/src/prover/smt/solver/quantifier-analyzer.ts +0 -1
- package/src/prover/smt/solver/quantifier-manager.ts +0 -1
- package/src/prover/smt/solver/quasi-macros.ts +0 -2
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +0 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/recfun-rewriter.ts +0 -1
- package/src/prover/smt/solver/reduce-args.ts +0 -1
- package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +0 -1
- package/src/prover/smt/solver/rewriter-tpl.ts +0 -1
- package/src/prover/smt/solver/rewriter.ts +0 -1
- package/src/prover/smt/solver/rlimit.ts +13 -1
- package/src/prover/smt/solver/sat/asymm-branch.ts +0 -2
- package/src/prover/smt/solver/sat/big.ts +0 -1
- package/src/prover/smt/solver/sat/clause-use-list.ts +0 -2
- package/src/prover/smt/solver/sat/clause.ts +0 -3
- package/src/prover/smt/solver/sat/cleaner.ts +0 -2
- package/src/prover/smt/solver/sat/config.ts +0 -3
- package/src/prover/smt/solver/sat/consequences.ts +0 -1
- package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
- package/src/prover/smt/solver/sat/goal2sat.ts +0 -2
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +0 -1
- package/src/prover/smt/solver/sat/model-converter.ts +0 -2
- package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
- package/src/prover/smt/solver/sat/pb-solver.ts +0 -2
- package/src/prover/smt/solver/sat/probing.ts +0 -2
- package/src/prover/smt/solver/sat/sat-tactic.ts +0 -1
- package/src/prover/smt/solver/sat/sat2goal.ts +0 -2
- package/src/prover/smt/solver/sat/scc.ts +0 -1
- package/src/prover/smt/solver/sat/simplifier.ts +0 -3
- package/src/prover/smt/solver/sat/solver.ts +0 -2
- package/src/prover/smt/solver/sat/var-queue.ts +0 -2
- package/src/prover/smt/solver/sat/watch-list.ts +0 -3
- package/src/prover/smt/solver/search-tree.ts +0 -1
- package/src/prover/smt/solver/seq-axioms.ts +0 -1
- package/src/prover/smt/solver/seq-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/seq-derive.ts +3 -8
- package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
- package/src/prover/smt/solver/seq-eq-solver.ts +0 -1
- package/src/prover/smt/solver/seq-factory.ts +0 -1
- package/src/prover/smt/solver/seq-monadic.ts +0 -2
- package/src/prover/smt/solver/seq-range-predicate.ts +0 -2
- package/src/prover/smt/solver/seq-re-rewriter.ts +0 -1
- package/src/prover/smt/solver/seq-re-util.ts +0 -2
- package/src/prover/smt/solver/seq-regex-bisim.ts +0 -1
- package/src/prover/smt/solver/seq-regex-live.ts +0 -2
- package/src/prover/smt/solver/seq-rewriter.ts +0 -2
- package/src/prover/smt/solver/seq-skolem.ts +0 -1
- package/src/prover/smt/solver/seq-subset.ts +0 -1
- package/src/prover/smt/solver/seq-view-witness.ts +0 -2
- package/src/prover/smt/solver/smt-consequences.ts +0 -2
- package/src/prover/smt/solver/smt-kernel.ts +0 -2
- package/src/prover/smt/solver/smt-logics.ts +0 -1
- package/src/prover/smt/solver/smt-setup.ts +3 -5
- package/src/prover/smt/solver/smt2-printer.ts +0 -2
- package/src/prover/smt/solver/smtlib-parser.ts +0 -2
- package/src/prover/smt/solver/smtlib-script.ts +0 -2
- package/src/prover/smt/solver/solve-eqs.ts +0 -2
- package/src/prover/smt/solver/solver.ts +1 -2
- package/src/prover/smt/solver/static-features.ts +0 -2
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +0 -2
- package/src/prover/smt/solver/term-enumeration.ts +0 -1
- package/src/prover/smt/solver/theory-array.ts +0 -2
- package/src/prover/smt/solver/theory-bv.ts +0 -2
- package/src/prover/smt/solver/theory-char.ts +0 -1
- package/src/prover/smt/solver/theory-datatype.ts +0 -1
- package/src/prover/smt/solver/theory-finite-set.ts +2 -2
- package/src/prover/smt/solver/theory-fpa.ts +0 -1
- package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
- package/src/prover/smt/solver/theory-lra-final-check.ts +0 -1
- package/src/prover/smt/solver/theory-lra-internalize.ts +8 -1
- package/src/prover/smt/solver/theory-lra-model.ts +0 -1
- package/src/prover/smt/solver/theory-lra-propagate.ts +0 -1
- package/src/prover/smt/solver/theory-lra-state.ts +0 -1
- package/src/prover/smt/solver/theory-lra.ts +0 -1
- package/src/prover/smt/solver/theory-pb.ts +0 -2
- package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
- package/src/prover/smt/solver/theory-recfun.ts +0 -1
- package/src/prover/smt/solver/theory-seq-regex.ts +0 -1
- package/src/prover/smt/solver/theory-seq-solve.ts +0 -2
- package/src/prover/smt/solver/theory-seq-state.ts +0 -2
- package/src/prover/smt/solver/theory-seq.ts +0 -1
- package/src/prover/smt/solver/theory.ts +0 -1
- package/src/prover/smt/solver/tseitin-cnf.ts +0 -2
- package/src/prover/smt/solver/var-subst.ts +0 -1
- package/src/prover/zenon/decide.ts +0 -2
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +2 -2
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +0 -2
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +0 -2
- package/src/prover/zenon/parse.ts +0 -2
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +0 -2
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +0 -2
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +1 -2
- package/src/runtime.ts +4 -0
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/search.ts +29 -20
- package/src/simulate.ts +3 -0
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/tlc/tlcext-operators.ts +44 -12
- package/src/tlc/trace-spec.ts +2 -3
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/zenon/LICENSE +0 -32
package/dist/run.cjs
CHANGED
|
@@ -6,11 +6,11 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs"),r=require("./tlapm.cjs");let i=require("node:path"),a=require("node:fs"),o=require("node:url"),s=require("node:child_process"),c=require("node:os"),l=require("node:v8");const u=`META-INF/MANIFEST.MF`,d=async e=>{if(e===void 0||!(0,a.existsSync)(e))return`master`;let t=await import(`fflate`),n=t.unzipSync((0,a.readFileSync)(e),{filter:e=>e.name===u})[u];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},f=/[*?[{]/,p=e=>e.flatMap(e=>f.test(e)?(0,a.globSync)(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),m=(e,t)=>e.map(e=>(0,i.join)(e,`${t}.tla`)).find(a.existsSync),h=e=>t=>{let n=m(e,t);return n===void 0?void 0:(0,a.readFileSync)(n,`utf8`)},g=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),_=e=>`jar:file:${(0,o.pathToFileURL)((0,i.resolve)(e)).pathname}!/tla2sany/StandardModules/`,v=t=>t instanceof e.V?e.it(t.code):e.Q(t),y=(n,r)=>{if(n instanceof e._||n instanceof e.b){let i=t.sn(n.message),a=n instanceof e.V?n.code:i&&!i.isEvalException?i.code:t.en.general;return r.print(a,t.tn.error,t.rn(a,n.message,r.isTool))}console.error(`${n.name}: ${n.message}`)},b=async(n,r=t.nn({isTool:!1}))=>{try{return await n()}catch(t){if(!(t instanceof e.y))throw t;return y(t,r),v(t)}},x=(e,t,n)=>console.error(`File does not exist: ${(0,i.isAbsolute)(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[_(n)]].join(`, `)}`),S=e=>e.endsWith(`/`)?e:`${e}/`,C=(e,n)=>r=>{let i=e(r);return i===void 0&&!t.ct.has(r)&&n(`${r}.tla`),i},w=e=>e.classPath?.split(i.delimiter).find(e=>e.endsWith(`.jar`));var T=`0.0.10-dev.
|
|
10
|
-
`),
|
|
9
|
+
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs"),r=require("./tlapm.cjs");let i=require("node:path"),a=require("node:fs"),o=require("node:url"),s=require("node:child_process"),c=require("node:os"),l=require("node:v8");const u=`META-INF/MANIFEST.MF`,d=async e=>{if(e===void 0||!(0,a.existsSync)(e))return`master`;let t=await import(`fflate`),n=t.unzipSync((0,a.readFileSync)(e),{filter:e=>e.name===u})[u];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},f=/[*?[{]/,p=e=>e.flatMap(e=>f.test(e)?(0,a.globSync)(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),m=(e,t)=>e.map(e=>(0,i.join)(e,`${t}.tla`)).find(a.existsSync),h=e=>t=>{let n=m(e,t);return n===void 0?void 0:(0,a.readFileSync)(n,`utf8`)},g=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),_=e=>`jar:file:${(0,o.pathToFileURL)((0,i.resolve)(e)).pathname}!/tla2sany/StandardModules/`,v=t=>t instanceof e.V?e.it(t.code):e.Q(t),y=(n,r)=>{if(n instanceof e._||n instanceof e.b){let i=t.sn(n.message),a=n instanceof e.V?n.code:i&&!i.isEvalException?i.code:t.en.general;return r.print(a,t.tn.error,t.rn(a,n.message,r.isTool))}console.error(`${n.name}: ${n.message}`)},b=async(n,r=t.nn({isTool:!1}))=>{try{return await n()}catch(t){if(!(t instanceof e.y))throw t;return y(t,r),v(t)}},x=(e,t,n)=>console.error(`File does not exist: ${(0,i.isAbsolute)(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[_(n)]].join(`, `)}`),S=e=>e.endsWith(`/`)?e:`${e}/`,C=(e,n)=>r=>{let i=e(r);return i===void 0&&!t.ct.has(r)&&n(`${r}.tla`),i},w=e=>e.classPath?.split(i.delimiter).find(e=>e.endsWith(`.jar`));var T=`0.0.10-dev.d618a2d79`;const E=2224400062,D={int8:0,int16:1,int32:2,shared8:4,shared16:5,shared32:6,block32:8,string8:9,string32:10,doubleLittle:12},O={smallInt:64,smallString:32,smallBlock:128},k=(e,...t)=>({tag:e,fields:t}),A=e=>typeof e==`object`&&`tag`in e,ee=(t,n)=>{let r=new DataView(t.buffer,t.byteOffset,t.byteLength);if(t.length<n+20||r.getUint32(n)!==E)throw new e.A(`corrupted fingerprint file`);let i=n+20+r.getUint32(n+4),a=[],o=n+20,s=t=>{let n=o;if(o+=t,o>i)throw new e.A(`corrupted fingerprint file`);return n},c=new TextDecoder,l=e=>{let n=s(e),r=c.decode(t.subarray(n,n+e));return a.push(r),r},u=(e,t)=>{let n=k(e);t>0&&a.push(n);for(let e=0;e<t;e++)n.fields.push(f());return n},d=e=>a[a.length-e],f=()=>{let n=t[s(1)];if(n>=O.smallBlock)return u(n&15,n>>4&7);if(n>=O.smallInt)return n&63;if(n>=O.smallString)return l(n&31);switch(n){case D.int8:return r.getInt8(s(1));case D.int16:return r.getInt16(s(2));case D.int32:return r.getInt32(s(4));case D.shared8:return d(r.getUint8(s(1)));case D.shared16:return d(r.getUint16(s(2)));case D.shared32:return d(r.getUint32(s(4)));case D.block32:{let e=r.getUint32(s(4));return u(e&255,e>>>10)}case D.string8:return l(r.getUint8(s(1)));case D.string32:return l(r.getUint32(s(4)));case D.doubleLittle:{let e={float:r.getFloat64(s(8),!0)};return a.push(e),e}}throw new e.A(`corrupted fingerprint file`)};return{value:f(),next:i}},te=e=>{let t=[],n=0,r=0,i=0,a=(e,n)=>{for(let r=(n-1)*8;r>=0;r-=8)t.push(e>>>r&255)},o=new TextEncoder,s=e=>{if(typeof e==`number`)return e>=0&&e<64?t.push(O.smallInt+e):e>=-128&&e<128?t.push(D.int8,e&255):e>=-32768&&e<32768?(t.push(D.int16),a(e,2)):(t.push(D.int32),a(e,4));if(n++,typeof e==`string`){let n=o.encode(e);n.length<32?t.push(O.smallString+n.length):n.length<256?t.push(D.string8,n.length):(t.push(D.string32),a(n.length,4)),t.push(...n),r+=1+Math.floor((n.length+4)/4),i+=1+Math.floor((n.length+8)/8);return}if(!A(e)){let n=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));n.setFloat64(0,e.float,!0),t.push(D.doubleLittle,...new Uint8Array(n.buffer)),r+=3,i+=2;return}let c=e.fields.length;c===0?n--:(r+=1+c,i+=1+c),e.tag<16&&c<8?t.push(O.smallBlock+e.tag+(c<<4)):(t.push(D.block32),a(c*1024+e.tag,4)),e.fields.forEach(s)};s(e);let c=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(20));return[E,t.length,n,r,i].forEach((e,t)=>c.setUint32(t*4,e)),new Uint8Array([...new Uint8Array(c.buffer),...t])},ne=20210223,j=[...n.c,`cooper`,`expandenabled`,`expandcdot`,`lambdify`,`enabledaxioms`,`levelcomparison`],M={zenon:{field:1,tag:1},isabelle:{field:2,tag:0},cooper:{field:4,tag:3,isConstant:!0},smt:{field:10,tag:8},z3:{field:11,tag:9},ls4:{field:17,tag:16},expandenabled:{field:18,tag:6,isConstant:!0},expandcdot:{field:19,tag:8,isConstant:!0},lambdify:{field:20,tag:9,isConstant:!0},enabledaxioms:{field:21,tag:10,isConstant:!0},levelcomparison:{field:22,tag:11,isConstant:!0}},re=[`false`,`timeout`],ie=`tla-ts ${T}`,ae=/* @__PURE__ */ new Map([[M.zenon.field,3],[M.isabelle.field,4]]),N=(e,t)=>e!==void 0&&A(e)?e.fields[t]:void 0,oe=e=>e!==void 0&&typeof e==`object`&&`float`in e?e.float:1/0,P=e=>{let t=new TextEncoder().encode(e),n=(e,t)=>e<<t|e>>>32-t,r=Array.from({length:Math.ceil(t.length/4)},(e,n)=>t[n*4]|t[n*4+1]<<8|t[n*4+2]<<16|t[n*4+3]<<24).reduce((e,t)=>{let r=Math.imul(n(Math.imul(t,3432918353),15),461845907);return Math.imul(n(e^r,13),5)+3864292196|0},0),i=Math.imul(r^t.length^(r^t.length)>>>16,2246822507),a=Math.imul(i^i>>>13,3266489909);return(a^a>>>16)&1073741823},se=e=>e!==void 0&&A(e)?[[e.fields[0],e.fields[1]],...se(e.fields[2])]:[],F=(t,n,r)=>{let i=(0,a.readFileSync)(n),o=ee(i,0),s=ee(i,o.next).value;if(o.value!==ne||!A(s)||s.tag!==0)throw new e.A(`corrupted fingerprint file`);let c=N(N(s,0),1),l=(e,t)=>{let n=ae.get(t);return!r||n===void 0||N(N(e,0),n)===ie};t.clear(),(c!==void 0&&A(c)?c.fields:[]).flatMap(e=>se(e).toReversed()).forEach(([n,r])=>{if(typeof n!=`string`||!A(r))throw new e.A(`corrupted fingerprint file`);t.set(n,r.fields.map((e,t)=>l(e,t)?e:0))})},ce=(e,t)=>{let n=N(t,0),r=N(n,0),i=N(N(n,1),0);if(r===void 0||r===1)return;let a=oe(N(e===`isabelle`?N(i,0):i,0)),o=e===`isabelle`?N(i,1):void 0,s=N(N(r,0),0);return{kind:`stored`,method:{prover:e,timeLimitMs:a*1e3,...typeof o==`string`&&{tactic:o}},isProved:r===0,...s!==void 0&&{reason:typeof s==`number`?re[s]:String(N(s,0))}}},le=(e,t)=>{let r=/* @__PURE__ */ new Date,i=t.method,a={float:n.u(i)},o=e===`zenon`?k(0,a,5):e===`isabelle`?k(0,k(0,a),i.tactic??`auto`):k(0,a),s=n.i(t),c=re.indexOf(s??``),l=s===void 0?0:k(0,c===-1?k(0,s):c);return k(0,k(0,k(0,n.a(t)?0:k(0,l),M[e].isConstant?M[e].tag:k(M[e].tag,o)),k(0,r.getFullYear(),r.getMonth(),r.getDate(),r.getHours(),r.getMinutes(),r.getSeconds()),ie,ie,ie))},ue=e=>{let t=2**Math.max(9,Math.ceil(Math.log2(e.size/2))),n=Array.from({length:t},()=>0);return e.forEach((e,r)=>{let i=P(r)&t-1;n[i]=k(0,r,k(0,...e),n[i])}),k(0,k(0,e.size,k(0,...n),0,512))},de=e=>String(e).padStart(2,`0`),fe=(e,t)=>{let n=/* @__PURE__ */ new Date,r=`${e}.history`,o=(0,i.join)(r,`${n.getFullYear()}-${de(n.getMonth()+1)}-${de(n.getDate())}_${de(n.getHours())}_${de(n.getMinutes())}_${de(n.getSeconds())}`);(0,a.mkdirSync)(o,{recursive:!0}),[e,...t].filter(e=>(0,a.existsSync)(e)).forEach(e=>(0,a.cpSync)(e,(0,i.join)(o,(0,i.basename)(e)),{preserveTimestamps:!0})),(0,a.readdirSync)(r).map(e=>(0,i.join)(r,e)).sort((e,t)=>(0,a.statSync)(t).mtimeMs-(0,a.statSync)(e).mtimeMs).slice(10).forEach(e=>(0,a.rmSync)(e,{recursive:!0,force:!0}))},pe=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=new Map([...e].map(([e,r])=>{let i=new Map(j.flatMap(e=>{let n=r[M[e].field],i=ce(e,N(n,0));return i?(t.set(i,n),[[e,i]]):[]}));return n.set(i,r),[e,i]}));return{results:r,save:i=>{e.clear(),r.forEach((r,i)=>{let a=[...n.get(r)??Array(23).fill(0)];j.forEach(e=>{let n=r.get(e);n&&(a[M[e].field]=t.get(n)??le(e,n))}),e.set(i,a)}),(0,a.writeFileSync)(`${i}.tmp`,Buffer.concat([te(ne),te(ue(e))])),(0,a.renameSync)(`${i}.tmp`,i)}}},me=((e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,n.length]}));return{usage:e.replace(`{options}`,t.map(e=>`[${e.flag}]${e.isRepeatable?`...`:``}`).join(` `)),parse:e=>{let t=[],r=[],i=[];for(let a=0;a<e.length;a++){let o=n.get(e[a]);o===void 0?(e[a].startsWith(`-`)?i:r).push(e[a]):(t.push({name:e[a],values:e.slice(a+1,a+1+o)}),a+=o)}return{options:t,positionals:r,unknown:i,incomplete:t.find(e=>e.values.length<(n.get(e.name)??0)),has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}})(`tla-ts tlapm {options} <Module.tla|glob>...`,[{flag:`-N`},{flag:`--summary`},{flag:`--strict`},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--threads <num>`},{flag:`--version`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-k`},{flag:`--noproving`},{flag:`--nofp`},{flag:`--nofpl <start> <end>`},{flag:`--safefp`},{flag:`--cleanfp`},{flag:`--usefp <file>`},{flag:`--cache-dir <directory>`},{flag:`--debug <flags>`,isRepeatable:!0},{flag:`--method <methods>`},{flag:`--solver <command>`},{flag:`--smt-logic <logic>`},{flag:`--stretch <factor>`},{flag:`--noflatten`}]),he=[`Usage: tla-ts <Spec.tla|Spec.cfg|spec.ts|glob>... [-config <Spec.cfg>] [-continue] [-deadlock] [-dump [<format>] <file>] [-fp <num>] [-lncheck <final|default|off>] [-maxSetSize <num>] [-metadir <directory>] [-nowarning] [-seed <num>] [-terse] [-tool] [-view] [-workers <count|auto>]`,` ${me.usage}`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
|
|
10
|
+
`),ge={name:``,values:[],doc:` `},_e=[ge,{name:`(basic options)`,values:[],doc:` `},ge,{name:`--help`,values:[],doc:` show this help message and exit`},{name:`-help`,values:[],doc:` (same as --help)`},{name:`--version`,values:[],doc:` show version number and exit`},{name:`--verbose`,values:[],doc:` produce verbose messages`},{name:`-v`,values:[],doc:` (same as --verbose)`},ge,{name:`--where`,values:[],doc:` show location of standard library and exit`},{name:`--config`,values:[],doc:` show configuration and exit`},{name:`--summary`,values:[],doc:` show summary of theorems (implies -N and not -C)`},{name:`--strict`,values:[],doc:` report incomplete proofs, empty proof targets and failed obligations as errors and exit with a non-zero status`},{name:`--timing`,values:[],doc:` show runtime statistics`},ge,{name:`-I`,values:[`string`],doc:`<dir> add <dir> to search path`},{name:`-d`,values:[`string`],doc:``},ge,{name:`-k`,values:[],doc:` keep going on backend failures`},{name:`-N`,values:[],doc:` do not run any backend verifiers`},{name:`-C`,values:[],doc:` check proofs in Isabelle/TLA+`},ge,{name:`--threads`,values:[`int`],doc:`<int> set number of worker threads to <int>`},{name:`--method`,values:[`string`],doc:`<meth> set default method to <meth> (try --method help)`},{name:`--solver`,values:[`string`],doc:`<solver> set SMT solver to <solver>`},{name:`--smt-logic`,values:[`string`],doc:`<logic> set SMT logic to <logic>`},{name:`--stretch`,values:[`float`],doc:`<f> multiply all timeouts by <f>`},{name:`--fast-isabelle`,values:[],doc:``},ge,{name:`(advanced options)`,values:[],doc:` `},ge,{name:`--noflatten`,values:[],doc:` do not flatten obligations`},{name:`--nonormal`,values:[],doc:` do not normalize obligations before printing`},{name:`--debug`,values:[`string`],doc:`{[-]<flag>} enable/disable debugging flags`},{name:`--paranoid`,values:[],doc:``},{name:`--isaprove`,values:[],doc:``},ge,{name:`--toolbox`,values:[`int`,`int`],doc:`<int><int> toolbox mode`},{name:`--toolbox-vsn`,values:[`int`],doc:`<int> Toolbox protocol version, 1|2, 1 by default.`},{name:`--line`,values:[`int`],doc:`<int> line to prove`},{name:`--wait`,values:[`int`],doc:`<time> wait for <time> before printing obligations in progress`},{name:`--stdin`,values:[],doc:` read the tla file from stdin instead of file system. Only applies if single tla file is provided as input.`},{name:`--prefer-stdlib`,values:[],doc:` prefer built-in standard modules if the module search path contains files with the same names as modules in stdlib.`},{name:`--parser`,values:[`string`],doc:` Set parser backend to use: TLAPM (default) or SANY.`},{name:`--module-jar`,values:[`string`],doc:` Add a path to a .jar file containing additional TLA+ modules, such
|
|
11
11
|
as the community modules. Multiple .jar files can be added by using
|
|
12
|
-
this option multiple times.`},{name:`--noproving`,values:[],doc:` do not prove, report fingerprinted results only`},
|
|
13
|
-
`}${f??n.r(e,t,{...r,isTemporal:t.method.prover===`ls4`})}`]])},je=(e,t)=>{if(e.channel===`stdout`)return console.log(e.text);let n=e.channel===`toolbox`||e.channel===`toolboxOnly`;if(t&&n)return Se([`type:warning`,`msg:${e.text}`]);e.channel!==`toolboxOnly`&&console.error(e.text)},Me=(e,t)=>Ce(e,`failed`,[`prover:fail`,`meth:time-limit: inf`,`reason:${t}`,`already:false`,`obl:${e.text}`]),Ne=[/^unsat/m,/SPASS beiseite: Proof found/,/SZS status Theorem/],Pe=(e,t,n,r,i)=>{let o=`${t}.out`;(0,a.writeFileSync)(t,n);let c=performance.now();(0,s.spawnSync)(`sh`,[`-c`,`file=${we(t)}; ${e} >${we(o)}`],{stdio:[`ignore`,`inherit`,`inherit`],timeout:Number.isFinite(r)?r:void 0});let l=performance.now()-c,u=(0,a.existsSync)(o)?(0,a.readFileSync)(o,`utf8`):``;return i||[t,o].forEach(e=>(0,a.rmSync)(e,{force:!0})),{verdict:Ne.some(e=>e.test(u))?`unsat`:u.startsWith(`sat`)?`sat`:`unknown`,output:u,timeUsedMs:l}},Fe=async(e,t,r,i)=>{let o=
|
|
12
|
+
this option multiple times.`},{name:`--noproving`,values:[],doc:` do not prove, report fingerprinted results only`},ge,{name:`--printallobs`,values:[],doc:` print obligations in all toolbox messages`},ge,{name:`--fpdir`,values:[`string`],doc:``},{name:`--safefp`,values:[],doc:` check tlapm, zenon, Isabelle versions for fingerprints`},{name:`--nofp`,values:[],doc:` do not use existing fingerprints, but overwrite any preexisting fingerprints associated with the current proof obligations, using the newly computed fingerprints and results`},{name:`--nofpl`,values:[`int`,`int`],doc:`<int><int> disable fingerprint use between given lines`},{name:`--cleanfp`,values:[],doc:` erase fingerprint file before starting`},ge,{name:`--erasefp`,values:[`string`,`string`],doc:`<f><back> erase from file <f> all results of backend <back>`},{name:`--printfp`,values:[`string`],doc:`<f> print the fingerprints stored in file <f> and quit`},{name:`--usefp`,values:[`string`],doc:`<f> load fingerprints from file <f> (save as usual)`},{name:`--fpp`,values:[],doc:` print the fingerprints of obligations in toolbox messages`},{name:`--cache-dir`,values:[`string`],doc:'<directory> save auxiliary and temporary files under <directory>. Alternatively, this directory can be defined via the variable `TLAPM_CACHE_DIR` of the runtime environment. The command-line parameter takes precedence over the environment variable. If neither is specified, the default value is ".tlacache".'}],ve=e=>/^[^ ]* */.exec(e)?.[0].length??0,ye=()=>{let e=Math.max(..._e.map(e=>e.name.length+ve(e.doc)));return`Usage: tla-ts tlapm <options> FILE ...\noptions are:\n${_e.filter(e=>e.doc!==``).map(t=>{let n=ve(t.doc);return` ${t.name} ${t.doc.slice(0,n)}${` `.repeat(e-t.name.length-n)}${t.doc.slice(n)}\n`}).join(``)}`},be=t=>{for(let r=0;r<t.length;r++){let i=t[r];if(i===`--version`)return;if(!i.startsWith(`-`))continue;let a=_e.find(e=>e.name===i);if(!a)return`unknown option '${i}'`;for(let e of a.values){if(r++,r===t.length)return`option '${i}' needs an argument`;let a=t[r];if(e===`int`&&n.p(a)===void 0)return`wrong argument '${a}'; option '${i}' expects an integer`;if(e===`float`&&n.f(a)===void 0)return`wrong argument '${a}'; option '${i}' expects a float`}let o=t[r];if(i===`--threads`&&(n.p(o)??0)<0)return`--threads requires a positive argument`;if(i===`--debug`&&o.split(`,`).includes(`oldsmt`))return`--debug oldsmt: the old SMT encoding has been removed`;if(i===`--method`)try{n.d(o)}catch(t){if(!(t instanceof e.j))throw t;return t.message}}},xe=e=>[`.`,...r.t().map(e=>(0,i.join)((0,i.dirname)((0,i.dirname)((0,a.realpathSync)(e))),`lib/tlapm/stdlib`)).filter(a.existsSync).slice(0,1),...e.options.flatMap(e=>e.name===`-I`?e.values:[]).toReversed()],Se=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),Ce=(e,t,n)=>Se([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:${t}`,...n]),we=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,Te={failed:10,incomplete:11,emptyTarget:12},Ee=(e,t,r)=>{let i=e.summary;r||(i.absent.forEach(e=>console.error(`Missing proof at ${n.x(e)}`)),i.omitted.forEach(e=>console.error(`Omitted proof at ${n.x(e)}`)));let a=i.absent.length+i.omitted.length>0;a&&console.error(`${n.b(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${i.absent.length} missing, ${i.omitted.length} omitted proof step(s).`);let o=t&&e.obligations.length===0;return o&&console.error(`${n.b(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...a?[Te.incomplete]:[],...o?[Te.emptyTarget]:[]]},De=(e,t,n)=>{console.error(` tlapm ending abnormally with ${e.exception}\n`),n&&Se(t.message===``?[`type:error`,`url:http://tla.msr-inria.inria.fr/bugs`,`msg:Oops, this seems to be a bug in TLAPM.\nPlease give feedback to developers.\n\n\n ${e.exception}\n`]:[`type:warning`,`msg:${t.location===void 0?``:`${t.location}\n\n`}${t.message}`])},Oe=t=>{if(!(t instanceof e.A))throw t;return{kind:`aborted`,error:t}},ke=e=>{try{return{kind:`done`,value:e()}}catch(e){return Oe(e)}},Ae=(e,t,r)=>{let i=t.method.timeLimitMs,a=t.kind===`decided`?`; time-used: ${(t.timeUsedMs/1e3).toFixed(1)} (${Math.round(100*t.timeUsedMs/i)}%)`:``,o=i===0?``:`time-limit: ${i===1/0?`inf`:Number((i/1e3).toPrecision(6))}${a}`,s=[t.method.tactic,o].filter(Boolean).join(`; `),c=n.i(t),l=n.a(t),u=t.kind===`reused`,d=t.kind===`decided`?t.note:t.kind===`refused`?`${t.reason}\nObligation:\n\n`:t.kind===`unavailable`?`\n\\* ${t.warning}\n`:void 0,f=t.kind===`unavailable`||u?t.shipped:void 0;Ce(e,l?`proved`:`failed`,[`prover:${t.method.prover}`,...s===``?[]:[`meth:${s}`],...c===void 0?[]:[`reason:${c}`],`already:${u}`,...l?[]:[`obl:${u?``:d??`
|
|
13
|
+
`}${f??n.r(e,t,{...r,isTemporal:t.method.prover===`ls4`})}`]])},je=(e,t)=>{if(e.channel===`stdout`)return console.log(e.text);let n=e.channel===`toolbox`||e.channel===`toolboxOnly`;if(t&&n)return Se([`type:warning`,`msg:${e.text}`]);e.channel!==`toolboxOnly`&&console.error(e.text)},Me=(e,t)=>Ce(e,`failed`,[`prover:fail`,`meth:time-limit: inf`,`reason:${t}`,`already:false`,`obl:${e.text}`]),Ne=[/^unsat/m,/SPASS beiseite: Proof found/,/SZS status Theorem/],Pe=(e,t,n,r,i)=>{let o=`${t}.out`;(0,a.writeFileSync)(t,n);let c=performance.now();(0,s.spawnSync)(`sh`,[`-c`,`file=${we(t)}; ${e} >${we(o)}`],{stdio:[`ignore`,`inherit`,`inherit`],timeout:Number.isFinite(r)?r:void 0});let l=performance.now()-c,u=(0,a.existsSync)(o)?(0,a.readFileSync)(o,`utf8`):``;return i||[t,o].forEach(e=>(0,a.rmSync)(e,{force:!0})),{verdict:Ne.some(e=>e.test(u))?`unsat`:u.startsWith(`sat`)?`sat`:`unknown`,output:u,timeUsedMs:l}},Fe=async(e,t,r,i)=>{let o=pe(i.fingerprints),s=i.solver,c=await n.s(e.obligations,{...i.backends,workers:i.workers,results:o.results,isFingerprinted:i.isFingerprinted,isProving:i.isProving,...i.isKeepingFiles&&{onInput:(e,n)=>(0,a.writeFileSync)(`${t}/${e}`,n)},...s!==void 0&&{solveSmt:async(e,n,r)=>Pe(s,`${t}/${e}`,n,r,i.isKeepingFiles)},onReport:(e,t)=>{if(e.attempts.forEach(e=>{e.kind===`decided`&&e.errorOutput!==void 0&&process.stdout.write(e.errorOutput),e.kind===`unavailable`&&process.stderr.write(`${e.warning}\n`)}),e.warnings.forEach(e=>je(e,i.isToolbox)),i.isToolbox){if(t.kind.kind===`Error`)return Me(t,`user error`);e.attempts.forEach(e=>Ae(t,e,i.printing)),e.obligation.status===`trivial`&&Ce(t,`trivial`,[`prover:tlapm`,`already:false`])}}}),l=`${t}/${e.name}.thy`;if((0,a.writeFileSync)(l,n.n(e.name,c,e.obligations,i.backends.isFlattened)),console.log(`(* created new ${JSON.stringify(l)} *)`),o.save(r),console.log(`(* fingerprints written in ${JSON.stringify(r)} *)`),!i.isProving)return!1;let u=c.flatMap((t,n)=>`reason`in t.obligation?[{report:t,obligation:e.obligations[n]}]:[]);i.isToolbox&&u.filter(e=>e.report.attempts.length===0&&e.obligation.kind.kind!==`Error`).forEach(e=>Me(e.obligation,`unexpected error`)),u.toReversed().forEach(e=>console.error(`${n.b(e.obligation.locus)}${n.y(n.v(`[ERROR]: @[<v2>Could not prove or check:@,%a@]`,n._(e.obligation.sequent,i.printing)),35)}`));let d=`${e.obligations.length} obligation${e.obligations.length>1?`s`:``}`;return console.error(u.length===0?`${n.b(e.location)}[INFO]: All ${d} proved.`:`${n.b(e.location)}[ERROR]: ${u.length}/${d} failed.\nThere were backend errors processing module \`${JSON.stringify(e.name)}\`.`),u.length>0},Ie=[`rwsetext`,`rw`,`rw+`],Le=/* @__PURE__ */ new Set([`tempfiles`,`hidden`,`alldefs`,`rw+`,`rw`,`rwsetext`,`disable_arithmetic`,`no_smt_set_extensionality`,`smarter_types`]),Re=async r=>{let o=me.parse(r),s=!o.has(`-N`)&&!o.has(`--summary`),l=o.options.flatMap(e=>e.name===`--debug`?e.values.flatMap(e=>e.split(`,`)):[]).reduce((e,t)=>t.startsWith(`-`)?new Set([...e].filter(e=>e!==t.slice(1))):/* @__PURE__ */ new Set([...e,t]),/* @__PURE__ */ new Set),u={isShowingHidden:l.has(`hidden`),isShowingAllDefinitions:l.has(`alldefs`)},d=Ie.filter(e=>l.has(e)),f=l.has(`smarter_types`)&&!l.has(`disable_arithmetic`),m=f&&d.length>0?`smarter_types with --debug ${d.at(-1)}`:[...l].find(e=>!Le.has(e)),h=be(r);if(h!==void 0)return console.error(`tla-ts tlapm: ${h}.\n${ye()}`),2;if(o.has(`--version`))return console.log(n.t),e.nt.success;let g=o.unknown[0]??(s&&o.has(`--printallobs`)?`--printallobs`:void 0)??(m===void 0?void 0:`--debug ${m}`);if(g!==void 0)return console.error(`Error: tla-ts tlapm does not support the tlapm option ${g}.`),1;let _=p(o.positionals).map(e=>e.path),v=_.map(e=>e.endsWith(`.tla`)?e:`${e}.tla`);if(v.length===0)return console.error(he),1;let y=o.has(`--toolbox`)||o.has(`--line`);y&&console.log(`\n\\* TLAPM version ${n.t}\n\\* launched at ${t.an(/* @__PURE__ */ new Date)} with command line:\n\\* ${[`tla-ts`,`tlapm`,...r].map(we).join(` `)}\n`);let b=o.options.reduce((e,t)=>{let[r,i]=t.values.map(e=>n.p(e)??0);return t.name===`--toolbox`?{start:r,end:i===0?1/0:i}:t.name===`--line`?r===0?n.m:{start:r,end:r}:e},n.m),x=v.reduce((e,t)=>e.includes((0,i.dirname)(t))?e:[(0,i.dirname)(t),...e],xe(o)),S=/* @__PURE__ */ new Set,C=[],w=ke(()=>{let t=v.findIndex(e=>!(0,a.existsSync)(e));if(t!==-1){let n=_[t];throw console.error(`File "<unknown>":\nError: File ${JSON.stringify(n)} not found`),new e.A(`File ${n} not found`,{failure:`Module.Parser.parse_file`})}return n.g(v.map(e=>({file:`./${e}`,source:(0,a.readFileSync)(e,`utf8`)})),e=>{S.add(e);let t=x.map(t=>`${t}/${e}.tla`).find(a.existsSync);if(t!==void 0)return{file:t,source:(0,a.readFileSync)(t,`utf8`)};let r=n.l.get(e);return r===void 0?void 0:{file:`${e}.tla`,source:r}},{lines:b,printing:u,onWarning:e=>{e.channel===`error`?C.push(e):je(e,y)}})});if(w.kind===`aborted`){let e=C.at(-1)?.locus;return De(w.error,{location:e&&n.x(e),message:C.toReversed().map(e=>`${e.text}\n\n`).join(``)},y),3}let T=w.value,E=o.get(`--cache-dir`)?.[0]??process.env.TLAPM_CACHE_DIR??`.tlacache`,D=o.get(`--nofpl`)?.map(e=>n.p(e)??0)??[0,0],O=o.get(`--method`)?.[0],k={isToolbox:y,isProving:!o.has(`--noproving`),workers:Math.max(1,n.p(o.get(`--threads`)?.[0]??``)??(0,c.availableParallelism)()),isFingerprinted:e=>!o.has(`--nofp`)&&!(e.locus&&e.locus.startLine>=D[0]&&e.locus.endLine<=D[1]),fingerprints:/* @__PURE__ */ new Map,backends:{defaultMethods:O===void 0?void 0:n.d(O),stretch:n.f(o.get(`--stretch`)?.[0]??`1`)??1,isFlattened:!o.has(`--noflatten`)&&[`yes`,`true`,void 0].includes(process.env.TLAPM_FLATTEN),smtLogic:l.has(`disable_arithmetic`)?`UF`:o.get(`--smt-logic`)?.[0]??`UFNIA`,smtEncoding:{isArithmetic:!l.has(`disable_arithmetic`),rewriteLevel:Ie.findLastIndex(e=>l.has(e))+1,isSetExtensional:!l.has(`no_smt_set_extensionality`),isTyped:f}},printing:u,isKeepingFiles:l.has(`tempfiles`),solver:o.get(`--solver`)?.[0]??process.env.TLAPM_SMT_SOLVER},A=[];for(let[e,t]of T.entries()){let r=`${E}/${t.name}.tlaps`,i=`${r}/fingerprints`,c=o.get(`--usefp`)?.[0]??i;if((0,a.mkdirSync)(r,{recursive:!0}),o.has(`--cleanfp`)&&(0,a.existsSync)(i)&&((0,a.rmSync)(i),console.log(`(* fingerprints file ${JSON.stringify(i)} removed *)`)),!o.has(`--cleanfp`)&&(0,a.existsSync)(c)&&t.summary.total!==0&&(console.log(o.has(`--nofp`)?`(* will not use fingerprints (because of option \`--nofp\`), but will now load fingerprints from the file \`${c}\`, in order to overwrite with the new fingerprints, and then save the results at the end. *)`:`(* loading fingerprints in ${JSON.stringify(c)} *)`),F(k.fingerprints,c,o.has(`--safefp`))),o.has(`--summary`)&&console.log(n.h(t)),y&&(t.obligations.forEach(e=>Ce(e,`to be proved`,o.has(`--printallobs`)?[`obl:${e.text}`]:[])),Se([`type:obligationsnumber`,`count:${t.obligations.length}`])),o.has(`--strict`)&&A.push(...Ee(t,b.start>0||b.end<1/0,o.has(`--summary`))),!s)continue;fe(i,[...S,...T.slice(0,e+1).map(e=>e.name)].map(e=>`${e}.tla`));let l=await Fe(t,r,i,k).then(e=>({kind:`done`,value:e}),Oe);if(l.kind===`aborted`){let e=l.error;return console.error(`${n.b(e.locus)}Error: ${e.message}`),De(e,{location:e.locus&&n.x(e.locus),message:e.message},y),3}if(l.value&&o.has(`--strict`)&&A.push(Te.failed),l.value&&!o.has(`--strict`)&&!y)return console.error(` tlapm ending abnormally with Failure("backend errors: there are unproved obligations")
|
|
14
14
|
Raised at Stdlib.failwith in file "stdlib.ml", line 29, characters 17-33
|
|
15
15
|
Called from Tlapm_lib.process_module in file "src/tlapm_lib.ml", lines 492-493, characters 12-37
|
|
16
16
|
Called from Tlapm_lib.main.f in file "src/tlapm_lib.ml", line 640, characters 23-43
|
|
@@ -18,7 +18,7 @@ Called from Stdlib__List.fold_left in file "list.ml", line 125, characters 24-34
|
|
|
18
18
|
Called from Tlapm_lib.main in file "src/tlapm_lib.ml", line 643, characters 13-40
|
|
19
19
|
Called from Tlapm_lib.init in file "src/tlapm_lib.ml", line 659, characters 8-59
|
|
20
20
|
`),3}return Object.values(Te).find(e=>A.includes(e))??e.nt.success},ze=(1n<<63n)-1n,Be=1n<<16n,Ve=(e,t)=>{let n=e.map(e=>{let t=BigInt.asIntN(32,e);return t<0n?t:BigInt.asIntN(64,e)}),r=n.toSorted((e,t)=>e<t?-1:+(e>t)),i=r.slice(1).map((e,t)=>e-r[t]).filter(e=>e<=ze),a=/* @__PURE__ */ new Map;e.forEach((e,r)=>{let i=e&t-1n,o=a.get(i),s=n[r];o?(o.min=s<o.min?s:o.min,o.max=s>o.max?s:o.max):a.set(i,{min:s,max:s})});let o=[...a.values()].map(e=>e.max-e.min).filter(e=>e>ze).map(e=>e===ze+1n?-e:(1n<<64n)-e);return[...i,...o].reduce((e,t)=>t<e?t:e,ze)},He=(n,r)=>{let i=t.un(r)?`tlc2.tool.EvalException`:`java.lang.RuntimeException`;return n===``?e.$(i):`TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nThe error occurred when TLC was ${n}.\nThe exception was a ${i}\n: `},Ue=n=>{let r=n.onOutput,i=n.isTool??!1,a=n.isContinued??!1,o=t.m(n),s=o.config,c=o.environment,l=c.runtime,u=o.search;if(!u)throw new e.B(`tla-ts can't search a specification without variables`);let d=(e,t,n=t,i=!0)=>r({kind:`message`,code:e,isError:i,message:t,toolMessage:n}),f=u.properties.liveness;if(f.length>0){n.onProgress?.({kind:`liveness-initializing`,isSymmetric:u.isSymmetric,isConstrained:u.isConstrained});let r=e.ot(()=>t.fn(()=>t.E(f,u.spec.temporals,c,{getFingerprint:()=>0,getSuccessors:()=>[]})))?.branches;r&&n.onProgress?.({kind:`liveness-prepared`,branches:r})}if((n.workers??1)!==1)return d(t.en.general,`Depth-First Iterative Deepening mode does not support multiple workers (https://github.com/tlaplus/tlaplus/issues/548). Please run TLC with a single worker.`),e.nt.error;if(f.length>0)return d(t.en.general,`Depth-First Iterative Deepening mode does not support checking liveness properties (https://github.com/tlaplus/tlaplus/issues/548). Please check liveness properties in Breadth-First-Search mode.`),e.nt.error;l.generatedStates=-1,l.distinctStates=-1,l.initialStates=-1,l.queueSize=-1,l.diameter=-1,l.isStarted=!0;let p=t.h(o.specification.assumptions,c,d);if(p!==void 0)return p;let m=o.getDescription().actions,h=/* @__PURE__ */ new Map,g={level:1,leveled:0,buckets:Be},_=(e,t)=>{let n=h.get(e);return n===void 0?(BigInt(h.size)>=g.buckets*20n&&(g.buckets*=2n),h.set(e,g.level<<2|g.leveled|t),0):(h.set(e,n|t),n)},v=e=>h.get(e)??0,y=e=>(e&2)===g.leveled||(e&1)==1,b=e=>e===0||e>>>2===g.level,x=0,S={isDone:!1,errorCode:0,continuedCode:0,isKeepingCallStack:!1,errorEntry:void 0,stopCode:`searching`,isMoreLevel:!1},C=(e,t,n)=>!a&&S.isDone?!1:(S.errorEntry=e,S.errorCode=n,S.isDone=!0,S.isKeepingCallStack=t,S.stopCode=`error`,!0),w=e=>u.toRecord(e.map(e=>e??t.Pt(`null`))),T=()=>{let e=`${x} states generated, ${h.size} distinct states found`;i&&d(t.en.depthFirstProgress,`Progress: ${e}.`,`Progress(-1) at ${t.an(/* @__PURE__ */ new Date)}: ${e}, -1 states left on queue.`,!1),d(t.en.depthFirstStats,`${e}.`,void 0,!1)},E=()=>r({kind:`success`,optimistic:t.o(h.size,x),actual:h.size===0&&x===0?0:t.i(Ve([...h.keys()],g.buckets))}),D=/* @__PURE__ */ new WeakMap,O;l.getLevel=e=>D.get(e)??0,l.getCurrentState=()=>O;let k=[],A,ee=()=>{let e=[],n=t=>(e.push(t),!1),r=u.spec.init;r&&t.Q(r,c,n,u.spec.scope,n),x=e.length;for(let n of e){if(!n.every(e=>e!==void 0))return d(t.en.initialStateIncomplete,`State is not completely specified by the initial predicate:\n${t.Vt(w(n))}`),t.en.initialStateIncomplete;A=n,D.set(n,1);let e=u.satisfiesConstraints(n),r=e?l.getFingerprint(n):0n,o=e?_(r,0):0;if(e&&o===0&&k.push({state:n,fingerprint:r}),o!==0)continue;let c=()=>s.alias===void 0?u.toRecord(n):u.evaluateAlias(s.alias,n,n,i),f=a?u.getViolatedInvariants(n):[u.findViolatedInvariant(n)].filter(e=>e!==void 0);for(let e of f){if(d(t.en.invariantViolatedInitial,`Invariant ${e.name} is violated by the initial state:\n${t.Vt(c())}`),!a)return t.en.invariantViolatedInitial;S.continuedCode=t.en.invariantViolatedInitial}let p=u.findFailedInitialPredicate(n);if(p)return d(t.en.propertyViolatedInitial,`Property ${p.name} is violated by the initial state:\n${t.Vt(c())}`),t.en.propertyViolatedInitial}return 0},te=(n,r)=>{let i=[];try{return t.$(n.expression,r,c,n=>{if(i.length===t.qt())throw new e.I;return i.push(n.state),!1},n.scope),{successors:i,incomplete:void 0}}catch(t){if(!(t instanceof e.C))throw t;return{successors:i,incomplete:t}}},ne=(n,r,i)=>{try{let e=i?u.findViolatedInvariant(r,n):void 0;if(e)return{code:t.en.invariantViolatedBehavior,text:`Invariant ${e.name} is violated.`,isViolated:!0};let a=u.findViolatedActionProperty(n,r);return a&&{code:t.en.actionPropertyViolatedBehavior,text:`Action property ${a.name} is violated.`,isViolated:!0}}catch(n){if(!(n instanceof e.b)||!t.dn(n))throw n;return{code:t.cn(n,!0).code,text:n.message.slice(0,n.message.indexOf(`
|
|
21
|
-
`)),isViolated:!1}}},j=[],M=[],re=(e,n,i,a,o)=>{d(e,n,i),d(t.en.behaviorUpToThisPoint,`The behavior up to this point is:`);let s=[...j.slice(0,a+1).map(e=>e.state),...o?[o]:[]];r({kind:`behavior`,states:s.map(w),isInvariant:e===t.en.invariantViolatedBehavior})},ie=(r,i,o)=>{let c=j[r],d=c.state,f=!0,p=!0,h=!0,g,v=(e,t,n)=>(C(c,n,e)&&re(e,t,t,r,g),h);O=d;try{for(let i of m){let s=te(i,d),c=s.incomplete,C=s.successors.length+ +!!c;x+=C,f&&=C===0;for(let n of s.successors){g=n,D.set(n,r+2);let i=u.satisfiesConstraints(n,d)&&u.satisfiesActionConstraints(d,n),s=i?l.getFingerprint(n):0n,c=i?_(s,0):0;if(i&&(p&&=(c&1)==1,h&&=!b(c),!y(c))){if(o.length===t.qt())throw new e.I;o.push({state:n,fingerprint:s})}let f=ne(d,n,c===0);if(f?.isViolated&&a)re(f.code,f.text,f.text,r,n),S.continuedCode=f.code;else if(f)return v(f.code,f.text,!f.isViolated)}if(c)return g=c.state,v(t.en.incompleteSuccessor,t.p(c.variables,i.name,m.length,n.version),!1);g=void 0}return f&&s.checkDeadlock?v(t.en.deadlockReached,`Deadlock reached.`,!1):((p||i&&h)&&_(c.fingerprint,1),h)}catch(n){let i=e.tt(n)?new e.P:n;if(!(i instanceof e.b))throw n;let a=i instanceof e.P;if(C(c,!a,a?t.en.stackOverflow:t.en.general)){let e=He(`computing the set of next states`,i);re(a?t.en.stackOverflow:t.en.general,a?i.message:`${e}${i.message}`,a?i.message:`${e}${t.in(i.message,!0)}`,r,g)}throw i}},ae=(e,t)=>{for(;e.length>0;){let n=v(e[0].fingerprint);if(!y(n)&&t<n>>>2)return!0;e[0]=e[e.length-1],e.pop()}return!1},N=n=>{let r=[...k];S.stopCode=`searching`,S.isMoreLevel=!1;let i=0;try{for(;S.stopCode===`searching`;){for(;r.length>0&&y(v(r[0].fingerprint));)r[0]=r[r.length-1],r.pop();if(r.length===0){S.stopCode=`done`;return}j[0]=r[0],M[0]=[],i=0;let e=n<2,t=ie(0,e,M[0]);for(S.isMoreLevel||=!t,i=1;!e;){if(!ae(M[i-1],i)){let e=j[i-1];if(h.set(e.fingerprint,v(e.fingerprint)&-3|g.leveled),i===1)break;i--;continue}j[i]=M[i-1][0],M[i]=[];let e=i>=n-1,t=ie(i,e,M[i]);if(S.isMoreLevel||=!t,i++,e)break}}}catch(n){if(!(n instanceof e.b))throw n;if(S.stopCode=`error`,C(j[i],!0,t.en.general)){let e=He(``,n);d(t.en.general,`${e}${n.message}`,`${e}${t.in(n.message,!0)}`)}}},oe=n=>{let i=t.G(c);try{if(m.every(e=>{let r=[];return t.ot([e],n.state,i,e=>r.push(e)),x+=r.length,r.every(e=>e.every(e=>e!==void 0)&&u.checkReplayedSuccessor(n.state,e,i,()=>_(l.getFingerprint(e),0)===0))}))return}catch(t){if(!(t instanceof e.b)&&!e.tt(t))throw t}r({kind:`nested-expressions`,callStack:i.callStack?.expressions??[]})},se=t=>{T();let n=[t,S.errorCode,S.continuedCode].find(e=>e!==0);return n===void 0?e.nt.success:e.it(n)},P=()=>{try{return{code:ee(),error:void 0}}catch(t){let n=e.tt(t)?new e.P:t;if(!(n instanceof e.b))throw t;return{code:0,error:n}}},ce=P();if(ce.error){let r=ce.error,i=t.dn(r)&&r.cause instanceof e.b?r.cause:r,a=A,o=a?``:He(`computing initial states`,i),s=a?`\nWhile working on the initial state:\n${t.Vt(w(a))}`:``;d(a?t.en.initialState:t.en.general,`${o}${i.message}${s}`,`${o}${t.in(i.message,!0)}${s}`),x=0,k.length=0;let c=P().error!==void 0;return c&&d(t.en.nestedExpression,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\ntlc2.tool.impl.FastTool@${(Number(BigInt.asUintN(28,t.kt([n.source])))|268435456).toString(16)}`),T(),c?e.nt.specEvaluationFailure:e.Q(i)}if(ce.code!==0)return e.it(ce.code);if(d(t.en.depthFirstInitGenerated,`Finished computing initial states: ${x} states generated, with ${k.length} of them distinct.`,void 0,!1),m.length===0)return E(),se(0);let le=!1,ue=t.en.general;for(let e=2;e<=n.maxDepth;e++){if(le){let e=S.errorEntry;!e&&S.continuedCode===0&&(ue=0,E()),e&&S.isKeepingCallStack&&oe(e);break}if(d(t.en.depthFirstLevel,`Starting level ${e}: ${x} states generated, ${h.size} distinct states found.`,void 0,!1),g.level++,g.leveled=2-g.leveled,N(e),S.isDone=!1,ue=S.isKeepingCallStack?0:S.errorCode,ue!==0)return se(ue);le=S.stopCode===`error`||!S.isMoreLevel}return se(ue)},We=/* @__PURE__ */ new Set([t.en.invariantEvaluationFailed,t.en.actionPropertyEvaluationFailed,t.en.incompleteSuccessor]),Ge=2147483647,Ke=(e,n)=>e.every((e,r)=>t.Zt(e,n[r])),qe=e=>{let t=[];for(let n=e;n;n=n.predecessor){let e=n.predecessor;e&&Ke(n.state,e.state)||t.unshift(n)}return t.forEach((e,n)=>{e.predecessor=t[n-1],e.level=n+1}),t},Je=(e,t,n)=>{let r=e.map(e=>t(e.state)),i=/* @__PURE__ */ new Map,a=[],o=[];r.forEach((t,n)=>{if(i.has(t)||(i.set(t,a.length),a.push(e[n].state),o.push([])),n===0)return;let s=i.get(r[n-1])??0,c=i.get(t)??0;s!==c&&!o[s].includes(c)&&o[s].push(c)});let s=n(o,a);if(!s)return;s.addInitialState(0,a[0]),a.forEach((e,t)=>s.addState(t,e,o[t].map(e=>({index:e,state:a[e]}))));let c=s.findViolation();if(!c)return;let l=e=>e.filter((t,n)=>n===0||t!==e[n-1]).length,u=[...c.prefix,...c.cycle],d=l(u),f=l(u.slice(0,c.prefix.length+1));return{length:d,loopStart:r[d-1]===t(a[u[c.prefix.length]])?d-1:f-1,properties:s.getViolatedProperties(e.slice(0,d).map(e=>e.state),f-1)}},Ye=(e,t,n,r,i)=>{let a=t.map(()=>/* @__PURE__ */ new Map),o=t=>e===`rlaction`?t.action:r(t.state),s=e=>i(e.predecessor?.state,e.state,-10);return{getNextActionIndex:r=>{if(e===`random`)return Math.floor(n.nextDouble()*t.length);let i=o(r);a.forEach(e=>{e.has(i)||e.set(i,0)});let s=a.map(e=>Math.exp(e.get(i)??0)),c=s.reduce((e,t)=>e+t,0),l=s.map((e,t)=>({index:t,weight:e/c})).sort((e,t)=>t.weight-e.weight),u=n.nextDouble(),d=0;return(l.find((e,t)=>(d=t===0?e.weight:d+e.weight,d>=u))??l[l.length-1]).index},markDisabled:(t,n)=>{e!==`random`&&(e===`rlaction`&&s(n),a[t].set(o(n),-Number.MAX_VALUE))},learnTrace:e=>{for(let n=e;n.predecessor;n=n.predecessor){let e=o(n),r=a.reduce((t,n)=>Math.max(t,n.get(e)??-Number.MAX_VALUE),-Number.MAX_VALUE),i=a[t.indexOf(n.action)],c=o(n.predecessor);i.set(c,.7*(i.get(c)??0)+.3*(s(n)+.7*r))}}}},Xe=n=>{let r=n.onSimulation,i=t.m(n),a=i.config,o=i.specification,s=i.environment,c=s.runtime,l=i.search,u=n.seed??0n,d=n.traceDepth===-1?Ge:n.traceDepth,f=n.traceCount??(1n<<63n)-1n,p=t.mt(u);for(let e=0n;e<n.aril;e++)p.nextDouble();let m=t.mt(p.nextLong()),h={generatedStates:0,traces:0,levelMean:0,levelM2:0,seed:u,aril:n.aril},g=(e,t,n=t,i=!0)=>r({kind:`message`,code:e,isError:i,message:t,toolMessage:n}),_=()=>r({kind:`summary`,statistics:{...h}}),v=/* @__PURE__ */ new WeakMap,y=i.getDescription(),b=y.inits,x=y.actions,S=0,C=0;if(c.getLevel=e=>v.get(e)?.level??0,c.getBehavior=e=>{let t=v.get(e);return t?qe(t).map(e=>e.state):[e]},c.getSimulationValue=(r,i)=>{let o=i&&v.get(i);switch(r){case`diameter`:return C===0?0:S+1;case`generated`:case`distinct`:case`queue`:throw new e.k(`TLCGet(${r}) was undefined.`);case`action`:return o&&t.M(o.action);case`config`:return t.Ft([[`mode`,n.isGenerating?`generate`:`simulate`],[`depth`,d===Ge?-1:d],[`traces`,Number(BigInt.asIntN(32,f))],[`deadlock`,a.checkDeadlock],[`seed`,String(u)],[`aril`,String(n.aril)],[`worker`,1],[`install`,`unknown`],[`sched`,n.scheduler]]);case`stats`:{let e=/* @__PURE__ */ new Map;for(let t=o;t&&t.level>1;t=t.predecessor)e.set(t.action.name,(e.get(t.action.name)??0)+1);return t.Ft([[`traces`,h.traces],[`duration`,Math.floor((Date.now()-c.startedAt)/1e3)],[`generated`,h.generatedStates],[`behavior`,t.Ft([[`actions`,t.Ft([...e])],[`id`,C]])],[`worker`,0],[`distinct`,-1],[`distinctvalues`,-1],[`retries`,-1],[`actions`,t.Ft([])],[`levelmean`,h.levelMean],[`levelvariance`,Math.round(h.levelM2/(h.traces+1))]])}}},c.isStarted=!0,!l)throw new e.B(`tla-ts can't simulate a specification without variables`);let w=e=>{let r=l.findPostconditionViolation(e);if(r)return r.counts!==void 0&&(n.onPrint??console.log)(r.counts),g(r.code,r.message,t.rn(r.code,r.message,!0)),r},T=l.properties.liveness,E=(n,r)=>e.ot(()=>t.fn(()=>t.E(T,l.spec.temporals,s,{getFingerprint:e=>Number(BigInt.asIntN(32,c.getFingerprint(e.state))),getSuccessors:e=>n[e].map(e=>({index:e,state:r[e]}))}))),D=E([],[])?.branches;D&&n.onProgress?.({kind:`liveness-prepared`,branches:D});let O=t.h(o.assumptions,s,g);if(O!==void 0)return O;let k=b[b.length-1],A=(e,t,n)=>{let r={state:e,action:t,predecessor:n,level:(n?.level??0)+1};return v.set(e,r),r},ee=e=>l.toRecord(e.map(e=>e??t.Pt(`null`))),te=e=>e.map((r,i)=>({action:r.action.name,label:t.O(r.action,n.version,r.level===1),state:a.alias===void 0||!r.state.every(e=>e!==void 0)?ee(r.state):l.evaluateAlias(a.alias,r.state,(e[i+1]??r).state,n.isTool??!1)})),ne=e=>t.pt(e.map(e=>l.toRecord(e.state)),e.slice(1).map(e=>t.M(e.action)),void 0),j=[],M=e=>e.every(e=>e!==void 0),re=[],ie=(n,r)=>{let i=Ze(n);if(!r)return g(t.en.general,`${Qe(i)}${i.message}`,`${Qe(i)}${t.in(i.message,!0)}`),_(),e.nt.error;let a=t.cn(i,!1),o=`While working on the initial state:\n${t.Vt(ee(r))}`;return g(t.en.initialState,`${a.message}\n${o}`,`${a.toolMessage}\n${o}`),_(),e.it(t.en.initialState)},ae=l.spec.init,N=n=>{if(re.length===t.qt())throw new e.I;return re.push(n),!1};try{ae&&t.Q(ae,s,N,l.spec.scope,N)}catch(e){return ie(e,void 0)}h.generatedStates=re.length,g(t.en.computingInitProgress,`Computed ${re.length} initial states...`,void 0,!1);for(let n of re){if(!M(n))return g(t.en.initialStateIncomplete,`State is not completely specified by the initial predicate:\n${t.Vt(ee(n))}`),e.nt.error;try{let r=A(n,k,void 0),i=l.findViolatedInvariant(n);if(i){let n=te([r])[0].state;return g(t.en.invariantViolatedInitial,`Invariant ${i.name} is violated by the initial state:\n${t.Vt(n)}`),c.counterExample=ne([r]),w(!0),e.nt.safetyViolation}let a=l.findFailedInitialPredicate(n);if(a){let n=te([r])[0].state;return g(t.en.propertyViolatedInitial,`Property ${a.name} is violated by the initial state:\n${t.Vt(n)}`),c.counterExample=ne([r]),w(!0),e.nt.livenessViolation}l.satisfiesConstraints(n)&&(l.trackStatePossible(n),j.push(r))}catch(e){return ie(e,n)}}if(re.length===0)return g(t.en.noInitialStates,`There is no state satisfying the initial state predicate.`),e.nt.error;if(j.length===0)return g(t.en.noInitialStatesInModel,`There is no state satisfying the initial state predicate and the state-constraint(s).`),e.nt.error;g(t.en.initGenerated1,`Finished computing initial states: ${j.length} distinct state generated at ${t.an(/* @__PURE__ */ new Date)}.`,void 0,!1);let oe=(e,t,n)=>({code:e,message:t,toolMessage:t,node:n,isException:!1,isSummarized:!0}),se=(r,i)=>{let a=[],o;c.deferred=void 0;try{t.$(i.expression,r.state,s,n=>{let s=A(n.state,i,r);s.deferred=c.deferred,c.deferred=void 0,h.generatedStates++;try{let e=l.findViolatedInvariant(s.state,r.state);if(e)return o=oe(t.en.invariantViolatedBehavior,`Invariant ${e.name} is violated.`,s),!0;let n=l.findViolatedActionProperty(r.state,s.state);if(n)return o=oe(t.en.actionPropertyViolatedBehavior,`Action property ${n.name} is violated.`,s),!0}catch(n){if(!(n instanceof e.b)||!t.dn(n))throw n;let r=t.cn(n,!0);return o={...oe(r.code,r.message,s),toolMessage:r.toolMessage},!0}if(!l.satisfiesConstraints(s.state,r.state)||(l.trackStatePossible(s.state),!l.satisfiesActionConstraints(r.state,s.state)))return!1;if(l.trackActionPossible(r.state,s.state),a.length===t.qt())throw new e.I;return a.push(s),!1},i.scope,n.isGenerating?m:void 0)}catch(o){if(!(o instanceof e.C))throw o;let s=A(o.state.map(e=>e??t.Pt(`null`)),i,r),c=t.p(o.variables,i.name,x.length,n.version);return{successors:a,error:oe(t.en.incompleteSuccessor,c,s)}}return{successors:a,error:o}},P=j[0],ce=Ye(n.scheduler,x,m,c.getFingerprint,l.getReward),le=e=>{if(T.length===0)return;let r=qe(e),i=Je(r,c.getFingerprint,E);if(!i)return;let a=r[i.length];return{name:i.properties[0],properties:i.properties,trace:te(r.slice(0,i.length)),loopStart:i.loopStart,loopLabel:a&&t.O(a.action,n.version,a.level===1)}},ue=()=>{P=j[Math.floor(m.nextDouble()*j.length)];for(let e=0;e<d;e++){if(c.isStopped)return`stopped`;let e=ce.getNextActionIndex(P),n=t.ht(m),r=[];for(let t=0;t<x.length;t++){let t=se(P,x[e]);if(t.error)return t.error;if(r=t.successors,r.length>0)break;ce.markDisabled(e,P),e=(e+n)%x.length}if(r.length===0){if(a.checkDeadlock)return oe(t.en.deadlockReached,`Deadlock reached.`,P);break}P=r[Math.floor(m.nextDouble()*r.length)],P.deferred?.(P.state)}if(c.isStopped)return`stopped`;let e=le(P);if(e)return{...oe(t.en.temporalPropertyViolated,``,P),isException:!0,violation:e};let r=Math.min(d,P.level),i=r-h.levelMean;h.levelMean+=Math.trunc(i/Math.max(h.traces,1)),h.levelM2+=i*(r-h.levelMean),n.scheduler===`rl`&&ce.learnTrace(P)},de=(n,r)=>{let i=Ze(n),a=t.un(i)?void 0:t.sn(i.message);if(a)return{code:a.code,message:i.message,toolMessage:t.rn(a.code,i.message,!0),node:r,isException:!0,isSummarized:!1};let o=Qe(i);return{code:t.en.general,message:`${o}${i.message}`,toolMessage:`${o}${t.in(i.message,!0)}`,node:r,isException:!0,isSummarized:o!==e.G}},fe=t.mt(u);c.getRandom=()=>fe;let pe=[],me=n.isContinued??!1;for(;;){h.traces++,C=h.traces;let e=(()=>{try{return ue()}catch(e){return de(e,P)}})();if(e===`stopped`||(S++,e&&pe.push(e),e?.isException)||BigInt(S)>=f)break;if(e!==void 0&&(!me||We.has(e.code))&&n.traceCount===void 0){h.traces++;break}}let he=pe.findIndex(e=>e.isException||!me||We.has(e.code)),ge=he===-1?pe:pe.slice(0,he+1);ge.forEach(e=>{e.violation?(n.onProgress?.({kind:`violation`,status:`liveness-violation`,violation:e.violation}),_()):(g(e.code,e.message,e.toolMessage),r({kind:`behavior`,trace:te(qe(e.node)),isLastStateOnly:d===Ge}),e.isSummarized&&_())});let F=ge[ge.length-1],_e=F?e.it(F.code):e.nt.success;F&&(c.counterExample=ne(qe(F.node)));let ve=w(F!==void 0),ye=ve?e.it(ve.code):e.nt.success,be=Math.max(_e,ye);return r({kind:`progress`,statistics:{...h}}),be===e.nt.success&&_(),be},Ze=t=>{if(e.tt(t))return new e.P;if(!(t instanceof e.b))throw t;return t},Qe=n=>t.un(n)?e.W:e.G,$e={builtin:1,number:2,string:3,ident:4,added:5},et=()=>({labelFlag:!1,labelRoot:`Lbl_`,fairnessOption:``,checkTermination:!1,specOption:!1,myspecOption:!1,inputVersionNumber:1903}),tt=e=>{let t=0,n=0,r=!1;for(let i of e)if(i===`.`)r=!0;else if(i<`0`||i>`9`||(t=10*t+Number(i),r&&(n+=1),n>3))return-1;return t*10**Math.max(0,3-n)},nt=[`unfair`,`wf`,`sf`],I=()=>({col:0,line:0,macroCol:0,macroLine:-1,lbl:``}),rt=e=>e.macroLine<0?`line ${e.line}, column ${e.col}`:`line ${e.line}, column ${e.col} of macro called at line ${e.macroLine}, column ${e.macroCol}`,it=t=>{if(t.kind!==`LabeledStmt`)throw new e.c(`ClassCastException: ${t.kind}`);return t},at=(t,n)=>{if(n<0||n>=t.length)throw new e.c(`ArrayIndexOutOfBoundsException: ${n}`);return t[n]},ot=(e,t,n)=>({string:e,column:t,type:n}),st=e=>e.type===$e.string?e.string.length+2:e.string.length,ct=(e=[])=>({tokens:e,anchorTokens:void 0,anchorTokCol:void 0}),lt=e=>{for(;e.tokens.length>0&&e.tokens[0].length===0;)e.tokens.shift();for(;e.tokens.length>0&&e.tokens[e.tokens.length-1].length===0;)e.tokens.pop();let t=Math.min(999999,...e.tokens.filter(e=>e.length>0).map(e=>e[0].column));e.tokens.forEach(e=>e.forEach(e=>{e.column-=t}));let n=[],r=[];e.tokens.forEach((t,i)=>{if(r.push(0),n.push(void 0),t.length===0)return;let a=t[0].column,o=e.tokens.slice(0,i).findLast(e=>e.length>0&&e[0].column<=a);if(o===void 0)return;let s=o.findIndex((e,t)=>t>0&&e.column>a),c=o[(s===-1?o.length:s)-1];n[i]=c,r[i]=c.column}),e.anchorTokens=n,e.anchorTokCol=r},ut=e=>{let t=ct(e);return lt(t),t},dt=t=>{let n=t.anchorTokens,r=t.anchorTokCol;if(n===void 0||r===void 0)throw new e.c(`NullPointerException: TLAExpr.renormalize`);t.tokens.forEach((t,i)=>{let a=n[i];if(a===void 0)return;let o=a.column-r[i];if(r[i]=a.column,o<0)throw new e.s(`TLAExpr.renormalize() found anchor has moved to left.`);t.forEach(e=>{e.column+=o})})},ft=e=>ut(e.tokens.map(e=>e.map(e=>({...e})))),pt=(e,t,n)=>{let r=t.tokens.length;e.tokens.splice(0,0,...t.tokens.slice(0,r-1));let i=t.tokens[r-1],a=e.tokens[r-1],o=i[i.length-1],s=o.column+st(o)+n;a.forEach(e=>{e.column+=s}),a.splice(0,0,...i);let c=[...t.anchorTokens??[]],l=[...t.anchorTokCol??[]];for(let t=r;t<e.tokens.length;t++)c.push(e.anchorTokens?.[t-r+1]),l.push(e.anchorTokCol?.[t-r+1]??0);e.anchorTokens=c,e.anchorTokCol=l,dt(e)},mt=e=>e.tokens.length===1&&e.tokens[0].length===1,ht=(e,t)=>at(at(e.tokens,t.line),t.item),gt=(t,n,r)=>{if(t.tokens.length<=n.line)throw new e.o(`TLAExpr.StepCoord called with line too big`);if(t.tokens[n.line].length<=n.item)throw new e.o(`TLAExpr.StepCoord called with col too big`);let i={line:n.line,item:n.item};for(let e=0;e<r;e++)if(i.item+=1,t.tokens[i.line].length===i.item){for(i.item=0,i.line+=1;i.line<t.tokens.length&&t.tokens[i.line].length===0;)i.line+=1;if(i.line===t.tokens.length)return}return i},_t=(e,t,n)=>{for(let r=e.tokens.length===0?void 0:{...n};r!==void 0;){let n=ht(e,r),i=n.type===$e.string;if(!i&&n.string===t)return r;let a=!i&&(n.string===`[`||n.string===`,`)?gt(e,r,2):void 0,o=a===void 0?void 0:ht(e,a),s=o!==void 0&&o.type!==$e.string&&[`:`,`|->`,`↦`].includes(o.string),c=i?1:n.string===`.`?2:s?3:1;r=gt(e,r,c)}},vt=(e,t,n,r)=>{let i=ht(e,n);if(mt(e)){let n=ft(t);e.tokens=n.tokens,e.anchorTokens=n.anchorTokens,e.anchorTokCol=n.anchorTokCol;return}let a=e.tokens[n.line],o=n.item+1<a.length?a[n.item+1].column-(i.column+st(i)):0,s=a.splice(n.item+1),c=n.line,l=+!!r+i.column,u=!r,d=()=>e.tokens[c];if(mt(t)){let e=t.tokens[0][0];i.string=e.string,i.type=e.type}else{r&&(i.string=`(`,i.type=$e.builtin);let n=ft(t);if(n.tokens.forEach((t,r)=>{if(t.forEach(e=>{e.column+=l,u?(i.string=e.string,i.type=e.type,u=!1):d().push(e)}),r+1>=n.tokens.length)return;l=0,c+=1;let a=c;e.tokens.splice(a,0,[]);let o=e.anchorTokens??[],s=e.anchorTokCol??[];e.anchorTokens=e.tokens.map((e,t)=>t<a?o[t]:t===a?n.anchorTokens?.[r+1]:o[t-1]),e.anchorTokCol=e.tokens.map((e,t)=>t<a?s[t]:t===a?n.anchorTokCol?.[r+1]??0:s[t-1])}),r){let e=d()[d().length-1];d().push(ot(`)`,e.column+st(e),$e.builtin))}}let f=d(),p={line:c,item:f.length-1};if(s.length>0){let e=f[f.length-1],t=e.column+st(e)+o-s[0].column;s.forEach(e=>{e.column+=t,f.push(e)})}return dt(e),gt(e,p,1)},yt=(t,n,r,i=!0)=>{let a=r.map(e=>_t(t,e,{line:0,item:0}));for(;;){let o=a.reduce((e,t,n)=>t!==void 0&&(e===void 0||t.line<e.position.line||t.line===e.position.line&&t.item<e.position.item)?{index:n,position:t}:e,void 0);if(o===void 0)return;let s=gt(t,o.position,1),c=vt(t,n[o.index],o.position,i);a[o.index]=c===void 0?void 0:_t(t,r[o.index],c),a.forEach((t,n)=>{if(n!==o.index&&t!==void 0&&c!==void 0){if(s===void 0)throw new e.c(`NullPointerException: TLAExpr.substituteForAll`);t.line===o.position.line&&(t.item+=c.item-s.item),t.line+=c.line-s.line}})}},bt=(e,t,n)=>{let r=ft(e);return yt(r,t,n),r},xt=(e,t,n)=>e.map(e=>bt(e,t,n)),St=(e,t)=>{let n=e=>t===`1.7.4`?``:`(col${e.column}) `,r=e.tokens.map(e=>e.map(e=>e.type===$e.string?`"\\"", "${e.string}", "\\""`:e.string===`\\/`?`"${n(e)}\\\\/"`:e.string.startsWith(`\\`)?`"\\${e.string}"`:e.string===`/\\`?`"${n(e)}/\\\\"`:`"${e.string}"`)),i=r.findIndex(e=>e.length>0);return`<< ${r.map((e,t)=>{let n=i!==-1&&t>i;return e.map((e,t)=>n||t>0?`, ${e}`:e).join(``)}).join(`
|
|
21
|
+
`)),isViolated:!1}}},j=[],M=[],re=(e,n,i,a,o)=>{d(e,n,i),d(t.en.behaviorUpToThisPoint,`The behavior up to this point is:`);let s=[...j.slice(0,a+1).map(e=>e.state),...o?[o]:[]];r({kind:`behavior`,states:s.map(w),isInvariant:e===t.en.invariantViolatedBehavior})},ie=(r,i,o)=>{let c=j[r],d=c.state,f=!0,p=!0,h=!0,g,v=(e,t,n)=>(C(c,n,e)&&re(e,t,t,r,g),h);O=d;try{for(let i of m){let s=te(i,d),c=s.incomplete,C=s.successors.length+ +!!c;x+=C,f&&=C===0;for(let n of s.successors){g=n,D.set(n,r+2);let i=u.satisfiesConstraints(n,d)&&u.satisfiesActionConstraints(d,n),s=i?l.getFingerprint(n):0n,c=i?_(s,0):0;if(i&&(p&&=(c&1)==1,h&&=!b(c),!y(c))){if(o.length===t.qt())throw new e.I;o.push({state:n,fingerprint:s})}let f=ne(d,n,c===0);if(f?.isViolated&&a)re(f.code,f.text,f.text,r,n),S.continuedCode=f.code;else if(f)return v(f.code,f.text,!f.isViolated)}if(c)return g=c.state,v(t.en.incompleteSuccessor,t.p(c.variables,i.name,m.length,n.version),!1);g=void 0}return f&&s.checkDeadlock?v(t.en.deadlockReached,`Deadlock reached.`,!1):((p||i&&h)&&_(c.fingerprint,1),h)}catch(n){let i=e.tt(n)?new e.P:n;if(!(i instanceof e.b))throw n;let a=i instanceof e.P;if(C(c,!a,a?t.en.stackOverflow:t.en.general)){let e=He(`computing the set of next states`,i);re(a?t.en.stackOverflow:t.en.general,a?i.message:`${e}${i.message}`,a?i.message:`${e}${t.in(i.message,!0)}`,r,g)}throw i}},ae=(e,t)=>{for(;e.length>0;){let n=v(e[0].fingerprint);if(!y(n)&&t<n>>>2)return!0;e[0]=e[e.length-1],e.pop()}return!1},N=n=>{let r=[...k];S.stopCode=`searching`,S.isMoreLevel=!1;let i=0;try{for(;S.stopCode===`searching`;){for(;r.length>0&&y(v(r[0].fingerprint));)r[0]=r[r.length-1],r.pop();if(r.length===0){S.stopCode=`done`;return}j[0]=r[0],M[0]=[],i=0;let e=n<2,t=ie(0,e,M[0]);for(S.isMoreLevel||=!t,i=1;!e;){if(!ae(M[i-1],i)){let e=j[i-1];if(h.set(e.fingerprint,v(e.fingerprint)&-3|g.leveled),i===1)break;i--;continue}j[i]=M[i-1][0],M[i]=[];let e=i>=n-1,t=ie(i,e,M[i]);if(S.isMoreLevel||=!t,i++,e)break}}}catch(n){if(!(n instanceof e.b))throw n;if(S.stopCode=`error`,C(j[i],!0,t.en.general)){let e=He(``,n);d(t.en.general,`${e}${n.message}`,`${e}${t.in(n.message,!0)}`)}}},oe=n=>{let i=t.G(c);try{if(m.every(e=>{let r=[];return t.ot([e],n.state,i,e=>r.push(e)),x+=r.length,r.every(e=>e.every(e=>e!==void 0)&&u.checkReplayedSuccessor(n.state,e,i,()=>_(l.getFingerprint(e),0)===0))}))return}catch(t){if(!(t instanceof e.b)&&!e.tt(t))throw t}r({kind:`nested-expressions`,callStack:i.callStack?.expressions??[]})},P=t=>{T();let n=[t,S.errorCode,S.continuedCode].find(e=>e!==0);return n===void 0?e.nt.success:e.it(n)},se=()=>{try{return{code:ee(),error:void 0}}catch(t){let n=e.tt(t)?new e.P:t;if(!(n instanceof e.b))throw t;return{code:0,error:n}}},F=se();if(F.error){let r=F.error,i=t.dn(r)&&r.cause instanceof e.b?r.cause:r,a=A,o=a?``:He(`computing initial states`,i),s=a?`\nWhile working on the initial state:\n${t.Vt(w(a))}`:``;d(a?t.en.initialState:t.en.general,`${o}${i.message}${s}`,`${o}${t.in(i.message,!0)}${s}`),x=0,k.length=0;let c=se().error!==void 0;return c&&d(t.en.nestedExpression,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\ntlc2.tool.impl.FastTool@${(Number(BigInt.asUintN(28,t.kt([n.source])))|268435456).toString(16)}`),T(),c?e.nt.specEvaluationFailure:e.Q(i)}if(F.code!==0)return e.it(F.code);if(d(t.en.depthFirstInitGenerated,`Finished computing initial states: ${x} states generated, with ${k.length} of them distinct.`,void 0,!1),m.length===0)return E(),P(0);let ce=!1,le=t.en.general;for(let e=2;e<=n.maxDepth;e++){if(ce){let e=S.errorEntry;!e&&S.continuedCode===0&&(le=0,E()),e&&S.isKeepingCallStack&&oe(e);break}if(d(t.en.depthFirstLevel,`Starting level ${e}: ${x} states generated, ${h.size} distinct states found.`,void 0,!1),g.level++,g.leveled=2-g.leveled,N(e),S.isDone=!1,le=S.isKeepingCallStack?0:S.errorCode,le!==0)return P(le);ce=S.stopCode===`error`||!S.isMoreLevel}return P(le)},We=/* @__PURE__ */ new Set([t.en.invariantEvaluationFailed,t.en.actionPropertyEvaluationFailed,t.en.incompleteSuccessor]),Ge=2147483647,Ke=(e,n)=>e.every((e,r)=>t.Zt(e,n[r])),qe=e=>{let t=[];for(let n=e;n;n=n.predecessor){let e=n.predecessor;e&&Ke(n.state,e.state)||t.unshift(n)}return t.forEach((e,n)=>{e.predecessor=t[n-1],e.level=n+1}),t},Je=(e,t,n)=>{let r=e.map(e=>t(e.state)),i=/* @__PURE__ */ new Map,a=[],o=[];r.forEach((t,n)=>{if(i.has(t)||(i.set(t,a.length),a.push(e[n].state),o.push([])),n===0)return;let s=i.get(r[n-1])??0,c=i.get(t)??0;s!==c&&!o[s].includes(c)&&o[s].push(c)});let s=n(o,a);if(!s)return;s.addInitialState(0,a[0]),a.forEach((e,t)=>s.addState(t,e,o[t].map(e=>({index:e,state:a[e]}))));let c=s.findViolation();if(!c)return;let l=e=>e.filter((t,n)=>n===0||t!==e[n-1]).length,u=[...c.prefix,...c.cycle],d=l(u),f=l(u.slice(0,c.prefix.length+1));return{length:d,loopStart:r[d-1]===t(a[u[c.prefix.length]])?d-1:f-1,properties:s.getViolatedProperties(e.slice(0,d).map(e=>e.state),f-1)}},Ye=(e,t,n,r,i)=>{let a=t.map(()=>/* @__PURE__ */ new Map),o=t=>e===`rlaction`?t.action:r(t.state),s=e=>i(e.predecessor?.state,e.state,-10);return{getNextActionIndex:r=>{if(e===`random`)return Math.floor(n.nextDouble()*t.length);let i=o(r);a.forEach(e=>{e.has(i)||e.set(i,0)});let s=a.map(e=>Math.exp(e.get(i)??0)),c=s.reduce((e,t)=>e+t,0),l=s.map((e,t)=>({index:t,weight:e/c})).sort((e,t)=>t.weight-e.weight),u=n.nextDouble(),d=0;return(l.find((e,t)=>(d=t===0?e.weight:d+e.weight,d>=u))??l[l.length-1]).index},markDisabled:(t,n)=>{e!==`random`&&(e===`rlaction`&&s(n),a[t].set(o(n),-Number.MAX_VALUE))},learnTrace:e=>{for(let n=e;n.predecessor;n=n.predecessor){let e=o(n),r=a.reduce((t,n)=>Math.max(t,n.get(e)??-Number.MAX_VALUE),-Number.MAX_VALUE),i=a[t.indexOf(n.action)],c=o(n.predecessor);i.set(c,.7*(i.get(c)??0)+.3*(s(n)+.7*r))}}}},Xe=n=>{let r=n.onSimulation,i=t.m(n),a=i.config,o=i.specification,s=i.environment,c=s.runtime,l=i.search,u=n.seed??0n,d=n.traceDepth===-1?Ge:n.traceDepth,f=n.traceCount??(1n<<63n)-1n,p=t.mt(u);for(let e=0n;e<n.aril;e++)p.nextDouble();let m=t.mt(p.nextLong()),h={generatedStates:0,traces:0,levelMean:0,levelM2:0,seed:u,aril:n.aril},g=(e,t,n=t,i=!0)=>r({kind:`message`,code:e,isError:i,message:t,toolMessage:n}),_=()=>r({kind:`summary`,statistics:{...h}}),v=/* @__PURE__ */ new WeakMap,y=i.getDescription(),b=y.inits,x=y.actions,S=0,C=0,w;if(c.getSuccessorAction=()=>w,c.getLevel=e=>v.get(e)?.level??0,c.getBehavior=e=>{let t=v.get(e);return t?qe(t).map(e=>e.state):[e]},c.getSimulationValue=(r,i)=>{let o=i&&v.get(i);switch(r){case`diameter`:return C===0?0:S+1;case`generated`:case`distinct`:case`queue`:throw new e.k(`TLCGet(${r}) was undefined.`);case`action`:return o&&t.M(o.action);case`config`:return t.Ft([[`mode`,n.isGenerating?`generate`:`simulate`],[`depth`,d===Ge?-1:d],[`traces`,Number(BigInt.asIntN(32,f))],[`deadlock`,a.checkDeadlock],[`seed`,String(u)],[`aril`,String(n.aril)],[`worker`,1],[`install`,`unknown`],[`sched`,n.scheduler]]);case`stats`:{let e=/* @__PURE__ */ new Map;for(let t=o;t&&t.level>1;t=t.predecessor)e.set(t.action.name,(e.get(t.action.name)??0)+1);return t.Ft([[`traces`,h.traces],[`duration`,Math.floor((Date.now()-c.startedAt)/1e3)],[`generated`,h.generatedStates],[`behavior`,t.Ft([[`actions`,t.Ft([...e])],[`id`,C]])],[`worker`,0],[`distinct`,-1],[`distinctvalues`,-1],[`retries`,-1],[`actions`,t.Ft([])],[`levelmean`,h.levelMean],[`levelvariance`,Math.round(h.levelM2/(h.traces+1))]])}}},c.isStarted=!0,!l)throw new e.B(`tla-ts can't simulate a specification without variables`);let T=e=>{let r=l.findPostconditionViolation(e);if(r)return r.counts!==void 0&&(n.onPrint??console.log)(r.counts),g(r.code,r.message,t.rn(r.code,r.message,!0)),r},E=l.properties.liveness,D=(n,r)=>e.ot(()=>t.fn(()=>t.E(E,l.spec.temporals,s,{getFingerprint:e=>Number(BigInt.asIntN(32,c.getFingerprint(e.state))),getSuccessors:e=>n[e].map(e=>({index:e,state:r[e]}))}))),O=D([],[])?.branches;O&&n.onProgress?.({kind:`liveness-prepared`,branches:O});let k=t.h(o.assumptions,s,g);if(k!==void 0)return k;let A=b[b.length-1],ee=(e,t,n)=>{let r={state:e,action:t,predecessor:n,level:(n?.level??0)+1};return v.set(e,r),r},te=e=>l.toRecord(e.map(e=>e??t.Pt(`null`))),ne=e=>e.map((r,i)=>({action:r.action.name,label:t.O(r.action,n.version,r.level===1),state:a.alias===void 0||!r.state.every(e=>e!==void 0)?te(r.state):l.evaluateAlias(a.alias,r.state,(e[i+1]??r).state,n.isTool??!1)})),j=e=>t.pt(e.map(e=>l.toRecord(e.state)),e.slice(1).map(e=>t.M(e.action)),void 0),M=[],re=e=>e.every(e=>e!==void 0),ie=[],ae=(n,r)=>{let i=Ze(n);if(!r)return g(t.en.general,`${Qe(i)}${i.message}`,`${Qe(i)}${t.in(i.message,!0)}`),_(),e.nt.error;let a=t.cn(i,!1),o=`While working on the initial state:\n${t.Vt(te(r))}`;return g(t.en.initialState,`${a.message}\n${o}`,`${a.toolMessage}\n${o}`),_(),e.it(t.en.initialState)},N=l.spec.init,oe=n=>{if(ie.length===t.qt())throw new e.I;return ie.push(n),!1};try{N&&t.Q(N,s,oe,l.spec.scope,oe)}catch(e){return ae(e,void 0)}h.generatedStates=ie.length,g(t.en.computingInitProgress,`Computed ${ie.length} initial states...`,void 0,!1);for(let n of ie){if(!re(n))return g(t.en.initialStateIncomplete,`State is not completely specified by the initial predicate:\n${t.Vt(te(n))}`),e.nt.error;try{let r=ee(n,A,void 0),i=l.findViolatedInvariant(n);if(i){let n=ne([r])[0].state;return g(t.en.invariantViolatedInitial,`Invariant ${i.name} is violated by the initial state:\n${t.Vt(n)}`),c.counterExample=j([r]),T(!0),e.nt.safetyViolation}let a=l.findFailedInitialPredicate(n);if(a){let n=ne([r])[0].state;return g(t.en.propertyViolatedInitial,`Property ${a.name} is violated by the initial state:\n${t.Vt(n)}`),c.counterExample=j([r]),T(!0),e.nt.livenessViolation}l.satisfiesConstraints(n)&&(l.trackStatePossible(n),M.push(r))}catch(e){return ae(e,n)}}if(ie.length===0)return g(t.en.noInitialStates,`There is no state satisfying the initial state predicate.`),e.nt.error;if(M.length===0)return g(t.en.noInitialStatesInModel,`There is no state satisfying the initial state predicate and the state-constraint(s).`),e.nt.error;g(t.en.initGenerated1,`Finished computing initial states: ${M.length} distinct state generated at ${t.an(/* @__PURE__ */ new Date)}.`,void 0,!1);let P=(e,t,n)=>({code:e,message:t,toolMessage:t,node:n,isException:!1,isSummarized:!0}),se=(r,i)=>{let a=[],o;c.deferred=void 0,w=i;try{t.$(i.expression,r.state,s,n=>{let s=ee(n.state,i,r);s.deferred=c.deferred,c.deferred=void 0,h.generatedStates++;try{let e=l.findViolatedInvariant(s.state,r.state);if(e)return o=P(t.en.invariantViolatedBehavior,`Invariant ${e.name} is violated.`,s),!0;let n=l.findViolatedActionProperty(r.state,s.state);if(n)return o=P(t.en.actionPropertyViolatedBehavior,`Action property ${n.name} is violated.`,s),!0}catch(n){if(!(n instanceof e.b)||!t.dn(n))throw n;let r=t.cn(n,!0);return o={...P(r.code,r.message,s),toolMessage:r.toolMessage},!0}if(!l.satisfiesConstraints(s.state,r.state)||(l.trackStatePossible(s.state),!l.satisfiesActionConstraints(r.state,s.state)))return!1;if(l.trackActionPossible(r.state,s.state),a.length===t.qt())throw new e.I;return a.push(s),!1},i.scope,n.isGenerating?m:void 0)}catch(o){if(!(o instanceof e.C))throw o;let s=ee(o.state.map(e=>e??t.Pt(`null`)),i,r),c=t.p(o.variables,i.name,x.length,n.version);return{successors:a,error:P(t.en.incompleteSuccessor,c,s)}}return{successors:a,error:o}},F=M[0],ce=Ye(n.scheduler,x,m,c.getFingerprint,l.getReward),le=e=>{if(E.length===0)return;let r=qe(e),i=Je(r,c.getFingerprint,D);if(!i)return;let a=r[i.length];return{name:i.properties[0],properties:i.properties,trace:ne(r.slice(0,i.length)),loopStart:i.loopStart,loopLabel:a&&t.O(a.action,n.version,a.level===1)}},ue=()=>{F=M[Math.floor(m.nextDouble()*M.length)];for(let e=0;e<d;e++){if(c.isStopped)return`stopped`;let e=ce.getNextActionIndex(F),n=t.ht(m),r=[];for(let t=0;t<x.length;t++){let t=se(F,x[e]);if(t.error)return t.error;if(r=t.successors,r.length>0)break;ce.markDisabled(e,F),e=(e+n)%x.length}if(r.length===0){if(a.checkDeadlock)return P(t.en.deadlockReached,`Deadlock reached.`,F);break}F=r[Math.floor(m.nextDouble()*r.length)],F.deferred?.(F.state)}if(c.isStopped)return`stopped`;let e=le(F);if(e)return{...P(t.en.temporalPropertyViolated,``,F),isException:!0,violation:e};let r=Math.min(d,F.level),i=r-h.levelMean;h.levelMean+=Math.trunc(i/Math.max(h.traces,1)),h.levelM2+=i*(r-h.levelMean),n.scheduler===`rl`&&ce.learnTrace(F)},de=(n,r)=>{let i=Ze(n),a=t.un(i)?void 0:t.sn(i.message);if(a)return{code:a.code,message:i.message,toolMessage:t.rn(a.code,i.message,!0),node:r,isException:!0,isSummarized:!1};let o=Qe(i);return{code:t.en.general,message:`${o}${i.message}`,toolMessage:`${o}${t.in(i.message,!0)}`,node:r,isException:!0,isSummarized:o!==e.G}},fe=t.mt(u);c.getRandom=()=>fe;let pe=[],me=n.isContinued??!1;for(;;){h.traces++,C=h.traces;let e=(()=>{try{return ue()}catch(e){return de(e,F)}})();if(e===`stopped`||(S++,e&&pe.push(e),e?.isException)||BigInt(S)>=f)break;if(e!==void 0&&(!me||We.has(e.code))&&n.traceCount===void 0){h.traces++;break}}let he=pe.findIndex(e=>e.isException||!me||We.has(e.code)),ge=he===-1?pe:pe.slice(0,he+1);ge.forEach(e=>{e.violation?(n.onProgress?.({kind:`violation`,status:`liveness-violation`,violation:e.violation}),_()):(g(e.code,e.message,e.toolMessage),r({kind:`behavior`,trace:ne(qe(e.node)),isLastStateOnly:d===Ge}),e.isSummarized&&_())});let _e=ge[ge.length-1],ve=_e?e.it(_e.code):e.nt.success;_e&&(c.counterExample=j(qe(_e.node)));let ye=T(_e!==void 0),be=ye?e.it(ye.code):e.nt.success,xe=Math.max(ve,be);return r({kind:`progress`,statistics:{...h}}),xe===e.nt.success&&_(),xe},Ze=t=>{if(e.tt(t))return new e.P;if(!(t instanceof e.b))throw t;return t},Qe=n=>t.un(n)?e.W:e.G,$e={builtin:1,number:2,string:3,ident:4,added:5},et=()=>({labelFlag:!1,labelRoot:`Lbl_`,fairnessOption:``,checkTermination:!1,specOption:!1,myspecOption:!1,inputVersionNumber:1903}),tt=e=>{let t=0,n=0,r=!1;for(let i of e)if(i===`.`)r=!0;else if(i<`0`||i>`9`||(t=10*t+Number(i),r&&(n+=1),n>3))return-1;return t*10**Math.max(0,3-n)},nt=[`unfair`,`wf`,`sf`],I=()=>({col:0,line:0,macroCol:0,macroLine:-1,lbl:``}),rt=e=>e.macroLine<0?`line ${e.line}, column ${e.col}`:`line ${e.line}, column ${e.col} of macro called at line ${e.macroLine}, column ${e.macroCol}`,it=t=>{if(t.kind!==`LabeledStmt`)throw new e.c(`ClassCastException: ${t.kind}`);return t},at=(t,n)=>{if(n<0||n>=t.length)throw new e.c(`ArrayIndexOutOfBoundsException: ${n}`);return t[n]},ot=(e,t,n)=>({string:e,column:t,type:n}),st=e=>e.type===$e.string?e.string.length+2:e.string.length,ct=(e=[])=>({tokens:e,anchorTokens:void 0,anchorTokCol:void 0}),lt=e=>{for(;e.tokens.length>0&&e.tokens[0].length===0;)e.tokens.shift();for(;e.tokens.length>0&&e.tokens[e.tokens.length-1].length===0;)e.tokens.pop();let t=Math.min(999999,...e.tokens.filter(e=>e.length>0).map(e=>e[0].column));e.tokens.forEach(e=>e.forEach(e=>{e.column-=t}));let n=[],r=[];e.tokens.forEach((t,i)=>{if(r.push(0),n.push(void 0),t.length===0)return;let a=t[0].column,o=e.tokens.slice(0,i).findLast(e=>e.length>0&&e[0].column<=a);if(o===void 0)return;let s=o.findIndex((e,t)=>t>0&&e.column>a),c=o[(s===-1?o.length:s)-1];n[i]=c,r[i]=c.column}),e.anchorTokens=n,e.anchorTokCol=r},ut=e=>{let t=ct(e);return lt(t),t},dt=t=>{let n=t.anchorTokens,r=t.anchorTokCol;if(n===void 0||r===void 0)throw new e.c(`NullPointerException: TLAExpr.renormalize`);t.tokens.forEach((t,i)=>{let a=n[i];if(a===void 0)return;let o=a.column-r[i];if(r[i]=a.column,o<0)throw new e.s(`TLAExpr.renormalize() found anchor has moved to left.`);t.forEach(e=>{e.column+=o})})},ft=e=>ut(e.tokens.map(e=>e.map(e=>({...e})))),pt=(e,t,n)=>{let r=t.tokens.length;e.tokens.splice(0,0,...t.tokens.slice(0,r-1));let i=t.tokens[r-1],a=e.tokens[r-1],o=i[i.length-1],s=o.column+st(o)+n;a.forEach(e=>{e.column+=s}),a.splice(0,0,...i);let c=[...t.anchorTokens??[]],l=[...t.anchorTokCol??[]];for(let t=r;t<e.tokens.length;t++)c.push(e.anchorTokens?.[t-r+1]),l.push(e.anchorTokCol?.[t-r+1]??0);e.anchorTokens=c,e.anchorTokCol=l,dt(e)},mt=e=>e.tokens.length===1&&e.tokens[0].length===1,ht=(e,t)=>at(at(e.tokens,t.line),t.item),gt=(t,n,r)=>{if(t.tokens.length<=n.line)throw new e.o(`TLAExpr.StepCoord called with line too big`);if(t.tokens[n.line].length<=n.item)throw new e.o(`TLAExpr.StepCoord called with col too big`);let i={line:n.line,item:n.item};for(let e=0;e<r;e++)if(i.item+=1,t.tokens[i.line].length===i.item){for(i.item=0,i.line+=1;i.line<t.tokens.length&&t.tokens[i.line].length===0;)i.line+=1;if(i.line===t.tokens.length)return}return i},_t=(e,t,n)=>{for(let r=e.tokens.length===0?void 0:{...n};r!==void 0;){let n=ht(e,r),i=n.type===$e.string;if(!i&&n.string===t)return r;let a=!i&&(n.string===`[`||n.string===`,`)?gt(e,r,2):void 0,o=a===void 0?void 0:ht(e,a),s=o!==void 0&&o.type!==$e.string&&[`:`,`|->`,`↦`].includes(o.string),c=i?1:n.string===`.`?2:s?3:1;r=gt(e,r,c)}},vt=(e,t,n,r)=>{let i=ht(e,n);if(mt(e)){let n=ft(t);e.tokens=n.tokens,e.anchorTokens=n.anchorTokens,e.anchorTokCol=n.anchorTokCol;return}let a=e.tokens[n.line],o=n.item+1<a.length?a[n.item+1].column-(i.column+st(i)):0,s=a.splice(n.item+1),c=n.line,l=+!!r+i.column,u=!r,d=()=>e.tokens[c];if(mt(t)){let e=t.tokens[0][0];i.string=e.string,i.type=e.type}else{r&&(i.string=`(`,i.type=$e.builtin);let n=ft(t);if(n.tokens.forEach((t,r)=>{if(t.forEach(e=>{e.column+=l,u?(i.string=e.string,i.type=e.type,u=!1):d().push(e)}),r+1>=n.tokens.length)return;l=0,c+=1;let a=c;e.tokens.splice(a,0,[]);let o=e.anchorTokens??[],s=e.anchorTokCol??[];e.anchorTokens=e.tokens.map((e,t)=>t<a?o[t]:t===a?n.anchorTokens?.[r+1]:o[t-1]),e.anchorTokCol=e.tokens.map((e,t)=>t<a?s[t]:t===a?n.anchorTokCol?.[r+1]??0:s[t-1])}),r){let e=d()[d().length-1];d().push(ot(`)`,e.column+st(e),$e.builtin))}}let f=d(),p={line:c,item:f.length-1};if(s.length>0){let e=f[f.length-1],t=e.column+st(e)+o-s[0].column;s.forEach(e=>{e.column+=t,f.push(e)})}return dt(e),gt(e,p,1)},yt=(t,n,r,i=!0)=>{let a=r.map(e=>_t(t,e,{line:0,item:0}));for(;;){let o=a.reduce((e,t,n)=>t!==void 0&&(e===void 0||t.line<e.position.line||t.line===e.position.line&&t.item<e.position.item)?{index:n,position:t}:e,void 0);if(o===void 0)return;let s=gt(t,o.position,1),c=vt(t,n[o.index],o.position,i);a[o.index]=c===void 0?void 0:_t(t,r[o.index],c),a.forEach((t,n)=>{if(n!==o.index&&t!==void 0&&c!==void 0){if(s===void 0)throw new e.c(`NullPointerException: TLAExpr.substituteForAll`);t.line===o.position.line&&(t.item+=c.item-s.item),t.line+=c.line-s.line}})}},bt=(e,t,n)=>{let r=ft(e);return yt(r,t,n),r},xt=(e,t,n)=>e.map(e=>bt(e,t,n)),St=(e,t)=>{let n=e=>t===`1.7.4`?``:`(col${e.column}) `,r=e.tokens.map(e=>e.map(e=>e.type===$e.string?`"\\"", "${e.string}", "\\""`:e.string===`\\/`?`"${n(e)}\\\\/"`:e.string.startsWith(`\\`)?`"\\${e.string}"`:e.string===`/\\`?`"${n(e)}/\\\\"`:`"${e.string}"`)),i=r.findIndex(e=>e.length>0);return`<< ${r.map((e,t)=>{let n=i!==-1&&t>i;return e.map((e,t)=>n||t>0?`, ${e}`:e).join(``)}).join(`
|
|
22
22
|
`)} >>`},Ct=(e,t,n)=>{let r=e=>St(e,n),i=[0],a=0,o=e=>(i[a+1]=i[a]+e.length,a+=1,e),s=()=>(--a,``),c=()=>`\n${` `.repeat(i[a])}`,l=t<1500,u=e=>`${o(`<<`)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${`kind`in e?m(e):r(e)}`).join(``)}>>${s()}`,d=e=>`${o(`<<`)}${e.map(e=>`"${e}"`).join(`, `)}>>${s()}`,f=e=>`${o(`<< `)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${u(e)}`).join(``)} >>${s()}`,p=e=>e?`"="`:`"\\\\in"`,m=e=>{switch(e.kind){case`Uniprocess`:return`${o(``)}[type |-> "uniprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Multiprocess`:return`${o(``)}[type |-> "multiprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` procs |-> `)}${u(e.procs)}]${s()}${s()}`;case`Procedure`:return l?`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}", ${c()}minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Process`:return l?`${o(``)}[name |-> "${e.name}", ${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}",${c()} fairness |-> "${nt[e.fairness]}", minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`VarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> ${p(e.isEq)}, val |-> ${r(e.val)}]${s()}`;case`PVarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> "=", val |-> ${r(e.val)}]${s()}`;case`LabeledStmt`:return`${o(``)}[label |-> "${e.label}",${c()}${o(` stmts |-> `)}${u(e.stmts)}]${s()}${s()}`;case`While`:return`${o(``)}[type |-> "while", ${c()} test |-> ${r(e.test)},${c()}${o(` labDo |-> `)}${u(e.labDo)},${s()}${c()}${o(` unlabDo |-> `)}${u(e.unlabDo)}]${s()}${s()}`;case`Assign`:return`${o(``)}[type |-> "assignment",${c()}${o(` ass |-> `)}${u(e.ass)}]${s()}${s()}`;case`SingleAssign`:return`${o(``)}[lhs |-> ${m(e.lhs)},${c()} rhs |-> ${r(e.rhs)}]${s()}`;case`Lhs`:return`[var |-> "${e.var}", sub |-> ${r(e.sub)}]`;case`If`:return`${o(``)}[type |-> "if", ${c()} test |-> ${r(e.test)},${c()}${o(` then |-> `)}${u(e.Then)},${s()}${c()}${o(` else |-> `)}${u(e.Else)}]${s()}${s()}`;case`Either`:return`${o(``)}[type |-> "either", ${c()}${o(` ors |-> `)}${f(e.ors)}]${s()}${s()}`;case`With`:return`${o(``)}[type |-> "with", ${c()} var |-> "${e.var}",${c()} eqOrIn |-> ${p(e.isEq)},${c()} exp |-> ${r(e.exp)},${c()}${o(` do |-> `)}${u(e.Do)}]${s()}${s()}`;case`When`:return`${o(``)}[type |-> "when", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`PrintS`:return`${o(``)}[type |-> "print", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Assert`:return`${o(``)}[type |-> "assert", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Skip`:return`[type |-> "skip"]`;case`LabelIf`:return`${o(``)}[type |-> "labelIf",${c()} test |-> ${r(e.test)},${c()}${o(` unlabThen |-> `)}${u(e.unlabThen)},${s()}${c()}${o(` labThen |-> `)}${u(e.labThen)},${s()}${c()}${o(` unlabElse |-> `)}${u(e.unlabElse)},${s()}${c()}${o(` labElse |-> `)}${u(e.labElse)}]${s()}${c()}${s()}`;case`LabelEither`:return`${o(``)}[type |-> "labelEither",${c()}${o(` clauses |-> `)}${u(e.clauses)}]${s()}${c()}${s()}`;case`Clause`:return`${o(``)}${o(`[unlabOr |-> `)}${u(e.unlabOr)},${s()}${c()}${o(` labOr |-> `)}${u(e.labOr)}]${s()}${c()}${s()}`;case`Call`:return`${o(``)}[type |-> "call",${c()} returnTo |-> "${e.returnTo}",${c()} to |-> "${e.to}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`;case`Return`:return`[type |-> "return", from |-> "${e.from??`null`}"]`;case`CallReturn`:return`${o(``)}[type |-> "callReturn",${c()} from |-> "${e.from??`null`}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`CallGoto`:return`${o(``)}[type |-> "callGoto",${c()} after |-> "${e.after}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`Goto`:return`[type |-> "goto", to |-> "${e.to}"]`;case`Macro`:return`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${o(`<<`)}${e.params.join(`, ${c()}`)}>>${s()},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`MacroCall`:return`${o(``)}[type |-> "macrocall",${c()} name |-> "${e.name}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`}};return m(e)},wt=(e,t,n)=>({lines:e,currentLine:t<e.length?Array.from(e[t]):void 0,line:t,column:n,vcolumn:t<e.length?Array.from(e[t].slice(0,n)).length:0}),Tt=e=>{if(e.currentLine===void 0)return` `;if(e.currentLine.length===e.column)return e.line+=1,e.column=0,e.vcolumn=0,e.currentLine=e.line>=e.lines.length?void 0:Array.from(e.lines[e.line]),`
|
|
23
23
|
`;let t=e.currentLine[e.column];return e.column+=1,e.vcolumn+=1,t},Et=t=>{if(t.column>0)--t.column,--t.vcolumn;else{if(t.line===0)throw new e.o(`PcalCharReader.backspace trying to move past beginning of reader`);--t.line,t.currentLine=Array.from(t.lines[t.line]),t.column=Math.max(t.currentLine.length-1,0),t.vcolumn=t.column}},Dt=e=>{for(;;){let t=Tt(e);if(t===` `)return` `;if(t!==` `&&t!==`
|
|
24
24
|
`)break}return Et(e),`${(e.currentLine??[]).slice(e.column).join(``)}\n`},Ot=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`⟨`]),kt=/* @__PURE__ */ new Set([`>>_`,`⟩_`,`]_`,`)`,`}`,`]`,`>>`,`⟩`]),At=/* @__PURE__ */ new Set([...Ot,...kt,...`_ ASSUME ASSUMPTION AXIOM BOOLEAN CASE CONSTANT CONSTANTS EXCEPT EXTENDS FALSE IF INSTANCE LOCAL MODULE OTHER STRING THEOREM TRUE VARIABLE VARIABLES WITH WF_ SF_`.split(` `),...`\\A ∀ \\forall \\E ∃ \\exists \\AA \\EE ~ ¬ \\lnot \\neg <> ◇ CHOOSE ENABLED UNCHANGED SUBSET UNION DOMAIN ' ^+ ⁺ ^* ^#`.split(` `),...`=> ⇒ \\cdot ⋅ <=> ⇔ \\equiv ≡ ~> ↝ -+-> ⇸ \\subseteq ⊆ \\subset ⊂ \\supset ⊃ \\supseteq ⊇ \\ll ≪ \\gg ≫ \\ \\cap \\intersect ∩ \\cup \\union ∪ /\\ ∧ \\/ ∨ \\land \\lor \\X × - + * / ^ | || ‖ & && ++ -- ** // ^^ |- ⊢ |= ⊨ -| ⊣ =| ⫤ <: :> := ≔ ::= ⩴`.split(` `),...`(+) ⊕ (-) ⊖ \\oplus \\ominus (.) ⊙ \\odot (/) ⊘ \\oslash (\\X) ⊗ \\otimes \\uplus ⊎ \\sqcap ⊓ \\sqcup ⊔ \\div ÷ \\star ⋆ \\o ∘ \\circ \\bigcirc ◯ \\bullet ●`.split(` `),...`\\in ∈ \\notin ∉ = # /= ≠ < > =< <= ≤ >= ≥ \\prec ≺ \\succ ≻ \\preceq ⪯ \\succeq ⪰ \\sim ∼ \\simeq ≃ \\approx ≈ \\doteq ≐ \\asymp ≍ \\sqsubset ⊏ \\sqsupset ⊐ \\sqsubseteq ⊑ \\sqsupseteq ⊒ \\propto ∝`.split(` `),...`: -> → |-> ↦ <- ← == ≜ ELSE THEN LET IN [] □ .. ‥ ... … $ $$ ? ?? ⁇ % %% ## @@ !! ‼ \\times \\leq \\geq \\mod \\wr ≀ ≅ ! ; , . -. @`.split(` `)]),jt=e=>/^[A-Za-z_]$/.test(e),Mt=e=>/^[0-9]$/.test(e),Nt=e=>e===` `||e===`\f`||e===`\r`,Pt=new Set([...At].filter(e=>!jt(e[0])&&!(e[0]===`\\`&&jt(e[1]??``))).flatMap(e=>Array.from(e,(t,n)=>e.slice(0,e.length-n)))),Ft=/* @__PURE__ */ new Set("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ ~!@#$%^&*()_-+={}[]|:;<,>.?/`'0123456789"),It=new Set(`; do then := ≔ begin variable variables || ‖ end else elsif if either or while with call return goto print assert skip procedure define process fair`.split(` `)),L={...$e,dashes:6,endModule:7},Lt=()=>({delimiter:``,delimiterLine:0,delimiterCol:0,commentDepth:0}),Rt=(t,n,r,i)=>{let a=[],o=[],s=``,c=`start`,l=n.vcolumn,u=n.vcolumn,d=Tt(n),f=0,p=!1,m=!1,h=` `,g=()=>{u=n.vcolumn,d=Tt(n)},_=()=>{s+=d,g()},v=()=>{c=`start`,l=u},y=()=>{a.push(o),o=[],l=0},b=t=>{throw new e.s(`${t} \`${s}' found at\n line ${n.line+1}, column ${l+1}`)},x=()=>{m=!0,t.delimiter=s,t.delimiterCol=l,t.delimiterLine=n.line-+(d===`
|
|
@@ -27,8 +27,8 @@ Called from Tlapm_lib.init in file "src/tlapm_lib.ml", line 659, characters 8-59
|
|
|
27
27
|
`||r===` `?(s=``,t.commentDepth=0,v()):t.commentDepth===0?_():g();case`lineComParen`:if(r===`*`)return t.commentDepth+=1,T(`lineComment`);t.commentDepth===0&&(s+=`(`),c=`lineComment`;return;case`lineComStar`:if(r===`)`){if(--t.commentDepth,t.commentDepth<0)throw new e.o(`Failure of assertion: case LINE_COM_STAR`);return T(`lineComment`)}t.commentDepth===0&&(s+=`*`),c=`lineComment`;return;case`comment`:case`orComment`:{let n=c===`comment`;if(r===`*`)return T(n?`commentStar`:`orCommentStar`);if(r===`(`)return T(n?`commentParen`:`orCommentParen`);if(r===`
|
|
28
28
|
`){s=``,g(),y(),c=`orComment`;return}if(r===` `)throw new e.s(n?`Input ended in the middle of a comment`:`Input ended in the middle of a multi-line comment`);return t.commentDepth===1?_():g()}case`commentStar`:case`orCommentStar`:{let n=c===`commentStar`?`comment`:`orComment`;if(r!==`)`){t.commentDepth===1&&(s+=`*`),c=n;return}if(g(),--t.commentDepth,n===`orComment`&&t.commentDepth<0)throw new e.o(`Assertion failure`);if(t.commentDepth!==0){c=n;return}return s=``,v()}case`commentParen`:case`orCommentParen`:{let e=c===`commentParen`?`comment`:`orComment`;if(r===`*`)return t.commentDepth+=1,T(e);t.commentDepth===1&&(s+=`(`),c=e;return}}};for(;c!==`done`&&!m;)E(d);return d!==`
|
|
29
29
|
`&&Et(n),ut(a)},zt=(e,t,n)=>Rt(e,t,!0,n),Bt=(e,t)=>(Rt(e,t,!1,!1),e.delimiter),Vt=(e,t)=>({params:e,tokenizer:Lt(),lookahead:{tokens:Array.from({length:10},()=>``),columns:Array.from({length:10},()=>0),lines:Array.from({length:10},()=>0)},lastToken:{column:0,line:0,text:``},isInMacro:!1,log:t}),Ht=()=>ut([[ot(`defaultInitValue`,0,0)]]),Ut=(e,t)=>[...e,...t.filter((n,r)=>!e.includes(n)&&t.indexOf(n)===r)],Wt=(e,t)=>!t.some(t=>e.includes(t)),Gt=(e,t)=>{t.splice(0,t.length,...e)},Kt=(t,n,r)=>{let i=t.params,a=t.lookahead,o=t.lastToken,s=0,c=[],l=[],u=1,d=/* @__PURE__ */ new Set,f=!1,p=!1,m,h=[],g=!1,_=[],v=[],y=[],b=!1,x=!1,S=i.inputVersionNumber>=1500,C=t=>{throw new e.s(`${t}\n line ${o.line}, column ${o.column}`)},w=()=>{if(s===0)return Dt(n),o.column=n.vcolumn+1,o.line=n.line+1,o.text=Bt(t.tokenizer,n),o.text;o.column=a.columns[0]+1,o.line=a.lines[0]+1;let e=a.tokens[0];for(let e=1;e<s;e++)a.tokens[e-1]=a.tokens[e],a.columns[e-1]=a.columns[e],a.lines[e-1]=a.lines[e];return--s,o.text=e,e},T=r=>{for(;s<r;){let r=s;if(Dt(n)===` `)throw new e.s(`Premature end of file, perhaps because of unclosed comment, near\n line ${a.lines[r]+1}, column ${a.columns[r]+1}`);a.columns[r]=n.vcolumn,a.lines[r]=n.line,a.tokens[r]=Bt(t.tokenizer,n),s+=1}return a.tokens[r-1]},E=r=>{if(r<s)throw new e.o(`ParseAlgorithm.PeekPastAlgToken called to peek after a token
|
|
30
|
-
it has already peeked at`);for(;r>s;)a.tokens[s]=Bt(t.tokenizer,n),s+=1;return Dt(n)},D=(r=!1)=>{if(s!==0)throw new e.o(`ParseAlgorithm: GetExpr called after lookahead`);let i=zt(t.tokenizer,n,r);return a.tokens[0]=t.tokenizer.delimiter,a.columns[0]=t.tokenizer.delimiterCol,a.lines[0]=t.tokenizer.delimiterLine,s=1,i},O=(e,t)=>{let n=w();n!==e&&n!==t&&C(`Expected "${e}" but found "${n}"`)},k=(t,n)=>{if(t===`;`){let t=T(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(t))return;if(`if either while with call return goto print assert skip`.split(` `).includes(t))throw new e.s(`Missing \`;' before line ${a.lines[0]+1}, column ${a.columns[0]+1}`)}O(t,n)},A=()=>{let e=w();return e===`=`?!0:e===`\\in`||e===`∈`?!1:C(`Expected "=" or "\\in" but found "${e}"`)},ee=()=>k(T(1)===`,`?`,`:`;`),te=()=>k(g?`{`:`begin`),ne=e=>{g?k(`}`):(k(`end`),k(e))},j=()=>{T(1)===`variables`?O(`variables`):k(`variable`)},M=()=>{let t={...I(),kind:`VarDecl`,var:w(),col:o.column,line:o.line,isEq:!0,val:Ht()};if(![`=`,`\\in`,`∈`].includes(T(1)))return p=!0,t;if(t.isEq=A(),t.val=D(),t.val.tokens.length===0)throw new e.c(`NullPointerException`);return t},re=()=>{j();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(T(1));)e.push(M()),ee();return e},ie=()=>{let t={...I(),kind:`PVarDecl`,var:w(),col:o.column,line:o.line,val:Ht()};if(T(1)!==`=`)return p=!0,t;if(k(`=`),t.val=D(),t.val.tokens.length===0)throw new e.c(`NullPointerException`);return t},ae=()=>{j();let e=[];for(;T(1)!==`begin`&&T(1)!==`{`;)e.push(ie()),ee();return e},N=()=>{if(`while if assert print else elsif either or end with when await skip call return goto`.split(` `).includes(T(1)))return!1;let e=Dt(n);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},oe=()=>{if(!N())return``;let e=w();t.isInMacro&&C(`A label may not appear in a macro.`),e===`Done`&&C("Cannot use `Done' as a label."),e===`Error`&&C("Cannot use `Error' as a label."),k(`:`),f=!0,d.add(e);let n=T(1);return n!==`+`&&n!==`-`||(k(n),(n===`+`?_:v).push(e),S=!1),e},se=()=>{let e=[],t=e=>!g&&[`end`,`else`,`elsif`,`or`].includes(e)||g&&e===`}`;for(;!t(T(1));)e.push(...ce());return g&&e.length===0&&C(`Empty statement list`),e},P=t=>{O(`{`);let n=se();if(k(`}`),k(`;`),t!==``){if(n[0].lbl!==``)throw new e.s(`Duplicate labeling of statement`,n[0]);n[0].lbl=t}return n},ce=()=>{let e=oe();if(g&&T(1)===`{`)return P(e);let t=le();return t.lbl=e,[t]},le=()=>{let t=T(1);if(t===`if`)return de(0);if(t===`either`)return fe();if(t===`with`)return pe(0);if(t===`when`||t===`await`){O(t);let n=o.column,r=o.line,i=D();if(i.tokens.length===0)throw new e.c(`NullPointerException`);return k(`;`),{...I(),kind:`When`,col:n,line:r,exp:i}}if(t===`print`||t===`assert`){O(t);let e=o.column,n=o.line,r=D();return r.tokens.length===0&&C(`Empty expression in ${t} statement at `),k(`;`),{...I(),kind:t===`print`?`PrintS`:`Assert`,col:e,line:n,exp:r}}if(t===`skip`){O(`skip`);let e={...I(),kind:`Skip`,col:o.column,line:o.line};return k(`;`),e}if(t===`call`)return _e();if(t===`return`){O(`return`);let e={...I(),kind:`Return`,col:o.column,line:o.line,from:m};return k(`;`),e}if(t===`goto`){O(`goto`);let e=o.column,t=o.line,n=w();return b=!0,(n===`Done`||n===`"Done"`)&&(x=!0),k(`;`),{...I(),kind:`Goto`,col:e,line:t,to:n}}return t===`while`?ue():E(1)[0]===`(`?ve():he()},ue=()=>{O(`while`);let e=o.column,t=o.line;g&&k(`(`);let n=D();g&&k(`)`),n.tokens.length===0&&C(`Empty while test at `),g||k(`do`);let r=g?ce():se();return g||(k(`end`),k(`while`),k(`;`)),r.length===0&&C(`Missing body of while statement at`),{...I(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},de=e=>{O(e===0?`if`:`elsif`);let t={...I(),kind:`LabelIf`,col:o.column,line:o.line,test:ct(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};g&&k(`(`),t.test=D(),g&&k(`)`),t.test.tokens.length===0&&C(`Empty if test at `),g||k(`then`),t.unlabThen=g?ce():se();let n=T(1);return n===`else`&&(O(`else`),t.unlabElse=g?ce():se()),!g&&n===`elsif`&&(t.unlabElse=[de(e+1)]),!g&&![`else`,`elsif`,`end`].includes(n)&&C(`Expecting "else", "elsif", or "end"`),!g&&e===0&&(k(`end`),k(`if`),k(`;`)),t.unlabElse.length===0&&at(t.unlabThen,t.unlabThen.length-1),t},fe=()=>{O(`either`);let t={...I(),kind:`LabelEither`,col:o.column,line:o.line,clauses:[]};for(;;){let n={...I(),kind:`Clause`,unlabOr:g?ce():se(),labOr:[]};if(n.unlabOr.length===0)throw new e.s("`either' statement with empty `or' clause",t);if(t.clauses.push(n),T(1)!==`or`)break;O(`or`)}if(g||(O(`end`),k(`either`),k(`;`)),t.clauses.length===1)throw new e.s("`either' statement has no `or'",t);return t},pe=t=>{t===0&&(k(`with`),g&&k(`(`));let n={...I(),kind:`With`,col:o.column,line:o.line,var:w(),isEq:!0,exp:ct(),Do:[]};n.isEq=A(),n.exp=D(),g&&T(1)===`)`||ee(),n.exp.tokens.length===0&&C(`Empty with expression at `);let r=!g&&T(1)===`do`,i=g&&T(1)===`)`;if(r&&k(`do`),i&&O(`)`),n.Do=r?se():i?ce():[pe(t+1)],r&&(k(`end`),k(`with`),k(`;`)),n.Do.length===0)throw new e.s(`Missing body of with statement`,n);return n},me=()=>{let e=a.columns[0]+1,t=a.lines[0]+1,n={...I(),kind:`Lhs`,col:e,line:t,var:w(),sub:D()};k(`:=`,`≔`);let r=D();return r.tokens.length===0&&C(`Empty right-hand side of assignment at `),{...I(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},he=()=>{let t={...I(),kind:`Assign`,col:a.columns[0]+1,line:a.lines[0]+1,ass:[me()]};for(;T(1)===`||`||T(1)===`‖`;){w();try{t.ass.push(me())}catch(t){if(!(t instanceof e.s))throw t;C(`Bad assignment statement at `)}}return k(`;`),t},ge=()=>{let e=[];if(E(0)[0]!==`)`)for(;;){let t=D();if(e.push(t),t.tokens.length===0&&C(`Empty argument in call statement at `),T(1)===`)`)break;k(`,`)}return k(`)`),k(`;`),e},F=()=>{O(`call`);let e={...I(),kind:`Call`,col:o.column,line:o.line,returnTo:``,to:w(),args:[]};return k(`(`),e.args=ge(),y.includes(e.to)||y.push(e.to),e},_e=()=>{let e=F();if(T(1)===`return`)return O(`return`),k(`;`),{...I(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:m,args:e.args};if(T(1)!==`goto`)return e;O(`goto`);let t={...I(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:w(),args:e.args};return b=!0,(t.to===`Done`||t.to===`"Done"`)&&(x=!0),k(`;`),t},ve=()=>{let e={...I(),kind:`MacroCall`,name:w(),col:o.column,line:o.line,args:[]};return O(`(`),e.args=ge(),e},ye=e=>{t.isInMacro=!0,O(`macro`);let n={...I(),kind:`Macro`,col:o.column,line:o.line,name:w(),params:[],body:[]};for(k(`(`);T(1)!==`)`;)n.params.length>0&&k(`,`),n.params.push(w());return O(`)`),te(),n.body=se(),ne(`macro`),T(1)===`;`&&w(),Me(n.body,e),t.isInMacro=!1,n},be=()=>{k(`procedure`);let e={...I(),kind:`Procedure`,col:o.column,line:o.line,name:w(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(m=e.name,_=[],v=[],y=[],k(`(`);T(1)!==`)`;)e.params.length>0&&k(`,`),e.params.push(ie());return O(`)`),T(1)!==`begin`&&T(1)!==`{`&&(e.decls=ae()),te(),e.body=se(),ne(`procedure`),T(1)===`;`&&w(),m=void 0,e.plusLabels=_,e.minusLabels=v,e.proceduresCalled=y,e},xe=()=>{k(`process`);let e=o.column,t=o.line;g&&k(`(`);let n=w(),r=A(),i=D();_=[],v=[],y=[],g&&k(`)`),i.tokens.length===0&&C(`Empty process id at `);let a=T(1)===`begin`||T(1)===`{`?[]:re();te();let s=se();return ne(`process`),T(1)===`;`&&w(),{...I(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:v,plusLabels:_,proceduresCalled:y,isEq:r,id:i,decls:a,body:s}},Se=()=>{let e=`${i.labelRoot}${u}`;return u+=1,d.has(e)?Se():e},Ce=e=>{e.lbl===``&&(e.lbl=Se(),c.push(e.lbl),l.push(rt(e)))},we=(t,n,r,i,a)=>{Gt(i,a);let o=n,s=!1,c=e=>{Ce(e),s=!0,a.length=0};return t.forEach(t=>{if(t.lbl!==``&&(s=!0,a.length=0,r))throw new e.s("Label in `with' statement",t);if(o){if(r)throw new e.s("Statement follows `call' or `return' inside a `with' statement.",t);c(t),o=!1}switch(t.kind){case`LabelIf`:{let e=[],n=[],i=we(t.unlabThen,!1,r,a,e);o=we(t.unlabElse,!1,r,a,n)||i,Gt(Ut(e,n),a);return}case`LabelEither`:{let e=[];t.clauses.forEach(t=>{let n=[];o=we(t.unlabOr,!1,r,a,n)||o,Gt(Ut(n,e),e)}),Gt(e,a);return}case`While`:if(r)throw new e.s("`while' inside a `with' statement",t);c(t),we(t.unlabDo,!1,!1,a,[]),o=!1;return;case`With`:{let e=[];o=we(t.Do,!1,!0,r?[...i]:[],e),Gt(e,a),!r&&!Wt(i,a)&&c(t);return}}let n=t.kind===`Call`||t.kind===`CallGoto`,l=t.kind===`Return`||t.kind===`CallReturn`,u=t.kind===`Assign`?Ut([],t.ass.map(e=>e.lhs.var)):n||l?[`stack`,...l||t.to===m?h.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(o=n||l||t.kind===`Goto`,Wt(a,u))Gt(Ut(a,u),a);else{if(r)throw new e.s(t.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",t);c(t),Gt(u,a)}}),s||o},Te=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return Te(n),{unlabeled:n,labeled:Ee(t===-1?[]:e.slice(t))}};e.forEach(e=>{switch(e.kind){case`LabelIf`:{let n=t(e.unlabThen);e.unlabThen=n.unlabeled,e.labThen=n.labeled;let r=t(e.unlabElse);e.unlabElse=r.unlabeled,e.labElse=r.labeled;return}case`LabelEither`:e.clauses.forEach(e=>{let n=t(e.unlabOr);e.unlabOr=n.unlabeled,e.labOr=n.labeled});return;case`While`:{let n=t(e.unlabDo);e.unlabDo=n.unlabeled,e.labDo=n.labeled}}})},Ee=t=>{let n=[];return t.forEach(t=>{if(t.lbl===``&&n.length>0)n[n.length-1].stmts.push(t);else{if(t.lbl===``)throw new e.o(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);n.push({...I(),kind:`LabeledStmt`,col:t.col,line:t.line,macroCol:t.macroCol,macroLine:t.macroLine,label:t.lbl,stmts:[t]})}}),n.forEach(e=>Te(e.stmts)),n},De=(t,n)=>{let r=t[n];switch(r.kind){case`LabelIf`:{let e=Oe(r.unlabThen);r.labThen.forEach(e=>Oe(e.stmts));let i=Oe(r.unlabElse);return r.labElse.forEach(e=>Oe(e.stmts)),r.labThen.length>0||r.labElse.length>0||e===2||i===2?2:(t[n]={...I(),kind:`If`,test:r.test,Then:r.unlabThen,Else:r.unlabElse},+(e+i>0))}case`LabelEither`:{let e=r.clauses.reduce((e,t)=>{let n=Math.max(e,Oe(t.unlabOr));return t.labOr.forEach(e=>Oe(e.stmts)),t.labOr.length>0?2:n},0);return e===2?2:(t[n]={...I(),kind:`Either`,ors:r.clauses.map(e=>e.unlabOr)},e)}case`With`:{let t=Oe(r.Do);if(t===2)throw new e.s(`with statement at ${rt(r)} contains a labeled statement`);return t}case`While`:if(n!==0)throw new e.o("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return Oe(r.unlabDo),r.labDo.forEach(e=>Oe(e.stmts)),0;case`Call`:return t[n+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(m===void 0)throw new e.s(`return statement not in a procedure at ${rt(r)}`);return 1;case`Goto`:case`CallGoto`:return 1;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`MacroCall`:return 0;default:throw new e.o(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${r.kind}`)}},Oe=t=>{for(let n=0;n<t.length;n++){let r=De(t,n);if(r!==0){if(n===t.length-1)return r;throw new e.o(`Translator discovered later than it should have that\n Statement at ${rt(t[n+1])} must have a label`)}}return 0},ke=e=>{we(e,!0,!1,[],[]);let t=Ee(e);return t.forEach(e=>Oe(e.stmts)),t},Ae=(t,n,r,i,a)=>{let o=e=>bt(e,n,r),s=e=>e.map(e=>Ae(e,n,r,i,a)),c=e=>e.map(e=>({...I(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>Ae(e,n,r,-1,0))})),l={...I(),col:t.col,line:t.line,macroCol:i>0?a:t.macroCol,macroLine:i>0?i:t.macroLine};switch(t.kind){case`Assign`:return{...l,kind:`Assign`,ass:t.ass.map(e=>je(e,n,r,i,a))};case`If`:return{...l,kind:`If`,test:o(t.test),Then:s(t.Then),Else:s(t.Else)};case`Either`:return{...l,kind:`Either`,ors:t.ors.map(s)};case`With`:return{...l,kind:`With`,var:t.var,isEq:t.isEq,exp:o(t.exp),Do:s(t.Do)};case`When`:case`Assert`:case`PrintS`:return{...l,kind:t.kind,exp:o(t.exp)};case`Skip`:return{...l,kind:`Skip`,macroCol:i>0?a:0,macroLine:i>0?i:-1};case`While`:return{...l,kind:`While`,test:o(t.test),unlabDo:s(t.unlabDo),labDo:c(t.labDo)};case`LabelIf`:return{...l,kind:`LabelIf`,test:o(t.test),unlabThen:s(t.unlabThen),labThen:c(t.labThen),unlabElse:s(t.unlabElse),labElse:c(t.labElse)};case`LabelEither`:return{...l,kind:`LabelEither`,clauses:t.clauses.map(e=>({...I(),kind:`Clause`,labOr:c(e.labOr),unlabOr:s(e.unlabOr)}))};case`Call`:return{...l,kind:`Call`,to:t.to,returnTo:t.returnTo,args:xt(t.args,n,r)};case`Return`:return{...l,kind:`Return`,from:t.from};case`CallReturn`:return{...l,kind:`CallReturn`,to:t.to,from:t.from,args:xt(t.args,n,r)};case`CallGoto`:return{...l,kind:`CallGoto`,to:t.to,after:t.after,args:xt(t.args,n,r)};case`Goto`:return{...l,kind:`Goto`,to:t.to};default:throw new e.o(`Found unexpected statement type in macro at${rt(t)}`)}},je=(t,n,r,i,a)=>{let o=bt(t.rhs,n,r),s={...I(),kind:`Lhs`,var:t.lhs.var,sub:t.lhs.sub.tokens.length===0?t.lhs.sub:bt(t.lhs.sub,n,r)},c={...I(),kind:`SingleAssign`,col:t.col,line:t.line,macroCol:i>0?a:t.macroCol,macroLine:i>0?i:t.macroLine,lhs:s,rhs:o},l=r.indexOf(s.var);if(l===-1)return c;let u=n[l],d=ht(u,{line:0,item:0});if(d.type!==$e.ident)throw new e.s(`Macro expansion substitutes \`${d.string}' for assignment variable\n at ${rt(c)}`);if(s.var=d.string,gt(u,{line:0,item:0},1)===void 0)return c;let f=ft(u);return f.tokens[0].splice(0,1),lt(f),s.sub.tokens.length===0?s.sub=f:pt(s.sub,f,0),c},Me=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return Me(e.unlabThen,t),Me(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>Me(e.unlabOr,t)),[e];case`With`:return Me(e.Do,t),[e];case`While`:return Me(e.unlabDo,t),[e];case`MacroCall`:return Ne(e,t);default:return[e]}});e.splice(0,e.length,...n)},Ne=(t,n)=>{let r=n.findLast(e=>e.name===t.name);if(r===void 0)throw new e.s(`Macro ${t.name} undefined,\n at ${rt(t)}`);if(r.params.length!==t.args.length)throw new e.s(`Macro ${t.name} called with wrong number of arguments at \n ${rt(t)}`);let i=r.body.map(e=>Ae(e,t.args,r.params,t.line,t.col));return i.length>0&&(i[0].lbl=t.lbl),i},Pe=t=>{t.forEach((n,r)=>{if(t.slice(r+1).some(e=>e.name===n.name))throw new e.s(`Multiple definitions of macro name \`${n.name}'`)})},Fe=e=>{if(e.length===0)return;let t=()=>{S=!1},n=e[0];if(e.length>1||n.kind!==`LabeledStmt`)return t();if(n.stmts.length===0)return;let r=n.stmts[0];if(n.stmts.length>1||r.kind!==`While`||!mt(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(S=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(S=!1)},Ie=()=>{let t=c.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new e.s([t,...l].join(`
|
|
31
|
-
`))},Le=e=>h.forEach(t=>{m=t.name,Me(t.body,e),t.body=ke(t.body)}),Re=()=>{r&&w()!==`algorithm`&&C("`--fair' not followed by `algorithm'");let e=w();g=T(1)===`{`,g&&O(`{`);let n=T(1)===`variable`||T(1)===`variables`?re():[],a=ct();T(1)===`define`&&(O(`define`),g&&k(`{`),a=D(!0),ne(`define`),k(`;`));let o=[];for(;T(1)===`macro`;)o.push(ye(o));for(;T(1)===`procedure`;)h.push(be()),S=!1;if(T(1)===`fair`&&(T(2)===`process`||T(2)===`+`&&T(3)===`process`)||T(1)===`process`){let r=[];for(;T(1)===`fair`||T(1)===`process`;){let e=T(1)===`fair`;e&&O(`fair`);let t=e&&T(1)===`+`;t&&O(`+`);let n=t||!e&&i.fairnessOption===`sf`?2:e||i.fairnessOption===`wf`?1:0;r.push({...xe(),fairness:n})}return ne(`algorithm`),Pe(o),r.forEach(e=>{Me(e.body,o),e.body=ke(e.body),Fe(e.body)}),Le(o),c.length>0&&(i.labelFlag||Ie(),t.log(`Labels added.`)),(x||b)&&(S=!1),{...I(),kind:`Multiprocess`,name:e,decls:n,defs:a,macros:o,prcds:h,procs:r}}i.inputVersionNumber===1500&&T(1)===`fair`&&(k(`fair`),T(1)===`+`&&k(`+`),i.fairnessOption=`wf`),r&&([``,`wf`,`wfNext`].includes(i.fairnessOption)||t.log(`Warning: Option \`${i.fairnessOption}' specified for --fair algorithm.`),i.fairnessOption=`wf`),te();let s=se();Pe(o),Me(s,o),Le(o),g&&k(`}`),ne(`algorithm`);let l=ke(s);return c.length>0&&(f&&!i.labelFlag&&Ie(),t.log(`Labels added.`)),(b||x)&&(S=!1),Fe(l),{...I(),kind:`Uniprocess`,name:e,decls:n,defs:a,macros:o,prcds:h,body:l}};try{return{ast:Re(),shouldOmitPC:S,hasDefaultInitialization:p}}catch(t){if(!(t instanceof e.c))throw t;return C(`Unknown error at or before`)}},R={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},qt=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],Jt=/* @__PURE__ */ new Set([R.global,R.processVar,R.procedureVar,R.parameter]),Yt=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),Xt=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),Zt=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},Qt=(e,t,n,r)=>!(t===R.procedureVar||t===R.processVar||t===R.parameter?Yt(e,R.global,n,``)!==void 0||Xt(e,n,r)!==void 0:Yt(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,useThis:n}),!0),$t=(e,t,n,r)=>Yt(e,t,n,r)?.useThis??n,en=(e,t,n)=>{let r=Xt(e,t,n);return r===void 0?t:Jt.has(r.type)?r.useThis:t},tn=t=>{let n={symbols:[],procedures:[],processNames:[],errorReport:``},r=(e,t)=>{Qt(n,R.label,e.label,t)||(n.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>i(e,t))},i=(t,n)=>{let a=e=>e.forEach(e=>i(e,n)),o=e=>e.forEach(e=>r(e,n));switch(t.kind){case`While`:a(t.unlabDo),o(t.labDo);return;case`If`:a(t.Then),a(t.Else);return;case`With`:a(t.Do);return;case`LabelIf`:a(t.unlabThen),o(t.labThen),a(t.unlabElse),o(t.labElse);return;case`Either`:t.ors.forEach(a);return;case`LabelEither`:t.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`Call`:case`Return`:case`CallReturn`:case`CallGoto`:case`Goto`:return;default:throw new e.o(`Unexpected AST type ${t.kind}`)}},a=(e,t,r=t===``?R.global:R.processVar)=>{Qt(n,r,e.var,t)||(n.errorReport+=`\n${qt[r]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(Qt(n,R.global,`pc`,``),t.prcds.length>0&&Qt(n,R.global,`stack`,``),t.decls.forEach(e=>a(e,``)),t.prcds.forEach(e=>{let t=Zt(n,e.name)<n.procedures.length;t&&(n.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:it(e.body[0]).label}),Qt(n,R.procedure,e.name,``),e.decls.forEach(t=>a(t,e.name,R.procedureVar)),e.params.forEach(t=>a(t,e.name,R.parameter)),e.body.forEach(t=>r(it(t),e.name))}),t.kind===`Multiprocess`&&t.procs.forEach(e=>{let t=n.processNames.includes(e.name);t&&(n.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.processNames.push(e.name),Qt(n,R.process,e.name,``),e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>r(it(t),e.name))}),t.kind===`Uniprocess`&&t.body.forEach(e=>r(it(e),``)),n.errorReport.length>0)throw new e.s(n.errorReport);return n},nn=e=>{let t=t=>e.symbols.filter(e=>e.useThis===t).length>1,n=!1;for(let r=0;r<=7;r+=1)e.symbols.forEach(e=>{if(e.type===r){e.useThis=e.id;for(let n=1;r>0&&t(e.useThis);n+=1)e.useThis+=n===1?`_`:e.context[n-2]??String(r);e.id!==e.useThis&&(n=!0)}});return n},rn=t=>{let n=t.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${qt[e.type]} name`);if(n.length>0)throw new e.s(`Cannot use \`defaultInitValue' as ${n.join(` or `)}`)},an=(t,n,r)=>{let i=(e,t)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==$e.ident)return;let a=en(n,e.string,t);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(ut([[cn(a)]])))})),i.length>0&&yt(e,i,r,!1)},a=(e,t)=>{e.var=en(n,e.var,t),i(e.val,t)},o=(e,t)=>e.forEach((r,i)=>{e[i]=$t(n,R.label,r,t)}),s=(e,t)=>e===void 0?void 0:$t(n,R.procedure,e,t),c=(e,t)=>{e.label=$t(n,R.label,e.label,t),e.stmts.forEach(e=>l(e,t))},l=(t,r)=>{let a=e=>e.forEach(e=>l(e,r)),o=e=>e.forEach(e=>c(e,r)),u=e=>e.forEach(e=>i(e,r));switch(t.kind){case`LabeledStmt`:c(t,r);return;case`While`:a(t.unlabDo),o(t.labDo),i(t.test,r);return;case`Assign`:t.ass.forEach(e=>{e.lhs.var=en(n,e.lhs.var,r),i(e.lhs.sub,r),i(e.rhs,r)});return;case`If`:a(t.Then),a(t.Else),i(t.test,r);return;case`With`:i(t.exp,r),a(t.Do);return;case`When`:case`PrintS`:case`Assert`:i(t.exp,r);return;case`Skip`:return;case`LabelIf`:i(t.test,r),a(t.unlabThen),o(t.labThen),a(t.unlabElse),o(t.labElse);return;case`Call`:t.returnTo=$t(n,R.procedure,t.returnTo,r),t.to=$t(n,R.procedure,t.to,r),u(t.args);return;case`Return`:t.from=s(t.from,r);return;case`CallReturn`:t.from=s(t.from,r),t.to=$t(n,R.procedure,t.to,r),u(t.args);return;case`CallGoto`:t.after=$t(n,R.procedure,t.after,r),t.to=$t(n,R.procedure,t.to,r),u(t.args);return;case`Goto`:if(Yt(n,R.label,t.to,r)===void 0&&t.to!==`Done`)throw new e.s(`goto to non-existent label \`${t.to}' at line ${t.line}, column ${t.col}`);t.to=$t(n,R.label,t.to,r);return;case`Either`:t.ors.forEach(a);return;case`LabelEither`:t.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;default:throw new e.o(`Unexpected AST type${t.kind}`)}},u=e=>{e.decls.forEach(t=>a(t,e.name)),e.params.forEach(t=>a(t,e.name)),e.body.forEach(t=>c(it(t),e.name));let t=at(n.procedures,Zt(n,e.name));o(e.plusLabels,e.name),o(e.minusLabels,e.name),t.initialPC!==void 0&&(t.initialPC=$t(n,R.label,t.initialPC,e.name)),e.name=$t(n,R.procedure,e.name,``),t.name=e.name},d=e=>{e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>c(it(t),e.name)),o(e.plusLabels,e.name),o(e.minusLabels,e.name),e.name=$t(n,R.process,e.name,``)};t.decls.forEach(e=>a(e,``)),t.kind===`Multiprocess`&&((e,t)=>{e.forEach(u);let n=e.map(e=>e.name),i=e.map(e=>n.map(t=>e.proceduresCalled.includes(t)));n.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=n.filter((e,n)=>i[t][n])});for(let e of t){d(e);let t=e.proceduresCalled;for(let e=0;e<t.length;e+=1){let a=n.indexOf(t[e]);if(a===-1){r(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}n.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(t.prcds,t.procs),t.kind===`Uniprocess`&&(t.prcds.forEach(u),t.body.forEach(e=>c(it(e),``)))},on=e=>ot(e,0,$e.string),sn=e=>ot(e,0,$e.added),z=e=>ot(e,0,$e.builtin),cn=e=>ot(e,0,$e.ident),ln=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+st(r)+t;n.push(ot(e.string,i,e.type))}),ut([n])},un=e=>e.tokens.forEach((t,n)=>{let r=n===0||n===e.tokens.length-1?1:6;t.forEach(e=>{if(e.column=r,r+=st(e),e.type===$e.builtin)switch(e.string){case`|->`:case`↦`:e.column=Math.max(16,e.column+1),r=e.column+5;return;case`[`:case`<<`:r+=1;return;case`]`:case`>>`:e.column+=1,r+=1;return;case`\\o`:e.column+=1,r+=2}})}),dn=(e,t,n,r=0,i=0)=>({...I(),kind:`SingleAssign`,line:r,col:i,lhs:{...I(),kind:`Lhs`,var:e,sub:t},rhs:n}),fn=(e,t=0,n=0)=>({...I(),kind:`Assign`,line:t,col:n,ass:e}),pn=(e,t,n=0,r=0)=>fn([dn(e,ut([]),t,n,r)],n,r),mn=e=>{if(e.tokens.length>1)return!1;let t=at(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},hn=e=>({...I(),kind:`When`,exp:ln([sn(`pc`),z(`=`),on(e)],1)}),gn=e=>pn(`pc`,ut([[on(e??`null`)]])),_n=e=>[cn(`Head`),z(`(`),sn(`stack`),z(`)`),z(`.`),cn(e)],vn=()=>[cn(`Tail`),z(`(`),sn(`stack`),z(`)`)],yn=e=>ut([_n(e)]),bn=(e,t,n,r)=>{let i=[[z(`<<`),z(`[`),cn(`procedure`),z(`|->`),on(e),z(`,`)],[cn(`pc`),z(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(z(`,`)),i.push([cn(e.var),z(`|->`),cn(e.var)])}),i[i.length-1].push(z(`]`),z(`>>`)),i.push(r);let a=ct(i);return un(a),lt(a),a},xn=(t,n,r)=>{if(n.params.length!==r.args.length)throw new e.s(`Procedure ${r.to} called with wrong number of arguments`,r);return n.params.forEach((e,n)=>t.ass.push(dn(e.var,ut([]),r.args[n],r.line,r.col))),[t,...n.decls.map(e=>pn(e.var,e.val,r.line,r.col)),gn(n.initialPC)]},Sn=(t,n,r)=>{let i,a=(t,r)=>{let i=Zt(n,t.to);if(i===n.procedures.length)throw new e.s(`Call of non-existent procedure ${t.to}`,t);let a=n.procedures[i],o=bn(t.to,[on(r)],[...a.decls,...a.params],[z(`\\o`),sn(`stack`)]);return xn(pn(`stack`,o,t.line,t.col),a,t)},o=t=>{t.from??=i;let r=t.from;if(r===void 0)throw new e.s("`return' statement not in procedure",t);let a=Zt(n,r);if(a>=n.procedures.length)throw new e.s(`Error in procedure (perhaps name used elsewhere)`,t);let o=n.procedures[a],s=(e,n)=>fn([dn(e,ct(),n,t.line,t.col)],t.line,t.col);return[s(`pc`,yn(`pc`)),...o.decls.map(e=>s(e.var,yn(e.var))),...o.params.map(e=>s(e.var,yn(e.var))),s(`stack`,ut([vn()]))]},s=t=>{let r=t.from;if(r===void 0)throw new e.s(`\`return' statement following \`call' at ${rt(t)} not in a procedure`);let i=at(n.procedures,Zt(n,r)),a=Zt(n,t.to);if(a===n.procedures.length)throw new e.s(`Call of non-existent procedure ${t.to}`,t);let o=n.procedures[a],s=fn([],t.line,t.col);if(r!==t.to){i.decls.forEach(e=>s.ass.push(dn(e.var,ct(),yn(e.var),t.line,t.col)));let e=bn(t.to,_n(`pc`),[...o.decls,...o.params],[z(`\\o`),...vn()]);s.ass.push(dn(`stack`,ut([]),e,t.line,t.col))}return xn(s,o,t)},c=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!r};let n={stmts:e,labeledStmts:[],needsGoto:!1},i=e[e.length-1];switch(i.kind){case`LabelIf`:case`LabelEither`:{let r=i.kind===`LabelIf`?p(i,t):m(i,t);e.pop(),e.push(r.stmt),n.labeledStmts=r.labeledStmts;break}case`Goto`:e.pop(),e.push(gn(i.to));break;case`Call`:e.pop(),e.push(...a(i,t));break;case`Return`:e.pop(),e.push(...o(i));break;case`CallReturn`:e.pop(),e.push(...s(i));break;case`CallGoto`:e.pop(),e.push(...a({...I(),kind:`Call`,returnTo:``,to:i.to,args:i.args,line:i.line,col:i.col},i.after));break;case`If`:{let e=c(i.Then,t),a=c(i.Else,t);n.labeledStmts.push(...e.labeledStmts,...a.labeledStmts),i.Then=e.stmts,i.Else=a.stmts,r||(n.needsGoto=e.needsGoto&&a.needsGoto,n.needsGoto||(e.needsGoto&&i.Then.push(gn(t)),a.needsGoto&&i.Else.push(gn(t))));break}case`Either`:{let e=i.ors.map((e,r)=>{let a=c(e,t);return i.ors[r]=a.stmts,n.labeledStmts.push(...a.labeledStmts),a});n.needsGoto=e.every(e=>e.needsGoto),!r&&!n.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&i.ors[n].push(gn(t))});break}case`With`:{let e=c(i.Do,t);i.Do=e.stmts,n.labeledStmts.push(...e.labeledStmts),n.needsGoto=e.needsGoto;break}default:n.needsGoto=!0}return r&&(n.needsGoto=!1),n},l=(e,t)=>{let n=c(e,t);return n.needsGoto&&n.stmts.push(gn(t)),n},u=(e,t)=>{let n=e.stmts.at(0);if(n?.kind===`While`)return f(e,n,t);let i=l([...e.stmts],t),a=[];return r||(i.stmts.unshift(hn(e.label)),a.push({...I(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},d=(e,t)=>e.flatMap((n,r)=>u(n,r<e.length-1?e[r+1].label:t)),f=(e,t,n)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=l([...t.unlabDo],i),o=l(e.stmts.slice(1),n),s=mn(t.test),c=s?a.stmts:[{...I(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...I(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...r?[]:[hn(e.label)],...c]},...d(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},p=(e,t)=>{let n=l(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=l(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=d(e.labThen,t);return i.push(...d(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...I(),kind:`If`,col:e.col,line:e.line,test:e.test,Then:n.stmts,Else:r.stmts},labeledStmts:i}},m=(e,t)=>{let n=[],r=[];return e.clauses.forEach(e=>{let i=l(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...d(e.labOr,t))}),{stmt:{...I(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},h=(e,t)=>d(e.map(it),t),g=e=>{i=e.name;let t=h(e.body,$t(n,R.label,`Error`,``));return i=void 0,{...I(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:t}},_=e=>({...I(),kind:`Process`,col:e.col,line:e.line,name:e.name,fairness:0,minusLabels:[],plusLabels:[],proceduresCalled:[],isEq:e.isEq,id:e.id,decls:e.decls,body:h(e.body,`Done`)}),v=t.prcds.map(g);return t.kind===`Uniprocess`?{...I(),kind:`Uniprocess`,col:t.col,line:t.line,name:t.name,decls:t.decls,defs:t.defs,macros:[],prcds:v,body:h(t.body,`Done`)}:{...I(),kind:`Multiprocess`,col:t.col,line:t.line,name:t.name,decls:t.decls,defs:t.defs,macros:[],prcds:v,procs:t.procs.map(_)}},Cn=(t,n)=>{let r=n?[]:[`pc`];if(r.push(...t.decls.map(e=>e.var)),t.prcds.length>0&&r.push(`stack`),t.prcds.forEach(e=>{r.push(...e.params.map(e=>e.var)),r.push(...e.decls.map(e=>e.var))}),t.kind===`Multiprocess`&&t.procs.forEach(e=>r.push(...e.decls.map(e=>e.var))),r.length===0)throw new e.s(`The algorithm has no variables.`);let i=(e,t)=>{let n=r.indexOf(t);return n===-1?0:(e[n]+=1,e[n])},a=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),o=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),s=(t,n)=>{let s=[...n];t.ass=o(t.ass),new Set(t.ass.map(e=>e.lhs.var)).forEach(n=>{let a=t.ass.filter(e=>e.lhs.var===n);if(!r.includes(n))throw new e.s(`Assignment to undeclared variable ${n}`,a[0]);let o=a.some(e=>e.lhs.sub.tokens.length===0);if(i(s,n)>1||a.length>1&&o)throw new e.s(`Multiple assignment to ${n}`,t)}),a(n,s)},c=(t,n)=>{switch(t.kind){case`Assign`:s(t,n);return;case`If`:{let e=[...n],r=[...n];t.Then.forEach(t=>c(t,e)),t.Else.forEach(e=>c(e,r)),a(n,e),a(n,r);return}case`Either`:{let e=[...n];t.ors.forEach(t=>{let r=[...n];t.forEach(e=>c(e,r)),a(e,r)}),a(n,e);return}case`With`:t.Do.forEach(e=>c(e,n));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new e.o(`Unexpected AST type ${t.kind}`)}},l=e=>e.forEach(e=>{let t=r.map(()=>0);it(e).stmts.forEach(e=>c(e,t))});t.prcds.forEach(e=>l(e.body)),(t.kind===`Uniprocess`?[t.body]:t.procs.map(e=>e.body)).forEach(l)},wn=(e,t,n,r)=>{let i=tn(e);nn(i)&&r(`Warning: symbols were renamed.`),an(e,i,r),Cn(Sn(e,i,t),t),n&&rn(i)},Tn=`[ \\t\\n\\x0B\\f\\r]`,En=RegExp(`\\\\\\* BEGIN TRANSLATION${Tn}+\\(${Tn}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${Tn}*(=${Tn}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${Tn}*STRING)${Tn}*\\/\\\\${Tn}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${Tn}*(=${Tn}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${Tn}*STRING)${Tn}*\\)`),Dn=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),On=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),kn=(e,t)=>On(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${rt(t.node)}`),An=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),jn=(e,t,n,r)=>{for(let i=Math.max(t,0);i<e.length;i++){let t=e[i],a=t.indexOf(n);if(a===-1)continue;let o=a+n.length,s=t.slice(o).search(/[^ ]/);if(s!==-1&&o+s===t.indexOf(r))return i}return-1},Mn=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;t.column<n.length&&n[t.column]===` `;)t.column+=1;if(t.column<n.length)return n;t.line+=1,t.column=0}return``},Nn=(e,t,n)=>{let r=Array.from(e.slice(t)).findIndex(e=>n.includes(e));return r===-1?e.length:t+e.slice(t,t+r).length},Pn=e=>/^[\p{L}\p{Nd}_]$/u.test(e),Fn=(e,t,n)=>{for(;t.line<e.length;){let r=Mn(e,t);if(r.slice(t.column).startsWith(n)){let e=t.column+n.length;if(e>=r.length||!/^[\p{L}_]$/u.test(r[e]))return t.column=Nn(r,e,` `),!0}t.column=Nn(r,t.column,` `)}return!1},In=(e,t)=>On(e,`Command-line error: ${t}`),Ln=(e,t)=>{let n=e.params,r=!0,i=!1,a=t=>(r&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(In(e,`Can only have one of -wf, -sf, -wfNext, and -nof options`),!1));for(let r=0;r<t.length;r++){let o=t[r],s=t[r+1];switch(o){case`-spec`:case`spec`:case`-myspec`:case`myspec`:{let t=o.endsWith(`myspec`);if(n[t?`myspecOption`:`specOption`]=!0,n.specOption&&n.myspecOption){In(e,`
|
|
30
|
+
it has already peeked at`);for(;r>s;)a.tokens[s]=Bt(t.tokenizer,n),s+=1;return Dt(n)},D=(r=!1)=>{if(s!==0)throw new e.o(`ParseAlgorithm: GetExpr called after lookahead`);let i=zt(t.tokenizer,n,r);return a.tokens[0]=t.tokenizer.delimiter,a.columns[0]=t.tokenizer.delimiterCol,a.lines[0]=t.tokenizer.delimiterLine,s=1,i},O=(e,t)=>{let n=w();n!==e&&n!==t&&C(`Expected "${e}" but found "${n}"`)},k=(t,n)=>{if(t===`;`){let t=T(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(t))return;if(`if either while with call return goto print assert skip`.split(` `).includes(t))throw new e.s(`Missing \`;' before line ${a.lines[0]+1}, column ${a.columns[0]+1}`)}O(t,n)},A=()=>{let e=w();return e===`=`?!0:e===`\\in`||e===`∈`?!1:C(`Expected "=" or "\\in" but found "${e}"`)},ee=()=>k(T(1)===`,`?`,`:`;`),te=()=>k(g?`{`:`begin`),ne=e=>{g?k(`}`):(k(`end`),k(e))},j=()=>{T(1)===`variables`?O(`variables`):k(`variable`)},M=()=>{let t={...I(),kind:`VarDecl`,var:w(),col:o.column,line:o.line,isEq:!0,val:Ht()};if(![`=`,`\\in`,`∈`].includes(T(1)))return p=!0,t;if(t.isEq=A(),t.val=D(),t.val.tokens.length===0)throw new e.c(`NullPointerException`);return t},re=()=>{j();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(T(1));)e.push(M()),ee();return e},ie=()=>{let t={...I(),kind:`PVarDecl`,var:w(),col:o.column,line:o.line,val:Ht()};if(T(1)!==`=`)return p=!0,t;if(k(`=`),t.val=D(),t.val.tokens.length===0)throw new e.c(`NullPointerException`);return t},ae=()=>{j();let e=[];for(;T(1)!==`begin`&&T(1)!==`{`;)e.push(ie()),ee();return e},N=()=>{if(`while if assert print else elsif either or end with when await skip call return goto`.split(` `).includes(T(1)))return!1;let e=Dt(n);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},oe=()=>{if(!N())return``;let e=w();t.isInMacro&&C(`A label may not appear in a macro.`),e===`Done`&&C("Cannot use `Done' as a label."),e===`Error`&&C("Cannot use `Error' as a label."),k(`:`),f=!0,d.add(e);let n=T(1);return n!==`+`&&n!==`-`||(k(n),(n===`+`?_:v).push(e),S=!1),e},P=()=>{let e=[],t=e=>!g&&[`end`,`else`,`elsif`,`or`].includes(e)||g&&e===`}`;for(;!t(T(1));)e.push(...F());return g&&e.length===0&&C(`Empty statement list`),e},se=t=>{O(`{`);let n=P();if(k(`}`),k(`;`),t!==``){if(n[0].lbl!==``)throw new e.s(`Duplicate labeling of statement`,n[0]);n[0].lbl=t}return n},F=()=>{let e=oe();if(g&&T(1)===`{`)return se(e);let t=ce();return t.lbl=e,[t]},ce=()=>{let t=T(1);if(t===`if`)return ue(0);if(t===`either`)return de();if(t===`with`)return fe(0);if(t===`when`||t===`await`){O(t);let n=o.column,r=o.line,i=D();if(i.tokens.length===0)throw new e.c(`NullPointerException`);return k(`;`),{...I(),kind:`When`,col:n,line:r,exp:i}}if(t===`print`||t===`assert`){O(t);let e=o.column,n=o.line,r=D();return r.tokens.length===0&&C(`Empty expression in ${t} statement at `),k(`;`),{...I(),kind:t===`print`?`PrintS`:`Assert`,col:e,line:n,exp:r}}if(t===`skip`){O(`skip`);let e={...I(),kind:`Skip`,col:o.column,line:o.line};return k(`;`),e}if(t===`call`)return _e();if(t===`return`){O(`return`);let e={...I(),kind:`Return`,col:o.column,line:o.line,from:m};return k(`;`),e}if(t===`goto`){O(`goto`);let e=o.column,t=o.line,n=w();return b=!0,(n===`Done`||n===`"Done"`)&&(x=!0),k(`;`),{...I(),kind:`Goto`,col:e,line:t,to:n}}return t===`while`?le():E(1)[0]===`(`?ve():me()},le=()=>{O(`while`);let e=o.column,t=o.line;g&&k(`(`);let n=D();g&&k(`)`),n.tokens.length===0&&C(`Empty while test at `),g||k(`do`);let r=g?F():P();return g||(k(`end`),k(`while`),k(`;`)),r.length===0&&C(`Missing body of while statement at`),{...I(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},ue=e=>{O(e===0?`if`:`elsif`);let t={...I(),kind:`LabelIf`,col:o.column,line:o.line,test:ct(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};g&&k(`(`),t.test=D(),g&&k(`)`),t.test.tokens.length===0&&C(`Empty if test at `),g||k(`then`),t.unlabThen=g?F():P();let n=T(1);return n===`else`&&(O(`else`),t.unlabElse=g?F():P()),!g&&n===`elsif`&&(t.unlabElse=[ue(e+1)]),!g&&![`else`,`elsif`,`end`].includes(n)&&C(`Expecting "else", "elsif", or "end"`),!g&&e===0&&(k(`end`),k(`if`),k(`;`)),t.unlabElse.length===0&&at(t.unlabThen,t.unlabThen.length-1),t},de=()=>{O(`either`);let t={...I(),kind:`LabelEither`,col:o.column,line:o.line,clauses:[]};for(;;){let n={...I(),kind:`Clause`,unlabOr:g?F():P(),labOr:[]};if(n.unlabOr.length===0)throw new e.s("`either' statement with empty `or' clause",t);if(t.clauses.push(n),T(1)!==`or`)break;O(`or`)}if(g||(O(`end`),k(`either`),k(`;`)),t.clauses.length===1)throw new e.s("`either' statement has no `or'",t);return t},fe=t=>{t===0&&(k(`with`),g&&k(`(`));let n={...I(),kind:`With`,col:o.column,line:o.line,var:w(),isEq:!0,exp:ct(),Do:[]};n.isEq=A(),n.exp=D(),g&&T(1)===`)`||ee(),n.exp.tokens.length===0&&C(`Empty with expression at `);let r=!g&&T(1)===`do`,i=g&&T(1)===`)`;if(r&&k(`do`),i&&O(`)`),n.Do=r?P():i?F():[fe(t+1)],r&&(k(`end`),k(`with`),k(`;`)),n.Do.length===0)throw new e.s(`Missing body of with statement`,n);return n},pe=()=>{let e=a.columns[0]+1,t=a.lines[0]+1,n={...I(),kind:`Lhs`,col:e,line:t,var:w(),sub:D()};k(`:=`,`≔`);let r=D();return r.tokens.length===0&&C(`Empty right-hand side of assignment at `),{...I(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},me=()=>{let t={...I(),kind:`Assign`,col:a.columns[0]+1,line:a.lines[0]+1,ass:[pe()]};for(;T(1)===`||`||T(1)===`‖`;){w();try{t.ass.push(pe())}catch(t){if(!(t instanceof e.s))throw t;C(`Bad assignment statement at `)}}return k(`;`),t},he=()=>{let e=[];if(E(0)[0]!==`)`)for(;;){let t=D();if(e.push(t),t.tokens.length===0&&C(`Empty argument in call statement at `),T(1)===`)`)break;k(`,`)}return k(`)`),k(`;`),e},ge=()=>{O(`call`);let e={...I(),kind:`Call`,col:o.column,line:o.line,returnTo:``,to:w(),args:[]};return k(`(`),e.args=he(),y.includes(e.to)||y.push(e.to),e},_e=()=>{let e=ge();if(T(1)===`return`)return O(`return`),k(`;`),{...I(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:m,args:e.args};if(T(1)!==`goto`)return e;O(`goto`);let t={...I(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:w(),args:e.args};return b=!0,(t.to===`Done`||t.to===`"Done"`)&&(x=!0),k(`;`),t},ve=()=>{let e={...I(),kind:`MacroCall`,name:w(),col:o.column,line:o.line,args:[]};return O(`(`),e.args=he(),e},ye=e=>{t.isInMacro=!0,O(`macro`);let n={...I(),kind:`Macro`,col:o.column,line:o.line,name:w(),params:[],body:[]};for(k(`(`);T(1)!==`)`;)n.params.length>0&&k(`,`),n.params.push(w());return O(`)`),te(),n.body=P(),ne(`macro`),T(1)===`;`&&w(),Me(n.body,e),t.isInMacro=!1,n},be=()=>{k(`procedure`);let e={...I(),kind:`Procedure`,col:o.column,line:o.line,name:w(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(m=e.name,_=[],v=[],y=[],k(`(`);T(1)!==`)`;)e.params.length>0&&k(`,`),e.params.push(ie());return O(`)`),T(1)!==`begin`&&T(1)!==`{`&&(e.decls=ae()),te(),e.body=P(),ne(`procedure`),T(1)===`;`&&w(),m=void 0,e.plusLabels=_,e.minusLabels=v,e.proceduresCalled=y,e},xe=()=>{k(`process`);let e=o.column,t=o.line;g&&k(`(`);let n=w(),r=A(),i=D();_=[],v=[],y=[],g&&k(`)`),i.tokens.length===0&&C(`Empty process id at `);let a=T(1)===`begin`||T(1)===`{`?[]:re();te();let s=P();return ne(`process`),T(1)===`;`&&w(),{...I(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:v,plusLabels:_,proceduresCalled:y,isEq:r,id:i,decls:a,body:s}},Se=()=>{let e=`${i.labelRoot}${u}`;return u+=1,d.has(e)?Se():e},Ce=e=>{e.lbl===``&&(e.lbl=Se(),c.push(e.lbl),l.push(rt(e)))},we=(t,n,r,i,a)=>{Gt(i,a);let o=n,s=!1,c=e=>{Ce(e),s=!0,a.length=0};return t.forEach(t=>{if(t.lbl!==``&&(s=!0,a.length=0,r))throw new e.s("Label in `with' statement",t);if(o){if(r)throw new e.s("Statement follows `call' or `return' inside a `with' statement.",t);c(t),o=!1}switch(t.kind){case`LabelIf`:{let e=[],n=[],i=we(t.unlabThen,!1,r,a,e);o=we(t.unlabElse,!1,r,a,n)||i,Gt(Ut(e,n),a);return}case`LabelEither`:{let e=[];t.clauses.forEach(t=>{let n=[];o=we(t.unlabOr,!1,r,a,n)||o,Gt(Ut(n,e),e)}),Gt(e,a);return}case`While`:if(r)throw new e.s("`while' inside a `with' statement",t);c(t),we(t.unlabDo,!1,!1,a,[]),o=!1;return;case`With`:{let e=[];o=we(t.Do,!1,!0,r?[...i]:[],e),Gt(e,a),!r&&!Wt(i,a)&&c(t);return}}let n=t.kind===`Call`||t.kind===`CallGoto`,l=t.kind===`Return`||t.kind===`CallReturn`,u=t.kind===`Assign`?Ut([],t.ass.map(e=>e.lhs.var)):n||l?[`stack`,...l||t.to===m?h.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(o=n||l||t.kind===`Goto`,Wt(a,u))Gt(Ut(a,u),a);else{if(r)throw new e.s(t.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",t);c(t),Gt(u,a)}}),s||o},Te=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return Te(n),{unlabeled:n,labeled:Ee(t===-1?[]:e.slice(t))}};e.forEach(e=>{switch(e.kind){case`LabelIf`:{let n=t(e.unlabThen);e.unlabThen=n.unlabeled,e.labThen=n.labeled;let r=t(e.unlabElse);e.unlabElse=r.unlabeled,e.labElse=r.labeled;return}case`LabelEither`:e.clauses.forEach(e=>{let n=t(e.unlabOr);e.unlabOr=n.unlabeled,e.labOr=n.labeled});return;case`While`:{let n=t(e.unlabDo);e.unlabDo=n.unlabeled,e.labDo=n.labeled}}})},Ee=t=>{let n=[];return t.forEach(t=>{if(t.lbl===``&&n.length>0)n[n.length-1].stmts.push(t);else{if(t.lbl===``)throw new e.o(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);n.push({...I(),kind:`LabeledStmt`,col:t.col,line:t.line,macroCol:t.macroCol,macroLine:t.macroLine,label:t.lbl,stmts:[t]})}}),n.forEach(e=>Te(e.stmts)),n},De=(t,n)=>{let r=t[n];switch(r.kind){case`LabelIf`:{let e=Oe(r.unlabThen);r.labThen.forEach(e=>Oe(e.stmts));let i=Oe(r.unlabElse);return r.labElse.forEach(e=>Oe(e.stmts)),r.labThen.length>0||r.labElse.length>0||e===2||i===2?2:(t[n]={...I(),kind:`If`,test:r.test,Then:r.unlabThen,Else:r.unlabElse},+(e+i>0))}case`LabelEither`:{let e=r.clauses.reduce((e,t)=>{let n=Math.max(e,Oe(t.unlabOr));return t.labOr.forEach(e=>Oe(e.stmts)),t.labOr.length>0?2:n},0);return e===2?2:(t[n]={...I(),kind:`Either`,ors:r.clauses.map(e=>e.unlabOr)},e)}case`With`:{let t=Oe(r.Do);if(t===2)throw new e.s(`with statement at ${rt(r)} contains a labeled statement`);return t}case`While`:if(n!==0)throw new e.o("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return Oe(r.unlabDo),r.labDo.forEach(e=>Oe(e.stmts)),0;case`Call`:return t[n+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(m===void 0)throw new e.s(`return statement not in a procedure at ${rt(r)}`);return 1;case`Goto`:case`CallGoto`:return 1;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`MacroCall`:return 0;default:throw new e.o(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${r.kind}`)}},Oe=t=>{for(let n=0;n<t.length;n++){let r=De(t,n);if(r!==0){if(n===t.length-1)return r;throw new e.o(`Translator discovered later than it should have that\n Statement at ${rt(t[n+1])} must have a label`)}}return 0},ke=e=>{we(e,!0,!1,[],[]);let t=Ee(e);return t.forEach(e=>Oe(e.stmts)),t},Ae=(t,n,r,i,a)=>{let o=e=>bt(e,n,r),s=e=>e.map(e=>Ae(e,n,r,i,a)),c=e=>e.map(e=>({...I(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>Ae(e,n,r,-1,0))})),l={...I(),col:t.col,line:t.line,macroCol:i>0?a:t.macroCol,macroLine:i>0?i:t.macroLine};switch(t.kind){case`Assign`:return{...l,kind:`Assign`,ass:t.ass.map(e=>je(e,n,r,i,a))};case`If`:return{...l,kind:`If`,test:o(t.test),Then:s(t.Then),Else:s(t.Else)};case`Either`:return{...l,kind:`Either`,ors:t.ors.map(s)};case`With`:return{...l,kind:`With`,var:t.var,isEq:t.isEq,exp:o(t.exp),Do:s(t.Do)};case`When`:case`Assert`:case`PrintS`:return{...l,kind:t.kind,exp:o(t.exp)};case`Skip`:return{...l,kind:`Skip`,macroCol:i>0?a:0,macroLine:i>0?i:-1};case`While`:return{...l,kind:`While`,test:o(t.test),unlabDo:s(t.unlabDo),labDo:c(t.labDo)};case`LabelIf`:return{...l,kind:`LabelIf`,test:o(t.test),unlabThen:s(t.unlabThen),labThen:c(t.labThen),unlabElse:s(t.unlabElse),labElse:c(t.labElse)};case`LabelEither`:return{...l,kind:`LabelEither`,clauses:t.clauses.map(e=>({...I(),kind:`Clause`,labOr:c(e.labOr),unlabOr:s(e.unlabOr)}))};case`Call`:return{...l,kind:`Call`,to:t.to,returnTo:t.returnTo,args:xt(t.args,n,r)};case`Return`:return{...l,kind:`Return`,from:t.from};case`CallReturn`:return{...l,kind:`CallReturn`,to:t.to,from:t.from,args:xt(t.args,n,r)};case`CallGoto`:return{...l,kind:`CallGoto`,to:t.to,after:t.after,args:xt(t.args,n,r)};case`Goto`:return{...l,kind:`Goto`,to:t.to};default:throw new e.o(`Found unexpected statement type in macro at${rt(t)}`)}},je=(t,n,r,i,a)=>{let o=bt(t.rhs,n,r),s={...I(),kind:`Lhs`,var:t.lhs.var,sub:t.lhs.sub.tokens.length===0?t.lhs.sub:bt(t.lhs.sub,n,r)},c={...I(),kind:`SingleAssign`,col:t.col,line:t.line,macroCol:i>0?a:t.macroCol,macroLine:i>0?i:t.macroLine,lhs:s,rhs:o},l=r.indexOf(s.var);if(l===-1)return c;let u=n[l],d=ht(u,{line:0,item:0});if(d.type!==$e.ident)throw new e.s(`Macro expansion substitutes \`${d.string}' for assignment variable\n at ${rt(c)}`);if(s.var=d.string,gt(u,{line:0,item:0},1)===void 0)return c;let f=ft(u);return f.tokens[0].splice(0,1),lt(f),s.sub.tokens.length===0?s.sub=f:pt(s.sub,f,0),c},Me=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return Me(e.unlabThen,t),Me(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>Me(e.unlabOr,t)),[e];case`With`:return Me(e.Do,t),[e];case`While`:return Me(e.unlabDo,t),[e];case`MacroCall`:return Ne(e,t);default:return[e]}});e.splice(0,e.length,...n)},Ne=(t,n)=>{let r=n.findLast(e=>e.name===t.name);if(r===void 0)throw new e.s(`Macro ${t.name} undefined,\n at ${rt(t)}`);if(r.params.length!==t.args.length)throw new e.s(`Macro ${t.name} called with wrong number of arguments at \n ${rt(t)}`);let i=r.body.map(e=>Ae(e,t.args,r.params,t.line,t.col));return i.length>0&&(i[0].lbl=t.lbl),i},Pe=t=>{t.forEach((n,r)=>{if(t.slice(r+1).some(e=>e.name===n.name))throw new e.s(`Multiple definitions of macro name \`${n.name}'`)})},Fe=e=>{if(e.length===0)return;let t=()=>{S=!1},n=e[0];if(e.length>1||n.kind!==`LabeledStmt`)return t();if(n.stmts.length===0)return;let r=n.stmts[0];if(n.stmts.length>1||r.kind!==`While`||!mt(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(S=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(S=!1)},Ie=()=>{let t=c.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new e.s([t,...l].join(`
|
|
31
|
+
`))},Le=e=>h.forEach(t=>{m=t.name,Me(t.body,e),t.body=ke(t.body)}),Re=()=>{r&&w()!==`algorithm`&&C("`--fair' not followed by `algorithm'");let e=w();g=T(1)===`{`,g&&O(`{`);let n=T(1)===`variable`||T(1)===`variables`?re():[],a=ct();T(1)===`define`&&(O(`define`),g&&k(`{`),a=D(!0),ne(`define`),k(`;`));let o=[];for(;T(1)===`macro`;)o.push(ye(o));for(;T(1)===`procedure`;)h.push(be()),S=!1;if(T(1)===`fair`&&(T(2)===`process`||T(2)===`+`&&T(3)===`process`)||T(1)===`process`){let r=[];for(;T(1)===`fair`||T(1)===`process`;){let e=T(1)===`fair`;e&&O(`fair`);let t=e&&T(1)===`+`;t&&O(`+`);let n=t||!e&&i.fairnessOption===`sf`?2:e||i.fairnessOption===`wf`?1:0;r.push({...xe(),fairness:n})}return ne(`algorithm`),Pe(o),r.forEach(e=>{Me(e.body,o),e.body=ke(e.body),Fe(e.body)}),Le(o),c.length>0&&(i.labelFlag||Ie(),t.log(`Labels added.`)),(x||b)&&(S=!1),{...I(),kind:`Multiprocess`,name:e,decls:n,defs:a,macros:o,prcds:h,procs:r}}i.inputVersionNumber===1500&&T(1)===`fair`&&(k(`fair`),T(1)===`+`&&k(`+`),i.fairnessOption=`wf`),r&&([``,`wf`,`wfNext`].includes(i.fairnessOption)||t.log(`Warning: Option \`${i.fairnessOption}' specified for --fair algorithm.`),i.fairnessOption=`wf`),te();let s=P();Pe(o),Me(s,o),Le(o),g&&k(`}`),ne(`algorithm`);let l=ke(s);return c.length>0&&(f&&!i.labelFlag&&Ie(),t.log(`Labels added.`)),(b||x)&&(S=!1),Fe(l),{...I(),kind:`Uniprocess`,name:e,decls:n,defs:a,macros:o,prcds:h,body:l}};try{return{ast:Re(),shouldOmitPC:S,hasDefaultInitialization:p}}catch(t){if(!(t instanceof e.c))throw t;return C(`Unknown error at or before`)}},R={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},qt=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],Jt=/* @__PURE__ */ new Set([R.global,R.processVar,R.procedureVar,R.parameter]),Yt=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),Xt=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),Zt=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},Qt=(e,t,n,r)=>!(t===R.procedureVar||t===R.processVar||t===R.parameter?Yt(e,R.global,n,``)!==void 0||Xt(e,n,r)!==void 0:Yt(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,useThis:n}),!0),$t=(e,t,n,r)=>Yt(e,t,n,r)?.useThis??n,en=(e,t,n)=>{let r=Xt(e,t,n);return r===void 0?t:Jt.has(r.type)?r.useThis:t},tn=t=>{let n={symbols:[],procedures:[],processNames:[],errorReport:``},r=(e,t)=>{Qt(n,R.label,e.label,t)||(n.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>i(e,t))},i=(t,n)=>{let a=e=>e.forEach(e=>i(e,n)),o=e=>e.forEach(e=>r(e,n));switch(t.kind){case`While`:a(t.unlabDo),o(t.labDo);return;case`If`:a(t.Then),a(t.Else);return;case`With`:a(t.Do);return;case`LabelIf`:a(t.unlabThen),o(t.labThen),a(t.unlabElse),o(t.labElse);return;case`Either`:t.ors.forEach(a);return;case`LabelEither`:t.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`Call`:case`Return`:case`CallReturn`:case`CallGoto`:case`Goto`:return;default:throw new e.o(`Unexpected AST type ${t.kind}`)}},a=(e,t,r=t===``?R.global:R.processVar)=>{Qt(n,r,e.var,t)||(n.errorReport+=`\n${qt[r]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(Qt(n,R.global,`pc`,``),t.prcds.length>0&&Qt(n,R.global,`stack`,``),t.decls.forEach(e=>a(e,``)),t.prcds.forEach(e=>{let t=Zt(n,e.name)<n.procedures.length;t&&(n.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:it(e.body[0]).label}),Qt(n,R.procedure,e.name,``),e.decls.forEach(t=>a(t,e.name,R.procedureVar)),e.params.forEach(t=>a(t,e.name,R.parameter)),e.body.forEach(t=>r(it(t),e.name))}),t.kind===`Multiprocess`&&t.procs.forEach(e=>{let t=n.processNames.includes(e.name);t&&(n.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.processNames.push(e.name),Qt(n,R.process,e.name,``),e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>r(it(t),e.name))}),t.kind===`Uniprocess`&&t.body.forEach(e=>r(it(e),``)),n.errorReport.length>0)throw new e.s(n.errorReport);return n},nn=e=>{let t=t=>e.symbols.filter(e=>e.useThis===t).length>1,n=!1;for(let r=0;r<=7;r+=1)e.symbols.forEach(e=>{if(e.type===r){e.useThis=e.id;for(let n=1;r>0&&t(e.useThis);n+=1)e.useThis+=n===1?`_`:e.context[n-2]??String(r);e.id!==e.useThis&&(n=!0)}});return n},rn=t=>{let n=t.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${qt[e.type]} name`);if(n.length>0)throw new e.s(`Cannot use \`defaultInitValue' as ${n.join(` or `)}`)},an=(t,n,r)=>{let i=(e,t)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==$e.ident)return;let a=en(n,e.string,t);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(ut([[cn(a)]])))})),i.length>0&&yt(e,i,r,!1)},a=(e,t)=>{e.var=en(n,e.var,t),i(e.val,t)},o=(e,t)=>e.forEach((r,i)=>{e[i]=$t(n,R.label,r,t)}),s=(e,t)=>e===void 0?void 0:$t(n,R.procedure,e,t),c=(e,t)=>{e.label=$t(n,R.label,e.label,t),e.stmts.forEach(e=>l(e,t))},l=(t,r)=>{let a=e=>e.forEach(e=>l(e,r)),o=e=>e.forEach(e=>c(e,r)),u=e=>e.forEach(e=>i(e,r));switch(t.kind){case`LabeledStmt`:c(t,r);return;case`While`:a(t.unlabDo),o(t.labDo),i(t.test,r);return;case`Assign`:t.ass.forEach(e=>{e.lhs.var=en(n,e.lhs.var,r),i(e.lhs.sub,r),i(e.rhs,r)});return;case`If`:a(t.Then),a(t.Else),i(t.test,r);return;case`With`:i(t.exp,r),a(t.Do);return;case`When`:case`PrintS`:case`Assert`:i(t.exp,r);return;case`Skip`:return;case`LabelIf`:i(t.test,r),a(t.unlabThen),o(t.labThen),a(t.unlabElse),o(t.labElse);return;case`Call`:t.returnTo=$t(n,R.procedure,t.returnTo,r),t.to=$t(n,R.procedure,t.to,r),u(t.args);return;case`Return`:t.from=s(t.from,r);return;case`CallReturn`:t.from=s(t.from,r),t.to=$t(n,R.procedure,t.to,r),u(t.args);return;case`CallGoto`:t.after=$t(n,R.procedure,t.after,r),t.to=$t(n,R.procedure,t.to,r),u(t.args);return;case`Goto`:if(Yt(n,R.label,t.to,r)===void 0&&t.to!==`Done`)throw new e.s(`goto to non-existent label \`${t.to}' at line ${t.line}, column ${t.col}`);t.to=$t(n,R.label,t.to,r);return;case`Either`:t.ors.forEach(a);return;case`LabelEither`:t.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;default:throw new e.o(`Unexpected AST type${t.kind}`)}},u=e=>{e.decls.forEach(t=>a(t,e.name)),e.params.forEach(t=>a(t,e.name)),e.body.forEach(t=>c(it(t),e.name));let t=at(n.procedures,Zt(n,e.name));o(e.plusLabels,e.name),o(e.minusLabels,e.name),t.initialPC!==void 0&&(t.initialPC=$t(n,R.label,t.initialPC,e.name)),e.name=$t(n,R.procedure,e.name,``),t.name=e.name},d=e=>{e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>c(it(t),e.name)),o(e.plusLabels,e.name),o(e.minusLabels,e.name),e.name=$t(n,R.process,e.name,``)};t.decls.forEach(e=>a(e,``)),t.kind===`Multiprocess`&&((e,t)=>{e.forEach(u);let n=e.map(e=>e.name),i=e.map(e=>n.map(t=>e.proceduresCalled.includes(t)));n.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=n.filter((e,n)=>i[t][n])});for(let e of t){d(e);let t=e.proceduresCalled;for(let e=0;e<t.length;e+=1){let a=n.indexOf(t[e]);if(a===-1){r(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}n.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(t.prcds,t.procs),t.kind===`Uniprocess`&&(t.prcds.forEach(u),t.body.forEach(e=>c(it(e),``)))},on=e=>ot(e,0,$e.string),sn=e=>ot(e,0,$e.added),z=e=>ot(e,0,$e.builtin),cn=e=>ot(e,0,$e.ident),ln=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+st(r)+t;n.push(ot(e.string,i,e.type))}),ut([n])},un=e=>e.tokens.forEach((t,n)=>{let r=n===0||n===e.tokens.length-1?1:6;t.forEach(e=>{if(e.column=r,r+=st(e),e.type===$e.builtin)switch(e.string){case`|->`:case`↦`:e.column=Math.max(16,e.column+1),r=e.column+5;return;case`[`:case`<<`:r+=1;return;case`]`:case`>>`:e.column+=1,r+=1;return;case`\\o`:e.column+=1,r+=2}})}),dn=(e,t,n,r=0,i=0)=>({...I(),kind:`SingleAssign`,line:r,col:i,lhs:{...I(),kind:`Lhs`,var:e,sub:t},rhs:n}),fn=(e,t=0,n=0)=>({...I(),kind:`Assign`,line:t,col:n,ass:e}),pn=(e,t,n=0,r=0)=>fn([dn(e,ut([]),t,n,r)],n,r),mn=e=>{if(e.tokens.length>1)return!1;let t=at(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},hn=e=>({...I(),kind:`When`,exp:ln([sn(`pc`),z(`=`),on(e)],1)}),gn=e=>pn(`pc`,ut([[on(e??`null`)]])),_n=e=>[cn(`Head`),z(`(`),sn(`stack`),z(`)`),z(`.`),cn(e)],vn=()=>[cn(`Tail`),z(`(`),sn(`stack`),z(`)`)],yn=e=>ut([_n(e)]),bn=(e,t,n,r)=>{let i=[[z(`<<`),z(`[`),cn(`procedure`),z(`|->`),on(e),z(`,`)],[cn(`pc`),z(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(z(`,`)),i.push([cn(e.var),z(`|->`),cn(e.var)])}),i[i.length-1].push(z(`]`),z(`>>`)),i.push(r);let a=ct(i);return un(a),lt(a),a},xn=(t,n,r)=>{if(n.params.length!==r.args.length)throw new e.s(`Procedure ${r.to} called with wrong number of arguments`,r);return n.params.forEach((e,n)=>t.ass.push(dn(e.var,ut([]),r.args[n],r.line,r.col))),[t,...n.decls.map(e=>pn(e.var,e.val,r.line,r.col)),gn(n.initialPC)]},Sn=(t,n,r)=>{let i,a=(t,r)=>{let i=Zt(n,t.to);if(i===n.procedures.length)throw new e.s(`Call of non-existent procedure ${t.to}`,t);let a=n.procedures[i],o=bn(t.to,[on(r)],[...a.decls,...a.params],[z(`\\o`),sn(`stack`)]);return xn(pn(`stack`,o,t.line,t.col),a,t)},o=t=>{t.from??=i;let r=t.from;if(r===void 0)throw new e.s("`return' statement not in procedure",t);let a=Zt(n,r);if(a>=n.procedures.length)throw new e.s(`Error in procedure (perhaps name used elsewhere)`,t);let o=n.procedures[a],s=(e,n)=>fn([dn(e,ct(),n,t.line,t.col)],t.line,t.col);return[s(`pc`,yn(`pc`)),...o.decls.map(e=>s(e.var,yn(e.var))),...o.params.map(e=>s(e.var,yn(e.var))),s(`stack`,ut([vn()]))]},s=t=>{let r=t.from;if(r===void 0)throw new e.s(`\`return' statement following \`call' at ${rt(t)} not in a procedure`);let i=at(n.procedures,Zt(n,r)),a=Zt(n,t.to);if(a===n.procedures.length)throw new e.s(`Call of non-existent procedure ${t.to}`,t);let o=n.procedures[a],s=fn([],t.line,t.col);if(r!==t.to){i.decls.forEach(e=>s.ass.push(dn(e.var,ct(),yn(e.var),t.line,t.col)));let e=bn(t.to,_n(`pc`),[...o.decls,...o.params],[z(`\\o`),...vn()]);s.ass.push(dn(`stack`,ut([]),e,t.line,t.col))}return xn(s,o,t)},c=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!r};let n={stmts:e,labeledStmts:[],needsGoto:!1},i=e[e.length-1];switch(i.kind){case`LabelIf`:case`LabelEither`:{let r=i.kind===`LabelIf`?p(i,t):m(i,t);e.pop(),e.push(r.stmt),n.labeledStmts=r.labeledStmts;break}case`Goto`:e.pop(),e.push(gn(i.to));break;case`Call`:e.pop(),e.push(...a(i,t));break;case`Return`:e.pop(),e.push(...o(i));break;case`CallReturn`:e.pop(),e.push(...s(i));break;case`CallGoto`:e.pop(),e.push(...a({...I(),kind:`Call`,returnTo:``,to:i.to,args:i.args,line:i.line,col:i.col},i.after));break;case`If`:{let e=c(i.Then,t),a=c(i.Else,t);n.labeledStmts.push(...e.labeledStmts,...a.labeledStmts),i.Then=e.stmts,i.Else=a.stmts,r||(n.needsGoto=e.needsGoto&&a.needsGoto,n.needsGoto||(e.needsGoto&&i.Then.push(gn(t)),a.needsGoto&&i.Else.push(gn(t))));break}case`Either`:{let e=i.ors.map((e,r)=>{let a=c(e,t);return i.ors[r]=a.stmts,n.labeledStmts.push(...a.labeledStmts),a});n.needsGoto=e.every(e=>e.needsGoto),!r&&!n.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&i.ors[n].push(gn(t))});break}case`With`:{let e=c(i.Do,t);i.Do=e.stmts,n.labeledStmts.push(...e.labeledStmts),n.needsGoto=e.needsGoto;break}default:n.needsGoto=!0}return r&&(n.needsGoto=!1),n},l=(e,t)=>{let n=c(e,t);return n.needsGoto&&n.stmts.push(gn(t)),n},u=(e,t)=>{let n=e.stmts.at(0);if(n?.kind===`While`)return f(e,n,t);let i=l([...e.stmts],t),a=[];return r||(i.stmts.unshift(hn(e.label)),a.push({...I(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},d=(e,t)=>e.flatMap((n,r)=>u(n,r<e.length-1?e[r+1].label:t)),f=(e,t,n)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=l([...t.unlabDo],i),o=l(e.stmts.slice(1),n),s=mn(t.test),c=s?a.stmts:[{...I(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...I(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...r?[]:[hn(e.label)],...c]},...d(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},p=(e,t)=>{let n=l(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=l(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=d(e.labThen,t);return i.push(...d(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...I(),kind:`If`,col:e.col,line:e.line,test:e.test,Then:n.stmts,Else:r.stmts},labeledStmts:i}},m=(e,t)=>{let n=[],r=[];return e.clauses.forEach(e=>{let i=l(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...d(e.labOr,t))}),{stmt:{...I(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},h=(e,t)=>d(e.map(it),t),g=e=>{i=e.name;let t=h(e.body,$t(n,R.label,`Error`,``));return i=void 0,{...I(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:t}},_=e=>({...I(),kind:`Process`,col:e.col,line:e.line,name:e.name,fairness:0,minusLabels:[],plusLabels:[],proceduresCalled:[],isEq:e.isEq,id:e.id,decls:e.decls,body:h(e.body,`Done`)}),v=t.prcds.map(g);return t.kind===`Uniprocess`?{...I(),kind:`Uniprocess`,col:t.col,line:t.line,name:t.name,decls:t.decls,defs:t.defs,macros:[],prcds:v,body:h(t.body,`Done`)}:{...I(),kind:`Multiprocess`,col:t.col,line:t.line,name:t.name,decls:t.decls,defs:t.defs,macros:[],prcds:v,procs:t.procs.map(_)}},Cn=(t,n)=>{let r=n?[]:[`pc`];if(r.push(...t.decls.map(e=>e.var)),t.prcds.length>0&&r.push(`stack`),t.prcds.forEach(e=>{r.push(...e.params.map(e=>e.var)),r.push(...e.decls.map(e=>e.var))}),t.kind===`Multiprocess`&&t.procs.forEach(e=>r.push(...e.decls.map(e=>e.var))),r.length===0)throw new e.s(`The algorithm has no variables.`);let i=(e,t)=>{let n=r.indexOf(t);return n===-1?0:(e[n]+=1,e[n])},a=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),o=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),s=(t,n)=>{let s=[...n];t.ass=o(t.ass),new Set(t.ass.map(e=>e.lhs.var)).forEach(n=>{let a=t.ass.filter(e=>e.lhs.var===n);if(!r.includes(n))throw new e.s(`Assignment to undeclared variable ${n}`,a[0]);let o=a.some(e=>e.lhs.sub.tokens.length===0);if(i(s,n)>1||a.length>1&&o)throw new e.s(`Multiple assignment to ${n}`,t)}),a(n,s)},c=(t,n)=>{switch(t.kind){case`Assign`:s(t,n);return;case`If`:{let e=[...n],r=[...n];t.Then.forEach(t=>c(t,e)),t.Else.forEach(e=>c(e,r)),a(n,e),a(n,r);return}case`Either`:{let e=[...n];t.ors.forEach(t=>{let r=[...n];t.forEach(e=>c(e,r)),a(e,r)}),a(n,e);return}case`With`:t.Do.forEach(e=>c(e,n));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new e.o(`Unexpected AST type ${t.kind}`)}},l=e=>e.forEach(e=>{let t=r.map(()=>0);it(e).stmts.forEach(e=>c(e,t))});t.prcds.forEach(e=>l(e.body)),(t.kind===`Uniprocess`?[t.body]:t.procs.map(e=>e.body)).forEach(l)},wn=(e,t,n,r)=>{let i=tn(e);nn(i)&&r(`Warning: symbols were renamed.`),an(e,i,r),Cn(Sn(e,i,t),t),n&&rn(i)},Tn=`[ \\t\\n\\x0B\\f\\r]`,En=RegExp(`\\\\\\* BEGIN TRANSLATION${Tn}+\\(${Tn}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${Tn}*(=${Tn}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${Tn}*STRING)${Tn}*\\/\\\\${Tn}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${Tn}*(=${Tn}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${Tn}*STRING)${Tn}*\\)`),Dn=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),On=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),kn=(e,t)=>On(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${rt(t.node)}`),An=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),jn=(e,t,n,r)=>{for(let i=Math.max(t,0);i<e.length;i++){let t=e[i],a=t.indexOf(n);if(a===-1)continue;let o=a+n.length,s=t.slice(o).search(/[^ ]/);if(s!==-1&&o+s===t.indexOf(r))return i}return-1},Mn=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;t.column<n.length&&n[t.column]===` `;)t.column+=1;if(t.column<n.length)return n;t.line+=1,t.column=0}return``},Nn=(e,t,n)=>{let r=Array.from(e.slice(t)).findIndex(e=>n.includes(e));return r===-1?e.length:t+e.slice(t,t+r).length},Pn=e=>/^[\p{L}\p{Nd}_]$/u.test(e),Fn=(e,t,n)=>{for(;t.line<e.length;){let r=Mn(e,t);if(r.slice(t.column).startsWith(n)){let e=t.column+n.length;if(e>=r.length||!/^[\p{L}_]$/u.test(r[e]))return t.column=Nn(r,e,` `),!0}t.column=Nn(r,t.column,` `)}return!1},In=(e,t)=>On(e,`Command-line error: ${t}`),Ln=(e,t)=>{let n=e.params,r=!0,i=!1,a=t=>(r&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(In(e,`Can only have one of -wf, -sf, -wfNext, and -nof options`),!1));for(let r=0;r<t.length;r++){let o=t[r],s=t[r+1];switch(o){case`-spec`:case`spec`:case`-myspec`:case`myspec`:{let t=o.endsWith(`myspec`);if(n[t?`myspecOption`:`specOption`]=!0,n.specOption&&n.myspecOption){In(e,`
|
|
32
32
|
Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){In(e,`Specification name must follow \`-${t?`myspec`:`spec`}' option`);return}r+=1;continue}case`-termination`:case`termination`:n.checkTermination=!0;continue;case`-noold`:case`-nocfg`:case`-noDoneDisjunct`:case`noDoneDisjunct`:continue;case`-wf`:case`wf`:case`-sf`:case`sf`:case`-wfNext`:case`wfNext`:case`-nof`:case`nof`:if(!a(o.replace(/^-/,``)))return;o.endsWith(`nof`)&&(i=!0);continue;case`-label`:case`label`:n.labelFlag=!0;continue;case`-labelRoot`:case`labelRoot`:if(s===void 0){In(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){In(e,`Label root must be a valid PlusCal identifier (must start with a letter and contain only letters, numbers, and underscores)`);return}n.labelRoot=s,r+=1;continue;case`-version`:case`version`:{if(s===void 0){In(e,"Version number must follow `-version' option");return}let t=tt(s);if(t<0||t>1903){On(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),In(e,`Bad version number`);return}n.inputVersionNumber=t,r+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){In(e,"Integer value at least 60 must follow `-lineWidth' option");return}r+=1;continue;default:In(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!i&&(n.fairnessOption=`wf`)},Rn=(e,t,n)=>{if(Mn(t,n),n.column+=7,!Mn(t,n).slice(n.column).startsWith(`(`)){On(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=Mn(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=Nn(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?On(e,`No closing ')' found in options statement`):Ln(e,r)},zn=(t,n,r)=>{let i=0,a=!1,o=!1;for(let s=n;!a&&s<t.length;s++){let c=t[s],l=s===n?r:0,u=[c.slice(0,l)];o=!1;for(let e=l;!a&&e<c.length;e++){let t=c[e],n=c.slice(e,e+2);if(n===`(*`&&!o)i+=1,u.push(` `),e+=1;else if(n===`*)`&&!o&&i===0)u.push(n),a=!0;else if(n===`*)`&&!o)--i,u.push(` `),e+=1;else if(i>0)u.push(` `);else if(o&&t===`\\`&&n.length===2)u.push(n),e+=1;else{if(!o&&n===`\\*`){u.push(` `);break}t===`"`&&(o=!o),u.push(t)}}if(o)return new e.s(`Unterminated string in line ${s+1}`);t[s]=u.join(``)}},Bn=(t,n)=>{let r=10*2**Math.max(0,Math.ceil(Math.log2(n/10)));throw new e.c(`java.lang.ArrayIndexOutOfBoundsException: Index ${t} out of bounds for length ${r}`)},Vn=(t,n,r)=>{if(!n.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let i=An(n),a={line:0,column:0};for(;Fn(i,a,`PlusCal`);){let e=Mn(i,a).slice(a.column),n=Array.from(e).findIndex(e=>!Pn(e));if(e.startsWith(`options`)&&(n===-1?e.length:n)===7){Rn(t,i,a);break}}let o=0,s=-1,c=!1;for(;o<i.length;o++){let e=i[o];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){s=t+11;break}if(n!==-1){s=n+6,c=!0;break}}let l=/* @__PURE__ */ new Set,u=jn(i,0,`BEGIN`,`TRANSLATION`);u===-1&&l.add(`NO_TRANSLATION_EXISTS`);let d=jn(i,u+1,`END`,`TRANSLATION`);if(d===-1&&l.add(`NO_TRANSLATION_EXISTS`),u===-1&&d===-1)return l;if(s===-1)return l.add(`NO_PLUSCAL_EXISTS`),l;let f=zn(i,o,s);if(f!==void 0)return kn(t,f),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let p;try{let e=Kt(t,wt(i,o,s),c);p=e.ast,wn(e.ast,e.shouldOmitPC,e.hasDefaultInitialization,t.log)}catch(n){if(!(n instanceof e.s))throw n;kn(t,n)}u===-1&&Bn(-1,i.length);let m=En.exec(i[u]);if(m===null)return l.add(`NO_PCAL_CHECKSUMS_EXIST`),l;let h=m.groups?.pcal,g=c&&r!==`1.7.4`?`fair`:p===void 0?void 0:Ct(p,t.params.inputVersionNumber,r);h!==void 0&&(g===void 0||h!==Dn(g))&&l.add(`PCAL_DIVERGENCE_EXISTS`);let _=m.groups?.tla;if(_!==void 0){if(d===-1)throw new e.c(`java.lang.IllegalArgumentException: fromIndex(${u+1}) > toIndex(-1)`);let t=n.slice(u+1,d).join(``);_!==Dn(t)&&l.add(`TLA_DIVERGENCE_EXISTS`)}return l.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):l},Hn=[[`STRING`,0,0,[],[]],[`FALSE`,0,0,[],[]],[`TRUE`,0,0,[],[]],[`BOOLEAN`,0,0,[],[]],[`=`,2,0,[2,2],[1,1]],[`/=`,2,0,[2,2],[1,1]],[`.`,2,0,void 0,void 0],[`'`,1,2,[1],[0]],[`\\lnot`,1,0,[3],[1]],[`\\neg`,1,0,void 0,void 0],[`\\land`,2,0,[3,3],[1,1]],[`\\lor`,2,0,[3,3],[1,1]],[`\\equiv`,2,0,[3,3],[1,1]],[`=>`,2,0,[3,3],[1,1]],[`SUBSET`,1,0,[2],[1]],[`UNION`,1,0,[2],[1]],[`DOMAIN`,1,0,[2],[1]],[`\\subseteq`,2,0,[2,2],[1,1]],[`\\in`,2,0,[2,2],[1,1]],[`\\notin`,2,0,[2,2],[1,1]],[`\\`,2,0,[2,2],[1,1]],[`\\intersect`,2,0,[2,2],[1,1]],[`\\union`,2,0,[2,2],[1,1]],[`\\times`,2,0,[2,2],[1,1]],[`~>`,2,3,[3,3],[0,0]],[`[]`,1,3,[3],[0]],[`<>`,1,3,[3],[0]],[`ENABLED`,1,1,[2],[0]],[`UNCHANGED`,1,2,[1],[0]],[`\\cdot`,2,2,[2,2],[0,0]],[`-+->`,2,3,[3,3],[0,0]],[`$AngleAct`,2,2,[2,1],[0,0]],[`$BoundedChoose`,-1,0,[2],[1]],[`$BoundedExists`,-1,0,[3],[1]],[`$BoundedForall`,-1,0,[3],[1]],[`$CartesianProd`,-1,0,[2],[1]],[`$Case`,-1,0,[3],[1]],[`$ConjList`,-1,0,[3],[1]],[`$DisjList`,-1,0,[3],[1]],[`$Except`,-1,0,[2],[1]],[`$FcnApply`,2,0,[2,2],[1,1]],[`$FcnConstructor`,-1,0,[3],[1]],[`$IfThenElse`,3,0,[3,3,3],[1,1,1]],[`$NonRecursiveFcnSpec`,1,0,[3],[1]],[`$Pair`,2,0,[3,3],[1,1]],[`$RcdConstructor`,-1,0,[3],[1]],[`$RcdSelect`,2,0,[2,0],[1,1]],[`$RecursiveFcnSpec`,1,0,[3],[1]],[`$Seq`,-1,0,[2],[1]],[`$SetEnumerate`,-1,0,[2],[1]],[`$SetOfAll`,-1,0,[2],[1]],[`$SetOfFcns`,-1,0,[2],[1]],[`$SetOfRcds`,-1,0,[2],[1]],[`$SF`,2,3,[1,2],[0,0]],[`$SquareAct`,2,2,[2,1],[0,0]],[`$SubsetOf`,1,0,[2],[1]],[`$TemporalExists`,1,3,[3],[0]],[`$TemporalForall`,1,3,[3],[0]],[`$TemporalWhile`,2,3,[3,3],[0,0]],[`$Tuple`,-1,0,[2],[1]],[`$UnboundedChoose`,1,0,[2],[1]],[`$UnboundedExists`,1,0,[3],[1]],[`$UnboundedForall`,1,0,[3],[1]],[`$WF`,2,3,[1,2],[0,0]],[`$Nop`,1,0,[3],[1]],[`$Qed`,0,0,[],[]],[`$Pfcase`,1,0,[3],[1]],[`$Have`,1,0,[3],[1]],[`$Take`,1,0,[3],[1]],[`$Pick`,1,0,[3],[1]],[`$Witness`,-1,0,[2],[1]],[`$Suffices`,1,0,[3],[1]]],Un={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},B=e=>({id:e,levelChecked:0,level:0,levelParams:/* @__PURE__ */ new Set,allParams:/* @__PURE__ */ new Set,nonLeibnizParams:/* @__PURE__ */ new Set,argLevelParams:/* @__PURE__ */ new Map,levelCorrect:!0,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map}),Wn=e=>Hn.map(([t,n,r,i,a])=>{let o=e(),s=n<0?void 0:Array.from({length:n},(t,n)=>({...B(e()),kind:`FormalParam`,name:`Formal_${n}`,arity:0,location:void 0})),c=i!==void 0&&a!==void 0,l=a?.map(e=>e>0);return{...B(o),levelChecked:c?99:0,level:r,kind:`OpDef`,defKind:`BuiltIn`,name:t,arity:n,params:s,body:void 0,isLocal:!1,location:Un,module:void 0,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:n<0?(a??[]).slice(0,1):a??[],isLeibnizArg:c?l:void 0,isLeibniz:l?.every(Boolean)??!0,opLevelCond:void 0,maxLevels:n<0?(i??[]).slice(0,1):i??[],minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0}}),Gn=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},Kn=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,qn=e=>e?.kind===`OpAppl`&&e.nullKind===`absent`,Jn=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),Yn=(e,t)=>(e&2147483647)%t,Xn=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[Yn(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},Zn=(e,n,r=n)=>e.buckets[Yn(t.mn(r),e.buckets.length)].find(e=>e.key===n)?.value,Qn=(e,n,r,i=n)=>{let a=t.mn(i),o=e.buckets[Yn(a,e.buckets.length)].find(e=>e.key===n);o?o.value=r:(e.count>=e.threshold&&Xn(e),e.buckets[Yn(a,e.buckets.length)].unshift({hash:a,key:n,value:r}),e.count++)},$n=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),er=`\0module `,tr=()=>({table:Jn(),symbols:[]}),nr=e=>e.kind===`Module`?er+e.name:e.name,rr=(e,t)=>{Qn(e.table,nr(t),t,t.name),e.symbols.push(t)},ir=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,ar=(e,t)=>Zn(e.table,t),or=(e,t)=>Zn(e.table,er+t,t),sr=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),cr=(e,t)=>$n(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),lr=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),ur=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),dr=e=>{if(e.length>3&&e.endsWith(`!!!`))return[...dr(e.slice(0,-3)),`!!`];let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},fr=e=>{switch(e.kind){case`Identifier`:return dr(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=dr(e.operator),n=e.argumentCounts??t.map((n,r)=>r===t.length-1?e.args.length:0),r=0;return t.map((t,i)=>{let a=e.args.slice(r,r+n[i]);return r+=n[i],{op:`Name`,name:t,args:a.length>0?a:void 0}})}case`Subexpression`:return e.selectors.map(e=>{switch(e.kind){case`Name`:return{op:`Name`,name:e.name,args:e.args.length>0?e.args:void 0};case`Operand`:return{op:e.operand,name:String(e.operand),args:void 0};case`Bound`:return{op:`Null`,name:`!(...)`,args:e.args};case`At`:return{op:`@`,name:`@`,args:void 0};case`Colon`:return{op:`:`,name:`:`,args:void 0}}})}},pr=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},mr=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,hr=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,gr=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),_r=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,vr=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],yr=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},br=e=>(t,n,r,i,a)=>{let o=[],s=[],c=[],l={name:void 0,nameLocation:void 0,node:void 0,index:0,mode:`FindingOpName`,previousMode:void 0,letInContext:void 0,definitionArityFound:0,definitionArgs:[],isInSuffices:!1},u=()=>t[l.index].location??a,d=e=>e.args??[];for(;l.index<t.length;){let f=t[l.index];if((f.op!==`Name`&&f.op!==`Null`||n!==0)&&f.args!==void 0)return e.addError(u(),`Selector \`${f.name}' should not have argument(s).`);switch(l.mode){case`FindingOpName`:{let f,p,m=[];for(;f===void 0&&l.index<t.length;){let n=t[l.index];if(p=n.op===`Name`?l.name===void 0?e.resolveSynonym(n.name):`${l.name}!${e.resolveSynonym(n.name)}`:void 0,l.name===void 0&&n.op!==`Name`)return e.addError(u(),`Need name or step number here, not \`${n.name}'.`);p!==void 0&&(f=l.letInContext===void 0?e.resolveSymbol(p):ar(l.letInContext,p)),f===void 0&&(p!==void 0&&(l.name=p,l.nameLocation=yr(l.nameLocation,u())),m.push(...d(n)),l.index++)}if(f===void 0&&e.version===`1.7.4`){let n=t.length-1;return e.addError(t[n].location??a,`Unknown operator: \`${mr(t[n])}'.`)}if(f===void 0)return e.addError(l.nameLocation??a,`Unknown operator: \`${l.name}'.`);if(f.kind===`Module`)return e.addError(u(),`Module name (${t[l.index].name}) not allowed here.`);if(l.node=f,l.nameLocation=yr(l.nameLocation,u()),l.name=p,gr(f)&&t.length!==1)return e.addError(u(),`Cannot take subexpression of \`${l.name}'.`);let h=ir(f);if(n===0){if(m.push(...d(t[l.index])),l.definitionArityFound+m.length!==h)return e.addError(t[l.index].argsLocation??a,`The operator ${l.name} requires ${h-l.definitionArityFound} arguments.`);m.forEach((t,n)=>l.definitionArgs.push(e.generateArgument(f,n+l.definitionArityFound,t,u())))}if(l.definitionArityFound=h,f.kind===`OpDef`&&f.defKind===`ModuleInstance`){if(l.index===t.length-1&&!(i||r))return e.addError(u(),`Operator name ${l.name} is incomplete.`)}else{let n=f.kind===`OpDef`&&f.defKind===`UserDefined`||f.kind===`ThmOrAssumpDef`?f:void 0;if(f.kind===`OpDef`&&f.defKind===`UserDefined`&&!f.isDefined&&t.length!==1)return e.addError(u(),`Subexpression of \`${l.name}' used inside the operator's definition.`);if(l.index!==t.length-1&&n!==void 0){s.push(...n.params??[]),l.name=void 0,l.nameLocation=void 0,l.mode=t[l.index+1].op===`Name`?`FollowingLabels`:`FindingSubExpr`,c.push(...l.definitionArgs),l.definitionArityFound=0,l.definitionArgs=[];let e=n.body;for(;e?.kind===`SubstIn`;)o.push(e),e=e.body;for(;e?.kind===`APSubstIn`;)o.push(e),e=e.body;l.mode===`FindingSubExpr`&&(l.node=e)}}l.previousMode=`FindingOpName`;break}case`FollowingLabels`:{let r=l.node,i=r?.kind===`OpDef`||r?.kind===`ThmOrAssumpDef`||r?.kind===`Label`?r.labels.get(f.name):void 0;if(i===void 0)return e.addError(u(),`Cannot find label \`${f.name}'.`);if(l.node=i,e.isOutOfLabelScope(i))return e.addError(u(),`Accessing subexpression labeled \`${f.name}' of ASSUME/PROVE clause within the scope of a declaration\n from outside that declaration's scope.`);if(n===0){if(i.params.length!==d(f).length)return e.addError(u(),`Label \`${f.name}' used with wrong number of arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...i.params),l.index<t.length-1&&t[l.index+1].op!==`Name`&&(l.mode=`FindingSubExpr`),l.mode===`FindingSubExpr`&&(l.node=i.body),l.previousMode=`FollowingLabels`;break}case`FindingSubExpr`:{let n=l.node,r=()=>e.addError(u(),`Nonexistent operand specified by \`${mr(f)}'.`);if(f.op===`:`){if(!(l.previousMode!==`FindingSubExpr`&&(l.index===t.length-1&&l.previousMode===`FindingOpName`||l.index<t.length-1&&t[l.index+1].op===`Name`)))return e.addError(u(),`\`!:' can be used only after a name and either at the end after an
|
|
33
33
|
operator name or before an operator name.`)}else if(n===void 0)return e.addError(u(),`Subexpression selection failed, probably due to an error in the selected expression.`);else if(n.kind===`LetIn`){if(hr(f.op,1)!==1)return e.addError(u(),`A LET/IN expression has only one operand.`);l.node=n.body}else if(n.kind===`OpAppl`){let i=n.operator,a=n.operands,o=i.kind===`FormalParam`||i.kind===`OpDecl`&&i.declKind===2||i.kind===`OpDef`&&i.defKind===`UserDefined`,p=()=>e.addError(u(),`Internal error: Expecting $Pair and didn't find it.`),m=e=>e?.kind===`OpAppl`&&e.operator.name===`$Pair`,h=hr(f.op,a.length);if(o){let e=hr(f.op,i.arity);if(e===-1)return r();l.node=a[e-1]}else if(i.kind===`OpDef`&&i.defKind===`BuiltIn`){if(i.name===`$RcdConstructor`||i.name===`$SetOfRcds`){if(h===-1)return r();let e=a[h-1];if(!m(e))return p();l.node=e.operands[1]}else if(i.name===`$Case`){if(l.index===t.length-1)return e.addError(u(),`Subexpression of CASE must have form !i!j.`);if(h===-1)return r();let n=a[h-1];if(!m(n))return p();l.index++;let i=hr(t[l.index].op,2);if(i===-1)return e.addError(u(),`Second selector for CASE subexpression must specify one of two operands.`);if(l.node=n.operands[i-1],l.node===void 0)return e.addError(u(),`Selecting OTHER in a CASE statement.`)}else if(i.name===`$Except`){if(h>1)return e.addError(u(),`Selecting subexpression of an EXCEPT not yet implemented.`);if(h===-1)return r();l.node=a[h-1]}else if((n.bounded?.length??0)===0&&(n.unbounded?.length??0)===0){if(h===-1)return r();l.node=a[h-1]}else if(f.op===`Null`||f.op===`@`){let t=vr(n);if(s.push(...t),f.op===`Null`){if(d(f).length!==t.length)return e.addError(u(),`Selector with ${d(f).length} argument(s) used for quantifier with ${t.length} bound identifier(s).`);c.push(...d(f).map(e.generateExpression))}l.node=a[0]}else{let e=hr(f.op,n.ranges.length);if(e===-1)return r();l.node=n.ranges[e-1]}}else return e.addError(u(),`Choosing operand \`${f.name}' of subexpression with no operands.`)}else if(n.kind===`AssumeProve`){if(n.isSuffices&&!l.isInSuffices){if(hr(f.op,1)!==1)return e.addError(u(),`Accessing non-existent subexpression of a SUFFICES`);l.isInSuffices=!0}else{l.isInSuffices=!1;let i=hr(f.op,1+n.assumptions.length);if(i===-1)return r();if(e.isOutOfClauseScope(n,i))return e.addError(u(),`Accessing ASSUME/PROVE clause within the scope of a declaration
|
|
34
34
|
from outside that declaration's scope.`);if(i<=n.assumptions.length){if(l.node=n.assumptions[i-1],l.node.kind===`NewSymb`&&l.index!==t.length-1)return e.addError(u(),`Selected a subexpression of a NEW clause of an ASSUME.`)}else l.node=n.goal}}else if(n.kind===`OpArg`){let t=n.op;if(t.kind!==`OpDef`||t.name!==`LAMBDA`)return e.addError(u(),`Trying to select subexpression of an operator argument.`);if(f.op!==`Null`&&f.op!==`@`)return e.addError(u(),`Cannot use !${f.name} to select subexpression of a LAMBDA.`);if(f.op===`Null`){if(t.arity!==d(f).length)return e.addError(u(),`Selector with ${d(f).length} arguments used for LAMBDA expression taking ${t.arity} arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...t.params??[]),l.node=t.body}else if(n.kind===`Label`)l.node=n.body,l.index--;else return e.addError(u(),`Selecting subexpression of expression that has none.`);if(l.node===void 0)return e.addError(u(),`An unexpected null node specified by '${f.name}'.\nThis is probably due to a previous error.`);if(l.index!==t.length-1){let n=t[l.index+1];if(n.op===`Name`){for(;l.node?.kind===`Label`;)l.node=l.node.body;if(l.node?.kind!==`LetIn`)return e.addError(u(),`A name selector here must be from a LET clause.`);l.letInContext=l.node.context,l.mode=`FindingOpName`}else if(n.op===`:`)return e.addError(u(),`!: should not follow an operand selector.`)}l.previousMode=`FindingSubExpr`;break}}l.index++}let f=l.node;if(f===void 0)return e.addError(a,`Subexpression selection failed, probably due to an error in the selected expression.`);if(f.kind===`AssumeProve`||f.kind===`NewSymb`)return r?f:e.addError(a,f.kind===`AssumeProve`?`Selected ASSUME/PROVE instead of expression.`:`Selected a NEW declaration as an expression or operator.`);if(n<0){let t=f.kind===`OpDef`&&(f.defKind===`UserDefined`||f.defKind===`NumberedProofStep`||f.defKind===`ModuleInstance`&&i)||f.kind===`ThmOrAssumpDef`;return l.previousMode!==`FindingOpName`||!t?e.addError(a,`DEF clause entry should describe a defined operator.`):f.kind===`OpDef`&&f.step!==void 0&&f.step.kind!==`DefStep`?e.addError(a,`DEF clause entry refers to a non-definition step.`):f}if(f.kind===`OpDef`&&f.defKind===`NumberedProofStep`)return e.addError(a,r?`Step number of non-fact used as a fact`:`Step number of non-expression step used as an expression.`);if(n>0){let t=s.length+(f.kind===`OpArg`?ir(f.op):l.previousMode===`FindingOpName`&&_r(f)?ir(f):0);if(n!==t)return e.addError(a,`Expected arity ${n} but found operator of arity ${t}.`)}let p=f;if(l.previousMode===`FindingOpName`&&s.length+o.length>0){if(p.kind!==`OpDef`&&p.kind!==`ThmOrAssumpDef`)return e.addError(t[t.length-1].location??a,`Internal Error: Found unexpected node kind after FindingOpName`);c.push(...l.definitionArgs);let n=(p.params??[]).map(t=>{let n=e.createFormalParam(t.name,t.arity,t.location);return s.push(n),t.arity===0?e.createOpAppl(n,[],a):e.createOpArg(n,a)});p=e.createOpAppl(p,n,a)}if(p.kind===`OpArg`){if(n===0)return e.addError(a,`Selected operator argument when expression expected.`);if(s.length+o.length>0){let t=p.op;s.push(...Array.from({length:ir(t)},(t,n)=>e.createFormalParam(`NewParam${n}`,0,void 0))),p=e.createOpAppl(t,l.definitionArgs,a)}}if(!r){if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`AssumeProve`)return e.addError(a,`ASSUME/PROVE used where an expression is required.`);if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`OpAppl`){let t=ur.get(p.body.operator.name);if(t!==void 0)return e.addError(a,`${t} proof step selected instead of expression.`)}}if(p.kind===`FormalParam`||p.kind===`OpDecl`||p.kind===`ThmOrAssumpDef`||p.kind===`OpDef`&&(p.defKind===`UserDefined`||p.defKind===`BuiltIn`))return n>0?e.createOpArg(p,a):e.createOpAppl(p,l.definitionArgs,a);if(p.kind===`OpArg`)return p;if(p.kind===`OpDef`||p.kind===`Module`)return(r||i)&&p.kind===`OpDef`?p:e.addError(a,`Module instantiation selected instead of expression.`);let m=o.reduceRight((t,n)=>e.copySubstIn(n,t),p),h=s.length>0?e.createLambda(s,m,a):void 0;return n>0?h===void 0||s.length!==n?e.addError(a,`Expected operator argument with arity ${n} but found one of arity ${s.length}.`):e.createOpArg(h,a):s.length===c.length?h===void 0?e.createOpAppl(e.getBuiltin(`$Nop`),[m],a):e.createOpAppl(h,c,a):e.addError(a,`Expected ${s.length} arguments but found ${c.length}.`)},xr=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Sr=(e,t)=>`${e}:${t}`,Cr=(e,n)=>{let r=t.bn(n).filter(e=>e.kind!==`End`).map(t.yn),i=[0,0];for(let e=0;e<n.length;e++)n[e]===`
|
|
@@ -44,7 +44,7 @@ Temporal formula used as set.`)),Ga(e,e.set)),e.levelCorrect;case`AssumeProve`:r
|
|
|
44
44
|
`:e.length===1?`Temporal property ${e[0]} was violated.\n`:`Temporal properties ${e.slice(0,-1).join(`, `)}${e.length>2?`,`:``} and ${e[e.length-1]} were violated.\n`,vs=e=>e.filter((t,n)=>t!==e[n-1]).map((e,n)=>`${n}) ${t.K(e)}\n`).toReversed().join(``),ys=e=>{if(e.length===0)return` The error call stack is empty.
|
|
45
45
|
`;let t=[];return e.forEach((n,r)=>{let i=n.location.range;n!==e[r-1]&&i&&t.push(`${t.length}. Line ${i.start.line}, column ${i.start.column} to line ${i.end.line}, column ${i.end.column} in ${i.module}\n`)}),`${t.join(``)}\n`},bs=(e,n)=>{let r=n.generated,i=n.distinct,a=t.an(/* @__PURE__ */ new Date);r===i?e.print(t.en.initGenerated1,t.tn.none,`Finished computing initial states: ${i} distinct state${i===1?``:`s`} generated at ${a}.`):e.print(t.en.initGenerated2,t.tn.none,`Finished computing initial states: ${r} state${r===1?``:`s`} generated, with ${i} of them distinct at ${a}.`)},xs=(e,n,r)=>{let i=Math.max(Date.now()-(r??0),1)/6e4,a=e=>e.toLocaleString(`en-US`),o=(e,t)=>r===void 0?``:` (${a(Math.floor(e/i))} ${t}/min)`;e.print(t.en.progress,t.tn.none,`Progress(${Math.max(n.depth,1)}) at ${t.an(/* @__PURE__ */ new Date)}: ${a(n.generatedStates)} states generated${o(n.generatedStates,`s`)}, ${a(n.distinctStates)} distinct states found${o(n.distinctStates,`ds`)}, ${a(n.queuedStates)} states left on queue.`)},Ss={init:t.en.coverageInit,next:t.en.coverageNext,invariant:t.en.coverageProperty,implied:t.en.coverageProperty,constraint:t.en.coverageConstraint},Cs=(e,n,r)=>{let i=(n,r)=>e.print(n,t.tn.none,r);i(t.en.coverageStart,`The coverage statistics at ${t.an(/* @__PURE__ */ new Date)} (see https://explain.tlapl.us/module-coverage-statistics for how to interpret the following statistics).`),n.variables.forEach(e=>i(t.en.coverageVariable,`<${e.label}>: ${e.distinct}`)),n.relations.forEach(e=>{let n=Ss[e.kind];i(n,n===t.en.coverageProperty?`<${e.label}>`:`<${e.label}>: ${e.distinct}:${e.generated}`),e.expressions.forEach(e=>{let n=` ${`|`.repeat(e.depth)}${e.location}`;e.cost>0?i(t.en.coverageValueCost,`${n}: ${e.count}:${e.cost}`):i(t.en.coverageValue,`${n}: ${e.count}`)})}),Date.now()-r>3e5?i(t.en.coverageEndOverhead,`End of statistics (please note that for performance reasons large models
|
|
46
46
|
are best checked with coverage and cost statistics disabled).`):i(t.en.coverageEnd,`End of statistics.`)},ws=(e,t)=>(0,i.join)(e,`${t}.class`),Ts=(e,n,r,a)=>{let s=e.print;switch(n.kind){case`parsed`:r.isParsed=!0,e.isTool&&s(t.en.sanyFinished,t.tn.none,`SANY finished.`),s(t.en.starting,t.tn.none,`Starting... (${t.an(/* @__PURE__ */ new Date)})`);return;case`constant-level-invariant`:if(e.version===`1.7.4`)return;s(t.en.constantLevelInvariant,t.tn.warning,`The invariant ${n.name} is a constant-level formula (i.e., it contains no variables, primes, or temporal operators) and evaluates to TRUE. To assert constant-level formulas in your spec, use ASSUME ConstInv. If you optionally want to give the assumption a name, write ASSUME YourAssumption == ConstInv instead. See https://explain.tlapl.us/assumptions-and-invariants for additional details.`);return;case`state-level-property`:if(e.version===`1.7.4`)return;s(t.en.stateLevelProperty,t.tn.warning,`The formula ${n.name} is a state-level formula, but it was used as a PROPERTY (or PROPERTIES), where a temporal formula is typically expected. State-level formulas used as PROPERTY or PROPERTIES are only checked in the initial state. To verify that the formula ${n.name} holds in all states of every behavior, use INVARIANT ${n.name} instead. Alternatively, applying the "always" temporal operator ([]) to the state-level formula ${n.name} changes it into a temporal formula, asserting that ${n.name} holds in all states of every behavior. See https://explain.tlapl.us/invariants-and-properties for additional details.`);return;case`liveness-initializing`:n.isSymmetric&&s(t.en.livenessSymmetry,t.tn.warning,`Declaring symmetry during liveness checking is dangerous. It might cause TLC to miss violations of the stated liveness properties. Please check liveness without symmetry defined.`),n.isConstrained&&e.version===`1.7.4`&&s(t.en.livenessConstraints,t.tn.warning,`Declaring state or action constraints during liveness checking is dangerous: Please read section 14.3.5 on page 247 of Specifying Systems (https://lamport.azurewebsites.net/tla/book.html) and optionally the discussion at https://discuss.tlapl.us/msg00994.html for more details.`);return;case`liveness-prepared`:s(t.en.temporalBranches,t.tn.none,`Implied-temporal checking--satisfiability problem has ${n.branches} branches.`);return;case`java-override`:{let e=(0,o.pathToFileURL)((0,i.resolve)(ws(a,n.module))).href;s(n.isMatched?t.en.javaOverrideLoaded:t.en.javaOverrideMismatch,n.isMatched?t.tn.none:t.tn.warning,`${n.isMatched?`Loading`:`Failed to match`} ${n.operator} operator override from ${e.replace(`file:///`,`file:/`)} with signature: <Java Method: ${n.signature}>.`);return}case`initial-states-started`:s(t.en.computingInit,t.tn.none,`Computing initial states...`);return;case`initial-states-progress`:us(e,n.count);return;case`initial-states-computed`:bs(e,n.initialStates);return;case`progress`:xs(e,n.statistics,r.startTime),n.statistics.coverage&&Cs(e,n.statistics.coverage,r.startTime);return;case`liveness-started`:{r.livenessStartTime=Date.now(),n.isComplete&&xs(e,n.statistics);let i=n.branches>1?`${n.branches} branches of `:``,a=n.branches*n.states;s(t.en.checkingTemporal,t.tn.none,`Checking ${i}temporal properties for the ${n.isComplete?`complete`:`current`} state space with ${a} total distinct states at (${t.an(/* @__PURE__ */ new Date)})`);return}case`liveness-finished`:Es(e,r);return;case`sequential-fallback`:process.stderr.write(`Warning: the search ordered the string ${JSON.stringify(n.string)} against another string it created, so tla-ts checks the model again with one worker. Workers don't agree on the order of strings the search creates.\n`);return;case`warning`:s(n.code,t.tn.warning,n.text);return;case`violation`:Os(n.status,n.violation,e)}},Es=(e,n)=>{n.livenessStartTime!==void 0&&(e.print(t.en.checkingTemporalEnd,t.tn.none,`Finished checking temporal properties in ${t.on(Date.now()-n.livenessStartTime)} at ${t.an(/* @__PURE__ */ new Date)}`),n.livenessStartTime=void 0)},Ds=(e,n)=>{n&&(n.counts&&console.log(n.counts),e.print(n.code,t.tn.error,t.rn(n.code,n.message,e.isTool)))},Os=(e,n,r)=>{let i=r.print,a=n.name,o=n.loopStart,s=o===void 0&&n.trace.length===1&&(e===`invariant-violation`||e===`liveness-violation`),c={code:t.en.temporalPropertyViolated,text:_s(n.properties??[a],r.version)},l={success:void 0,error:void 0,"assumption-violation":n.message?{code:t.en.assumptionEvaluationError,text:t.rn(t.en.assumptionEvaluationError,`Evaluating assumption ${a} failed.\n${n.message}`,r.isTool)}:{code:t.en.assumptionFalse,text:`Assumption ${a} is false.`},deadlock:{code:t.en.deadlockReached,text:`Deadlock reached.`},"invariant-violation":s?ds(`invariant-violation`,a):{code:t.en.invariantViolatedBehavior,text:`Invariant ${a} is violated.`},"property-violation":c,"liveness-violation":o===void 0?s?ds(`liveness-violation`,a):{code:t.en.actionPropertyViolatedBehavior,text:`Action property ${a} is violated.`}:c,"postcondition-violation":{code:n.postcondition?.code??t.en.general,text:t.rn(n.postcondition?.code??t.en.general,n.message??`Postcondition ${a} is false.`,r.isTool)}}[e],u=e===`property-violation`,d=o!==void 0&&!u,f=u||d;if(f&&r.version!==`1.7.4`&&fs(r,n.trace[0]?.output),n.counts&&console.log(n.counts),l){let e=s?`${l.text}\n${t.Vt(n.trace[0].state)}`:l.text;i(l.code,t.tn.error,e)}if(s||(f||fs(r,n.trace[0]?.output),gs(r,n.trace,f?`counter-example`:`error-trace`)),fs(r,n.traceOutput),d){let e=n.loopLabel;o===n.trace.length-1?i(t.en.statePrint3,t.tn.state,`${o+2}: Stuttering`):r.isTool?i(t.en.backToState,t.tn.state,`${o+1}: Back to state${e?`: <${e}>\n`:``}`):console.log(`Back to state ${o+1}${e?`: <${e}>\n`:``}`)}n.warning&&r.version!==`1.7.4`&&i(n.warning.code,t.tn.warning,n.warning.text);let p=n.unwitnessed??(e===`postcondition-violation`?void 0:n.postcondition);return fs(r,n.postconditionOutput),Ds(r,p),!s&&e!==`assumption-violation`},ks=(e,n)=>e.print(t.en.nestedExpression,t.tn.error,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\n${ys(n)}`),As=(e,n,r)=>e.print(t.en.success,t.tn.none,[`Model checking completed. No error has been found.`,` Estimates of the probability that TLC did not check all reachable states`,` because two distinct states had the same fingerprint:`,` calculated (optimistic): val = ${t.r(n)}`,...r===void 0?[]:[` based on the actual fingerprints: val = ${t.r(r)}`]].join(`
|
|
47
|
-
`)),js=(e,n)=>{switch(n.kind){case`message`:e.print(n.code,n.isError?t.tn.error:t.tn.none,e.isTool?n.toolMessage:n.message);return;case`behavior`:n.states.forEach((r,i)=>n.isInvariant?e.print(t.en.statePrint2,t.tn.state,`${i+1}: \n${t.Vt(r,e.isDiffTrace?n.states[i-1]:void 0)}`):e.print(t.en.statePrint1,t.tn.state,`${i+1}:\n${t.Vt(r)}`));return;case`nested-expressions`:ks(e,n.callStack);return;case`success`:As(e,n.optimistic,n.actual)}},Ms=(n,r,i)=>{let a=r.print;if(n.failure){let i=n.failure,o=r.isTool?i.toolMessage:i.message,s=()=>{let e=i.fingerprint;if(e){let n=i.callStack?.length&&r.version!==`1.7.4`?ys(i.callStack):vs(e.sources);a(t.en.fingerprintFailed,t.tn.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${n}\nReason:\n${t.in(e.reason,r.isTool)}`)}else i.callStack&&ks(r,i.callStack)};i.isCallStackFirst&&s();let c=i.initialState&&(()=>{try{return`While working on the initial state:\n${t.Vt(i.initialState)}`}catch(t){throw t instanceof e.b?e.at(new e.b(`${e.G}${t.message}`),e.nt.error):t}})();a(c?t.en.initialState:i.code,t.tn.error,c?`${o}\n${c}`:o),fs(r,i.trace[0]?.output),gs(r,i.trace,`error-trace`);let l=i.traceFailure;l&&a(l.code,t.tn.error,r.isTool?l.toolMessage:l.message),fs(r,i.traceOutput),Ds(r,i.postcondition),i.isCallStackFirst||s()}else if(n.violation){if(!Os(n.status,n.violation,r))return;let e=n.additionalViolation;e&&Os(`property-violation`,e,r),n.liveCallStack&&ks(r,n.liveCallStack)}else n.status===`success`&&(Es(r,i),As(r,t.o(n.distinctStates,n.generatedStates),n.fingerprintDistance===void 0?void 0:t.i(n.fingerprintDistance)));if(n.failure?.isWithoutStatistics)return;n.status!==`success`&&Es(r,i),n.coverage&&Cs(r,n.coverage,i.startTime),r.isTool&&xs(r,n,i.startTime),a(t.en.stats,t.tn.none,`${n.generatedStates} states generated, ${n.distinctStates} distinct states found, ${n.queuedStates} states left on queue.`);let o=r.version===`1.7.4`,s=o?n.outDegrees??n.violationOutDegrees:n.outDegrees;(!o||s)&&a(t.en.searchDepth,t.tn.none,`The depth of the complete state graph search is ${o?Math.max(n.depth,1):n.depth}.`);let c=s&&t.s(s);c&&a(t.en.stateGraphOutdegree,t.tn.none,c)},Ns=e=>e.print(t.en.version,t.tn.none,`TLC2 Version ${T} (rev: tla-ts)`),Ps=(e,n,r)=>{let i=t.nn({isTool:e,version:n});return Ns(i),i.print(t.en.commandLineError,t.tn.error,`${r}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1},Fs=(e,n)=>{let r=`${n.workers} worker${n.workers===1?``:`s`} on ${(0,c.availableParallelism)()} cores with ${Math.floor((0,l.getHeapStatistics)().heap_size_limit/1024/1024)}MB heap and
|
|
47
|
+
`)),js=(e,n)=>{switch(n.kind){case`message`:e.print(n.code,n.isError?t.tn.error:t.tn.none,e.isTool?n.toolMessage:n.message);return;case`behavior`:n.states.forEach((r,i)=>n.isInvariant?e.print(t.en.statePrint2,t.tn.state,`${i+1}: \n${t.Vt(r,e.isDiffTrace?n.states[i-1]:void 0)}`):e.print(t.en.statePrint1,t.tn.state,`${i+1}:\n${t.Vt(r)}`));return;case`nested-expressions`:ks(e,n.callStack);return;case`success`:As(e,n.optimistic,n.actual)}},Ms=(n,r,i)=>{let a=r.print;if(n.failure){let i=n.failure,o=r.isTool?i.toolMessage:i.message,s=()=>{let e=i.fingerprint;if(e){let n=i.callStack?.length&&r.version!==`1.7.4`?ys(i.callStack):vs(e.sources);a(t.en.fingerprintFailed,t.tn.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${n}\nReason:\n${t.in(e.reason,r.isTool)}`)}else i.callStack&&ks(r,i.callStack)};i.isCallStackFirst&&s();let c=i.initialState&&(()=>{try{return`While working on the initial state:\n${t.Vt(i.initialState)}`}catch(t){throw t instanceof e.b?e.at(new e.b(`${e.G}${t.message}`),e.nt.error):t}})();a(c?t.en.initialState:i.code,t.tn.error,c?`${o}\n${c}`:o),fs(r,i.trace[0]?.output),gs(r,i.trace,`error-trace`);let l=i.traceFailure;l&&a(l.code,t.tn.error,r.isTool?l.toolMessage:l.message),fs(r,i.traceOutput),Ds(r,i.postcondition),i.isCallStackFirst||s()}else if(n.violation){if(!Os(n.status,n.violation,r))return;let e=n.additionalViolation;e&&Os(`property-violation`,e,r),n.liveCallStack&&ks(r,n.liveCallStack)}else n.status===`success`&&(Es(r,i),As(r,t.o(n.distinctStates,n.generatedStates),n.fingerprintDistance===void 0?void 0:t.i(n.fingerprintDistance)));if(n.failure?.isWithoutStatistics)return;n.status!==`success`&&Es(r,i),n.coverage&&Cs(r,n.coverage,i.startTime),r.isTool&&xs(r,n,i.startTime),a(t.en.stats,t.tn.none,`${n.generatedStates} states generated, ${n.distinctStates} distinct states found, ${n.queuedStates} states left on queue.`);let o=r.version===`1.7.4`,s=o?n.outDegrees??n.violationOutDegrees:n.outDegrees;(!o||s)&&a(t.en.searchDepth,t.tn.none,`The depth of the complete state graph search is ${o?Math.max(n.depth,1):n.depth}.`);let c=s&&t.s(s);c&&a(t.en.stateGraphOutdegree,t.tn.none,c)},Ns=e=>e.print(t.en.version,t.tn.none,`TLC2 Version ${T} (rev: tla-ts)`),Ps=(e,n,r)=>{let i=t.nn({isTool:e,version:n});return Ns(i),i.print(t.en.commandLineError,t.tn.error,`${r}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1},Fs=(e,n)=>{let r=`${n.workers} worker${n.workers===1?``:`s`} on ${(0,c.availableParallelism)()} cores with ${Math.floor((0,l.getHeapStatistics)().heap_size_limit/1024/1024)}MB heap and 64MB offheap memory [pid: ${process.pid}] (${(0,c.type)()} ${(0,c.release)()} ${(0,c.arch)()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit`;n.mode===`model-check`&&n.dfidDepth!==void 0?e.print(t.en.depthFirstModelChecking,t.tn.none,`Running depth-first search Model-Checking with fp ${n.fingerprintIndex} and seed ${n.seed} with ${r}).`):n.mode===`model-check`?e.print(t.en.modelChecking,t.tn.none,`Running breadth-first search Model-Checking with fp ${n.fingerprintIndex} and seed ${n.seed} with ${r}, MSBDiskFPSet, DiskStateQueue).`):e.print(t.en.simulating,t.tn.none,`Running ${n.scheduler===`rl`?`RL`:`Random`} Simulation with seed ${n.seed} with ${r}).`)},Is=(e,n)=>{let r=e.print;switch(n.kind){case`message`:r(n.code,n.isError?t.tn.error:t.tn.none,e.isTool?n.toolMessage:n.message);return;case`behavior`:{let i=n.trace[n.trace.length-1];if(!n.isLastStateOnly){gs(e,n.trace,`simulation`);return}r(t.en.errorState,t.tn.none,`The error state is:
|
|
48
48
|
`),r(t.en.statePrint1,t.tn.state,`:\n${t.Vt(i.state)}`);return}case`progress`:{let i=n.statistics;if(e.isTool){Ls(e,i);return}let a=i.levelM2/(i.traces+1);r(t.en.simulationProgress,t.tn.none,`Progress: ${i.generatedStates} states checked, ${i.traces} traces generated (trace length: mean=${i.levelMean}, var(x)=${Math.round(a)}, sd=${Math.round(Math.sqrt(a))})`);return}case`summary`:e.isTool&&Ls(e,n.statistics),r(t.en.simulationStats,t.tn.none,`The number of states generated: ${n.statistics.generatedStates}\nSimulation using seed ${n.statistics.seed} and aril ${n.statistics.aril}`)}},Ls=(e,n)=>e.print(t.en.simulationProgress,t.tn.none,`Progress(${n.traces}) at ${t.an(/* @__PURE__ */ new Date)}: ${n.generatedStates} states generated, -1 distinct states found, -1 states left on queue.`),Rs=[{name:`-checkpoint`,sampleValue:`minutes`,description:`interval between check point; defaults to 30`,isOptional:!0},{name:`-cleanup`,description:`clean up the states directory`,isOptional:!0},{name:`-config`,sampleValue:`file`,description:`provide the configuration file; defaults to SPEC.cfg`,isOptional:!0},{name:`-continue`,description:`continue running even when an invariant is violated; default
|
|
49
49
|
behavior is to halt on first violation`,isOptional:!0},{name:`-coverage`,sampleValue:`minutes`,description:`interval between the collection of coverage information;
|
|
50
50
|
if not specified, no coverage will be collected`,isOptional:!0},{name:`-deadlock`,description:`if specified DO NOT CHECK FOR DEADLOCK. Setting the flag is
|
|
@@ -151,10 +151,10 @@ A pretty-printed and in-depth description of TLC can be found at:
|
|
|
151
151
|
https://lamport.azurewebsites.net/tla/current-tools.pdf`.replace(/TLC(\)|\s|$)/g,`${X(`TLC`)}$1`),` `)}`,``,`${X(`OPTIONS`)}\n`,...e.map(e=>`\t${X(e.name)}${e.sampleValue===void 0?``:` ${Vs(e.sampleValue)}`}\n\t\t${t(e.description??``,` `)}`),``,`${X(`TIPS`)}\n`,...Bs.map(e=>`\t${t(e,` `)}\n`)].join(`
|
|
152
152
|
`)},Js=async t=>{let n=(await Promise.resolve().then(()=>require("./compile.cjs"))).compile((0,a.readFileSync)(t,`utf8`),t),r=`\\* Generated by tla-ts from ${(0,i.basename)(t)}. Edit ${(0,i.basename)(t)} instead.`,o=(0,i.join)((0,i.dirname)(t),`${n.name}.tla`),s=(0,i.join)((0,i.dirname)(t),`${n.name}.cfg`);for(let n of[o,s])if((0,a.existsSync)(n)&&!(0,a.readFileSync)(n,`utf8`).startsWith(r))throw new e.L(`${n} already exists, and tla-ts didn't generate it from ${t}`);return(0,a.writeFileSync)(o,`${r}\n${n.source}\n`),(0,a.writeFileSync)(s,`${r}\n${n.config}\n`),o},Ys={success:e.nt.success,"assumption-violation":e.nt.assumptionViolation,deadlock:e.nt.deadlock,"invariant-violation":e.nt.safetyViolation,"property-violation":e.nt.safetyViolation,"liveness-violation":e.nt.livenessViolation,"postcondition-violation":e.nt.assumptionViolation,error:e.nt.error},Xs=t=>{if((0,a.statSync)(t,{throwIfNoEntry:!1})?.isDirectory())throw new e.b(`${t} (Is a directory)`)},Zs=(e,t)=>e.endsWith(t)?e:`${e}${t}`,Qs=e=>{if(e.length===1)return{path:Zs(e[0],`.dump`)};let t=e[0].toLowerCase();return{path:Zs(e[1],`.dot`),dot:!0,colorize:t.includes(`colorize`),actionLabels:t.includes(`actionlabels`),snapshot:t.includes(`snapshot`),constrained:t.includes(`constrained`),stuttering:t.includes(`stuttering`),strict:t.includes(`strict`)}},$s=e=>t.kt([e]).toString(),ec=(e,t,n,r,o)=>{let s=n.temporaryDirectory??(0,c.tmpdir)(),l=(0,a.existsSync)(s)?(0,a.realpathSync)(s):(0,i.resolve)(s),u=(0,i.join)(l,`tlc-${$s((0,i.resolve)(e))}`),d=w(n);return(n,s)=>{let c=`${n}.tla`;if(s===`file`)return(0,a.realpathSync)(m(t,n)??e);if(o===`1.7.4`)return(0,i.join)(l,c);if(s===`root file`){let t=r===void 0?l:(0,i.resolve)(r),o=(0,a.realpathSync)(e);return`${(0,i.join)(t,$s(`${o} ${n}`),c)} (${o})`}let f=(0,i.join)(u,c);return d===void 0?f:`${f} (${_(d)}${c})`}},tc=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>e.match(/^-----*\s*CONFIG\s+(\S+?)\s*-----*$/)?.[1]===t);if(r===-1)return`
|
|
153
153
|
`;let i=n.findIndex((e,t)=>t>r&&e.startsWith(`====`));return`${n.slice(r+1,i===-1?void 0:i).join(`
|
|
154
|
-
`).trim()}\n`},nc=e=>e.replace(/\/+/g,`/`).replace(/(.)\/$/,`$1`),rc=e=>{let t=nc(e),n=t.lastIndexOf(`/`);return n===-1?`.`:t.slice(0,Math.max(n,1))},ic=(e,t)=>e.endsWith(`/`)?`${e}${t}`:`${e}/${t}`,ac=(e,t,n,r)=>{if(t===`1.7.4`||!e.isTraceSpecForced&&(e.isTraceSpecDisabled||e.isTool||e.isContinued||(0,i.basename)(n).includes(`_TTrace`)))return;let a=e.traceSpecPath,o=`${(0,i.basename)(n)}_TTrace_${Math.floor(r/1e3)}`,s=a===void 0?{directory:rc(n),module:o}:a.toLowerCase().endsWith(`.tla`)?{directory:rc(a),module:(0,i.basename)(a).replace(/\.tla$/,``)}:{directory:nc(a),module:o};return{...s,traceFile:e.isTraceBinaryDisabled?void 0:ic(s.directory,`${s.module}.bin`)}},oc={ENOENT:`No such file or directory`,ENOTDIR:`Not a directory`,EISDIR:`Is a directory`,EACCES:`Permission denied`},sc=(t,n)=>{try{(0,a.writeFileSync)(t,n)}catch(n){let r=n instanceof Error&&`code`in n?oc[String(n.code)]:void 0;throw r===void 0?n:new e.b(`${t} (${r})`)}},cc=e=>{try{(0,a.mkdirSync)(e,{recursive:!0})}catch{}},lc=e=>{let n=/* @__PURE__ */ new Date,r=`${t.pn(n.getFullYear()%100)}-${t.pn(n.getMonth()+1)}-${t.pn(n.getDate())}-${t.pn(n.getHours())}-${t.pn(n.getMinutes())}-${t.pn(n.getSeconds())}.${t.pn(n.getMilliseconds(),3)}`,o=(0,i.join)(e.metadir??`states`,r);return(0,a.mkdirSync)(o,{recursive:!0}),o},uc=async(r,o,s,c,l)=>{let u=o.livenessCheck,d=l.version;Ns(l);let f=o.recoverDirectory;if(f!==void 0)throw(0,a.existsSync)((0,i.join)(f,`vars.chkpt`))?new e.x(`tla-ts can't recover a model check from the checkpoint in ${f}.`):new e.D(f);Fs(l,o);let p=o.configPath??r.replace(/\.tla$/,`.cfg`);if(!(0,a.existsSync)(p))return l.print(t.en.configFileError,t.tn.error,`TLC encountered the following error when trying to read the configuration file ${p}:\nFile not found.`),e.nt.configParseError;let m=(0,i.basename)(r,`.tla`),_={startTime:Date.now(),livenessStartTime:void 0,isParsed:!1},b=()=>{let e=Date.now()-_.startTime;l.print(t.en.finished,t.tn.none,`Finished in ${l.isTool?`${e}ms`:t.on(e)} at (${t.an(/* @__PURE__ */ new Date)})`)},x=()=>l.print(t.en.parsingFailed,t.tn.error,`Parsing or semantic analysis failed.`),S=t=>(t instanceof e.F?x():y(t,l),b(),v(t)),T=(()=>{try{let e=(0,a.readFileSync)(p,`utf8`);return t.gn(p.endsWith(`.tla`)?tc(e,p.replaceAll(`.tla`,``)):e,d)}catch(t){if(!(t instanceof e._))throw t;return t}})();if(T instanceof e._&&d===`1.7.4`)return l.print(t.en.general,t.tn.error,`${e.$(`tlc2.tool.ConfigFileException`)}${t.in(T.message,l.isTool)}`),b(),e.nt.error;if(T instanceof e._)return S(T);o.isDeadlockChecked||(T.checkDeadlock=!1);let E=(0,i.dirname)(r),D=[E,...c.libraries],O=h(D),k=ac(o,d,r.replace(/\.tla$/,``),_.startTime),A=e=>o.moduleOperators.filter(t=>t.kind===e).map(e=>e.module);l.isTool&&l.print(t.en.startingSany,t.tn.none,`Starting SANY...`);let ee=(0,i.isAbsolute)(r),te=ee?m:r.replace(/\.tla$/,``),ne=w(c),j=d===`1.7.4`?pc(r,c,ne):void 0;j?!(0,a.existsSync)(r)&&!t.ct.has(m)&&j(`${m}.tla`):!(0,a.existsSync)(r)&&!t.lt.has(m)&&g(ee?E:process.cwd(),ee?`${m}.tla`:`./${te}.tla`,[...ee||E===`.`?[]:[E],...c.libraries]);let M=Ro(r,j?C(O,j):O,{fileName:te,describeFile:ec(r,D,c,o.metadir,d),version:d,rootExtendees:[...A(`postcondition`),...k?.traceFile===void 0?[]:[`_TLCTrace`],...o.invariants.flatMap(e=>e.modules),...A(`constraint`),...A(`view`).slice(0,1)],suppressedCodes:o.suppressedCodes,errorCodes:o.errorCodes,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}),re=M.specification;if(M.isFailed||re===void 0)return Ts(l,{kind:`parsed`},_,E),x(),b(),e.nt.specParseError;try{let i=(0,a.readFileSync)(r,`utf8`),c=t.x(i).name;if(c!==m)throw new e.M(`File name '${m}' does not match the name '${c}' of the top level module it contains.`,void 0);let f=o.userFile,p=t.ut(d),h=Uo(i,re.root,o.invariants,e=>O(e)??p.get(e)??t.b(i,e),d);T.invariants.push(...h.names);let g={workers:o.workers,livenessCheck:u===`off`?`off`:[`final`,`seqfinal`].includes(u)?`final`:`default`,seed:o.seed,fingerprintPolynomial:o.fingerprintIndex,maxSetSize:o.maxSetSize,isLazyValueExpanded:o.isLazyValueExpanded,isViewPrinted:o.isViewPrinted,dump:s,isTool:l.isTool,isContinued:o.isContinued,moduleOperators:o.moduleOperators,traceSpec:k,coverage:o.coverage,isSanyReported:!0,isWarningEnabled:o.isWarningEnabled,version:d,onProgress:e=>Ts(l,e,_,E),onPrint:f===void 0?void 0:e=>(0,a.appendFileSync)(f,`${e}\n`),source:h.source,config:T,onPause:()=>(0,a.readSync)(0,Buffer.alloc(1)),loadModule:O,loadClass:e=>{let t=ws(E,e);return(0,a.existsSync)(t)?(0,a.readFileSync)(t):void 0},readFile:e=>(Xs(e),(0,a.existsSync)(e)?(0,a.readFileSync)(e,`utf8`):void 0),writeFile:sc,makeDirectory:cc};if(o.mode!==`model-check`){let e=Xe({...g,traceDepth:o.traceDepth,traceCount:o.traceCount,aril:o.aril,isGenerating:o.mode===`generate`,scheduler:o.scheduler,onSimulation:e=>Is(l,e)});return b(),e}if(o.dfidDepth!==void 0){let e=Ue({...g,maxDepth:o.dfidDepth,onOutput:e=>js(l,e)});return b(),e}let v=await n.S(g);if(Ms(v,l,_),b(),k&&v.traceSpec!==void 0){let n=ic(k.directory,`${k.module}.tla`);cc(k.directory);let r=(()=>{try{sc(n,v.traceSpec);return}catch(t){if(!(t instanceof e.b))throw t;return t}})();l.print(r?t.en.traceSpecFailed:t.en.traceSpecWritten,t.tn.none,r?`Failed to generate trace exploration spec; error message: ${r.message}`:`Trace exploration spec path: ${n}`)}return v.failure?.exitCode??Ys[v.status]}catch(t){if(!(t instanceof e.y))throw t;return t instanceof e.F&&console.log(dc(t,m)),_.isParsed||Ts(l,{kind:`parsed`},_,E),S(t)}},dc=(t,n)=>{let r=t instanceof e.M;if(!r&&!t.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${t.message}\n\n`;let i=r?t.location===void 0?`Unknown location\n\n${t.message}`:`In module ${t.location}\n\n${t.message}`:`In module ${n}\n\nCould not parse module ${n} from file ${n}.tla`;return`${t.failure?`***Parse Error***\n${t.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${n}\n\n${i}\n*** Errors: 1\n\n${i}\n\n\n`},fc=async(n,r)=>{let o=r.tlcVersion??`master`,s=ls(n);if(s===`usage`)return console.log(qs()),1;if(`error`in s)return s.kind===`uncaught`?(console.error(`Exception in thread "main" ${s.error}`),1):Ps(s.isTool,o,s.error);let c=s.dump&&Qs(s.dump);c?.path.startsWith("${metadir}")&&(c.path=c.path.replaceAll("${metadir}",lc(s)));let l=c?.path;if(l!==void 0)try{(0,a.closeSync)((0,a.openSync)(l,`w`))}catch{return console.log(`Error: Unable to write to file ${l}`),Ps(s.isTool,o,`Error: Given file name ${l} for dumping states invalid.`)}let u=s.configPath!==void 0;if(u&&s.specs.length>1)return Ps(s.isTool,o,`Error: more than one input files: ${s.specs[0].replace(/\.tla$/,``)} and ${s.specs[1]}`);let d=p(s.specs).map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg|ts)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.ts`)||e.path.endsWith(`.tla`)&&(!e.isGlobbed||u||(0,a.existsSync)(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(d.length===0)return Ps(s.isTool,o,`Error: Missing input TLA+ module.`);if(u&&d.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let f=[...new Set(d.map(e=>(0,a.existsSync)(e)||(0,i.isAbsolute)(e)?e:r.libraries.map(t=>(0,i.join)(t,e)).find(a.existsSync)??e))],m=[];for(let[e,n]of f.entries()){e>0&&console.log(``);let a=t.nn({isTool:s.isTool,isWarningEnabled:s.isWarningEnabled,isDiffTrace:s.isDiffTrace,version:o,suppressedCodes:s.suppressedCodes,errorCodes:s.errorCodes});m.push(await b(async()=>{let e=n.endsWith(`.ts`)?await Js(n):n;return f.length>1&&console.log(`Checking ${(0,i.basename)(e)} with ${(0,i.basename)(e,`.tla`)}.cfg`),uc(e,s,c,r,a)},a))}return m.find(t=>t!==e.nt.success)??e.nt.success},pc=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),a=(!(0,i.isAbsolute)(e)&&r!==``?[r]:t.libraries).map(S),o=a.length>0?a[a.length-1]:(0,i.isAbsolute)(e)?r:``;return e=>x(`${o}${e}`,a,n)},mc={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},hc=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),gc={"&":`&`,"<":`<`,">":`>`,"\r":` `},_c=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:gc[e]),vc=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,yc=e=>{let t=(e.cdata??e.text)?.match(vc)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=yc(t);if(e)return e}},bc=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${_c(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)bc(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},xc=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),Sc=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},Cc={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},wc={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Tc=Kn(`--TLA+ BUILTINS--`),Ec=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Dc=(e,t=16)=>e>t*.75?Dc(e,t*2):t,Oc=(e,t)=>(e^e>>>16)&t-1,kc=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Ac=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),jc=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Mc=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=kc(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(jc,``)}).join(`
|
|
155
|
-
`)},
|
|
156
|
-
`)},
|
|
157
|
-
`),a=r.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${i}\n`).join(``);return e.at(new e.T(i,a),
|
|
158
|
-
`),n=r.isUncommented?Nc(
|
|
159
|
-
`)}\n`},
|
|
160
|
-
`)})(),
|
|
154
|
+
`).trim()}\n`},nc=e=>e.replace(/\/+/g,`/`).replace(/(.)\/$/,`$1`),rc=e=>{let t=nc(e),n=t.lastIndexOf(`/`);return n===-1?`.`:t.slice(0,Math.max(n,1))},ic=(e,t)=>e.endsWith(`/`)?`${e}${t}`:`${e}/${t}`,ac=(e,t,n,r)=>{if(t===`1.7.4`||!e.isTraceSpecForced&&(e.isTraceSpecDisabled||e.isTool||e.isContinued||(0,i.basename)(n).includes(`_TTrace`)))return;let a=e.traceSpecPath,o=`${(0,i.basename)(n)}_TTrace_${Math.floor(r/1e3)}`,s=a===void 0?{directory:rc(n),module:o}:a.toLowerCase().endsWith(`.tla`)?{directory:rc(a),module:(0,i.basename)(a).replace(/\.tla$/,``)}:{directory:nc(a),module:o};return{...s,traceFile:e.isTraceBinaryDisabled?void 0:ic(s.directory,`${s.module}.bin`)}},oc={ENOENT:`No such file or directory`,ENOTDIR:`Not a directory`,EISDIR:`Is a directory`,EACCES:`Permission denied`},sc=(t,n)=>{try{(0,a.writeFileSync)(t,n)}catch(n){let r=n instanceof Error&&`code`in n?oc[String(n.code)]:void 0;throw r===void 0?n:new e.b(`${t} (${r})`)}},cc=e=>{try{(0,a.mkdirSync)(e,{recursive:!0})}catch{}},lc=e=>{let n=/* @__PURE__ */ new Date,r=`${t.pn(n.getFullYear()%100)}-${t.pn(n.getMonth()+1)}-${t.pn(n.getDate())}-${t.pn(n.getHours())}-${t.pn(n.getMinutes())}-${t.pn(n.getSeconds())}.${t.pn(n.getMilliseconds(),3)}`,o=(0,i.join)(e.metadir??`states`,r);return(0,a.mkdirSync)(o,{recursive:!0}),o},uc=async(r,o,s,c,l)=>{let u=o.livenessCheck,d=l.version;Ns(l);let f=o.recoverDirectory;if(f!==void 0)throw(0,a.existsSync)((0,i.join)(f,`vars.chkpt`))?new e.x(`tla-ts can't recover a model check from the checkpoint in ${f}.`):new e.D(f);Fs(l,o);let p=o.configPath??r.replace(/\.tla$/,`.cfg`);if(!(0,a.existsSync)(p))return l.print(t.en.configFileError,t.tn.error,`TLC encountered the following error when trying to read the configuration file ${p}:\nFile not found.`),e.nt.configParseError;let m=(0,i.basename)(r,`.tla`),_={startTime:Date.now(),livenessStartTime:void 0,isParsed:!1},b=()=>{let e=Date.now()-_.startTime;l.print(t.en.finished,t.tn.none,`Finished in ${l.isTool?`${e}ms`:t.on(e)} at (${t.an(/* @__PURE__ */ new Date)})`)},x=()=>l.print(t.en.parsingFailed,t.tn.error,`Parsing or semantic analysis failed.`),S=t=>(t instanceof e.F?x():y(t,l),b(),v(t)),T=(()=>{try{let e=(0,a.readFileSync)(p,`utf8`);return t.gn(p.endsWith(`.tla`)?tc(e,p.replaceAll(`.tla`,``)):e,d)}catch(t){if(!(t instanceof e._))throw t;return t}})();if(T instanceof e._&&d===`1.7.4`)return l.print(t.en.general,t.tn.error,`${e.$(`tlc2.tool.ConfigFileException`)}${t.in(T.message,l.isTool)}`),b(),e.nt.error;if(T instanceof e._)return S(T);o.isDeadlockChecked||(T.checkDeadlock=!1);let E=(0,i.dirname)(r),D=[E,...c.libraries],O=h(D),k=ac(o,d,r.replace(/\.tla$/,``),_.startTime),A=e=>o.moduleOperators.filter(t=>t.kind===e).map(e=>e.module);l.isTool&&l.print(t.en.startingSany,t.tn.none,`Starting SANY...`);let ee=(0,i.isAbsolute)(r),te=ee?m:r.replace(/\.tla$/,``),ne=w(c),j=d===`1.7.4`?mc(r,c,ne):void 0;j?!(0,a.existsSync)(r)&&!t.ct.has(m)&&j(`${m}.tla`):!(0,a.existsSync)(r)&&!t.lt.has(m)&&g(ee?E:process.cwd(),ee?`${m}.tla`:`./${te}.tla`,[...ee||E===`.`?[]:[E],...c.libraries]);let M=Ro(r,j?C(O,j):O,{fileName:te,describeFile:ec(r,D,c,o.metadir,d),version:d,rootExtendees:[...A(`postcondition`),...k?.traceFile===void 0?[]:[`_TLCTrace`],...o.invariants.flatMap(e=>e.modules),...A(`constraint`),...A(`view`).slice(0,1)],suppressedCodes:o.suppressedCodes,errorCodes:o.errorCodes,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}),re=M.specification;if(M.isFailed||re===void 0)return Ts(l,{kind:`parsed`},_,E),x(),b(),e.nt.specParseError;try{let i=(0,a.readFileSync)(r,`utf8`),c=t.x(i).name;if(c!==m)throw new e.M(`File name '${m}' does not match the name '${c}' of the top level module it contains.`,void 0);let f=o.userFile,p=t.ut(d),h=Uo(i,re.root,o.invariants,e=>O(e)??p.get(e)??t.b(i,e),d);T.invariants.push(...h.names);let g={workers:o.workers,livenessCheck:u===`off`?`off`:[`final`,`seqfinal`].includes(u)?`final`:`default`,seed:o.seed,fingerprintPolynomial:o.fingerprintIndex,maxSetSize:o.maxSetSize,isLazyValueExpanded:o.isLazyValueExpanded,isViewPrinted:o.isViewPrinted,dump:s,isTool:l.isTool,isContinued:o.isContinued,moduleOperators:o.moduleOperators,traceSpec:k,coverage:o.coverage,isSanyReported:!0,isWarningEnabled:o.isWarningEnabled,version:d,onProgress:e=>Ts(l,e,_,E),onPrint:f===void 0?void 0:e=>(0,a.appendFileSync)(f,`${e}\n`),source:h.source,config:T,onPause:()=>(0,a.readSync)(0,Buffer.alloc(1)),readLine:dc,loadModule:O,loadClass:e=>{let t=ws(E,e);return(0,a.existsSync)(t)?(0,a.readFileSync)(t):void 0},readFile:e=>(Xs(e),(0,a.existsSync)(e)?(0,a.readFileSync)(e,`utf8`):void 0),writeFile:sc,makeDirectory:cc};if(o.mode!==`model-check`){let e=Xe({...g,traceDepth:o.traceDepth,traceCount:o.traceCount,aril:o.aril,isGenerating:o.mode===`generate`,scheduler:o.scheduler,onSimulation:e=>Is(l,e)});return b(),e}if(o.dfidDepth!==void 0){let e=Ue({...g,maxDepth:o.dfidDepth,onOutput:e=>js(l,e)});return b(),e}let v=await n.S(g);if(Ms(v,l,_),b(),k&&v.traceSpec!==void 0){let n=ic(k.directory,`${k.module}.tla`);cc(k.directory);let r=(()=>{try{sc(n,v.traceSpec);return}catch(t){if(!(t instanceof e.b))throw t;return t}})();l.print(r?t.en.traceSpecFailed:t.en.traceSpecWritten,t.tn.none,r?`Failed to generate trace exploration spec; error message: ${r.message}`:`Trace exploration spec path: ${n}`)}return v.failure?.exitCode??Ys[v.status]}catch(t){if(!(t instanceof e.y))throw t;return t instanceof e.F&&console.log(fc(t,m)),_.isParsed||Ts(l,{kind:`parsed`},_,E),S(t)}},dc=()=>{let e=[],t=Buffer.alloc(1),n=!1;for(;(0,a.readSync)(0,t)===1&&(n=!0,t[0]!==10);)e.push(t[0]);return n?Buffer.from(e).toString().replace(/\r$/,``):void 0},fc=(t,n)=>{let r=t instanceof e.M;if(!r&&!t.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${t.message}\n\n`;let i=r?t.location===void 0?`Unknown location\n\n${t.message}`:`In module ${t.location}\n\n${t.message}`:`In module ${n}\n\nCould not parse module ${n} from file ${n}.tla`;return`${t.failure?`***Parse Error***\n${t.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${n}\n\n${i}\n*** Errors: 1\n\n${i}\n\n\n`},pc=async(n,r)=>{let o=r.tlcVersion??`master`,s=ls(n);if(s===`usage`)return console.log(qs()),1;if(`error`in s)return s.kind===`uncaught`?(console.error(`Exception in thread "main" ${s.error}`),1):Ps(s.isTool,o,s.error);let c=s.dump&&Qs(s.dump);c?.path.startsWith("${metadir}")&&(c.path=c.path.replaceAll("${metadir}",lc(s)));let l=c?.path;if(l!==void 0)try{(0,a.closeSync)((0,a.openSync)(l,`w`))}catch{return console.log(`Error: Unable to write to file ${l}`),Ps(s.isTool,o,`Error: Given file name ${l} for dumping states invalid.`)}let u=s.configPath!==void 0;if(u&&s.specs.length>1)return Ps(s.isTool,o,`Error: more than one input files: ${s.specs[0].replace(/\.tla$/,``)} and ${s.specs[1]}`);let d=p(s.specs).map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg|ts)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.ts`)||e.path.endsWith(`.tla`)&&(!e.isGlobbed||u||(0,a.existsSync)(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(d.length===0)return Ps(s.isTool,o,`Error: Missing input TLA+ module.`);if(u&&d.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let f=[...new Set(d.map(e=>(0,a.existsSync)(e)||(0,i.isAbsolute)(e)?e:r.libraries.map(t=>(0,i.join)(t,e)).find(a.existsSync)??e))],m=[];for(let[e,n]of f.entries()){e>0&&console.log(``);let a=t.nn({isTool:s.isTool,isWarningEnabled:s.isWarningEnabled,isDiffTrace:s.isDiffTrace,version:o,suppressedCodes:s.suppressedCodes,errorCodes:s.errorCodes});m.push(await b(async()=>{let e=n.endsWith(`.ts`)?await Js(n):n;return f.length>1&&console.log(`Checking ${(0,i.basename)(e)} with ${(0,i.basename)(e,`.tla`)}.cfg`),uc(e,s,c,r,a)},a))}return m.find(t=>t!==e.nt.success)??e.nt.success},mc=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),a=(!(0,i.isAbsolute)(e)&&r!==``?[r]:t.libraries).map(S),o=a.length>0?a[a.length-1]:(0,i.isAbsolute)(e)?r:``;return e=>x(`${o}${e}`,a,n)},hc={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},gc=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),_c={"&":`&`,"<":`<`,">":`>`,"\r":` `},vc=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:_c[e]),yc=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,bc=e=>{let t=(e.cdata??e.text)?.match(yc)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=bc(t);if(e)return e}},xc=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${vc(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)xc(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},Sc=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),Cc=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},wc={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Tc={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Ec=Kn(`--TLA+ BUILTINS--`),Dc=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Oc=(e,t=16)=>e>t*.75?Oc(e,t*2):t,kc=(e,t)=>(e^e>>>16)&t-1,Ac=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},jc=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),Mc=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Nc=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=Ac(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(Mc,``)}).join(`
|
|
155
|
+
`)},Pc=e=>{let t=Ac(e),n=e=>jc(e).startsWith(`\\*`);return t.filter(n).length<Math.floor(t.length/2)?e:t.map(e=>{if(!n(e))return e;let t=e.indexOf(`\\*`)+2;return e.slice(e[t]===` `?t+1:t)}).join(`
|
|
156
|
+
`)},Fc=(t,n,r)=>{let i=r.version===`1.7.4`,a=/* @__PURE__ */ new Set,o=/* @__PURE__ */ new Map,s=!1,c=[],l=(e,t)=>{if(!i)return t();c.push(...e);let n=t();return c.length-=e.length,n},u=(t,n)=>{let r=[...c,...n].reverse(),i=[t,...r.map(e=>`\tat tla2sany.${e.at}`)].join(`
|
|
157
|
+
`),a=r.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${i}\n`).join(``);return e.at(new e.T(i,a),hc.uncaughtException)},d=e=>u(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),f=(e,t)=>(a.has(e.id)||(a.add(e.id),o.set(e.id,l([...t?[t]:[],...Dc(e.kind,Kn(e.location))],()=>g(e)))),Z(Cc(e),[Q(`UID`,e.id)])),p=(e,t)=>{let n=t.levelChecked===0?[]:[Q(`level`,t.level)],r=t.location?[Sc(t.location),...n]:n;return{...e,children:[...r,...e.children]}},m=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[f(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),h=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
|
|
158
|
+
`),n=r.isUncommented?Pc(Nc(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:n,children:[]}]:[]},g=t=>{switch(t.kind){case`FormalParam`:return p(Z(`FormalParamNode`,[Q(`uniquename`,t.name),Q(`arity`,t.arity)]),t);case`OpDecl`:return p(Z(`OpDeclNode`,[Q(`uniquename`,t.name),Q(`arity`,t.arity),Q(`kind`,t.declKind)]),t);case`OpDef`:{if(t.defKind===`NumberedProofStep`)throw i?u(gc(37),[Tc]):e.at(new e.B(gc(37)),hc.uncaughtException);if(t.defKind===`ModuleInstance`)return p(Z(`ModuleInstanceKind`,[Q(`uniquename`,t.name),...t.isLocal&&!i?[Z(`local`)]:[]]),t);let n=t.params??[];if(t.defKind===`BuiltIn`)return p(Z(`BuiltInKind`,[Q(`uniquename`,t.name),Q(`arity`,t.arity),...t.params?[m(n,t.isLeibnizArg,$.builtInParam)]:[]]),t);let r=t.body,a=t.module;if(r===void 0&&i)throw d($.body);if(r===void 0||a===void 0)throw Error(`The definition of ${t.name} has no body`);return p(Z(`UserDefinedOpKind`,[Q(`uniquename`,t.name),Q(`arity`,t.arity),...i?[]:[Z(`originalOperator`,[f(t.source??t)]),Z(`originallyDefinedInModule`,[f(a)])],Z(`body`,[x(r,$.body)]),...t.params||!i?[m(n,t.isLeibnizArg,$.param)]:[],...i?[]:h(t.preComments),...t.inRecursive?[Z(`recursive`)]:[],...t.recursiveSection>=0&&!i?[Q(`recursiveSection`,t.recursiveSection)]:[],...t.isLocal&&!i?[Z(`local`)]:[]]),t)}case`ThmOrAssumpDef`:return p(Z(t.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,t.name),x(t.body,$.theoremDefinitionBody)]),t);case`Module`:return Z(`ModuleNode`,[Sc(t.location),..._(t)]);case`Theorem`:return p(Z(`TheoremNode`,[...t.definition?[Z(`definition`,[f(t.definition,$.theoremDefinition)])]:[],Z(`body`,[x(t.body,$.theorem)]),...t.proof?[x(t.proof,$.proof)]:[],...t.isSuffices?[Z(`suffices`)]:[]]),t);case`Assume`:return Z(`AssumeNode`,[Sc(t.location),...t.body.levelChecked===0?[]:[Q(`level`,t.body.level)],...t.definition?[Z(`definition`,[f(t.definition,$.assumeDefinition)])]:[],Z(`body`,[x(t.body,$.assume)])])}},_=e=>{let t=t=>!r.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...i?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...cr(e,2).filter(t).map(e=>f(e,$.constant)),...cr(e,3).filter(t).map(e=>f(e,$.variable)),...sr(e).filter(t).map(e=>f(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?x(e,$.topLevel):f(e,$.topLevel)),...e.definitions.filter(e=>!i&&e.kind===`Module`).map(e=>f(e))]},v=(e,t)=>l([t],()=>Z(`Subst`,[f(e.op,$.substOperator),x(e.expr,$.substExpression)])),y=e=>{if(e.nullKind!==void 0&&i)throw u(gc(0),[$.operator,...Dc(`OpDef`,Ec),Tc]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(s=!0);let n=f(e.operator,$.operator),r=e.operands.map((e,t)=>e===void 0||t===0&&s&&qn(e)?i?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):x(e,$.operand)),a=e.tupleOrs,o=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[f(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>f(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],x(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,r),...o])},b=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?f(e,t):x(e,t),x=(e,t)=>{if(!i)return S(e);if(e.kind===`OpAppl`&&e.nullKind===`absent`&&`nullType`in t)throw d(t);return l([t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:Kn(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}],()=>S(e))},S=e=>{switch(e.kind){case`OpAppl`:return p(y(e),e);case`Numeral`:return p(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e);case`String`:return p(Z(`StringNode`,[Q(`StringValue`,e.value)]),e);case`Decimal`:return p(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...i?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e);case`LetIn`:{let t=x(e.body,$.letBody);return p(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>f(e,$.letDefinition)))]),e)}case`Label`:return p(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[x(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>f(e,$.labelParam)))]),e);case`OpArg`:return p(Z(`OpArgNode`,[Z(`argument`,[f(e.op,$.argument)])]),e);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return p(Z(`AtNode`,[x(t,$.exceptObject),x(n,$.exceptComponents)]),e)}case`SubstIn`:case`APSubstIn`:{let t=wc[e.kind],n=e.substs.map(e=>v(e,t.subst)),r=x(e.body,t.body);return p(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[f(e.instantiatingModule,t.from)]),Z(`instTo`,[f(e.instantiatedModule,t.to)])]),e)}case`Instance`:{let t=e.substs.map(e=>v(e,$.instanceSubst)),n=e.params.map(e=>f(e,$.instanceParam));return Z(`InstanceNode`,[Sc(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!i?[Z(`local`)]:[]])}case`UseOrHide`:return p(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>b(e,$.useFact))),Z(`defs`,e.defs.map(e=>f(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e);case`NewSymb`:return p(Z(`NewSymbNode`,[f(e.declaration,$.newDeclaration),...e.set&&!(i&&qn(e.set))?[x(e.set,$.newSet)]:[]]),e);case`AssumeProve`:return p(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>x(e,$.assumption))),Z(`prove`,[x(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>b(e,$.byFact))),Z(`defs`,e.defs.map(e=>f(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return p(n,e)}case`NonLeafProof`:return p(Z(`steps`,[...i?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?f(e,$.step):x(e,$.step))]),e);case`DefStep`:return p(Z(`DefStepNode`,e.defs.map(e=>f(e,$.defStep))),e)}},C=(r.isRestricted?[n]:t).map(e=>f(e,$.main)),w=Oc(o.size),T=Z(`context`,[...o.entries()].toSorted(([e],[t])=>kc(e,w)-kc(t,w)).map(([e,t])=>Z(`entry`,[Q(`UID`,e),t])));return Z(`modules`,[Q(`RootModule`,n.name),T,...C])},Ic=(t,n={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let r=Fc(t.modules,t.root,n),i=bc(r);if(i){let t=i.character.codePointAt(0)??0;throw e.at(new e.B(`The spec contains the character U+${t.toString(16).toUpperCase().padStart(4,`0`)} in the ${i.tag} element. XML 1.0 cannot represent that character in character data, not even as a numeric character reference, so the spec cannot be exported until the character is removed from it.`),hc.unrepresentableCharacter)}let a=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return xc(r,0,n.isTerse?0:2,a),n.isTerse?a.join(``):`${a.join(`
|
|
159
|
+
`)}\n`},Lc=(()=>{let e=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],t=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,X(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,X(`SYNOPSIS`),``,`\t${X(`tla2sany.xml.XMLExporter`)} [${X(`-Iortu`)}] [${X(`-help`)}] FILE`,``,X(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,X(`OPTIONS`),``,...e.map(([e,t])=>`\t${X(e)}\n\t\t${t}`),``,X(`TIPS`),``,...t.flatMap(e=>[`\t${e}`,``]),``].join(`
|
|
160
|
+
`)})(),Rc=e=>(process.stderr.write(`ERROR: ${e}\n${Lc}`),hc.argsParsingFailure),zc=(t,n)=>{try{return process.stdout.write(Ic(t,n)),e.nt.success}catch(t){if(!(t instanceof e.B))throw t;let n=e.Q(t),r=t instanceof e.T?t.unwound:``;return console.error(n===hc.uncaughtException?`${r}Exception in thread "main" ${t.message}`:`ERROR: ${t.message}`),n}},Bc={"no-file":{message:`at least one .tla file must be given`,line174:59},"missing-include":{message:`the -I flag must be followed by a directory and at least one .tla file`,line174:71},"several-files":{message:`Only one TLA file to check allowed!`,line174:83}},Vc=(e,t)=>{let n={flags:/* @__PURE__ */ new Set,includes:[],error:void 0};if(e.length===0)return{...n,error:`no-file`};let r=-1;for(let i=0;i<e.length-1;i++)if(t.has(e[i]))n.flags.add(e[i]),r=i;else if(e[i]===`-I`){if(i++,i>e.length-2)return{...n,error:`missing-include`};n.includes.push(e[i]),r=i}return r===e.length-2?n:{...n,error:`several-files`}},Hc=n=>{let r=Vc(n,/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]));if(r.error)return Rc(Bc[r.error].message);let o=n[n.length-1];if(o===`-help`)return process.stdout.write(Lc),e.nt.success;let s=o.endsWith(`.tla`)?o:`${o}.tla`,c=[`.`,...r.includes],l=c.map(e=>(0,i.resolve)(e,s)).find(a.existsSync);l===void 0&&!t.lt.has(s.slice(0,-4))&&g(process.cwd(),`./${s}`,r.includes);let u=Ro(l??s,h(c),{fileName:o,isXmlExport:!0});return process.stderr.write(u.text),u.isFailed||u.specification===void 0?(console.error(`ERROR: Failed to parse module.`),hc.specParsingFailure):zc(u.specification,{version:`master`,isRestricted:r.flags.has(`-r`),isUncommented:r.flags.has(`-u`),isTerse:r.flags.has(`-t`)})},Uc=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),hc.uncaughtException),Wc=(n,r)=>{let o=Vc(n,/* @__PURE__ */ new Set([`-o`]));if(o.error)return Uc(`java.lang.IllegalArgumentException: ${Bc[o.error].message}`,Bc[o.error].line174);let s=n[n.length-1],c=`${s.replace(/\.tla$/i,``)}.tla`,l=(o.includes.length===0?[`/`]:o.includes).map(S),u=[`.`,...l],d=e=>x(`${l[l.length-1]}${e}`,l,r),f=u.map(e=>(0,i.resolve)(e,c)).find(a.existsSync);if(f===void 0&&!t.ct.has((0,i.basename)(c,`.tla`)))return d(c),e.nt.success;let p=Ro(f??c,C(h(u),d),{fileName:s,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(p.text),p.specification===void 0?Uc(`tla2sany.xml.XMLExportingException: spec ${(f&&Lo((0,a.readFileSync)(f,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):zc(p.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},Gc=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],Kc=e=>{let t={libraries:[]};for(let n=0;n<e.length;n++){let r=e[n];if(r===`-cp`||r===`-classpath`||r===`--class-path`)n++,t.classPath=e[n];else if(r===`-jar`)return t.classPath=e[n+1],{mainClass:`tlc2.TLC`,args:e.slice(n+2),java:t};else if(r.startsWith(`-DTLA-Library=`))t.libraries.push(...r.slice(14).split(i.delimiter));else if(r.startsWith(`-Djava.io.tmpdir=`))t.temporaryDirectory=r.slice(17);else if(r.startsWith(`-Dtla-ts.tlc=`))t.tlcVersion=r.slice(13)===`1.7.4`?`1.7.4`:`master`;else if(!r.startsWith(`-D`)&&!r.startsWith(`-X`))return n>0||Gc.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},qc=async e=>{if(e[0]===`tlapm`)return b(()=>Re(e.slice(1)));let t=Kc(e);return t===void 0?pc(e,{libraries:[]}):(t.java.tlcVersion??=await d(w(t.java)),t.mainClass===`tlc2.TLC`?pc(t.args,t.java):t.mainClass===`tla2sany.xml.XMLExporter`?b(()=>t.java.tlcVersion===`1.7.4`?Wc(t.args,w(t.java)):Hc(t.args)):(console.error(`Error: tla-ts runs the Java classes ${Gc.join(` and `)}, not ${t.mainClass}.`),1))},Jc=async()=>{process.exitCode=await qc(process.argv.slice(2))};exports.runCli=Jc;
|