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-158987871400124.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 Philosophers-PT-000020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871400124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 82K 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 Philosophers-PT-000020-CTLFireability-00
FORMULA_NAME Philosophers-PT-000020-CTLFireability-01
FORMULA_NAME Philosophers-PT-000020-CTLFireability-02
FORMULA_NAME Philosophers-PT-000020-CTLFireability-03
FORMULA_NAME Philosophers-PT-000020-CTLFireability-04
FORMULA_NAME Philosophers-PT-000020-CTLFireability-05
FORMULA_NAME Philosophers-PT-000020-CTLFireability-06
FORMULA_NAME Philosophers-PT-000020-CTLFireability-07
FORMULA_NAME Philosophers-PT-000020-CTLFireability-08
FORMULA_NAME Philosophers-PT-000020-CTLFireability-09
FORMULA_NAME Philosophers-PT-000020-CTLFireability-10
FORMULA_NAME Philosophers-PT-000020-CTLFireability-11
FORMULA_NAME Philosophers-PT-000020-CTLFireability-12
FORMULA_NAME Philosophers-PT-000020-CTLFireability-13
FORMULA_NAME Philosophers-PT-000020-CTLFireability-14
FORMULA_NAME Philosophers-PT-000020-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591128980693

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:16:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 20:16:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:16:22] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2020-06-02 20:16:22] [INFO ] Transformed 100 places.
[2020-06-02 20:16:22] [INFO ] Transformed 100 transitions.
[2020-06-02 20:16:22] [INFO ] Parsed PT model containing 100 places and 100 transitions in 90 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Finished random walk after 34602 steps, including 54 resets, run visited all 102 properties in 130 ms. (steps per millisecond=266 )
[2020-06-02 20:16:23] [INFO ] Flatten gal took : 50 ms
[2020-06-02 20:16:23] [INFO ] Flatten gal took : 17 ms
[2020-06-02 20:16:23] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 11 ms.
[2020-06-02 20:16:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Philosophers-PT-000020 @ 3570 seconds

FORMULA Philosophers-PT-000020-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000020-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2391
rslt: Output for CTLFireability @ Philosophers-PT-000020

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 20:16:23 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 41,
"aneg": 1,
"comp": 80,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "AX(((((1 <= p5) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p22)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p20) AND (1 <= p37)) OR ((1 <= p15) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p36)) OR ((1 <= p17) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p31))) AND (((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p35)) OR ((1 <= p17) AND (1 <= p39)))))",
"processed_size": 1265,
"rewrites": 225
},
"net":
{
"conflict_clusters": 21,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 20,
"adisj": 1,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "(((1 <= p37) AND (1 <= p57)) OR ((1 <= p34) AND (1 <= p82)) OR ((1 <= p31) AND (1 <= p74)) OR ((1 <= p39) AND (1 <= p81)) OR ((1 <= p29) AND (1 <= p76)) OR ((1 <= p21) AND (1 <= p67)) OR ((1 <= p35) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p63)) OR ((1 <= p23) AND (1 <= p61)) OR ((1 <= p33) AND (1 <= p72)) OR ((1 <= p32) AND (1 <= p75)) OR ((1 <= p24) AND (1 <= p68)) OR ((1 <= p22) AND (1 <= p66)) OR ((1 <= p27) AND (1 <= p73)) OR ((1 <= p19) AND (1 <= p65)) OR ((1 <= p40) AND (1 <= p84)) OR ((1 <= p36) AND (1 <= p71)) OR ((1 <= p28) AND (1 <= p64)) OR ((1 <= p26) AND (1 <= p62)) OR ((1 <= p30) AND (1 <= p69)))",
"processed_size": 637,
"rewrites": 227
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 80
},
"threads": 1,
"type": "dfs"
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 20,
"adisj": 1,
"aneg": 1,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "E (F ((((p37 <= 0) OR (p57 <= 0)) AND ((p34 <= 0) OR (p82 <= 0)) AND ((p31 <= 0) OR (p74 <= 0)) AND ((p39 <= 0) OR (p81 <= 0)) AND ((p29 <= 0) OR (p76 <= 0)) AND ((p21 <= 0) OR (p67 <= 0)) AND ((p35 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p63 <= 0)) AND ((p23 <= 0) OR (p61 <= 0)) AND ((p33 <= 0) OR (p72 <= 0)) AND ((p32 <= 0) OR (p75 <= 0)) AND ((p24 <= 0) OR (p68 <= 0)) AND ((p22 <= 0) OR (p66 <= 0)) AND ((p27 <= 0) OR (p73 <= 0)) AND ((p19 <= 0) OR (p65 <= 0)) AND ((p40 <= 0) OR (p84 <= 0)) AND ((p36 <= 0) OR (p71 <= 0)) AND ((p28 <= 0) OR (p64 <= 0)) AND ((p26 <= 0) OR (p62 <= 0)) AND ((p30 <= 0) OR (p69 <= 0)))))",
"processed_size": 645,
"rewrites": 225
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 20,
"aneg": 1,
"comp": 60,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 60,
"visible_transitions": 0
},
"processed": "A (G (((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR ((1 <= p5) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p22)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p20) AND (1 <= p37)) OR ((1 <= p15) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p36)) OR ((1 <= p17) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p31)))))",
"processed_size": 935,
"rewrites": 226
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 40,
"adisj": 1,
"aneg": 1,
"comp": 80,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "AX((((p37 <= 0) OR (p57 <= 0)) AND ((p34 <= 0) OR (p82 <= 0)) AND ((p31 <= 0) OR (p74 <= 0)) AND ((p39 <= 0) OR (p81 <= 0)) AND ((p29 <= 0) OR (p76 <= 0)) AND ((p21 <= 0) OR (p67 <= 0)) AND ((p35 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p63 <= 0)) AND ((p23 <= 0) OR (p61 <= 0)) AND ((p33 <= 0) OR (p72 <= 0)) AND ((p32 <= 0) OR (p75 <= 0)) AND ((p24 <= 0) OR (p68 <= 0)) AND ((p22 <= 0) OR (p66 <= 0)) AND ((p27 <= 0) OR (p73 <= 0)) AND ((p19 <= 0) OR (p65 <= 0)) AND ((p40 <= 0) OR (p84 <= 0)) AND ((p36 <= 0) OR (p71 <= 0)) AND ((p28 <= 0) OR (p64 <= 0)) AND ((p26 <= 0) OR (p62 <= 0)) AND ((p30 <= 0) OR (p69 <= 0)) AND ((p37 <= 0) OR (p57 <= 0)) AND ((p34 <= 0) OR (p82 <= 0)) AND ((p31 <= 0) OR (p74 <= 0)) AND ((p39 <= 0) OR (p81 <= 0)) AND ((p29 <= 0) OR (p76 <= 0)) AND ((p21 <= 0) OR (p67 <= 0)) AND ((p35 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p63 <= 0)) AND ((p23 <= 0) OR (p61 <= 0)) AND ((p33 <= 0) OR (p72 <= 0)) AND ((p32 <= 0) OR (p75 <= 0)) AND ((p24 <= 0) OR (p68 <= 0)) AND ((p22 <= 0) OR (p66 <= 0)) AND ((p27 <= 0) OR (p73 <= 0)) AND ((p19 <= 0) OR (p65 <= 0)) AND ((p40 <= 0) OR (p84 <= 0)) AND ((p36 <= 0) OR (p71 <= 0)) AND ((p28 <= 0) OR (p64 <= 0)) AND ((p26 <= 0) OR (p62 <= 0)) AND ((p30 <= 0) OR (p69 <= 0))))",
"processed_size": 1281,
"rewrites": 225
},
"net":
{
"conflict_clusters": 21,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 40,
"adisj": 22,
"aneg": 0,
"comp": 140,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 140,
"taut": 0,
"tconj": 20,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "E(EF((((1 <= p37) AND (1 <= p57)) OR ((1 <= p34) AND (1 <= p82)) OR ((1 <= p31) AND (1 <= p74)) OR ((1 <= p39) AND (1 <= p81)) OR ((1 <= p29) AND (1 <= p76)) OR ((1 <= p21) AND (1 <= p67)) OR ((1 <= p35) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p63)) OR ((1 <= p23) AND (1 <= p61)) OR ((1 <= p33) AND (1 <= p72)) OR ((1 <= p32) AND (1 <= p75)) OR ((1 <= p24) AND (1 <= p68)) OR ((1 <= p22) AND (1 <= p66)) OR ((1 <= p27) AND (1 <= p73)) OR ((1 <= p19) AND (1 <= p65)) OR ((1 <= p40) AND (1 <= p84)) OR ((1 <= p36) AND (1 <= p71)) OR ((1 <= p28) AND (1 <= p64)) OR ((1 <= p26) AND (1 <= p62)) OR ((1 <= p30) AND (1 <= p69)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p35)) OR ((1 <= p17) AND (1 <= p39)))) U (AX(((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94))) AND (((p5 <= 0) OR (p23 <= 0)) AND (((p8 <= 0) OR (p28 <= 0)) AND (((p16 <= 0) OR (p36 <= 0)) AND (((p3 <= 0) OR (p21 <= 0)) AND (((p18 <= 0) OR (p34 <= 0)) AND (((p2 <= 0) OR (p22 <= 0)) AND (((p6 <= 0) OR (p26 <= 0)) AND (((p10 <= 0) OR (p31 <= 0)) AND (((p0 <= 0) OR (p37 <= 0)) AND (((p9 <= 0) OR (p27 <= 0)) AND (((p4 <= 0) OR (p24 <= 0)) AND (((p20 <= 0) OR (p40 <= 0)) AND (((p1 <= 0) OR (p19 <= 0)) AND (((p14 <= 0) OR (p30 <= 0)) AND (((p12 <= 0) OR (p29 <= 0)) AND (((p7 <= 0) OR (p25 <= 0)) AND (((p15 <= 0) OR (p33 <= 0)) AND (((p11 <= 0) OR (p32 <= 0)) AND (((p13 <= 0) OR (p35 <= 0)) AND ((p17 <= 0) OR (p39 <= 0)))))))))))))))))))))))",
"processed_size": 2248,
"rewrites": 227
},
"net":
{
"conflict_clusters": 21,
"singleton_clusters": 0
},
"result":
{
"edges": 11595013,
"markings": 2292975,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 272
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "A (G ((((1 <= p7) AND (1 <= p28)) OR (1 <= p79))))",
"processed_size": 51,
"rewrites": 226
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EF((AX(((1 <= p18) AND (1 <= p34))) AND ((1 <= p86) OR (p29 <= 0) OR (p50 <= 0))))",
"processed_size": 84,
"rewrites": 226
},
"net":
{
"conflict_clusters": 21,
"singleton_clusters": 0
},
"result":
{
"edges": 30720616,
"markings": 7249542,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 291
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EX((E((1 <= p99) U ((1 <= p39) AND (1 <= p60))) AND AG(((p33 <= 0) OR (p72 <= 0)))))",
"processed_size": 85,
"rewrites": 227
},
"net":
{
"conflict_clusters": 21,
"singleton_clusters": 0
},
"result":
{
"edges": 70014,
"markings": 21810,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 317
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EF(AX((1 <= p91)))",
"processed_size": 18,
"rewrites": 226
},
"net":
{
"conflict_clusters": 21,
"singleton_clusters": 0
},
"result":
{
"edges": 30720616,
"markings": 7249542,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 344
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 20,
"adisj": 1,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p35)) OR ((1 <= p17) AND (1 <= p39)))))",
"processed_size": 635,
"rewrites": 226
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 382
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p31) AND (1 <= p52)) OR ((1 <= p19) AND (1 <= p38)))",
"processed_size": 61,
"rewrites": 228
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 437
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((((p31 <= 0) OR (p74 <= 0)) AND ((p20 <= 0) OR (p40 <= 0))) OR (((p7 <= 0) OR (p28 <= 0)) AND ((p23 <= 0) OR (p61 <= 0))))",
"processed_size": 128,
"rewrites": 228
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "((p97 <= 0) AND (p96 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p77 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p85 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0))",
"processed_size": 297,
"rewrites": 227
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 60
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 20,
"problems": 20
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 611
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 80,
"adisj": 3,
"aneg": 0,
"comp": 160,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 160,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 60,
"visible_transitions": 0
},
"processed": "AG(((((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p35)) OR ((1 <= p17) AND (1 <= p39))) OR (EG((((1 <= p5) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p22)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p20) AND (1 <= p37)) OR ((1 <= p15) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p36)) OR ((1 <= p17) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p31)))) AND (((1 <= p37) AND (1 <= p58)) OR ((1 <= p29) AND (1 <= p50)) OR ((1 <= p34) AND (1 <= p53)) OR ((1 <= p24) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p51)) OR ((1 <= p36) AND (1 <= p55)) OR ((1 <= p22) AND (1 <= p43)) OR ((1 <= p28) AND (1 <= p46)) OR ((1 <= p40) AND (1 <= p59)) OR ((1 <= p26) AND (1 <= p48)) OR ((1 <= p33) AND (1 <= p54)) OR ((1 <= p30) AND (1 <= p49)) OR ((1 <= p19) AND (1 <= p38)) OR ((1 <= p35) AND (1 <= p56)) OR ((1 <= p39) AND (1 <= p60)) OR ((1 <= p31) AND (1 <= p52)) OR ((1 <= p27) AND (1 <= p45)) OR ((1 <= p23) AND (1 <= p42)) OR ((1 <= p21) AND (1 <= p44)) OR ((1 <= p25) AND (1 <= p47)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p35)) OR ((1 <= p17) AND (1 <= p39))))))",
"processed_size": 2542,
"rewrites": 226
},
"net":
{
"conflict_clusters": 21,
"singleton_clusters": 0
},
"result":
{
"edges": 9302040,
"markings": 2292975,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 761
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p16 <= 0) OR (p33 <= 0))",
"processed_size": 27,
"rewrites": 227
},
"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": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1015
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((p99 <= 0) OR (p28 <= 0) OR (p64 <= 0) OR (p33 <= 0) OR (p72 <= 0))))",
"processed_size": 80,
"rewrites": 226
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1015
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((p99 <= 0) R (F (((p20 <= 0) OR (p37 <= 0))) AND ((p24 <= 0) OR (p68 <= 0) OR (p31 <= 0) OR (p52 <= 0))))",
"processed_size": 110,
"rewrites": 235
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1523
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(F (((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94))) U ((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94)))",
"processed_size": 603,
"rewrites": 233
},
"result":
{
"edges": 59,
"markings": 59,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3047
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 20,
"adisj": 1,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "(((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p35)) OR ((1 <= p17) AND (1 <= p39)))",
"processed_size": 627,
"rewrites": 224
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 20,
"adisj": 1,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "(((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p35)) OR ((1 <= p17) AND (1 <= p39)))",
"processed_size": 627,
"rewrites": 224
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 21,
"adisj": 22,
"aneg": 0,
"comp": 120,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "G ((((((p37 <= 0) OR (p58 <= 0)) AND ((p29 <= 0) OR (p50 <= 0)) AND ((p34 <= 0) OR (p53 <= 0)) AND ((p24 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p51 <= 0)) AND ((p36 <= 0) OR (p55 <= 0)) AND ((p22 <= 0) OR (p43 <= 0)) AND ((p28 <= 0) OR (p46 <= 0)) AND ((p40 <= 0) OR (p59 <= 0)) AND ((p26 <= 0) OR (p48 <= 0)) AND ((p33 <= 0) OR (p54 <= 0)) AND ((p30 <= 0) OR (p49 <= 0)) AND ((p19 <= 0) OR (p38 <= 0)) AND ((p35 <= 0) OR (p56 <= 0)) AND ((p39 <= 0) OR (p60 <= 0)) AND ((p31 <= 0) OR (p52 <= 0)) AND ((p27 <= 0) OR (p45 <= 0)) AND ((p23 <= 0) OR (p42 <= 0)) AND ((p21 <= 0) OR (p44 <= 0)) AND ((p25 <= 0) OR (p47 <= 0))) OR (1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR ((1 <= p5) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p22)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p20) AND (1 <= p37)) OR ((1 <= p15) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p36)) OR ((1 <= p17) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p31))) OR G (((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94)))))",
"processed_size": 1880,
"rewrites": 226
},
"result":
{
"edges": 30720636,
"markings": 7249558,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4072,
"runtime": 1179.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(X(*)) AND A(X(A(F(*))))) : A(G(**)) : E((E(G(*)) R *)) : A(G((** OR (E(G(**)) AND **)))) : A(F(**)) : (A(G((** OR A(G(**))))) AND **) : (A(G(*)) OR (A(X(*)) AND (E(F(*)) OR (** OR (** OR **))))) : E((E(F(**)) U (A(X(**)) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **)))))))))))))))))))))) : (E(F((A(X(**)) AND **))) OR (A(X(**)) AND A(G(**)))) : E(X((E((** U **)) AND A(G(*))))) : (A(G(*)) AND A(F(**))) : E(F(A(G(E(F(**)))))) : A(G(A(F(**)))) : E((** U (E(G(**)) OR **))) : E(F(A(X(**)))) : A(G(A(F(**))))"
},
"net":
{
"arcs": 320,
"conflict_clusters": 21,
"places": 100,
"places_significant": 60,
"singleton_clusters": 0,
"transitions": 100
},
"result":
{
"preliminary_value": "no no yes no no no no yes yes no no unknown no yes yes no ",
"value": "no no yes no no no no yes yes no no unknown 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: 200/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 100
lola: finding significant places
lola: 100 places, 100 transitions, 60 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 CTLFireability.xml
lola: NOT(E (X ((((((p5 <= 0) OR (p26 <= 0)) AND ((p3 <= 0) OR (p24 <= 0)) AND ((p8 <= 0) OR (p27 <= 0)) AND ((p2 <= 0) OR (p21 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p16 <= 0) OR (p33 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p22 <= 0)) AND ((p12 <= 0) OR (p30 <= 0)) AND ((p4 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p20 <= 0) OR (p37 <= 0)) AND ((p15 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p29 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p36 <= 0)) AND ((p17 <= 0) OR (p40 <= 0)) AND ((p9 <= 0) OR (p31 <= 0))) OR (((p5 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p28 <= 0)) AND ((p16 <= 0) OR (p36 <= 0)) AND ((p3 <= 0) OR (p21 <= 0)) AND ((p18 <= 0) OR (p34 <= 0)) AND ((p2 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p0 <= 0) OR (p37 <= 0)) AND ((p9 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p24 <= 0)) AND ((p20 <= 0) OR (p40 <= 0)) AND ((p1 <= 0) OR (p19 <= 0)) AND ((p14 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p29 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p15 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND ((p13 <= 0) OR (p35 <= 0)) AND ((p17 <= 0) OR (p39 <= 0)))) OR E (G ((((1 <= p37) AND (1 <= p57)) OR ((1 <= p34) AND (1 <= p82)) OR ((1 <= p31) AND (1 <= p74)) OR ((1 <= p39) AND (1 <= p81)) OR ((1 <= p29) AND (1 <= p76)) OR ((1 <= p21) AND (1 <= p67)) OR ((1 <= p35) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p63)) OR ((1 <= p23) AND (1 <= p61)) OR ((1 <= p33) AND (1 <= p72)) OR ((1 <= p32) AND (1 <= p75)) OR ((1 <= p24) AND (1 <= p68)) OR ((1 <= p22) AND (1 <= p66)) OR ((1 <= p27) AND (1 <= p73)) OR ((1 <= p19) AND (1 <= p65)) OR ((1 <= p40) AND (1 <= p84)) OR ((1 <= p36) AND (1 <= p71)) OR ((1 <= p28) AND (1 <= p64)) OR ((1 <= p26) AND (1 <= p62)) OR ((1 <= p30) AND (1 <= p69))))))))) : A (G ((((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p35)) OR ((1 <= p17) AND (1 <= p39))))) : NOT(A ((A (F (((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94)))) U ((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94))))) : A (G (((((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p35)) OR ((1 <= p17) AND (1 <= p39))) OR (E (G ((((1 <= p5) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p22)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p20) AND (1 <= p37)) OR ((1 <= p15) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p36)) OR ((1 <= p17) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p31))))) AND (((1 <= p37) AND (1 <= p58)) OR ((1 <= p29) AND (1 <= p50)) OR ((1 <= p34) AND (1 <= p53)) OR ((1 <= p24) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p51)) OR ((1 <= p36) AND (1 <= p55)) OR ((1 <= p22) AND (1 <= p43)) OR ((1 <= p28) AND (1 <= p46)) OR ((1 <= p40) AND (1 <= p59)) OR ((1 <= p26) AND (1 <= p48)) OR ((1 <= p33) AND (1 <= p54)) OR ((1 <= p30) AND (1 <= p49)) OR ((1 <= p19) AND (1 <= p38)) OR ((1 <= p35) AND (1 <= p56)) OR ((1 <= p39) AND (1 <= p60)) OR ((1 <= p31) AND (1 <= p52)) OR ((1 <= p27) AND (1 <= p45)) OR ((1 <= p23) AND (1 <= p42)) OR ((1 <= p21) AND (1 <= p44)) OR ((1 <= p25) AND (1 <= p47)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p35)) OR ((1 <= p17) AND (1 <= p39))))))) : A (F (((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94)))) : (A (G ((((((p37 <= 0) OR (p58 <= 0)) AND ((p29 <= 0) OR (p50 <= 0)) AND ((p34 <= 0) OR (p53 <= 0)) AND ((p24 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p51 <= 0)) AND ((p36 <= 0) OR (p55 <= 0)) AND ((p22 <= 0) OR (p43 <= 0)) AND ((p28 <= 0) OR (p46 <= 0)) AND ((p40 <= 0) OR (p59 <= 0)) AND ((p26 <= 0) OR (p48 <= 0)) AND ((p33 <= 0) OR (p54 <= 0)) AND ((p30 <= 0) OR (p49 <= 0)) AND ((p19 <= 0) OR (p38 <= 0)) AND ((p35 <= 0) OR (p56 <= 0)) AND ((p39 <= 0) OR (p60 <= 0)) AND ((p31 <= 0) OR (p52 <= 0)) AND ((p27 <= 0) OR (p45 <= 0)) AND ((p23 <= 0) OR (p42 <= 0)) AND ((p21 <= 0) OR (p44 <= 0)) AND ((p25 <= 0) OR (p47 <= 0))) OR (1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR ((1 <= p5) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p22)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p20) AND (1 <= p37)) OR ((1 <= p15) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p36)) OR ((1 <= p17) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p31))) OR A (G (((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94))))))) AND (((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p35)) OR ((1 <= p17) AND (1 <= p39)))) : (NOT(E (F (((p97 <= 0) AND (p96 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p77 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p85 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0) AND ((p5 <= 0) OR (p26 <= 0)) AND ((p3 <= 0) OR (p24 <= 0)) AND ((p8 <= 0) OR (p27 <= 0)) AND ((p2 <= 0) OR (p21 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p16 <= 0) OR (p33 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p22 <= 0)) AND ((p12 <= 0) OR (p30 <= 0)) AND ((p4 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p20 <= 0) OR (p37 <= 0)) AND ((p15 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p29 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p36 <= 0)) AND ((p17 <= 0) OR (p40 <= 0)) AND ((p9 <= 0) OR (p31 <= 0)))))) OR (NOT(E (X ((((1 <= p37) AND (1 <= p57)) OR ((1 <= p34) AND (1 <= p82)) OR ((1 <= p31) AND (1 <= p74)) OR ((1 <= p39) AND (1 <= p81)) OR ((1 <= p29) AND (1 <= p76)) OR ((1 <= p21) AND (1 <= p67)) OR ((1 <= p35) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p63)) OR ((1 <= p23) AND (1 <= p61)) OR ((1 <= p33) AND (1 <= p72)) OR ((1 <= p32) AND (1 <= p75)) OR ((1 <= p24) AND (1 <= p68)) OR ((1 <= p22) AND (1 <= p66)) OR ((1 <= p27) AND (1 <= p73)) OR ((1 <= p19) AND (1 <= p65)) OR ((1 <= p40) AND (1 <= p84)) OR ((1 <= p36) AND (1 <= p71)) OR ((1 <= p28) AND (1 <= p64)) OR ((1 <= p26) AND (1 <= p62)) OR ((1 <= p30) AND (1 <= p69)) OR ((1 <= p37) AND (1 <= p57)) OR ((1 <= p34) AND (1 <= p82)) OR ((1 <= p31) AND (1 <= p74)) OR ((1 <= p39) AND (1 <= p81)) OR ((1 <= p29) AND (1 <= p76)) OR ((1 <= p21) AND (1 <= p67)) OR ((1 <= p35) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p63)) OR ((1 <= p23) AND (1 <= p61)) OR ((1 <= p33) AND (1 <= p72)) OR ((1 <= p32) AND (1 <= p75)) OR ((1 <= p24) AND (1 <= p68)) OR ((1 <= p22) AND (1 <= p66)) OR ((1 <= p27) AND (1 <= p73)) OR ((1 <= p19) AND (1 <= p65)) OR ((1 <= p40) AND (1 <= p84)) OR ((1 <= p36) AND (1 <= p71)) OR ((1 <= p28) AND (1 <= p64)) OR ((1 <= p26) AND (1 <= p62)) OR ((1 <= p30) AND (1 <= p69)))))) AND (((NOT(A (G ((((1 <= p37) AND (1 <= p57)) OR ((1 <= p34) AND (1 <= p82)) OR ((1 <= p31) AND (1 <= p74)) OR ((1 <= p39) AND (1 <= p81)) OR ((1 <= p29) AND (1 <= p76)) OR ((1 <= p21) AND (1 <= p67)) OR ((1 <= p35) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p63)) OR ((1 <= p23) AND (1 <= p61)) OR ((1 <= p33) AND (1 <= p72)) OR ((1 <= p32) AND (1 <= p75)) OR ((1 <= p24) AND (1 <= p68)) OR ((1 <= p22) AND (1 <= p66)) OR ((1 <= p27) AND (1 <= p73)) OR ((1 <= p19) AND (1 <= p65)) OR ((1 <= p40) AND (1 <= p84)) OR ((1 <= p36) AND (1 <= p71)) OR ((1 <= p28) AND (1 <= p64)) OR ((1 <= p26) AND (1 <= p62)) OR ((1 <= p30) AND (1 <= p69)))))) OR (((p5 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p28 <= 0)) AND ((p16 <= 0) OR (p36 <= 0)) AND ((p3 <= 0) OR (p21 <= 0)) AND ((p18 <= 0) OR (p34 <= 0)) AND ((p2 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p0 <= 0) OR (p37 <= 0)) AND ((p9 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p24 <= 0)) AND ((p20 <= 0) OR (p40 <= 0)) AND ((p1 <= 0) OR (p19 <= 0)) AND ((p14 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p29 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p15 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND ((p13 <= 0) OR (p35 <= 0)) AND ((p17 <= 0) OR (p39 <= 0)))) OR (((p5 <= 0) OR (p26 <= 0)) AND ((p3 <= 0) OR (p24 <= 0)) AND ((p8 <= 0) OR (p27 <= 0)) AND ((p2 <= 0) OR (p21 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p16 <= 0) OR (p33 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p22 <= 0)) AND ((p12 <= 0) OR (p30 <= 0)) AND ((p4 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p20 <= 0) OR (p37 <= 0)) AND ((p15 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p29 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p36 <= 0)) AND ((p17 <= 0) OR (p40 <= 0)) AND ((p9 <= 0) OR (p31 <= 0)))) OR ((p97 <= 0) AND (p96 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p77 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p85 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0))))) : E ((E (F ((((1 <= p37) AND (1 <= p57)) OR ((1 <= p34) AND (1 <= p82)) OR ((1 <= p31) AND (1 <= p74)) OR ((1 <= p39) AND (1 <= p81)) OR ((1 <= p29) AND (1 <= p76)) OR ((1 <= p21) AND (1 <= p67)) OR ((1 <= p35) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p63)) OR ((1 <= p23) AND (1 <= p61)) OR ((1 <= p33) AND (1 <= p72)) OR ((1 <= p32) AND (1 <= p75)) OR ((1 <= p24) AND (1 <= p68)) OR ((1 <= p22) AND (1 <= p66)) OR ((1 <= p27) AND (1 <= p73)) OR ((1 <= p19) AND (1 <= p65)) OR ((1 <= p40) AND (1 <= p84)) OR ((1 <= p36) AND (1 <= p71)) OR ((1 <= p28) AND (1 <= p64)) OR ((1 <= p26) AND (1 <= p62)) OR ((1 <= p30) AND (1 <= p69)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p35)) OR ((1 <= p17) AND (1 <= p39))))) U ((((((((((((((((((((A (X (((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94)))) AND ((p5 <= 0) OR (p23 <= 0))) AND ((p8 <= 0) OR (p28 <= 0))) AND ((p16 <= 0) OR (p36 <= 0))) AND ((p3 <= 0) OR (p21 <= 0))) AND ((p18 <= 0) OR (p34 <= 0))) AND ((p2 <= 0) OR (p22 <= 0))) AND ((p6 <= 0) OR (p26 <= 0))) AND ((p10 <= 0) OR (p31 <= 0))) AND ((p0 <= 0) OR (p37 <= 0))) AND ((p9 <= 0) OR (p27 <= 0))) AND ((p4 <= 0) OR (p24 <= 0))) AND ((p20 <= 0) OR (p40 <= 0))) AND ((p1 <= 0) OR (p19 <= 0))) AND ((p14 <= 0) OR (p30 <= 0))) AND ((p12 <= 0) OR (p29 <= 0))) AND ((p7 <= 0) OR (p25 <= 0))) AND ((p15 <= 0) OR (p33 <= 0))) AND ((p11 <= 0) OR (p32 <= 0))) AND ((p13 <= 0) OR (p35 <= 0))) AND ((p17 <= 0) OR (p39 <= 0))))) : (E (F ((A (X (((1 <= p18) AND (1 <= p34)))) AND ((1 <= p86) OR (p29 <= 0) OR (p50 <= 0))))) OR (A (X (((p3 <= 0) OR (p24 <= 0)))) AND A (G ((((1 <= p7) AND (1 <= p28)) OR (1 <= p79)))))) : E (X ((E (((1 <= p99) U ((1 <= p39) AND (1 <= p60)))) AND NOT(E (F (((1 <= p33) AND (1 <= p72)))))))) : (NOT(E (F (((1 <= p99) AND (1 <= p28) AND (1 <= p64) AND (1 <= p33) AND (1 <= p72))))) AND A (F (((1 <= p16) AND (1 <= p33))))) : E (F (A (G (E (F (((1 <= p30) AND (1 <= p49)))))))) : A (G (A (F ((((p31 <= 0) OR (p52 <= 0)) AND ((p19 <= 0) OR (p38 <= 0))))))) : E (((1 <= p99) U (E (G (((1 <= p20) AND (1 <= p37)))) OR ((1 <= p24) AND (1 <= p68) AND (1 <= p31) AND (1 <= p52))))) : E (F (A (X ((1 <= p91))))) : A (G (A (F (((((1 <= p31) AND (1 <= p74)) OR ((1 <= p20) AND (1 <= p40))) AND (((1 <= p7) AND (1 <= p28)) OR ((1 <= p23) AND (1 <= p61))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: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: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: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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((((1 <= p5) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p22)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p6) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((((1 <= p5) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p22)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p6) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((((1 <= p5) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p1) AND (1 <= p22)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p6) AND (1 ... (shortened)
lola: processed formula length: 1265
lola: 225 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((((p37 <= 0) OR (p57 <= 0)) AND ((p34 <= 0) OR (p82 <= 0)) AND ((p31 <= 0) OR (p74 <= 0)) AND ((p39 <= 0) OR (p81 <= 0)) AND ((p29 <= 0) OR (p76 <= 0)) AND ((p21 <= 0) OR (p67 <= 0)) AND ((p35 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p63 <= 0)) AND ((p23 <= 0) OR (p61 <= 0)) AND ((p33 <= 0) OR (p72 <= 0)) AND ((p32 <= 0) OR (p75 <= 0)) AND ((p24 <= 0) OR (p68 <= 0)) AND ((p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((1 <= p37) AND (1 <= p57)) OR ((1 <= p34) AND (1 <= p82)) OR ((1 <= p31) AND (1 <= p74)) OR ((1 <= p39) AND (1 <= p81)) OR ((1 <= p29) AND (1 <= p76)) OR ((1 <= p21) AND (1 <= p67)) OR ((1 <= p35) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p63)) OR ((1 <= p23) AND (1 <= p61)) OR ((1 <= p33) AND (1 <= p72)) OR ((1 <= p32) AND (1 <= p75)) OR ((1 <= p24) AND (1 <= p68)) OR ((1 <= p22) AND... (shortened)
lola: processed formula length: 637
lola: 227 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: formula 0: (((p37 <= 0) OR (p57 <= 0)) AND ((p34 <= 0) OR (p82 <= 0)) AND ((p31 <= 0) OR (p74 <= 0)) AND ((p39 <= 0) OR (p81 <= 0)) AND ((p29 <= 0) OR (p76 <= 0)) AND ((p21 <= 0) OR (p67 <= 0)) AND ((p35 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p63 <= 0)) AND ((p23 <= 0) OR (p61 <= 0)) AND ((p33 <= 0) OR (p72 <= 0)) AND ((p32 <= 0) OR (p75 <= 0)) AND ((p24 <= 0) OR (p68 <= 0)) AND ((p22 <= 0) OR (p66 <= 0)) AND ((p27 <= 0) OR (p73 <= 0)) AND ((p19 <= 0) OR (p65 <= 0)) AND ((p40 <= 0) OR (p84 <= 0)) AND ((p36 <= 0) OR (p71 <= 0)) AND ((p28 <= 0) OR (p64 <= 0)) AND ((p26 <= 0) OR (p62 <= 0)) AND ((p30 <= 0) OR (p69 <= 0)))
lola: The predicate does not eventually occur from all successors.
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR ((1 <= p5) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p27)) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p37 <= 0) OR (p57 <= 0)) AND ((p34 <= 0) OR (p82 <= 0)) AND ((p31 <= 0) OR (p74 <= 0)) AND ((p39 <= 0) OR (p81 <= 0)) AND ((p29 <= 0) OR (p76 <= 0)) AND ((p21 <= 0) OR (p67 <= 0)) AND ((p35 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p63 <= 0)) AND ((p23 <= 0) OR (p61 <= 0)) AND ((p33 <= 0) OR (p72 <= 0)) AND ((p32 <= 0) OR (p75 <= 0)) AND ((p24 <= 0) OR (p68 <= 0)) AND ((p22 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((p37 <= 0) OR (p57 <= 0)) AND ((p34 <= 0) OR (p82 <= 0)) AND ((p31 <= 0) OR (p74 <= 0)) AND ((p39 <= 0) OR (p81 <= 0)) AND ((p29 <= 0) OR (p76 <= 0)) AND ((p21 <= 0) OR (p67 <= 0)) AND ((p35 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p63 <= 0)) AND ((p23 <= 0) OR (p61 <= 0)) AND ((p33 <= 0) OR (p72 <= 0)) AND ((p32 <= 0) OR (p75 <= 0)) AND ((p24 <= 0) OR (p68 <= 0)) AND ((p22 <= ... (shortened)
lola: processed formula length: 645
lola: 225 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p37 <= 0) OR (p57 <= 0)) AND ((p34 <= 0) OR (p82 <= 0)) AND ((p31 <= 0) OR (p74 <= 0)) AND ((p39 <= 0) OR (p81 <= 0)) AND ((p29 <= 0) OR (p76 <= 0)) AND ((p21 <= 0) OR (p67 <= 0)) AND ((p35 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p63 <= 0)) AND ((p23 <= 0) OR (p61 <= 0)) AND ((p33 <= 0) OR (p72 <= 0)) AND ((p32 <= 0) OR (p75 <= 0)) AND ((p24 <= 0) OR (p68 <= 0)) AND ((p22 <= 0) OR (p66 <= 0)) AND ((p27 <= 0) OR (p73 <= 0)) AND ((p19 <= 0) OR (p65 <= 0)) AND ((p40 <= 0) OR (p84 <= 0)) AND ((p36 <= 0) OR (p71 <= 0)) AND ((p28 <= 0) OR (p64 <= 0)) AND ((p26 <= 0) OR (p62 <= 0)) AND ((p30 <= 0) OR (p69 <= 0)))
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR ((1 <= p5) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p27)) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR ((1 <= p5) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p27)) OR ... (shortened)
lola: processed formula length: 935
lola: 226 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: formula 0: ((p97 <= 0) AND (p96 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p77 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p85 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0) AND ((p5 <= 0) OR (p26 <= 0)) AND ((p3 <= 0) OR (p24 <= 0)) AND ((p8 <= 0) OR (p27 <= 0)) AND ((p2 <= 0) OR (p21 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p16 <= 0) OR (p33 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p1 <= 0) OR (p22 <= 0)) AND ((p12 <= 0) OR (p30 <= 0)) AND ((p4 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p20 <= 0) OR (p37 <= 0)) AND ((p15 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p29 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p36 <= 0)) AND ((p17 <= 0) OR (p40 <= 0)) AND ((p9 <= 0) OR (p31 <= 0)))
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p37 <= 0) OR (p57 <= 0)) AND ((p34 <= 0) OR (p82 <= 0)) AND ((p31 <= 0) OR (p74 <= 0)) AND ((p39 <= 0) OR (p81 <= 0)) AND ((p29 <= 0) OR (p76 <= 0)) AND ((p21 <= 0) OR (p67 <= 0)) AND ((p35 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p63 <= 0)) AND ((p23 <= 0) OR (p61 <= 0)) AND ((p33 <= 0) OR (p72 <= 0)) AND ((p32 <= 0) OR (p75 <= 0)) AND ((p24 <= 0) OR (p68 <= 0)) AND ((p22 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((p37 <= 0) OR (p57 <= 0)) AND ((p34 <= 0) OR (p82 <= 0)) AND ((p31 <= 0) OR (p74 <= 0)) AND ((p39 <= 0) OR (p81 <= 0)) AND ((p29 <= 0) OR (p76 <= 0)) AND ((p21 <= 0) OR (p67 <= 0)) AND ((p35 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p63 <= 0)) AND ((p23 <= 0) OR (p61 <= 0)) AND ((p33 <= 0) OR (p72 <= 0)) AND ((p32 <= 0) OR (p75 <= 0)) AND ((p24 <= 0) OR (p68 <= 0)) AND ((p22 <= 0) ... (shortened)
lola: processed formula length: 1281
lola: 225 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((((1 <= p37) AND (1 <= p57)) OR ((1 <= p34) AND (1 <= p82)) OR ((1 <= p31) AND (1 <= p74)) OR ((1 <= p39) AND (1 <= p81)) OR ((1 <= p29) AND (1 <= p76)) OR ((1 <= p21) AND (1 <= p67)) OR ((1 <= p35) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p63)) OR ((1 <= p23) AND (1 <= p61)) OR ((1 <= p33) AND (1 <= p72)) OR ((1 <= p32) AND (1 <= p75)) OR ((1 <= p24) AND (1 <= p68)) OR ((1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((((1 <= p37) AND (1 <= p57)) OR ((1 <= p34) AND (1 <= p82)) OR ((1 <= p31) AND (1 <= p74)) OR ((1 <= p39) AND (1 <= p81)) OR ((1 <= p29) AND (1 <= p76)) OR ((1 <= p21) AND (1 <= p67)) OR ((1 <= p35) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p63)) OR ((1 <= p23) AND (1 <= p61)) OR ((1 <= p33) AND (1 <= p72)) OR ((1 <= p32) AND (1 <= p75)) OR ((1 <= p24) AND (1 <= p68)) OR ((1 <= p22... (shortened)
lola: processed formula length: 2248
lola: 227 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 639356 markings, 3131145 edges, 127871 markings/sec, 0 secs
lola: 1284499 markings, 6360022 edges, 129029 markings/sec, 5 secs
lola: 1898341 markings, 9530807 edges, 122768 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2292975 markings, 11595013 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((A (X (((1 <= p18) AND (1 <= p34)))) AND ((1 <= p86) OR (p29 <= 0) OR (p50 <= 0))))) OR (A (X (((p3 <= 0) OR (p24 <= 0)))) AND A (G ((((1 <= p7) AND (1 <= p28)) OR (1 <= p79))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p7) AND (1 <= p28)) OR (1 <= p79))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((1 <= p7) AND (1 <= p28)) OR (1 <= p79))))
lola: processed formula length: 51
lola: 226 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (((1 <= p18) AND (1 <= p34)))) AND ((1 <= p86) OR (p29 <= 0) OR (p50 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX(((1 <= p18) AND (1 <= p34))) AND ((1 <= p86) OR (p29 <= 0) OR (p50 <= 0))))
lola: processed formula length: 84
lola: 226 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 962271 markings, 3769319 edges, 192454 markings/sec, 0 secs
lola: 1688284 markings, 6745273 edges, 145203 markings/sec, 5 secs
lola: 2409284 markings, 9795442 edges, 144200 markings/sec, 10 secs
lola: 3092051 markings, 12722366 edges, 136553 markings/sec, 15 secs
lola: 3779270 markings, 15697913 edges, 137444 markings/sec, 20 secs
lola: 4473611 markings, 18710853 edges, 138868 markings/sec, 25 secs
lola: 5116984 markings, 21541704 edges, 128675 markings/sec, 30 secs
lola: 5848445 markings, 24679870 edges, 146292 markings/sec, 35 secs
lola: 6539622 markings, 27730919 edges, 138235 markings/sec, 40 secs
lola: 7249542 markings, 30720616 edges, 141984 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7249542 markings, 30720616 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((E (((1 <= p99) U ((1 <= p39) AND (1 <= p60)))) AND A (G (((p33 <= 0) OR (p72 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((E((1 <= p99) U ((1 <= p39) AND (1 <= p60))) AND AG(((p33 <= 0) OR (p72 <= 0)))))
lola: processed formula length: 85
lola: 227 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 21810 markings, 70014 edges
lola: ========================================
lola: subprocess 5 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= p91)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((1 <= p91)))
lola: processed formula length: 18
lola: 226 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1038371 markings, 4073011 edges, 207674 markings/sec, 0 secs
lola: 1799940 markings, 7212965 edges, 152314 markings/sec, 5 secs
lola: 2492176 markings, 10148597 edges, 138447 markings/sec, 10 secs
lola: 3141711 markings, 12937266 edges, 129907 markings/sec, 15 secs
lola: 3793033 markings, 15758799 edges, 130264 markings/sec, 20 secs
lola: 4462226 markings, 18660501 edges, 133839 markings/sec, 25 secs
lola: 5117780 markings, 21545016 edges, 131111 markings/sec, 30 secs
lola: 5804485 markings, 24483852 edges, 137341 markings/sec, 35 secs
lola: 6435312 markings, 27265141 edges, 126165 markings/sec, 40 secs
lola: 7137527 markings, 30248967 edges, 140443 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7249542 markings, 30720616 edges
lola: ========================================
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1... (shortened)
lola: processed formula length: 635
lola: 226 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 7 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (E (F (((1 <= p30) AND (1 <= p49))))))))
lola: ========================================
lola: SUBTASK
lola: checking possible liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:588
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:742
lola: processed formula: ((1 <= p30) AND (1 <= p49))
lola: processed formula length: 27
lola: 227 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p30 <= 0) OR (p49 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p30) AND (1 <= p49))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-1.sara
sara: try reading problem file CTLFireability-7-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-1.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2100888 markings, 3988633 edges, 420178 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4145762 markings, 8029463 edges, 408975 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 6088631 markings, 11917634 edges, 388574 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 7975801 markings, 15729770 edges, 377434 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 9803632 markings, 19457587 edges, 365566 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 11601134 markings, 23130187 edges, 359500 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 13375485 markings, 26754238 edges, 354870 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 15147027 markings, 30397913 edges, 354308 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 16556771 markings, 33295733 edges, 281949 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 17978167 markings, 36227256 edges, 284279 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 19374099 markings, 39102615 edges, 279186 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 20744849 markings, 41953070 edges, 274150 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 22117597 markings, 44809426 edges, 274550 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 23507792 markings, 47698279 edges, 278039 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 24897315 markings, 50583217 edges, 277905 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 26180636 markings, 53260861 edges, 256664 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 27523101 markings, 56047215 edges, 268493 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 28902198 markings, 58929565 edges, 275819 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 30275073 markings, 61786845 edges, 274575 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 31629404 markings, 64621529 edges, 270866 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 33034989 markings, 67554914 edges, 281117 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 34446813 markings, 70512227 edges, 282365 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 35809611 markings, 73374604 edges, 272560 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 37166256 markings, 76228185 edges, 271329 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 38567477 markings, 79170206 edges, 280244 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 39907050 markings, 81989450 edges, 267915 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 41289680 markings, 84903482 edges, 276526 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 42631422 markings, 87731980 edges, 268348 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 44045378 markings, 90698844 edges, 282791 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 45445727 markings, 93637675 edges, 280070 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 46852420 markings, 96610827 edges, 281339 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 48251417 markings, 99578064 edges, 279799 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 49729455 markings, 102704060 edges, 295608 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 51208073 markings, 105812430 edges, 295724 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 52615289 markings, 108788198 edges, 281443 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 53992552 markings, 111710650 edges, 275453 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 55464797 markings, 114836412 edges, 294449 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 56839510 markings, 117745323 edges, 274943 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 58321401 markings, 120885133 edges, 296378 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 59902191 markings, 124234408 edges, 316158 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 61423707 markings, 127457214 edges, 304303 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 62902555 markings, 130595066 edges, 295770 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 64438190 markings, 133848400 edges, 307127 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 65955973 markings, 137075933 edges, 303557 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 67444336 markings, 140240396 edges, 297673 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 68977110 markings, 143511592 edges, 306555 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 70584956 markings, 146928953 edges, 321569 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 72189087 markings, 150342348 edges, 320826 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 73784568 markings, 153745215 edges, 319096 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 75384802 markings, 157152518 edges, 320047 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 76980784 markings, 160551569 edges, 319196 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 78580498 markings, 163962074 edges, 319943 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 80161163 markings, 167348872 edges, 316133 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 81741077 markings, 170714373 edges, 315983 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 83339460 markings, 174115828 edges, 319677 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 84930240 markings, 177506238 edges, 318156 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 86507271 markings, 180888152 edges, 315406 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 88071086 markings, 184243441 edges, 312763 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 89635089 markings, 187594548 edges, 312801 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 91196338 markings, 190944797 edges, 312250 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 92755767 markings, 194279991 edges, 311886 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 94313838 markings, 197625366 edges, 311614 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 95866447 markings, 200955193 edges, 310522 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 97422718 markings, 204290049 edges, 311254 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 98972459 markings, 207617566 edges, 309948 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 100535564 markings, 210965883 edges, 312621 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 102075034 markings, 214290242 edges, 307894 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 103616804 markings, 217594115 edges, 308354 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 105154163 markings, 220901513 edges, 307472 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 106719468 markings, 224244661 edges, 313061 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 108256503 markings, 227560032 edges, 307407 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 109789436 markings, 230867325 edges, 306587 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 111340316 markings, 234200625 edges, 310176 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 112877218 markings, 237526155 edges, 307380 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 114444911 markings, 240901412 edges, 313539 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 116045880 markings, 244345537 edges, 320194 markings/sec, 375 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no unknown unknown unknown unknown no yes yes no unknown unknown unknown unknown yes unknown
lola: memory consumption: 13245392 KB
lola: time consumption: 511 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((((p31 <= 0) OR (p52 <= 0)) AND ((p19 <= 0) OR (p38 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p31) AND (1 <= p52)) OR ((1 <= p19) AND (1 <= p38)))
lola: processed formula length: 61
lola: 228 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: state equation task get result started, id 0
lola: The predicate does not eventually occur from all states.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((((1 <= p31) AND (1 <= p74)) OR ((1 <= p20) AND (1 <= p40))) AND (((1 <= p7) AND (1 <= p28)) OR ((1 <= p23) AND (1 <= p61))))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((((p31 <= 0) OR (p74 <= 0)) AND ((p20 <= 0) OR (p40 <= 0))) OR (((p7 <= 0) OR (p28 <= 0)) AND ((p23 <= 0) OR (p61 <= 0))))
lola: processed formula length: 128
lola: 228 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 10 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p97 <= 0) AND (p96 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p77 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p85 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0))
lola: processed formula length: 297
lola: 227 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: formula 0: ((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94))
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 21 markings, 20 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 20 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <... (shortened)
lola: processed formula length: 2542
lola: 226 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1143898 markings, 4496890 edges, 228780 markings/sec, 0 secs
lola: 2132653 markings, 8625991 edges, 197751 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2292975 markings, 9302040 edges
lola: ========================================
lola: subprocess 12 will run for 761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p99 <= 0) OR (p28 <= 0) OR (p64 <= 0) OR (p33 <= 0) OR (p72 <= 0)))) AND A (F (((1 <= p16) AND (1 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p16) AND (1 <= p33))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p16 <= 0) OR (p33 <= 0))
lola: processed formula length: 27
lola: 227 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p16) AND (1 <= p33))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 1015 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p99 <= 0) OR (p28 <= 0) OR (p64 <= 0) OR (p33 <= 0) OR (p72 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p99 <= 0) OR (p28 <= 0) OR (p64 <= 0) OR (p33 <= 0) OR (p72 <= 0))))
lola: processed formula length: 80
lola: 226 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: formula 0: ((1 <= p99) AND (1 <= p28) AND (1 <= p64) AND (1 <= p33) AND (1 <= p72))
lola: state equation task get result unparse finished id 0
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1015 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= p99) U (E (G (((1 <= p20) AND (1 <= p37)))) OR ((1 <= p24) AND (1 <= p68) AND (1 <= p31) AND (1 <= p52)))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p99 <= 0) R (F (((p20 <= 0) OR (p37 <= 0))) AND ((p24 <= 0) OR (p68 <= 0) OR (p31 <= 0) OR (p52 <= 0))))
lola: processed formula length: 110
lola: 235 rewrites
lola: closed formula file CTLFireability.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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 14 will run for 1523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G (((p97 <= 0) AND (p96 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p77 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p85 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0)))) R ((p97 <= 0) AND (p96 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p77 <= 0) AND (p79 <= 0) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <= p78) OR (1 <= p80) OR (1 <= p83) OR (1 <= p85) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94))) U ((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p77) OR (1 <= p79) OR (1 <... (shortened)
lola: processed formula length: 603
lola: 233 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 59 markings, 59 edges
lola: ========================================
lola: subprocess 15 will run for 3047 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((((p37 <= 0) OR (p58 <= 0)) AND ((p29 <= 0) OR (p50 <= 0)) AND ((p34 <= 0) OR (p53 <= 0)) AND ((p24 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p51 <= 0)) AND ((p36 <= 0) OR (p55 <= 0)) AND ((p22 <= 0) OR (p43 <= 0)) AND ((p28 <= 0) OR (p46 <= 0)) AND ((p40 <= 0) OR (p59 <= 0)) AND ((p26 <= 0) OR (p48 <= 0)) AND ((p33 <= 0) OR (p54 <= 0)) AND ((p30 <= 0) OR (p49 <= 0)) AND ((p19 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3047 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p1... (shortened)
lola: processed formula length: 627
lola: 224 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 40 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (E (F (((1 <= p30) AND (1 <= p49))))))))
lola: ========================================
lola: SUBTASK
lola: checking possible liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:588
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:742
lola: processed formula: ((1 <= p30) AND (1 <= p49))
lola: processed formula length: 27
lola: 227 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p30 <= 0) OR (p49 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p30) AND (1 <= p49))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-16-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-16-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-16-0.sara.
sara: try reading problem file CTLFireability-16-1.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1920276 markings, 3637571 edges, 384055 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3686842 markings, 7117150 edges, 353313 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 5371094 markings, 10475607 edges, 336850 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 7020295 markings, 13796977 edges, 329840 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 8624659 markings, 17048365 edges, 320873 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 10202070 markings, 20266296 edges, 315482 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 11837026 markings, 23610170 edges, 326991 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 13553871 markings, 27123280 edges, 343369 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 15247828 markings, 30600165 edges, 338791 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 16925007 markings, 34055142 edges, 335436 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 18600378 markings, 37512741 edges, 335074 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 20276225 markings, 40977034 edges, 335169 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 21936172 markings, 44430021 edges, 331989 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 23593074 markings, 47874332 edges, 331380 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 25246362 markings, 51305107 edges, 330658 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 26898939 markings, 54748869 edges, 330515 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 28551952 markings, 58200695 edges, 330603 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 30216723 markings, 61668184 edges, 332954 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 31866537 markings, 65121224 edges, 329963 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 33471190 markings, 68469476 edges, 320931 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 35082048 markings, 71841982 edges, 322172 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 36768487 markings, 75392098 edges, 337288 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 38490369 markings, 79004537 edges, 344376 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 40106994 markings, 82412246 edges, 323325 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 41724084 markings, 85821161 edges, 323418 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 43404389 markings, 89354211 edges, 336061 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 45113188 markings, 92942655 edges, 341760 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 46810003 markings, 96521044 edges, 339363 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 48505377 markings, 100119056 edges, 339075 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 50214284 markings, 103719434 edges, 341781 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 51911208 markings, 107300515 edges, 339385 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 53603173 markings, 110886541 edges, 338393 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 55283837 markings, 114448133 edges, 336133 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 56970455 markings, 118022911 edges, 337324 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 58658787 markings, 121596908 edges, 337666 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 60353870 markings, 125186449 edges, 339017 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 62071797 markings, 128825705 edges, 343585 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 63787582 markings, 132471175 edges, 343157 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 65508112 markings, 136114774 edges, 344106 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 67192279 markings, 139699755 edges, 336833 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 68887988 markings, 143320814 edges, 339142 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 70596539 markings, 146954077 edges, 341710 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 72295895 markings, 150571089 edges, 339871 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 73984601 markings, 154170194 edges, 337741 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 75691586 markings, 157804224 edges, 341397 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 77376330 markings, 161397463 edges, 336949 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 79068070 markings, 165006317 edges, 338348 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 80725213 markings, 168555031 edges, 331429 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 82419483 markings, 172156281 edges, 338854 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 84109901 markings, 175752848 edges, 338084 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 85788929 markings, 179352226 edges, 335806 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 87482174 markings, 182981337 edges, 338649 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 89190794 markings, 186641206 edges, 341724 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 90908360 markings, 190323360 edges, 343513 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 92642576 markings, 194038162 edges, 346843 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 94356618 markings, 197716363 edges, 342808 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 96072452 markings, 201401271 edges, 343167 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 97807909 markings, 205117845 edges, 347091 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 99530444 markings, 208807426 edges, 344507 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 101250060 markings, 212503793 edges, 343923 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 102946734 markings, 216159405 edges, 339335 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 104644444 markings, 219812925 edges, 339542 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 106351867 markings, 223458412 edges, 341485 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 108047512 markings, 227108112 edges, 339129 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 109733727 markings, 230745838 edges, 337243 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 111424529 markings, 234385753 edges, 338160 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 113104430 markings, 238017504 edges, 335980 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 114783628 markings, 241631742 edges, 335840 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 116476029 markings, 245272380 edges, 338480 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 118157582 markings, 248899234 edges, 336311 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 119835046 markings, 252515792 edges, 335493 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 121505021 markings, 256116744 edges, 333995 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 123182288 markings, 259721399 edges, 335453 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 124835062 markings, 263294108 edges, 330555 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 126494531 markings, 266877082 edges, 331894 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 128143749 markings, 270445100 edges, 329844 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 129773001 markings, 273970911 edges, 325850 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 131409823 markings, 277498638 edges, 327364 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 133032124 markings, 281018225 edges, 324460 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 134668012 markings, 284554503 edges, 327178 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 136306361 markings, 288090431 edges, 327670 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 137954034 markings, 291645167 edges, 329535 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 139608663 markings, 295215863 edges, 330926 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 141260273 markings, 298790839 edges, 330322 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 142506572 markings, 301480317 edges, 249260 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 143735381 markings, 304143331 edges, 245762 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 144912268 markings, 306687970 edges, 235377 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 146069697 markings, 309194927 edges, 231486 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 147188369 markings, 311620561 edges, 223734 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 148070115 markings, 313521033 edges, 176349 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 149125556 markings, 315816573 edges, 211088 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 150571024 markings, 318950750 edges, 289094 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 151740241 markings, 321499678 edges, 233843 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 153244418 markings, 324767123 edges, 300835 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 154495713 markings, 327492515 edges, 250259 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 155659435 markings, 330010390 edges, 232744 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 157105184 markings, 333148650 edges, 289150 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 158588159 markings, 336380991 edges, 296595 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 160075776 markings, 339605407 edges, 297523 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 161561195 markings, 342840750 edges, 297084 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 162992965 markings, 345944539 edges, 286354 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 164265621 markings, 348697117 edges, 254531 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 165428017 markings, 351224627 edges, 232479 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 166548330 markings, 353651401 edges, 224063 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 167698665 markings, 356143047 edges, 230067 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 168426083 markings, 357724230 edges, 145484 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 169535189 markings, 360139602 edges, 221821 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 170389521 markings, 361992545 edges, 170866 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 171478007 markings, 364361266 edges, 217697 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 172576601 markings, 366751855 edges, 219719 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 173684395 markings, 369167628 edges, 221559 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 174762427 markings, 371503567 edges, 215606 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 175811606 markings, 373795434 edges, 209836 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 176678923 markings, 375687512 edges, 173463 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 178031469 markings, 378635959 edges, 270509 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 179442508 markings, 381725605 edges, 282208 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 180886754 markings, 384869689 edges, 288849 markings/sec, 580 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G ((((((p37 <= 0) OR (p58 <= 0)) AND ((p29 <= 0) OR (p50 <= 0)) AND ((p34 <= 0) OR (p53 <= 0)) AND ((p24 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p51 <= 0)) AND ((p36 <= 0) OR (p55 <= 0)) AND ((p22 <= 0) OR (p43 <= 0)) AND ((p28 <= 0) OR (p46 <= 0)) AND ((p40 <= 0) OR (p59 <= 0)) AND ((p26 <= 0) OR (p48 <= 0)) AND ((p33 <= 0) OR (p54 <= 0)) AND ((p30 <= 0) OR (p49 <= 0)) AND ((p19 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p5) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p28)) OR ((1 <= p16) AND (1 <= p36)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p34)) OR ((1 <= p2) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p37)) OR ((1 <= p9) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p40)) OR ((1 <= p1) AND (1 <= p1... (shortened)
lola: processed formula length: 627
lola: 224 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 40 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((((((p37 <= 0) OR (p58 <= 0)) AND ((p29 <= 0) OR (p50 <= 0)) AND ((p34 <= 0) OR (p53 <= 0)) AND ((p24 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p51 <= 0)) AND ((p36 <= 0) OR (p55 <= 0)) AND ((p22 <= 0) OR (p43 <= 0)) AND ((p28 <= 0) OR (p46 <= 0)) AND ((p40 <= 0) OR (p59 <= 0)) AND ((p26 <= 0) OR (p48 <= 0)) AND ((p33 <= 0) OR (p54 <= 0)) AND ((p30 <= 0) OR (p49 <= 0)) AND ((p19 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((((p37 <= 0) OR (p58 <= 0)) AND ((p29 <= 0) OR (p50 <= 0)) AND ((p34 <= 0) OR (p53 <= 0)) AND ((p24 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p51 <= 0)) AND ((p36 <= 0) OR (p55 <= 0)) AND ((p22 <= 0) OR (p43 <= 0)) AND ((p28 <= 0) OR (p46 <= 0)) AND ((p40 <= 0) OR (p59 <= 0)) AND ((p26 <= 0) OR (p48 <= 0)) AND ((p33 <= 0) OR (p54 <= 0)) AND ((p30 <= 0) OR (p49 <= 0)) AND ((p19 <= 0... (shortened)
lola: processed formula length: 1880
lola: 226 rewrites
lola: closed formula file CTLFireability.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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 507392 markings, 1942083 edges, 101478 markings/sec, 0 secs
lola: 1173540 markings, 4622717 edges, 133230 markings/sec, 5 secs
lola: 1735496 markings, 6939763 edges, 112391 markings/sec, 10 secs
lola: 2325742 markings, 9443272 edges, 118049 markings/sec, 15 secs
lola: 2928882 markings, 12019688 edges, 120628 markings/sec, 20 secs
lola: 3521369 markings, 14569001 edges, 118497 markings/sec, 25 secs
lola: 4058030 markings, 16888374 edges, 107332 markings/sec, 30 secs
lola: 4610285 markings, 19313385 edges, 110451 markings/sec, 35 secs
lola: 5181691 markings, 21827947 edges, 114281 markings/sec, 40 secs
lola: 5719869 markings, 24132436 edges, 107636 markings/sec, 45 secs
lola: 6254401 markings, 26472524 edges, 106906 markings/sec, 50 secs
lola: 6820658 markings, 28865060 edges, 113251 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 7249558 markings, 30720636 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no yes yes no no unknown no yes yes no
lola:
preliminary result: no no yes no no no no yes yes no no unknown no yes yes no
lola: memory consumption: 4072 KB
lola: time consumption: 1179 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="Philosophers-PT-000020"
export BK_EXAMINATION="CTLFireability"
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 Philosophers-PT-000020, examination is CTLFireability"
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-158987871400124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;