Input options:

-f, --formula=STRING

process the formula STRING

-F, --file=FILENAME[/COL]

process each line of FILENAME as a formula; if COL is a positive integer, assume a CSV file and read column COL; use a negative COL to drop the first line of the CSV file

--ins=PROPS

comma-separated list of controllable (a.k.a. output) atomic propositions

--lbt-input

read all formulas using LBT's prefix syntax

--lenient

parenthesized blocks that cannot be parsed as subformulas are considered as atomic properties

--outs=PROPS

comma-separated list of controllable (a.k.a. output) atomic propositions

Output format:

-8, --utf8

enable UTF-8 characters in output (ignored with --lbtt or --spin)

--check[=PROP]

test for the additional property PROP and output the result in the HOA format (implies -H). PROP may be some prefix of 'all' (default), 'unambiguous', 'stutter-invariant', 'stutter-sensitive-example', 'semi-determinism', or 'strength'.

-d, --dot[=1|a|A|b|B|c|C(COLOR)|e|E|f(FONT)|h|i(ID)|k|K|n|N|o|r|R|s|t|u|v|y|+INT|<INT|#]

GraphViz's format. Add letters for (1) force numbered states, (a) show acceptance condition (default), (A) hide acceptance condition, (b) acceptance sets as bullets, (B) bullets except for Büchi/co-Büchi automata, (c) force circular nodes, (C) color nodes with COLOR, (d) show origins when known, (e) force elliptic nodes, (E) force rEctangular nodes, (f(FONT)) use FONT, (g) hide edge labels, (h) horizontal layout, (i) or (i(GRAPHID)) add IDs, (k) use state labels when possible, (K) use transition labels (default), (n) show name, (N) hide name, (o) ordered transitions, (r) rainbow colors for acceptance sets, (R) color acceptance sets by Inf/Fin, (s) with SCCs, (t) force transition-based acceptance, (u) hide true states, (v) vertical layout, (y) split universal edges by color, (+INT) add INT to all set numbers, (<INT) display at most INT states, (#) show internal edge numbers

-H, --hoaf[=1.1|i|k|l|m|s|t|v]

Output the automaton in HOA format (default). Add letters to select (1.1) version 1.1 of the format, (i) use implicit labels for complete deterministic automata, (s) prefer state-based acceptance when possible [default], (t) force transition-based acceptance, (m) mix state and transition-based acceptance, (k) use state labels when possible, (l) single-line output, (v) verbose properties

--lbtt[=t]

LBTT's format (add =t to force transition-based acceptance even on Büchi automata)

--name=FORMAT

set the name of the output automaton

-o, --output=FORMAT

send output to a file named FORMAT instead of standard output. The first automaton sent to a file truncates it unless FORMAT starts with '>>'.

-q, --quiet

suppress all normal output

-s, --spin[=6|c]

Spin neverclaim (implies --ba). Add letters to select (6) Spin's 6.2.4 style, (c) comments on states

--stats=FORMAT, --format=FORMAT

output statistics about the automaton

Fine tuning:

--algo=sd|ds|ps|lar|lar.old

choose the algorithm for synthesis: "sd": translate to tgba, split, then determinize; "ds": translate to tgba, determinize, then split; "ps": translate to dpa, then split; "lar": translate to a deterministic automaton with arbitrary acceptance condition, then use LAR to turn to parity, then split (default); "lar.old": old version of LAR, for benchmarking.

--decompose=yes|no

whether to decompose the specification as multiple output-disjoint problems to solve independently (enabled by default)

--simplify=no|bisim|bwoa|sat|bisim-sat|bwoa-sat

simplification to apply to the controler (no) nothing, (bisim) bisimulation-based reduction, (bwoa) bissimulation-based reduction with output assignment, (sat) SAT-based minimization, (bisim-sat) SAT after bisim, (bwoa-sat) SAT after bwoa. Defaults to 'bwoa'.

Output options:

--aiger[=ite|isop|both[+ud][+dc][+sub0|sub1|sub2]]

prints a winning strategy as an AIGER circuit. The first, and only mandatory option defines the method to be used. "ite" for If-then-else normal form; "isop" for irreducible sum of producs; "both" tries both encodings and keeps the smaller one. The other options further refine the encoding, see aiger::encode_bdd.

--print-game-hoa[=options]

print the parity game in the HOA format, do not solve it

--print-pg

print the parity game in the pgsolver format, do not solve it

--realizability

realizability only, do not compute a winning strategy

Miscellaneous options:

--csv[=[>>]FILENAME]

output statistics as CSV in FILENAME or on standard output (if '>>' is used to request append mode, the header line is not output)

--help

print this help

--verbose

verbose mode

--verify

verifies the strategy or (if demanded) aiger against the spec.

--version

print program version

-x, --extra-options=OPTS

fine-tuning options (see spot-x (7))

Mandatory or optional arguments to long options are also mandatory or optional for any corresponding short options.

Exit status:

0

if the input problem is realizable

1

if the input problem is not realizable

2

if any error has been reported