Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871500194.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PhilosophersDyn-COL-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871500194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 31K Apr 27 15:14 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-COL-03-00
FORMULA_NAME PhilosophersDyn-COL-03-01
FORMULA_NAME PhilosophersDyn-COL-03-02
FORMULA_NAME PhilosophersDyn-COL-03-03
FORMULA_NAME PhilosophersDyn-COL-03-04
FORMULA_NAME PhilosophersDyn-COL-03-05
FORMULA_NAME PhilosophersDyn-COL-03-06
FORMULA_NAME PhilosophersDyn-COL-03-07
FORMULA_NAME PhilosophersDyn-COL-03-08
FORMULA_NAME PhilosophersDyn-COL-03-09
FORMULA_NAME PhilosophersDyn-COL-03-10
FORMULA_NAME PhilosophersDyn-COL-03-11
FORMULA_NAME PhilosophersDyn-COL-03-12
FORMULA_NAME PhilosophersDyn-COL-03-13
FORMULA_NAME PhilosophersDyn-COL-03-14
FORMULA_NAME PhilosophersDyn-COL-03-15

=== Now, execution of the tool begins

BK_START 1591134179929

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 21:43:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 21:43:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 21:43:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 21:43:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 499 ms
[2020-06-02 21:43:02] [INFO ] sort/places :
Neighbourhood->Neighbourhood,
Philosopher->Outside,Think,Forks,WaitLeft,WaitRight,HasLeft,HasRight,

[2020-06-02 21:43:02] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 25 ms.
[2020-06-02 21:43:02] [INFO ] Computed order based on color domains.
[2020-06-02 21:43:02] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions in 11 ms.
[2020-06-02 21:43:02] [INFO ] Unfolded HLPN properties in 0 ms.
[2020-06-02 21:43:02] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 21:43:02] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 21:43:02] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 21:43:02] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 21:43:02] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 21:43:02] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 21:43:02] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 21:43:02] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 21:43:02] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 14322 resets, run finished after 371 ms. (steps per millisecond=269 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1]
[2020-06-02 21:43:02] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2020-06-02 21:43:02] [INFO ] Computed 11 place invariants in 4 ms
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-02 21:43:03] [INFO ] State equation strengthened by 36 read => feed constraints.
[2020-06-02 21:43:03] [INFO ] [Real]Added 36 Read/Feed constraints in 15 ms returned sat
[2020-06-02 21:43:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:43:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:43:03] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2020-06-02 21:43:03] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 8 ms.
[2020-06-02 21:43:03] [INFO ] Added : 29 causal constraints over 6 iterations in 82 ms. Result :sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 5 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Added 36 Read/Feed constraints in 6 ms returned sat
[2020-06-02 21:43:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:43:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:43:03] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2020-06-02 21:43:03] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 6 ms.
[2020-06-02 21:43:03] [INFO ] Added : 30 causal constraints over 7 iterations in 86 ms. Result :sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-02 21:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:43:04] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-02 21:43:04] [INFO ] [Real]Added 36 Read/Feed constraints in 6 ms returned sat
[2020-06-02 21:43:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:43:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2020-06-02 21:43:04] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-02 21:43:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:43:04] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-02 21:43:04] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2020-06-02 21:43:04] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 8 ms.
[2020-06-02 21:43:04] [INFO ] Added : 45 causal constraints over 9 iterations in 118 ms. Result :sat
Successfully simplified 31 atomic propositions for a total of 31 simplifications.
[2020-06-02 21:43:04] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-02 21:43:04] [INFO ] Flatten gal took : 47 ms
FORMULA PhilosophersDyn-COL-03-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 21:43:04] [INFO ] Applying decomposition
[2020-06-02 21:43:04] [INFO ] Flatten gal took : 22 ms
[2020-06-02 21:43:04] [INFO ] Decomposing Gal with order
[2020-06-02 21:43:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 21:43:04] [INFO ] Removed a total of 198 redundant transitions.
[2020-06-02 21:43:04] [INFO ] Flatten gal took : 49 ms
[2020-06-02 21:43:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2020-06-02 21:43:04] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2020-06-02 21:43:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ PhilosophersDyn-COL-03 @ 3570 seconds

