fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r322-tall-162132128100266
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for UtilityControlRoom-PT-Z2T3N06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7688.735 3600000.00 1077486.00 8228.60 FFFTFFFTFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r322-tall-162132128100266.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is UtilityControlRoom-PT-Z2T3N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132128100266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 86K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 371K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 114K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 465K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 8.2K May 12 04:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K May 12 04:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K May 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 70K May 12 08:13 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 UtilityControlRoom-PT-Z2T3N06-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-15

=== Now, execution of the tool begins

BK_START 1621451427137

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 19:10:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 19:10:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:10:30] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2021-05-19 19:10:30] [INFO ] Transformed 106 places.
[2021-05-19 19:10:30] [INFO ] Transformed 162 transitions.
[2021-05-19 19:10:30] [INFO ] Parsed PT model containing 106 places and 162 transitions in 82 ms.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 316 steps, including 0 resets, run visited all 42 properties in 11 ms. (steps per millisecond=28 )
[2021-05-19 19:10:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 19:10:30] [INFO ] Flatten gal took : 59 ms
FORMULA UtilityControlRoom-PT-Z2T3N06-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:10:30] [INFO ] Flatten gal took : 16 ms
[2021-05-19 19:10:30] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2021-05-19 19:10:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ UtilityControlRoom-PT-Z2T3N06 @ 3570 seconds