FORMULA PhilosophersDyn-COL-03-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLFireability @ PhilosophersDyn-COL-03

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 21:43:04 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 34,
"adisj": 26,
"aneg": 3,
"comp": 219,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 219,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "G ((G ((((1 <= p2) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p1) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p6) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p7) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p7) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p4) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)))) OR ((((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p5 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p26 <= 0) OR (p29 <= 0))) OR (((p2 <= 0) OR (p3 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p7 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p1 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p8 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p2 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p8 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p6 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p7 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p7 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p3 <= 0) OR (p7 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p8 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p4 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p7 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p12 <= 0) OR (p15 <= 0))))))",
"processed_size": 3305,
"rewrites": 174
},
"result":
{
"edges": 810,
"markings": 325,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (G ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21)))))",
"processed_size": 419,
"rewrites": 174
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 34,
"adisj": 2,
"aneg": 0,
"comp": 126,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 126,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "X (X (X (G ((F ((((1 <= p2) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p1) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p6) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p7) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p7) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p4) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p9) AND (1 <= p10) AND (1 <= p11)))) OR (((1 <= p2) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p8) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p26) AND (1 <= p29))))))))",
"processed_size": 1920,
"rewrites": 174
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 9,
"aneg": 1,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (G ((G (((p9 <= 0) OR (p10 <= 0) OR (p11 <= 0))) OR (((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p5 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p26 <= 0) OR (p29 <= 0))))))",
"processed_size": 470,
"rewrites": 174
},
"result":
{
"edges": 1683,
"markings": 649,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G (((1 <= p12) OR (1 <= p13) OR (1 <= p14)))))",
"processed_size": 54,
"rewrites": 174
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 13,
"aneg": 2,
"comp": 78,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 78,
"taut": 0,
"tconj": 12,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "G (((G (((p9 <= 0) OR (p10 <= 0) OR (p11 <= 0))) R (((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p5 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p26 <= 0) OR (p29 <= 0)))) AND (((p2 <= 0) OR (p3 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND (((p5 <= 0) OR (p7 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND (((p1 <= 0) OR (p3 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND (((p2 <= 0) OR (p6 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND (((p1 <= 0) OR (p5 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND (((p5 <= 0) OR (p6 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND (((p5 <= 0) OR (p7 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND (((p2 <= 0) OR (p7 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND (((p1 <= 0) OR (p6 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND (((p2 <= 0) OR (p6 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND (((p3 <= 0) OR (p7 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p12 <= 0) OR (p15 <= 0)))))))))))))))",
"processed_size": 1209,
"rewrites": 174
},
"result":
{
"edges": 879,
"markings": 343,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (X (F ((((1 <= p2) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p8) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p26) AND (1 <= p29))))))",
"processed_size": 423,
"rewrites": 174
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 5,
"aconj": 27,
"adisj": 3,
"aneg": 0,
"comp": 81,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 81,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (X (F ((G ((X (X (X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21)))))) AND (((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21))))) AND (((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21)))))))",
"processed_size": 1275,
"rewrites": 174
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 3,
"aconj": 37,
"adisj": 4,
"aneg": 2,
"comp": 111,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 111,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (((((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21))) U (((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21)))) AND (F ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21)))) AND X ((((p6 <= 0) OR (p15 <= 0) OR (p23 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p22 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p8 <= 0) OR (p17 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p17 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p16 <= 0) OR (p22 <= 0)) AND ((p7 <= 0) OR (p16 <= 0) OR (p23 <= 0)) AND ((p0 <= 0) OR (p15 <= 0) OR (p21 <= 0)))))) U X (((p9 <= 0) OR (p10 <= 0) OR (p11 <= 0)))))",
"processed_size": 1725,
"rewrites": 174
},
"result":
{
"edges": 93,
"markings": 79,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 11,
"adisj": 10,
"aneg": 0,
"comp": 57,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 57,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X ((X (F ((X (((1 <= p9) AND (1 <= p10) AND (1 <= p11))) OR F ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21))))))) OR G ((((p6 <= 0) OR (p15 <= 0) OR (p23 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p22 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p8 <= 0) OR (p17 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p17 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p16 <= 0) OR (p22 <= 0)) AND ((p7 <= 0) OR (p16 <= 0) OR (p23 <= 0)) AND ((p0 <= 0) OR (p15 <= 0) OR (p21 <= 0))))))",
"processed_size": 899,
"rewrites": 174
},
"result":
{
"edges": 168,
"markings": 130,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 64,
"adisj": 4,
"aneg": 2,
"comp": 216,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 216,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "F ((G (F ((G (((((p17 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p18 <= 0))) OR (((p4 <= 0) OR (p10 <= 0) OR (p16 <= 1)) AND ((p5 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p9 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 1)) AND ((p7 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p16 <= 1)) AND ((p3 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p10 <= 0) OR (p17 <= 1)) AND ((p1 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p11 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p9 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p11 <= 0) OR (p16 <= 1)) AND ((p2 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0))))) OR (((p17 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p18 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 1)) AND ((p5 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p9 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 1)) AND ((p7 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p16 <= 1)) AND ((p3 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p10 <= 0) OR (p17 <= 1)) AND ((p1 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p11 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p9 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p11 <= 0) OR (p16 <= 1)) AND ((p2 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0)))))) AND X ((((1 <= p17) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p18))))))",
"processed_size": 3322,
"rewrites": 174
},
"result":
{
"edges": 772,
"markings": 328,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 13,
"adisj": 3,
"aneg": 2,
"comp": 39,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 39,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "G ((X ((((1 <= p17) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p18)))) AND (G ((F ((((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p5 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p26 <= 0) OR (p29 <= 0)))) OR ((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))) OR ((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))))",
"processed_size": 623,
"rewrites": 174
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 18,
"adisj": 4,
"aneg": 3,
"comp": 45,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 45,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (F ((G (((((p17 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p18 <= 0))) AND (F ((((p17 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p18 <= 0)))) OR G ((((p17 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p18 <= 0))))))) OR (((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21))))))",
"processed_size": 729,
"rewrites": 174
},
"result":
{
"edges": 450,
"markings": 298,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 82,
"adisj": 3,
"aneg": 3,
"comp": 300,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 300,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G (F ((X (F ((G ((((p4 <= 0) OR (p10 <= 0) OR (p16 <= 1)) AND ((p5 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p9 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 1)) AND ((p7 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p16 <= 1)) AND ((p3 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p10 <= 0) OR (p17 <= 1)) AND ((p1 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p11 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p9 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p11 <= 0) OR (p16 <= 1)) AND ((p2 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0)))) OR (((p4 <= 0) OR (p10 <= 0) OR (p16 <= 1)) AND ((p5 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p9 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 1)) AND ((p7 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p16 <= 1)) AND ((p3 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p10 <= 0) OR (p17 <= 1)) AND ((p1 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p11 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p9 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p11 <= 0) OR (p16 <= 1)) AND ((p2 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p10 <= 0) OR (p11 <= 0)))))) OR (((p4 <= 0) OR (p10 <= 0) OR (p16 <= 1)) AND ((p5 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p9 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 1)) AND ((p7 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p16 <= 1)) AND ((p3 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p10 <= 0) OR (p17 <= 1)) AND ((p1 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p11 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p9 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p11 <= 0) OR (p16 <= 1)) AND ((p2 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0))))))",
"processed_size": 4578,
"rewrites": 174
},
"result":
{
"edges": 1026,
"markings": 436,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 27,
"adisj": 1,
"aneg": 1,
"comp": 99,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 99,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((p4 <= 0) OR (p10 <= 0) OR (p16 <= 1)) AND ((p5 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p9 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 1)) AND ((p7 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p16 <= 1)) AND ((p3 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p10 <= 0) OR (p17 <= 1)) AND ((p1 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p11 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p9 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p11 <= 0) OR (p16 <= 1)) AND ((p2 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0)))",
"processed_size": 1500,
"rewrites": 176
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 78
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 36,
"adisj": 2,
"aneg": 0,
"comp": 129,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 129,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "(F ((X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21)))) AND ((1 <= p9) AND ((1 <= p10) AND (1 <= p11))))) U (((1 <= p4) AND (1 <= p10) AND (2 <= p16)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p9) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p11) AND (2 <= p15)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p9) AND (2 <= p16)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p10) AND (2 <= p17)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p10) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p11) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p9) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p11) AND (2 <= p16)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16))))",
"processed_size": 1974,
"rewrites": 174
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 27,
"adisj": 1,
"aneg": 1,
"comp": 99,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 99,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((p4 <= 0) OR (p10 <= 0) OR (p16 <= 1)) AND ((p5 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p9 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 1)) AND ((p7 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p16 <= 1)) AND ((p3 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p10 <= 0) OR (p17 <= 1)) AND ((p1 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p11 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p9 <= 0) OR (p15 <= 1)) AND ((p6 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p9 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p11 <= 0) OR (p16 <= 1)) AND ((p2 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p16 <= 0)))",
"processed_size": 1500,
"rewrites": 176
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 78
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 10,
"adisj": 9,
"aneg": 0,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 9,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G ((X (G ((((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p5 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p26 <= 0) OR (p29 <= 0))))) OR (((1 <= p2) AND (1 <= p24) AND (1 <= p27)) OR (((1 <= p3) AND (1 <= p25) AND (1 <= p28)) OR (((1 <= p6) AND (1 <= p26) AND (1 <= p29)) OR (((1 <= p8) AND (1 <= p26) AND (1 <= p29)) OR (((1 <= p4) AND (1 <= p25) AND (1 <= p28)) OR (((1 <= p0) AND (1 <= p24) AND (1 <= p27)) OR (((1 <= p1) AND (1 <= p24) AND (1 <= p27)) OR (((1 <= p5) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p26) AND (1 <= p29))))))))))))",
"processed_size": 846,
"rewrites": 174
},
"result":
{
"edges": 12,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 36,
"adisj": 2,
"aneg": 0,
"comp": 129,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 129,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "(F ((X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21)))) AND ((1 <= p9) AND ((1 <= p10) AND (1 <= p11))))) U (((1 <= p4) AND (1 <= p10) AND (2 <= p16)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p9) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p11) AND (2 <= p15)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p9) AND (2 <= p16)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p10) AND (2 <= p17)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p10) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p11) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p9) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p11) AND (2 <= p16)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16))))",
"processed_size": 1974,
"rewrites": 174
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 291752,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G((G(*) OR (* OR *))) AND X(G(**))) : X(X(X(G((F(**) OR **))))) : X(G((G(*) OR **))) : X(X(G(**))) : (X(X(F(**))) OR G(((G(*) R *) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **)))))))))))))) : X(X(F((G((X(X(X(**))) AND **)) AND **)))) : X((((** U **) AND (F(**) AND X(*))) U X(*))) : X((X(F((X(**) OR F(**)))) OR G(**))) : F((G(F((G(*) OR *))) AND X(**))) : G((X(**) AND (G((F(*) OR *)) OR **))) : X(F((G((* AND (F(*) OR G(*)))) OR **))) : G(F((X(F((G(*) OR *))) OR *))) : ((F((X(**) AND (** AND (** AND **)))) U **) OR (G((X(G(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))) AND F(**)))"
},
"net":
{
"arcs": 534,
"conflict_clusters": 1,
"places": 30,
"places_significant": 19,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "no no yes no no no yes yes no no yes yes no ",
"value": "no no yes no no no yes yes no no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 111/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 81 transitions, 19 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p0)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p0)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p0)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: (NOT(F (((F ((((p2 <= 0) OR (p3 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p3 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p7 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p1 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p5 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p8 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p2 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p8 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p5 <= 0) OR (p6 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p7 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p7 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p4 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p3 <= 0) OR (p7 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p8 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p4 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p7 <= 0) OR (p13 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p3 <= 0) OR (p12 <= 0) OR (p15 <= 0)))) AND (((1 <= p2) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p8) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p26) AND (1 <= p29)))) AND (((1 <= p2) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p1) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p6) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p7) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p7) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p4) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)))))) AND G (X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21)))))) : X (G (X (((F (X (((1 <= p9) AND (1 <= p10) AND (1 <= p11)))) U X (F ((((1 <= p2) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p1) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p5) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p6) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p7) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p1) AND (1 <= p4) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p7) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p4) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p9) AND (1 <= p10) AND (1 <= p11)))))) OR X ((((1 <= p2) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p8) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p26) AND (1 <= p29)))))))) : G (X ((NOT(F (((1 <= p9) AND (1 <= p10) AND (1 <= p11)))) OR (((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p5 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p26 <= 0) OR (p29 <= 0)))))) : G (X (X (((1 <= p12) OR (1 <= p13) OR (1 <= p14))))) : (X (X (F ((((1 <= p2) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p8) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p26) AND (1 <= p29)))))) OR G (((((((((((((NOT((F (((1 <= p9) AND (1 <= p10) AND (1 <= p11))) U (((1 <= p2) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p8) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p26) AND (1 <= p29))))) AND ((p2 <= 0) OR (p3 <= 0) OR (p12 <= 0) OR (p15 <= 0))) AND ((p5 <= 0) OR (p7 <= 0) OR (p14 <= 0) OR (p17 <= 0))) AND ((p1 <= 0) OR (p3 <= 0) OR (p13 <= 0) OR (p16 <= 0))) AND ((p2 <= 0) OR (p6 <= 0) OR (p14 <= 0) OR (p17 <= 0))) AND ((p1 <= 0) OR (p5 <= 0) OR (p13 <= 0) OR (p16 <= 0))) AND ((p5 <= 0) OR (p6 <= 0) OR (p14 <= 0) OR (p17 <= 0))) AND ((p5 <= 0) OR (p7 <= 0) OR (p13 <= 0) OR (p16 <= 0))) AND ((p2 <= 0) OR (p7 <= 0) OR (p14 <= 0) OR (p17 <= 0))) AND ((p1 <= 0) OR (p6 <= 0) OR (p12 <= 0) OR (p15 <= 0))) AND ((p2 <= 0) OR (p6 <= 0) OR (p12 <= 0) OR (p15 <= 0))) AND ((p3 <= 0) OR (p7 <= 0) OR (p13 <= 0) OR (p16 <= 0))) AND ((p1 <= 0) OR (p3 <= 0) OR (p12 <= 0) OR (p15 <= 0))))) : X (F (X ((G ((X (X (X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21)))))) AND (((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21))))) AND (((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21))))))) : X ((((((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21))) U (((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21)))) AND F ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21))))) AND NOT(X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21)))))) U NOT(X (((1 <= p9) AND (1 <= p10) AND (1 <= p11)))))) : X ((F (X ((X (((1 <= p9) AND (1 <= p10) AND (1 <= p11))) OR F ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21))))))) OR G ((((p6 <= 0) OR (p15 <= 0) OR (p23 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p22 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p8 <= 0) OR (p17 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p17 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p16 <= 0) OR (p22 <= 0)) AND ((p7 <= 0) OR (p16 <= 0) OR (p23 <= 0)) AND ((p0 <= 0) OR (p15 <= 0) OR (p21 <= 0)))))) : F ((G (NOT(G ((F (((((1 <= p17) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p18))) AND (((1 <= p4) AND (1 <= p10) AND (2 <= p16)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p9) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p11) AND (2 <= p15)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p9) AND (2 <= p16)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p10) AND (2 <= p17)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p10) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p11) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p9) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p11) AND (2 <= p16)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16))))) AND (((1 <= p17) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p18)) OR ((1 <= p4) AND (1 <= p10) AND (2 <= p16)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p9) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p11) AND (2 <= p15)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p9) AND (2 <= p16)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p10) AND (2 <= p17)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p10) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p11) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p9) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p11) AND (2 <= p16)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16))))))) AND X ((((1 <= p17) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p18)))))) : G ((X ((((1 <= p17) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p18)))) AND (NOT(F ((G ((((1 <= p2) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p8) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p26) AND (1 <= p29)))) AND ((1 <= p12) OR (1 <= p13) OR (1 <= p14))))) OR ((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))))) : X ((F (G (NOT((G ((((1 <= p17) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p18)))) U (((1 <= p17) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p18))))))) OR ((((1 <= p17) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p18))) U F (((((1 <= p17) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p18))) U (((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21)))))))) : NOT(F (G (X ((G (X (G ((F ((((1 <= p4) AND (1 <= p10) AND (2 <= p16)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p9) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p11) AND (2 <= p15)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p9) AND (2 <= p16)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p10) AND (2 <= p17)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p10) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p11) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p9) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p11) AND (2 <= p16)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16)))) AND (((1 <= p4) AND (1 <= p10) AND (2 <= p16)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p9) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p11) AND (2 <= p15)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p9) AND (2 <= p16)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p10) AND (2 <= p17)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p10) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p11) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p9) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p11) AND (2 <= p16)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p10) AND (1 <= p11))))))) AND (((1 <= p4) AND (1 <= p10) AND (2 <= p16)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p9) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p11) AND (2 <= p15)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p9) AND (2 <= p16)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p10) AND (2 <= p17)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p10) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p11) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p9) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p11) AND (2 <= p16)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16)))))))) : (G ((((((((((X (G ((((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p5 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p26 <= 0) OR (p29 <= 0))))) OR ((1 <= p2) AND (1 <= p24) AND (1 <= p27))) OR ((1 <= p3) AND (1 <= p25) AND (1 <= p28))) OR ((1 <= p6) AND (1 <= p26) AND (1 <= p29))) OR ((1 <= p8) AND (1 <= p26) AND (1 <= p29))) OR ((1 <= p4) AND (1 <= p25) AND (1 <= p28))) OR ((1 <= p0) AND (1 <= p24) AND (1 <= p27))) OR ((1 <= p1) AND (1 <= p24) AND (1 <= p27))) OR ((1 <= p5) AND (1 <= p25) AND (1 <= p28))) OR ((1 <= p7) AND (1 <= p26) AND (1 <= p29)))) U (F ((((X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p21)))) AND (1 <= p9)) AND (1 <= p10)) AND (1 <= p11))) U (((1 <= p4) AND (1 <= p10) AND (2 <= p16)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p9) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p11) AND (2 <= p15)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p9) AND (2 <= p16)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p10) AND (2 <= p17)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p10) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p11) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p9) AND (2 <= p15)) OR ((1 <= p6) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p9) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p11) AND (2 <= p16)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p16)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((G ((((1 <= p2) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p1) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p5) AND (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((((1 <= p2) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p1) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p5) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((1 <= p2) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p1) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p5) AND (1 ... (shortened)
lola: processed formula length: 3305
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 325 markings, 810 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15)... (shortened)
lola: processed formula length: 419
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((F ((((1 <= p2) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p1) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((F ((((1 <= p2) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p13) AND (1 <= p16)) OR ((1 <= p0) AND (1 <= p1) AND (1 <= p12) AND (1 <= p15)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p5... (shortened)
lola: processed formula length: 1920
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((p9 <= 0) OR (p10 <= 0) OR (p11 <= 0))) OR (((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p5 <= 0) OR (p25 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((p9 <= 0) OR (p10 <= 0) OR (p11 <= 0))) OR (((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p5 <= 0) OR (p25 <... (shortened)
lola: processed formula length: 470
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 649 markings, 1683 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p12) OR (1 <= p13) OR (1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p12) OR (1 <= p13) OR (1 <= p14)))))
lola: processed formula length: 54
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((((1 <= p2) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p8) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G (((p9 <= 0) OR (p10 <= 0) OR (p11 <= 0))) R (((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p5 <= 0) OR (p25 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G (((p9 <= 0) OR (p10 <= 0) OR (p11 <= 0))) R (((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p5 <= 0) OR (p25 <= 0... (shortened)
lola: processed formula length: 1209
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 343 markings, 879 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((1 <= p2) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p8) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((1 <= p2) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p6) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p8) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p24) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p... (shortened)
lola: processed formula length: 423
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G ((X (X (X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G ((X (X (X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p... (shortened)
lola: processed formula length: 1275
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p15)... (shortened)
lola: processed formula length: 1725
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 79 markings, 93 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((X (((1 <= p9) AND (1 <= p10) AND (1 <= p11))) OR F ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((X (((1 <= p9) AND (1 <= p10) AND (1 <= p11))) OR F ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND... (shortened)
lola: processed formula length: 899
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 130 markings, 168 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((G (((((p17 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p18 <= 0))) OR (((p4 <= 0) OR (p10 <= 0) OR (p16 <= 1)) AND ((p5 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p9 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 1)) AND ((p7 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((G (((((p17 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p18 <= 0))) OR (((p4 <= 0) OR (p10 <= 0) OR (p16 <= 1)) AND ((p5 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p9 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 1)) AND ((p7 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR... (shortened)
lola: processed formula length: 3322
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 328 markings, 772 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((((1 <= p17) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p18)))) AND (G ((F ((((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((((1 <= p17) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p18)))) AND (G ((F ((((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0... (shortened)
lola: processed formula length: 623
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((((p17 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p18 <= 0))) AND (F ((((p17 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p18 <= 0)))) OR G ((((p17 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p18 <= 0))))))) OR (((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((((p17 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p18 <= 0))) AND (F ((((p17 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p18 <= 0)))) OR G ((((p17 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p18 <= 0))))))) OR (((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p2... (shortened)
lola: processed formula length: 729
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 298 markings, 450 edges
lola: ========================================
lola: subprocess 11 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (F ((G ((((p4 <= 0) OR (p10 <= 0) OR (p16 <= 1)) AND ((p5 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p9 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 1)) AND ((p7 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p16 <= 1)) AND ((p3 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (F ((G ((((p4 <= 0) OR (p10 <= 0) OR (p16 <= 1)) AND ((p5 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p9 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 1)) AND ((p7 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p16 <= 1)) AND ((p3 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p1... (shortened)
lola: processed formula length: 4578
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 436 markings, 1026 edges
lola: ========================================
lola: subprocess 12 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p4) AND (1 <= p10) AND (2 <= p16)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p9) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p11) AND (2 <= p15)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p9) AND (2 <= p16)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p11) AND (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p4 <= 0) OR (p10 <= 0) OR (p16 <= 1)) AND ((p5 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p9 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 1)) AND ((p7 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p16 <= 1)) AND ((p3 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p11 <= 0) OR (p16 ... (shortened)
lola: processed formula length: 1500
lola: 176 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p1... (shortened)
lola: processed formula length: 1974
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((F ((X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p4) AND (1 <= p10) AND (2 <= p16)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p9) AND (2 <= p17)) OR ((1 <= p0) AND (1 <= p11) AND (2 <= p15)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p9) AND (2 <= p16)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p15) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p11) AND (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p4 <= 0) OR (p10 <= 0) OR (p16 <= 1)) AND ((p5 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p9 <= 0) OR (p17 <= 1)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 1)) AND ((p7 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p17 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p16 <= 1)) AND ((p3 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p11 <= 0) OR (p16 ... (shortened)
lola: processed formula length: 1500
lola: 176 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((X (G ((((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p5 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p26 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((((p2 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p6 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p0 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p24 <= 0) OR (p27 <= 0)) AND ((p5 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p26 <... (shortened)
lola: processed formula length: 846
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 12 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((X ((((1 <= p6) AND (1 <= p15) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p17) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p17) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p16) AND (1 <= p23)) OR ((1 <= p0) AND (1 <= p1... (shortened)
lola: processed formula length: 1974
lola: 174 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no yes yes no no yes yes no
lola:
preliminary result: no no yes no no no yes yes no no yes yes no
lola: memory consumption: 291752 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is PhilosophersDyn-COL-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871500194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;