FORMULA UtilityControlRoom-PT-Z2T3N06-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T3N06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2502
rslt: Output for LTLFireability @ UtilityControlRoom-PT-Z2T3N06

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X (X (X (G (((p81 <= 0) AND (p80 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0)))))))",
"processed_size": 107,
"rewrites": 158
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 1,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "(((1 <= p64) AND (1 <= p92)) OR ((1 <= p59) AND (1 <= p89)) OR ((1 <= p60) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p89)) OR ((1 <= p63) AND (1 <= p91)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p67) AND (1 <= p93)) OR ((1 <= p65) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p93)) OR ((1 <= p57) AND (1 <= p88)) OR ((1 <= p62) AND (1 <= p91)) OR ((1 <= p56) AND (1 <= p88)))",
"processed_size": 381,
"rewrites": 158
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 1,
"aneg": 1,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "(((p64 <= 0) OR (p92 <= 0)) AND ((p59 <= 0) OR (p89 <= 0)) AND ((p60 <= 0) OR (p90 <= 0)) AND ((p58 <= 0) OR (p89 <= 0)) AND ((p63 <= 0) OR (p91 <= 0)) AND ((p61 <= 0) OR (p90 <= 0)) AND ((p67 <= 0) OR (p93 <= 0)) AND ((p65 <= 0) OR (p92 <= 0)) AND ((p66 <= 0) OR (p93 <= 0)) AND ((p57 <= 0) OR (p88 <= 0)) AND ((p62 <= 0) OR (p91 <= 0)) AND ((p56 <= 0) OR (p88 <= 0)))",
"processed_size": 381,
"rewrites": 160
},
"result":
{
"edges": 68,
"markings": 57,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 42
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 24,
"adisj": 2,
"aneg": 0,
"comp": 78,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 78,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "G ((X ((((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)))) AND F (((1 <= p81) OR (1 <= p80) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78)))))",
"processed_size": 1203,
"rewrites": 158
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 24,
"adisj": 4,
"aneg": 3,
"comp": 96,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 96,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "F ((F (((p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0))) AND (G ((X (X ((((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p15 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p17 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p15 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p19 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p17 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p8 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p19 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p74 <= 0))))) OR ((p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0)))) AND ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31)))))",
"processed_size": 1488,
"rewrites": 158
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 0,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "(((1 <= p64) AND (1 <= p92)) OR ((1 <= p59) AND (1 <= p89)) OR ((1 <= p60) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p89)) OR ((1 <= p63) AND (1 <= p91)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p67) AND (1 <= p93)) OR ((1 <= p65) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p93)) OR ((1 <= p57) AND (1 <= p88)) OR ((1 <= p62) AND (1 <= p91)) OR ((1 <= p56) AND (1 <= p88)))",
"processed_size": 370,
"rewrites": 179
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 363
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X (X (F (((1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86))))))",
"processed_size": 103,
"rewrites": 158
},
"result":
{
"edges": 1152,
"markings": 963,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "X (G ((1 <= p71)))",
"processed_size": 18,
"rewrites": 158
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 466
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X (F ((1 <= p54))))",
"processed_size": 22,
"rewrites": 158
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 544
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F (((((1 <= p0) AND (1 <= p14) AND (1 <= p74)) U (1 <= p73)) OR (p7 <= 0))))",
"processed_size": 79,
"rewrites": 158
},
"result":
{
"edges": 12,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 653
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "G ((1 <= p76))",
"processed_size": 14,
"rewrites": 158
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 816
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p37 <= 0) U G ((X ((p7 <= 0)) OR (F (((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0))) OR (p7 <= 0)))))",
"processed_size": 97,
"rewrites": 158
},
"result":
{
"edges": 57515,
"markings": 30873,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 816
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (G ((p27 <= 0))) AND F (((p1 <= 0) OR (p17 <= 0) OR (p74 <= 0)))))",
"processed_size": 74,
"rewrites": 158
},
"result":
{
"edges": 85,
"markings": 72,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1089
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G ((1 <= p54)) AND (p84 <= 0))))",
"processed_size": 39,
"rewrites": 158
},
"result":
{
"edges": 41,
"markings": 41,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1633
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 24,
"adisj": 2,
"aneg": 2,
"comp": 84,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 84,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 27,
"visible_transitions": 0
},
"processed": "G ((G ((((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p15 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p17 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p15 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p19 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p17 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p8 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p19 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p74 <= 0)))) R ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0) AND (p31 <= 0))))",
"processed_size": 1287,
"rewrites": 158
},
"result":
{
"edges": 47,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3267
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))",
"processed_size": 81,
"rewrites": 158
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 4,
"aneg": 0,
"comp": 42,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 42,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "F ((F ((((1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) OR (G ((((1 <= p64) AND (1 <= p92)) OR ((1 <= p59) AND (1 <= p89)) OR ((1 <= p60) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p89)) OR ((1 <= p63) AND (1 <= p91)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p67) AND (1 <= p93)) OR ((1 <= p65) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p93)) OR ((1 <= p57) AND (1 <= p88)) OR ((1 <= p62) AND (1 <= p91)) OR ((1 <= p56) AND (1 <= p88)))) AND F (((1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))))) AND ((1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86))))",
"processed_size": 666,
"rewrites": 158
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 24,
"adisj": 1,
"aneg": 1,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p15 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p17 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p15 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p19 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p17 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p8 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p19 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p74 <= 0)))",
"processed_size": 1097,
"rewrites": 160
},
"result":
{
"edges": 198,
"markings": 70,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 66
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 24,
"adisj": 2,
"aneg": 0,
"comp": 78,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 78,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "(((1 <= p81) OR (1 <= p80) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78)) U (((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p74))))",
"processed_size": 1189,
"rewrites": 158
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 48,
"adisj": 2,
"aneg": 1,
"comp": 144,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 144,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G (F ((X ((((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p74)))) OR (((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p15 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p17 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p15 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p19 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p17 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p8 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p19 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p74 <= 0))))))",
"processed_size": 2212,
"rewrites": 158
},
"result":
{
"edges": 296313828,
"markings": 49808478,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))",
"processed_size": 81,
"rewrites": 158
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 1,
"aneg": 1,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G ((((p0 <= 0) OR (p10 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p17 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p19 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p15 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p74 <= 0))))",
"processed_size": 551,
"rewrites": 158
},
"result":
{
"edges": 40,
"markings": 40,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 165044,
"runtime": 1067.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(X(X(G(*))))) : (** OR (G((X(*) R *)) AND F(**))) : G((X(**) AND F(**))) : ((** U **) OR (G(F((X(**) OR *))) AND F(**))) : F((F(*) AND (G((X(X(*)) OR *)) AND **))) : (G(*) AND (F((F((** OR (G(**) AND F(**)))) AND **)) AND **)) : G((G(*) R *)) : (X(X(X(F(**)))) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))) : F(((X(**) U G((X(**) AND *))) AND G(**))) : X(G(**)) : X(X(F(**))) : X(F(((** U **) OR **))) : G(F((G(*) AND **))) : ((** U G((X(*) OR (F(*) OR **)))) OR (G(**) AND F(G((X(*) OR (F(*) OR **)))))) : X((X(G(*)) AND F(*)))"
},
"net":
{
"arcs": 414,
"conflict_clusters": 62,
"places": 106,
"places_significant": 91,
"singleton_clusters": 0,
"transitions": 138
},
"result":
{
"preliminary_value": "no no no yes no no no yes no no no no no no no ",
"value": "no no no yes no no no yes no no no no no no 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: 244/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3392
lola: finding significant places
lola: 106 places, 138 transitions, 91 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: X (G (X (G (X (NOT(X (F (((1 <= p81) OR (1 <= p80) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78)))))))))) : (G (NOT((X ((((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)))) U (((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)))))) U (((1 <= p64) AND (1 <= p92)) OR ((1 <= p59) AND (1 <= p89)) OR ((1 <= p60) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p89)) OR ((1 <= p63) AND (1 <= p91)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p67) AND (1 <= p93)) OR ((1 <= p65) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p93)) OR ((1 <= p57) AND (1 <= p88)) OR ((1 <= p62) AND (1 <= p91)) OR ((1 <= p56) AND (1 <= p88)))) : G ((X ((((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)))) AND F (((1 <= p81) OR (1 <= p80) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78))))) : (G (F (NOT(G ((NOT(X ((((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p74))))) AND (((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p74)))))))) U (((1 <= p81) OR (1 <= p80) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78)) U (((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p74))))) : F (((NOT(G (((1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86)))) AND NOT(F ((X (X ((((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p74))))) AND ((1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86)))))) AND ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31)))) : ((NOT(F ((((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74))))) AND F ((F ((G ((((1 <= p64) AND (1 <= p92)) OR ((1 <= p59) AND (1 <= p89)) OR ((1 <= p60) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p89)) OR ((1 <= p63) AND (1 <= p91)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p67) AND (1 <= p93)) OR ((1 <= p65) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p93)) OR ((1 <= p57) AND (1 <= p88)) OR ((1 <= p62) AND (1 <= p91)) OR ((1 <= p56) AND (1 <= p88)))) U ((1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))) AND ((1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86))))) AND ((1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))) : G (NOT((F (((G ((((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p74)))) AND X (G (((1 <= p81) OR (1 <= p80) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78))))) U (((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p15) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p74))))) U ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31))))) : ((((((((((((NOT(X (NOT(F (X (((F (((p32 <= 0) AND (p33 <= 0) AND (p34 <= 0) AND (p35 <= 0) AND (p36 <= 0) AND (p37 <= 0) AND (p39 <= 0) AND (p38 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0) AND (p49 <= 0) AND (p48 <= 0) AND (p51 <= 0) AND (p50 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p55 <= 0) AND (p54 <= 0))) U ((1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))) U X (((1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86))))))))) OR ((1 <= p64) AND (1 <= p92))) OR ((1 <= p59) AND (1 <= p89))) OR ((1 <= p60) AND (1 <= p90))) OR ((1 <= p58) AND (1 <= p89))) OR ((1 <= p63) AND (1 <= p91))) OR ((1 <= p61) AND (1 <= p90))) OR ((1 <= p67) AND (1 <= p93))) OR ((1 <= p65) AND (1 <= p92))) OR ((1 <= p66) AND (1 <= p93))) OR ((1 <= p57) AND (1 <= p88))) OR ((1 <= p62) AND (1 <= p91))) OR ((1 <= p56) AND (1 <= p88))) : F (((X (((1 <= p61) AND (1 <= p90))) U NOT(F ((NOT(X ((1 <= p73))) OR ((1 <= p61) AND (1 <= p90)))))) AND G ((1 <= p3)))) : NOT(F (((p84 <= 0) U X (NOT(G ((1 <= p71))))))) : X (X (F ((1 <= p54)))) : (X (((1 <= p0) AND (1 <= p14) AND (1 <= p74))) U F (X (((((1 <= p0) AND (1 <= p14) AND (1 <= p74)) U (1 <= p73)) OR (p7 <= 0))))) : F (G (X (G (X (F ((NOT(F ((p54 <= 0))) AND (p84 <= 0)))))))) : (G ((1 <= p76)) U ((p37 <= 0) U G (((NOT(X ((1 <= p7))) OR NOT(G (((1 <= p0) AND (1 <= p9) AND (1 <= p74))))) OR (p7 <= 0))))) : X ((G (NOT(X ((1 <= p27)))) AND NOT(G (((1 <= p1) AND (1 <= p17) AND (1 <= p74))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (G (((p81 <= 0) AND (p80 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (G (((p81 <= 0) AND (p80 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0)))))))
lola: processed formula length: 107
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 18 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p64) AND (1 <= p92)) OR ((1 <= p59) AND (1 <= p89)) OR ((1 <= p60) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p89)) OR ((1 <= p63) AND (1 <= p91)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p67) AND (1 <= p93)) OR ((1 <= p65) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p93)) OR ((1 <= p57) AND (1 <= p88)) OR ((1 <= p62) AND (1 <= p91)) OR ((1 <= p56) AND (1 <= p88))) OR (G ((X ((((p0 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p64) AND (1 <= p92)) OR ((1 <= p59) AND (1 <= p89)) OR ((1 <= p60) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p89)) OR ((1 <= p63) AND (1 <= p91)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p67) AND (1 <= p93)) OR ((1 <= p65) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p93)) OR ((1 <= p57) AND (1 <= p88)) OR ((1 <= p62) AND (1 <= p91)) OR ((1 <= p56) AND (1 <= p88)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p64) AND (1 <= p92)) OR ((1 <= p59) AND (1 <= p89)) OR ((1 <= p60) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p89)) OR ((1 <= p63) AND (1 <= p91)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p67) AND (1 <= p93)) OR ((1 <= p65) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p93)) OR ((1 <= p57) AND (1 <= p88)) OR ((1 <= p62) AND (1 <= p91)) OR ((1 <= p56) AND (1 <= p88)))
lola: processed formula length: 381
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 24 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p64) AND (1 <= p92)) OR ((1 <= p59) AND (1 <= p89)) OR ((1 <= p60) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p89)) OR ((1 <= p63) AND (1 <= p91)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p67) AND (1 <= p93)) OR ((1 <= p65) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p93)) OR ((1 <= p57) AND (1 <= p88)) OR ((1 <= p62) AND (1 <= p91)) OR ((1 <= p56) AND (1 <= p88))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p64 <= 0) OR (p92 <= 0)) AND ((p59 <= 0) OR (p89 <= 0)) AND ((p60 <= 0) OR (p90 <= 0)) AND ((p58 <= 0) OR (p89 <= 0)) AND ((p63 <= 0) OR (p91 <= 0)) AND ((p61 <= 0) OR (p90 <= 0)) AND ((p67 <= 0) OR (p93 <= 0)) AND ((p65 <= 0) OR (p92 <= 0)) AND ((p66 <= 0) OR (p93 <= 0)) AND ((p57 <= 0) OR (p88 <= 0)) AND ((p62 <= 0) OR (p91 <= 0)) AND ((p56 <= 0) OR (p88 <= 0)))
lola: processed formula length: 381
lola: 160 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 57 markings, 68 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((((1 <= p0) AND (1 <= p10) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p17) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p19) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p8) ... (shortened)
lola: processed formula length: 1203
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p81) OR (1 <= p80) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78)) U (((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p15 <= 0) OR (p7... (shortened)
lola: processed formula length: 1097
lola: 160 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 70 markings, 198 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p81) OR (1 <= p80) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78)) U (((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p81) OR (1 <= p80) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78)) U (((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <... (shortened)
lola: processed formula length: 1189
lola: 158 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p1... (shortened)
lola: processed formula length: 2212
lola: 158 rewrites
lola: closed formula file LTLFireability.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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 934268 markings, 1933450 edges, 186854 markings/sec, 0 secs
lola: 1716573 markings, 3837751 edges, 156461 markings/sec, 5 secs
lola: 2446556 markings, 5754151 edges, 145997 markings/sec, 10 secs
lola: 3143993 markings, 7663141 edges, 139487 markings/sec, 15 secs
lola: 3822898 markings, 9597327 edges, 135781 markings/sec, 20 secs
lola: 4470820 markings, 11511449 edges, 129584 markings/sec, 25 secs
lola: 5106067 markings, 13452168 edges, 127049 markings/sec, 30 secs
lola: 5725555 markings, 15395486 edges, 123898 markings/sec, 35 secs
lola: 6326576 markings, 17327425 edges, 120204 markings/sec, 40 secs
lola: 6922931 markings, 19279600 edges, 119271 markings/sec, 45 secs
lola: 7511974 markings, 21249247 edges, 117809 markings/sec, 50 secs
lola: 8102951 markings, 23252638 edges, 118195 markings/sec, 55 secs
lola: 8684486 markings, 25255160 edges, 116307 markings/sec, 60 secs
lola: 9255416 markings, 27254280 edges, 114186 markings/sec, 65 secs
lola: 9819026 markings, 29257996 edges, 112722 markings/sec, 70 secs
lola: 10372340 markings, 31266042 edges, 110663 markings/sec, 75 secs
lola: 10917249 markings, 33284961 edges, 108982 markings/sec, 80 secs
lola: 11455915 markings, 35313076 edges, 107733 markings/sec, 85 secs
lola: 11990515 markings, 37348595 edges, 106920 markings/sec, 90 secs
lola: 12520903 markings, 39401434 edges, 106078 markings/sec, 95 secs
lola: 13030916 markings, 41390912 edges, 102003 markings/sec, 100 secs
lola: 13523473 markings, 43341207 edges, 98511 markings/sec, 105 secs
lola: 14041216 markings, 45414936 edges, 103549 markings/sec, 110 secs
lola: 14555786 markings, 47492101 edges, 102914 markings/sec, 115 secs
lola: 15065153 markings, 49582226 edges, 101873 markings/sec, 120 secs
lola: 15557163 markings, 51611145 edges, 98402 markings/sec, 125 secs
lola: 15996939 markings, 53435802 edges, 87955 markings/sec, 130 secs
lola: 16436493 markings, 55263230 edges, 87911 markings/sec, 135 secs
lola: 16868644 markings, 57081733 edges, 86430 markings/sec, 140 secs
lola: 17296795 markings, 58913961 edges, 85630 markings/sec, 145 secs
lola: 17725601 markings, 60745747 edges, 85761 markings/sec, 150 secs
lola: 18153200 markings, 62596461 edges, 85520 markings/sec, 155 secs
lola: 18599658 markings, 64548595 edges, 89292 markings/sec, 160 secs
lola: 19066030 markings, 66605102 edges, 93274 markings/sec, 165 secs
lola: 19530080 markings, 68678662 edges, 92810 markings/sec, 170 secs
lola: 19996540 markings, 70778512 edges, 93292 markings/sec, 175 secs
lola: 20461504 markings, 72888298 edges, 92993 markings/sec, 180 secs
lola: 20924919 markings, 75005021 edges, 92683 markings/sec, 185 secs
lola: 21386001 markings, 77127782 edges, 92216 markings/sec, 190 secs
lola: 21845438 markings, 79258571 edges, 91887 markings/sec, 195 secs
lola: 22296905 markings, 81385028 edges, 90293 markings/sec, 200 secs
lola: 22750364 markings, 83523329 edges, 90692 markings/sec, 205 secs
lola: 23199681 markings, 85663310 edges, 89863 markings/sec, 210 secs
lola: 23642203 markings, 87806083 edges, 88504 markings/sec, 215 secs
lola: 24084589 markings, 89948072 edges, 88477 markings/sec, 220 secs
lola: 24522621 markings, 92101091 edges, 87606 markings/sec, 225 secs
lola: 24958883 markings, 94267863 edges, 87252 markings/sec, 230 secs
lola: 25386047 markings, 96415256 edges, 85433 markings/sec, 235 secs
lola: 25812021 markings, 98567156 edges, 85195 markings/sec, 240 secs
lola: 26234878 markings, 100736238 edges, 84571 markings/sec, 245 secs
lola: 26616925 markings, 102712188 edges, 76409 markings/sec, 250 secs
lola: 26984744 markings, 104611504 edges, 73564 markings/sec, 255 secs
lola: 27364331 markings, 106606589 edges, 75917 markings/sec, 260 secs
lola: 27769489 markings, 108720894 edges, 81032 markings/sec, 265 secs
lola: 28178970 markings, 110872982 edges, 81896 markings/sec, 270 secs
lola: 28589241 markings, 113050409 edges, 82054 markings/sec, 275 secs
lola: 28996252 markings, 115218216 edges, 81402 markings/sec, 280 secs
lola: 29399967 markings, 117389731 edges, 80743 markings/sec, 285 secs
lola: 29802915 markings, 119569803 edges, 80590 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 5095756 KB
lola: time consumption: 302 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 5095756 KB
lola: time consumption: 302 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0))) AND (G ((X (X ((((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0))) AND (G ((X (X ((((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR... (shortened)
lola: processed formula length: 1488
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (F (((1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86)))))) OR (((1 <= p64) AND (1 <= p92)) OR (((1 <= p59) AND (1 <= p89)) OR (((1 <= p60) AND (1 <= p90)) OR (((1 <= p58) AND (1 <= p89)) OR (((1 <= p63) AND (1 <= p91)) OR (((1 <= p61) AND (1 <= p90)) OR (((1 <= p67) AND (1 <= p93)) OR (((1 <= p65) AND (1 <= p92)) OR (((1 <= p66) AND (1 <= p93)) OR (((1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p64) AND (1 <= p92)) OR (((1 <= p59) AND (1 <= p89)) OR (((1 <= p60) AND (1 <= p90)) OR (((1 <= p58) AND (1 <= p89)) OR (((1 <= p63) AND (1 <= p91)) OR (((1 <= p61) AND (1 <= p90)) OR (((1 <= p67) AND (1 <= p93)) OR (((1 <= p65) AND (1 <= p92)) OR (((1 <= p66) AND (1 <= p93)) OR (((1 <= p57) AND (1 <= p88)) OR (((1 <= p62) AND (1 <= p91)) OR ((1 <= p56) AND (1 <= p88)))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p64) AND (1 <= p92)) OR ((1 <= p59) AND (1 <= p89)) OR ((1 <= p60) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p89)) OR ((1 <= p63) AND (1 <= p91)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p67) AND (1 <= p93)) OR ((1 <= p65) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p93)) OR ((1 <= p57) AND (1 <= p88)) OR ((1 <= p62) AND (1 <= p91)) OR ((1 <= p56) AND (1 <= p88)))
lola: processed formula length: 370
lola: 179 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 24 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F (((1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F (((1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86))))))
lola: processed formula length: 103
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 963 markings, 1152 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((X (((1 <= p61) AND (1 <= p90))) U G ((X ((1 <= p73)) AND ((p61 <= 0) OR (p90 <= 0))))) AND G ((1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((X (((1 <= p61) AND (1 <= p90))) U G ((X ((1 <= p73)) AND ((p61 <= 0) OR (p90 <= 0))))) AND G ((1 <= p3))))
lola: processed formula length: 112
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 26 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 7 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p71)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p71)))
lola: processed formula length: 18
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((1 <= p54))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((1 <= p54))))
lola: processed formula length: 22
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 9 will run for 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((((1 <= p0) AND (1 <= p14) AND (1 <= p74)) U (1 <= p73)) OR (p7 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((((1 <= p0) AND (1 <= p14) AND (1 <= p74)) U (1 <= p73)) OR (p7 <= 0))))
lola: processed formula length: 79
lola: 158 rewrites
lola: closed formula file LTLFireability.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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 12 edges
lola: ========================================
lola: subprocess 10 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p37 <= 0) U G ((X ((p7 <= 0)) OR (F (((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0))) OR (p7 <= 0))))) OR (G ((1 <= p76)) AND F (G ((X ((p7 <= 0)) OR (F (((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0))) OR (p7 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p76))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p76))
lola: processed formula length: 14
lola: 158 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 11 will run for 816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p37 <= 0) U G ((X ((p7 <= 0)) OR (F (((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0))) OR (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p37 <= 0) U G ((X ((p7 <= 0)) OR (F (((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0))) OR (p7 <= 0)))))
lola: processed formula length: 97
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30873 markings, 57515 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((p27 <= 0))) AND F (((p1 <= 0) OR (p17 <= 0) OR (p74 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((p27 <= 0))) AND F (((p1 <= 0) OR (p17 <= 0) OR (p74 <= 0)))))
lola: processed formula length: 74
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 72 markings, 85 edges
lola: ========================================
lola: subprocess 12 will run for 1089 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((1 <= p54)) AND (p84 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((1 <= p54)) AND (p84 <= 0))))
lola: processed formula length: 39
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 41 markings, 41 edges
lola: ========================================
lola: subprocess 13 will run for 1633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p15 <= 0) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p15 <= 0) ... (shortened)
lola: processed formula length: 1287
lola: 158 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 47 markings, 47 edges
lola: ========================================
lola: subprocess 14 will run for 3267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p0 <= 0) OR (p10 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p17 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p19 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))
lola: processed formula length: 81
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 6 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: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((((1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) OR (G ((((1 <= p64) AND (1 <= p92)) OR ((1 <= p59) AND (1 <= p89)) OR ((1 <= p60) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p89)) OR ((1 <= p63) AND (1 <= p91)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p67) AND (1 <= p93)) OR ((1 <= p65) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p93)) OR ((1 <= p57) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((((1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) OR (G ((((1 <= p64) AND (1 <= p92)) OR ((1 <= p59) AND (1 <= p89)) OR ((1 <= p60) AND (1 <= p90)) OR ((1 <= p58) AND (1 <= p89)) OR ((1 <= p63) AND (1 <= p91)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p67) AND (1 <= p93)) OR ((1 <= p65) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p93)) OR ((1 <= p57) AN... (shortened)
lola: processed formula length: 666
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((1 <= p81) OR (1 <= p80) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78)) U (((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p15) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p15 <= 0) OR (p7... (shortened)
lola: processed formula length: 1097
lola: 160 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 70 markings, 198 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p81) OR (1 <= p80) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78)) U (((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p81) OR (1 <= p80) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78)) U (((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <... (shortened)
lola: processed formula length: 1189
lola: 158 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((X ((((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((((1 <= p0) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p16) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p74)) OR ((1 <= p1) AND (1 <= p1... (shortened)
lola: processed formula length: 2212
lola: 158 rewrites
lola: closed formula file LTLFireability.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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 944080 markings, 1956238 edges, 188816 markings/sec, 0 secs
lola: 1724628 markings, 3858419 edges, 156110 markings/sec, 5 secs
lola: 2454967 markings, 5776643 edges, 146068 markings/sec, 10 secs
lola: 3156824 markings, 7699367 edges, 140371 markings/sec, 15 secs
lola: 3829466 markings, 9616630 edges, 134528 markings/sec, 20 secs
lola: 4479328 markings, 11536821 edges, 129972 markings/sec, 25 secs
lola: 5114460 markings, 13478206 edges, 127026 markings/sec, 30 secs
lola: 5737668 markings, 15433883 edges, 124642 markings/sec, 35 secs
lola: 6348075 markings, 17396636 edges, 122081 markings/sec, 40 secs
lola: 6949854 markings, 19370207 edges, 120356 markings/sec, 45 secs
lola: 7544079 markings, 21355860 edges, 118845 markings/sec, 50 secs
lola: 8130424 markings, 23347240 edges, 117269 markings/sec, 55 secs
lola: 8710423 markings, 25346448 edges, 116000 markings/sec, 60 secs
lola: 9282593 markings, 27349985 edges, 114434 markings/sec, 65 secs
lola: 9847500 markings, 29360285 edges, 112981 markings/sec, 70 secs
lola: 10403186 markings, 31379346 edges, 111137 markings/sec, 75 secs
lola: 10951644 markings, 33414541 edges, 109692 markings/sec, 80 secs
lola: 11491726 markings, 35448161 edges, 108016 markings/sec, 85 secs
lola: 12027818 markings, 37492030 edges, 107218 markings/sec, 90 secs
lola: 12557482 markings, 39542994 edges, 105933 markings/sec, 95 secs
lola: 13082565 markings, 41594465 edges, 105017 markings/sec, 100 secs
lola: 13601169 markings, 43650435 edges, 103721 markings/sec, 105 secs
lola: 14116594 markings, 45717014 edges, 103085 markings/sec, 110 secs
lola: 14626959 markings, 47782067 edges, 102073 markings/sec, 115 secs
lola: 15131827 markings, 49858825 edges, 100974 markings/sec, 120 secs
lola: 15637374 markings, 51943426 edges, 101109 markings/sec, 125 secs
lola: 16138421 markings, 54021998 edges, 100209 markings/sec, 130 secs
lola: 16639049 markings, 56112533 edges, 100126 markings/sec, 135 secs
lola: 17130642 markings, 58202709 edges, 98319 markings/sec, 140 secs
lola: 17620242 markings, 60300052 edges, 97920 markings/sec, 145 secs
lola: 18110494 markings, 62408577 edges, 98050 markings/sec, 150 secs
lola: 18592717 markings, 64519132 edges, 96445 markings/sec, 155 secs
lola: 19071764 markings, 66630457 edges, 95809 markings/sec, 160 secs
lola: 19542872 markings, 68737002 edges, 94222 markings/sec, 165 secs
lola: 20013585 markings, 70856819 edges, 94143 markings/sec, 170 secs
lola: 20479950 markings, 72972195 edges, 93273 markings/sec, 175 secs
lola: 20942398 markings, 75085663 edges, 92490 markings/sec, 180 secs
lola: 21405455 markings, 77217707 edges, 92611 markings/sec, 185 secs
lola: 21866706 markings, 79357940 edges, 92250 markings/sec, 190 secs
lola: 22319582 markings, 81490935 edges, 90575 markings/sec, 195 secs
lola: 22771100 markings, 83619481 edges, 90304 markings/sec, 200 secs
lola: 23222417 markings, 85774253 edges, 90263 markings/sec, 205 secs
lola: 23667950 markings, 87928984 edges, 89107 markings/sec, 210 secs
lola: 24116636 markings, 90108060 edges, 89737 markings/sec, 215 secs
lola: 24503564 markings, 92009039 edges, 77386 markings/sec, 220 secs
lola: 24887480 markings, 93916278 edges, 76783 markings/sec, 225 secs
lola: 25296988 markings, 95963838 edges, 81902 markings/sec, 230 secs
lola: 25722049 markings, 98110475 edges, 85012 markings/sec, 235 secs
lola: 26145524 markings, 100275807 edges, 84695 markings/sec, 240 secs
lola: 26568101 markings, 102457905 edges, 84515 markings/sec, 245 secs
lola: 26945423 markings, 104410521 edges, 75464 markings/sec, 250 secs
lola: 27306588 markings, 106299317 edges, 72233 markings/sec, 255 secs
lola: 27666789 markings, 108188498 edges, 72040 markings/sec, 260 secs
lola: 28033094 markings, 110099816 edges, 73261 markings/sec, 265 secs
lola: 28397031 markings, 112026542 edges, 72787 markings/sec, 270 secs
lola: 28756002 markings, 113941905 edges, 71794 markings/sec, 275 secs
lola: 29115490 markings, 115859420 edges, 71898 markings/sec, 280 secs
lola: 29470838 markings, 117774407 edges, 71070 markings/sec, 285 secs
lola: 29826514 markings, 119696369 edges, 71135 markings/sec, 290 secs
lola: 30253836 markings, 122024235 edges, 85464 markings/sec, 295 secs
lola: 30605566 markings, 123950251 edges, 70346 markings/sec, 300 secs
lola: 30957341 markings, 125884362 edges, 70355 markings/sec, 305 secs
lola: 31302795 markings, 127800324 edges, 69091 markings/sec, 310 secs
lola: 31645912 markings, 129725459 edges, 68623 markings/sec, 315 secs
lola: 31990017 markings, 131653004 edges, 68821 markings/sec, 320 secs
lola: 32330350 markings, 133592560 edges, 68067 markings/sec, 325 secs
lola: 32668104 markings, 135538651 edges, 67551 markings/sec, 330 secs
lola: 33008110 markings, 137491475 edges, 68001 markings/sec, 335 secs
lola: 33345802 markings, 139453068 edges, 67538 markings/sec, 340 secs
lola: 33683202 markings, 141414251 edges, 67480 markings/sec, 345 secs
lola: 34020534 markings, 143372642 edges, 67466 markings/sec, 350 secs
lola: 34357119 markings, 145346704 edges, 67317 markings/sec, 355 secs
lola: 34693260 markings, 147325179 edges, 67228 markings/sec, 360 secs
lola: 35026193 markings, 149294437 edges, 66587 markings/sec, 365 secs
lola: 35355702 markings, 151274900 edges, 65902 markings/sec, 370 secs
lola: 35689457 markings, 153258769 edges, 66751 markings/sec, 375 secs
lola: 36020609 markings, 155238364 edges, 66230 markings/sec, 380 secs
lola: 36351576 markings, 157232812 edges, 66193 markings/sec, 385 secs
lola: 36680087 markings, 159231743 edges, 65702 markings/sec, 390 secs
lola: 37005577 markings, 161235000 edges, 65098 markings/sec, 395 secs
lola: 37329091 markings, 163269585 edges, 64703 markings/sec, 400 secs
lola: 37652308 markings, 165290908 edges, 64643 markings/sec, 405 secs
lola: 37976206 markings, 167323439 edges, 64780 markings/sec, 410 secs
lola: 38297910 markings, 169373039 edges, 64341 markings/sec, 415 secs
lola: 38617222 markings, 171434222 edges, 63862 markings/sec, 420 secs
lola: 38937220 markings, 173518555 edges, 64000 markings/sec, 425 secs
lola: 39253403 markings, 175616173 edges, 63237 markings/sec, 430 secs
lola: 39564551 markings, 177717418 edges, 62230 markings/sec, 435 secs
lola: 39872717 markings, 179828676 edges, 61633 markings/sec, 440 secs
lola: 40178168 markings, 181964266 edges, 61090 markings/sec, 445 secs
lola: 40482710 markings, 184153222 edges, 60908 markings/sec, 450 secs
lola: 40786831 markings, 186337432 edges, 60824 markings/sec, 455 secs
lola: 41082861 markings, 188541176 edges, 59206 markings/sec, 460 secs
lola: 41401421 markings, 190817932 edges, 63712 markings/sec, 465 secs
lola: 41741052 markings, 193155074 edges, 67926 markings/sec, 470 secs
lola: 42094017 markings, 195598183 edges, 70593 markings/sec, 475 secs
lola: 42464201 markings, 197906759 edges, 74037 markings/sec, 480 secs
lola: 42704743 markings, 199936569 edges, 48108 markings/sec, 485 secs
lola: 42883800 markings, 201838558 edges, 35811 markings/sec, 490 secs
lola: 43035865 markings, 203680283 edges, 30413 markings/sec, 495 secs
lola: 43177708 markings, 205490101 edges, 28369 markings/sec, 500 secs
lola: 43311397 markings, 207287030 edges, 26738 markings/sec, 505 secs
lola: 43442371 markings, 209089838 edges, 26195 markings/sec, 510 secs
lola: 43572469 markings, 210897230 edges, 26020 markings/sec, 515 secs
lola: 43699517 markings, 212691385 edges, 25410 markings/sec, 520 secs
lola: 43823202 markings, 214480164 edges, 24737 markings/sec, 525 secs
lola: 43948410 markings, 216258980 edges, 25042 markings/sec, 530 secs
lola: 44072779 markings, 218019893 edges, 24874 markings/sec, 535 secs
lola: 44199922 markings, 219777785 edges, 25429 markings/sec, 540 secs
lola: 44326441 markings, 221541822 edges, 25304 markings/sec, 545 secs
lola: 44454996 markings, 223313579 edges, 25711 markings/sec, 550 secs
lola: 44583658 markings, 225078057 edges, 25732 markings/sec, 555 secs
lola: 44712615 markings, 226814616 edges, 25791 markings/sec, 560 secs
lola: 44841433 markings, 228529107 edges, 25764 markings/sec, 565 secs
lola: 44969231 markings, 230240036 edges, 25560 markings/sec, 570 secs
lola: 45100661 markings, 231961269 edges, 26286 markings/sec, 575 secs
lola: 45231583 markings, 233698142 edges, 26184 markings/sec, 580 secs
lola: 45363558 markings, 235427624 edges, 26395 markings/sec, 585 secs
lola: 45494829 markings, 237133511 edges, 26254 markings/sec, 590 secs
lola: 45627665 markings, 238861459 edges, 26567 markings/sec, 595 secs
lola: 45760926 markings, 240570255 edges, 26652 markings/sec, 600 secs
lola: 45893592 markings, 242246980 edges, 26533 markings/sec, 605 secs
lola: 46029167 markings, 243966840 edges, 27115 markings/sec, 610 secs
lola: 46164413 markings, 245692241 edges, 27049 markings/sec, 615 secs
lola: 46300762 markings, 247425297 edges, 27270 markings/sec, 620 secs
lola: 46434700 markings, 249145504 edges, 26788 markings/sec, 625 secs
lola: 46568455 markings, 250873835 edges, 26751 markings/sec, 630 secs
lola: 46699026 markings, 252590189 edges, 26114 markings/sec, 635 secs
lola: 46828947 markings, 254276161 edges, 25984 markings/sec, 640 secs
lola: 46959629 markings, 255982799 edges, 26136 markings/sec, 645 secs
lola: 47090936 markings, 257690084 edges, 26261 markings/sec, 650 secs
lola: 47222210 markings, 259394655 edges, 26255 markings/sec, 655 secs
lola: 47352970 markings, 261088667 edges, 26152 markings/sec, 660 secs
lola: 47483934 markings, 262794284 edges, 26193 markings/sec, 665 secs
lola: 47612860 markings, 264485003 edges, 25785 markings/sec, 670 secs
lola: 47742061 markings, 266157872 edges, 25840 markings/sec, 675 secs
lola: 47870616 markings, 267861884 edges, 25711 markings/sec, 680 secs
lola: 47999832 markings, 269567956 edges, 25843 markings/sec, 685 secs
lola: 48125425 markings, 271255970 edges, 25119 markings/sec, 690 secs
lola: 48251046 markings, 272943667 edges, 25124 markings/sec, 695 secs
lola: 48374088 markings, 274627897 edges, 24608 markings/sec, 700 secs
lola: 48491907 markings, 276244620 edges, 23564 markings/sec, 705 secs
lola: 48615837 markings, 277941640 edges, 24786 markings/sec, 710 secs
lola: 48738478 markings, 279641431 edges, 24528 markings/sec, 715 secs
lola: 48860770 markings, 281329981 edges, 24458 markings/sec, 720 secs
lola: 48982223 markings, 283041313 edges, 24291 markings/sec, 725 secs
lola: 49101056 markings, 284744670 edges, 23767 markings/sec, 730 secs
lola: 49218620 markings, 286465470 edges, 23513 markings/sec, 735 secs
lola: 49338421 markings, 288247857 edges, 23960 markings/sec, 740 secs
lola: 49468537 markings, 290307003 edges, 26023 markings/sec, 745 secs
lola: 49592257 markings, 292328041 edges, 24744 markings/sec, 750 secs
lola: 49724924 markings, 294551678 edges, 26533 markings/sec, 755 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 49808478 markings, 296313828 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((((p0 <= 0) OR (p10 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p17 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p19 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))
lola: processed formula length: 81
lola: 158 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 6 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: G ((((p0 <= 0) OR (p10 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p17 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p19 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p0 <= 0) OR (p10 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p17 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p16 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p19 <= 0) OR (p74 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR ... (shortened)
lola: processed formula length: 551
lola: 158 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 40 markings, 40 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no yes no no no no no no no
lola:
preliminary result: no no no yes no no no yes no no no no no no no
lola: memory consumption: 165044 KB
lola: time consumption: 1067 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z2T3N06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is UtilityControlRoom-PT-Z2T3N06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r322-tall-162132128100266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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