About the Execution of 2020-gold for SafeBus-COL-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4323.571 | 3600000.00 | 19250.00 | 313.80 | TFTFFFFFFTFTFFTF | 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.r208-smll-162089471100106.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is SafeBus-COL-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-162089471100106
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 11:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 11:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 14:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 42K May 5 16:51 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 SafeBus-COL-03-00
FORMULA_NAME SafeBus-COL-03-01
FORMULA_NAME SafeBus-COL-03-02
FORMULA_NAME SafeBus-COL-03-03
FORMULA_NAME SafeBus-COL-03-04
FORMULA_NAME SafeBus-COL-03-05
FORMULA_NAME SafeBus-COL-03-06
FORMULA_NAME SafeBus-COL-03-07
FORMULA_NAME SafeBus-COL-03-08
FORMULA_NAME SafeBus-COL-03-09
FORMULA_NAME SafeBus-COL-03-10
FORMULA_NAME SafeBus-COL-03-11
FORMULA_NAME SafeBus-COL-03-12
FORMULA_NAME SafeBus-COL-03-13
FORMULA_NAME SafeBus-COL-03-14
FORMULA_NAME SafeBus-COL-03-15
=== Now, execution of the tool begins
BK_START 1621042246296
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-15 01:30:49] [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-15 01:30:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 01:30:49] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-15 01:30:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1356 ms
[2021-05-15 01:30:50] [INFO ] sort/places :
Dom->AMC,wait_ack,
Dot->cable_free,ACK,T_out,R_tout,S_tout,FMCb,
It->Cpt2,Cpt1,msgl,cable_used,FMC,wait_cable,listen,RMC,PMC,MSG,wait_msg,loop_em,
[2021-05-15 01:30:50] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2021-05-15 01:30:50] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 41 ms.
[2021-05-15 01:30:50] [INFO ] Computed order based on color domains.
[2021-05-15 01:30:50] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions in 24 ms.
[2021-05-15 01:30:50] [INFO ] Unfolded HLPN properties in 1 ms.
[2021-05-15 01:30:50] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-15 01:30:50] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-15 01:30:50] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-15 01:30:50] [INFO ] Reduced 3 identical enabling conditions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 6 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 76 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 520 ms. (steps per millisecond=192 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-15 01:30:51] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-15 01:30:51] [INFO ] Computed 17 place invariants in 9 ms
[2021-05-15 01:30:51] [INFO ] [Real]Absence check using 7 positive place invariants in 24 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-15 01:30:51] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-15 01:30:51] [INFO ] Flatten gal took : 99 ms
FORMULA SafeBus-COL-03-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 01:30:51] [INFO ] Applying decomposition
[2021-05-15 01:30:52] [INFO ] Flatten gal took : 61 ms
[2021-05-15 01:30:52] [INFO ] Decomposing Gal with order
[2021-05-15 01:30:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 01:30:52] [INFO ] Removed a total of 198 redundant transitions.
[2021-05-15 01:30:52] [INFO ] Flatten gal took : 167 ms
[2021-05-15 01:30:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 9 ms.
[2021-05-15 01:30:52] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2021-05-15 01:30:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SafeBus-COL-03 @ 3570 seconds
FORMULA SafeBus-COL-03-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-COL-03-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-COL-03-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-COL-03-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-COL-03-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-COL-03-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-COL-03-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-COL-03-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-COL-03-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-COL-03-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-COL-03-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-COL-03-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-COL-03-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ SafeBus-COL-03
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 15 01:30:53 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"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": 14,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p15) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p14) AND (1 <= p50)))))",
"processed_size": 545,
"rewrites": 124
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 12,
"adisj": 1,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G ((X (G ((((1 <= p5) AND (1 <= p33)) OR ((1 <= p4) AND (1 <= p32)) OR ((1 <= p4) AND (1 <= p33)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33))))) OR (((1 <= p33) AND (1 <= p43)) OR (((1 <= p31) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p42))))))",
"processed_size": 387,
"rewrites": 124
},
"result":
{
"edges": 82,
"markings": 82,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 7,
"adisj": 9,
"aneg": 1,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 6,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (X (F ((G ((((1 <= p5) AND (1 <= p33)) OR ((1 <= p4) AND (1 <= p32)) OR ((1 <= p4) AND (1 <= p33)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33)))) OR (((1 <= p22) AND (1 <= p44)) OR (((1 <= p27) AND (1 <= p44)) OR (((1 <= p26) AND (1 <= p44)) OR (((1 <= p25) AND (1 <= p44)) OR (((1 <= p24) AND (1 <= p44)) OR ((1 <= p23) AND (1 <= p44)))))))))))",
"processed_size": 490,
"rewrites": 124
},
"result":
{
"edges": 91,
"markings": 90,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 4,
"aconj": 17,
"adisj": 3,
"aneg": 0,
"comp": 60,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "((((1 <= p25) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p23) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p26) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p22) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p24) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p27) AND (1 <= p37) AND (1 <= p50))) U (X ((X (X (((p37 <= 0) OR (p45 <= 0)))) U ((1 <= p37) AND (1 <= p45)))) OR (G ((((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p15) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p14) AND (1 <= p50)))) AND X (F (((1 <= p37) AND (1 <= p45)))))))",
"processed_size": 944,
"rewrites": 124
},
"result":
{
"edges": 320,
"markings": 316,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 21
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"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": 14,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p15) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p14) AND (1 <= p50)))))",
"processed_size": 545,
"rewrites": 124
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 0,
"aneg": 0,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "(((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p15) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p14) AND (1 <= p50)))",
"processed_size": 529,
"rewrites": 139
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 24,
"adisj": 3,
"aneg": 6,
"comp": 84,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 84,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "(X (F ((((((p0 <= 0) OR (p6 <= 0) OR (p16 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p17 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p18 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p20 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p21 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p19 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p15 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p14 <= 0) OR (p50 <= 0))) R (((p28 <= 0) OR (p34 <= 0)) AND ((p29 <= 0) OR (p35 <= 0)) AND ((p30 <= 0) OR (p36 <= 0)))) AND (((p29 <= 0) OR (p39 <= 0)) AND (((p30 <= 0) OR (p40 <= 0)) AND ((p28 <= 0) OR (p38 <= 0))))))) R F ((((p0 <= 0) OR (p6 <= 0) OR (p16 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p17 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p18 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p20 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p21 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p19 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p15 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p14 <= 0) OR (p50 <= 0)))))",
"processed_size": 1291,
"rewrites": 124
},
"result":
{
"edges": 75,
"markings": 58,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 4,
"aconj": 18,
"adisj": 4,
"aneg": 3,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (X (X (G ((X ((((1 <= p29) AND (1 <= p39)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p28) AND (1 <= p38)))) AND F (((((p22 <= 0) OR (p44 <= 0)) AND ((p27 <= 0) OR (p44 <= 0)) AND ((p26 <= 0) OR (p44 <= 0)) AND ((p25 <= 0) OR (p44 <= 0)) AND ((p24 <= 0) OR (p44 <= 0)) AND ((p23 <= 0) OR (p44 <= 0))) AND (F ((((p29 <= 0) OR (p39 <= 0)) AND ((p30 <= 0) OR (p40 <= 0)) AND ((p28 <= 0) OR (p38 <= 0)))) OR G ((((p22 <= 0) OR (p44 <= 0)) AND ((p27 <= 0) OR (p44 <= 0)) AND ((p26 <= 0) OR (p44 <= 0)) AND ((p25 <= 0) OR (p44 <= 0)) AND ((p24 <= 0) OR (p44 <= 0)) AND ((p23 <= 0) OR (p44 <= 0))))))))))))",
"processed_size": 616,
"rewrites": 124
},
"result":
{
"edges": 83,
"markings": 83,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X (G ((((1 <= p5) AND (1 <= p33)) OR ((1 <= p4) AND (1 <= p32)) OR ((1 <= p4) AND (1 <= p33)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33))))))",
"processed_size": 288,
"rewrites": 124
},
"result":
{
"edges": 82,
"markings": 82,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p22) AND (1 <= p44)) OR ((1 <= p27) AND (1 <= p44)) OR ((1 <= p26) AND (1 <= p44)) OR ((1 <= p25) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p44)) OR ((1 <= p23) AND (1 <= p44)))))",
"processed_size": 197,
"rewrites": 124
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p37) AND (1 <= p45))) OR ((1 <= p37) AND (1 <= p45))))",
"processed_size": 68,
"rewrites": 124
},
"result":
{
"edges": 86,
"markings": 86,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 1
},
"compoundnumber": 9,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 0,
"aconj": 22,
"adisj": 7,
"aneg": 2,
"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": 10,
"visible_transitions": 0
},
"processed": "((G (((((p11 <= 0) OR (p46 <= 0)) AND ((p12 <= 0) OR (p46 <= 0)) AND ((p10 <= 0) OR (p46 <= 0))) OR (((p28 <= 0) OR (p34 <= 0)) AND ((p29 <= 0) OR (p35 <= 0)) AND ((p30 <= 0) OR (p36 <= 0))))) R (((p11 <= 0) OR (p46 <= 0)) AND ((p12 <= 0) OR (p46 <= 0)) AND ((p10 <= 0) OR (p46 <= 0)))) U ((F ((((1 <= p28) AND (1 <= p34)) OR ((1 <= p29) AND (1 <= p35)) OR ((1 <= p30) AND (1 <= p36)))) OR (G ((((1 <= p28) AND (1 <= p34)) OR ((1 <= p29) AND (1 <= p35)) OR ((1 <= p30) AND (1 <= p36)))) AND F ((((1 <= p28) AND (1 <= p34)) OR ((1 <= p29) AND (1 <= p35)) OR ((1 <= p30) AND (1 <= p36)))))) AND (((1 <= p28) AND (1 <= p34)) OR ((1 <= p29) AND (1 <= p35)) OR ((1 <= p30) AND (1 <= p36)))))",
"processed_size": 704,
"rewrites": 124
},
"result":
{
"edges": 5685,
"markings": 2875,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 28
},
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 24,
"adisj": 7,
"aneg": 2,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 4,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "G ((F ((((1 <= p4) AND (1 <= p52)) OR ((1 <= p4) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p4) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p3) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p53)) OR ((1 <= p3) AND (1 <= p52)) OR ((1 <= p3) AND (1 <= p53)))) AND ((G (F ((F ((((p42 <= 0) OR (p45 <= 0)) AND ((p43 <= 0) OR (p45 <= 0)) AND ((p41 <= 0) OR (p45 <= 0)))) OR (((p42 <= 0) OR (p45 <= 0)) AND ((p43 <= 0) OR (p45 <= 0)) AND ((p41 <= 0) OR (p45 <= 0)))))) AND (((p42 <= 0) OR (p45 <= 0)) AND (((p43 <= 0) OR (p45 <= 0)) AND ((p41 <= 0) OR (p45 <= 0))))) OR (((1 <= p4) AND (1 <= p52)) OR ((1 <= p4) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p4) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p3) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p53)) OR ((1 <= p3) AND (1 <= p52)) OR ((1 <= p3) AND (1 <= p53))))))",
"processed_size": 879,
"rewrites": 124
},
"result":
{
"edges": 431,
"markings": 288,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"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": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 15,
"adisj": 3,
"aneg": 1,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "F (G ((F ((((1 <= p29) AND (1 <= p39)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p28) AND (1 <= p38)))) AND (F ((((p5 <= 0) OR (p33 <= 0)) AND ((p4 <= 0) OR (p32 <= 0)) AND ((p4 <= 0) OR (p33 <= 0)) AND ((p5 <= 0) OR (p31 <= 0)) AND ((p4 <= 0) OR (p31 <= 0)) AND ((p5 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p31 <= 0)) AND ((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)))) OR (((1 <= p29) AND (1 <= p39)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p28) AND (1 <= p38)))))))",
"processed_size": 491,
"rewrites": 124
},
"result":
{
"edges": 357,
"markings": 325,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 104860,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F(**)) : ((G(*) R *) U ((F(**) OR (G(**) AND F(**))) AND **)) : G(F(**)) : G((X(G(**)) OR (** OR (** OR **)))) : X(X(F((G(*) OR (** OR (** OR (** OR (** OR (** OR **))))))))) : F(G((F(**) AND (F(*) OR **)))) : (** U (X((X(X(**)) U **)) OR (G(**) AND X(F(**))))) : X(F(**)) : F((F(**) OR **)) : ((X(F(((* R *) AND (* AND (* AND *))))) R F(*)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))) : G((F(**) AND ((G(F((F(*) OR *))) AND (** AND (** AND **))) OR **))) : X(X(X(G((X(**) AND F((* AND (F(*) OR G(*))))))))) : X(X(G(**)))"
},
"net":
{
"arcs": 529,
"conflict_clusters": 4,
"places": 54,
"places_significant": 37,
"singleton_clusters": 0,
"transitions": 91
},
"result":
{
"preliminary_value": "yes no no no no no no yes no yes no no no ",
"value": "yes no no no no no no yes no yes 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: 145/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 54
lola: finding significant places
lola: 54 places, 91 transitions, 37 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 (F ((((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p15) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p14) AND (1 <= p50))))) : (NOT((F (((((1 <= p11) AND (1 <= p46)) OR ((1 <= p12) AND (1 <= p46)) OR ((1 <= p10) AND (1 <= p46))) AND (((1 <= p28) AND (1 <= p34)) OR ((1 <= p29) AND (1 <= p35)) OR ((1 <= p30) AND (1 <= p36))))) U (((1 <= p11) AND (1 <= p46)) OR ((1 <= p12) AND (1 <= p46)) OR ((1 <= p10) AND (1 <= p46))))) U ((G ((((1 <= p28) AND (1 <= p34)) OR ((1 <= p29) AND (1 <= p35)) OR ((1 <= p30) AND (1 <= p36)))) U F ((((1 <= p28) AND (1 <= p34)) OR ((1 <= p29) AND (1 <= p35)) OR ((1 <= p30) AND (1 <= p36))))) AND (((1 <= p28) AND (1 <= p34)) OR ((1 <= p29) AND (1 <= p35)) OR ((1 <= p30) AND (1 <= p36))))) : G (F ((((1 <= p22) AND (1 <= p44)) OR ((1 <= p27) AND (1 <= p44)) OR ((1 <= p26) AND (1 <= p44)) OR ((1 <= p25) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p44)) OR ((1 <= p23) AND (1 <= p44))))) : G ((((X (G ((((1 <= p5) AND (1 <= p33)) OR ((1 <= p4) AND (1 <= p32)) OR ((1 <= p4) AND (1 <= p33)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33))))) OR ((1 <= p33) AND (1 <= p43))) OR ((1 <= p31) AND (1 <= p41))) OR ((1 <= p32) AND (1 <= p42)))) : X (X (F (((((((NOT(F ((((((1 <= p5) AND (1 <= p33)) OR ((1 <= p4) AND (1 <= p32)) OR ((1 <= p4) AND (1 <= p33)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33))) U (((1 <= p28) AND (1 <= p34)) OR ((1 <= p29) AND (1 <= p35)) OR ((1 <= p30) AND (1 <= p36)))) U (((p5 <= 0) OR (p33 <= 0)) AND ((p4 <= 0) OR (p32 <= 0)) AND ((p4 <= 0) OR (p33 <= 0)) AND ((p5 <= 0) OR (p31 <= 0)) AND ((p4 <= 0) OR (p31 <= 0)) AND ((p5 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p31 <= 0)) AND ((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)))))) OR ((1 <= p22) AND (1 <= p44))) OR ((1 <= p27) AND (1 <= p44))) OR ((1 <= p26) AND (1 <= p44))) OR ((1 <= p25) AND (1 <= p44))) OR ((1 <= p24) AND (1 <= p44))) OR ((1 <= p23) AND (1 <= p44)))))) : X (F (X (G ((NOT(G ((((1 <= p5) AND (1 <= p33)) OR ((1 <= p4) AND (1 <= p32)) OR ((1 <= p4) AND (1 <= p33)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33))))) U (((1 <= p29) AND (1 <= p39)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p28) AND (1 <= p38)))))))) : ((((1 <= p25) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p23) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p26) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p22) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p24) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p27) AND (1 <= p37) AND (1 <= p50))) U (G ((((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p15) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p14) AND (1 <= p50)))) U (X (X (X (((p37 <= 0) OR (p45 <= 0))))) U X (((1 <= p37) AND (1 <= p45)))))) : ((0 <= 0) U ((X ((((1 <= p42) AND (1 <= p45)) OR ((1 <= p43) AND (1 <= p45)) OR ((1 <= p41) AND (1 <= p45)))) AND (((1 <= p42) AND (1 <= p45)) OR ((1 <= p43) AND (1 <= p45)) OR ((1 <= p41) AND (1 <= p45)))) U X ((((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p15) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p14) AND (1 <= p50)))))) : (F (X (X ((X (G (((1 <= p37) AND (1 <= p45)))) AND F (((1 <= p37) AND (1 <= p45))))))) U F ((F (((1 <= p37) AND (1 <= p45))) OR ((1 <= p37) AND (1 <= p45))))) : (((((((((NOT((G (X ((((((((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p15) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p14) AND (1 <= p50))) U (((1 <= p28) AND (1 <= p34)) OR ((1 <= p29) AND (1 <= p35)) OR ((1 <= p30) AND (1 <= p36)))) OR ((1 <= p29) AND (1 <= p39))) OR ((1 <= p30) AND (1 <= p40))) OR ((1 <= p28) AND (1 <= p38))))) U G ((((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p15) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p14) AND (1 <= p50)))))) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50))) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50))) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50))) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50))) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50))) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50))) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p15) AND (1 <= p50))) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p13) AND (1 <= p50))) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p14) AND (1 <= p50))) : G (((((NOT(F (G (X (F (G ((G ((((1 <= p42) AND (1 <= p45)) OR ((1 <= p43) AND (1 <= p45)) OR ((1 <= p41) AND (1 <= p45)))) AND (((1 <= p42) AND (1 <= p45)) OR ((1 <= p43) AND (1 <= p45)) OR ((1 <= p41) AND (1 <= p45)))))))))) AND ((p42 <= 0) OR (p45 <= 0))) AND ((p43 <= 0) OR (p45 <= 0))) AND ((p41 <= 0) OR (p45 <= 0))) U (((1 <= p4) AND (1 <= p52)) OR ((1 <= p4) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p4) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p3) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p53)) OR ((1 <= p3) AND (1 <= p52)) OR ((1 <= p3) AND (1 <= p53))))) : X (X (G (X ((X ((((1 <= p29) AND (1 <= p39)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p28) AND (1 <= p38)))) AND F (NOT((G ((((1 <= p29) AND (1 <= p39)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p28) AND (1 <= p38)))) U (((1 <= p22) AND (1 <= p44)) OR ((1 <= p27) AND (1 <= p44)) OR ((1 <= p26) AND (1 <= p44)) OR ((1 <= p25) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p44)) OR ((1 <= p23) AND (1 <= p44))))))))))) : G (X (X ((((1 <= p5) AND (1 <= p33)) OR ((1 <= p4) AND (1 <= p32)) OR ((1 <= p4) AND (1 <= p33)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33))))))
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <... (shortened)
lola: processed formula length: 545
lola: 124 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((((1 <= p5) AND (1 <= p33)) OR ((1 <= p4) AND (1 <= p32)) OR ((1 <= p4) AND (1 <= p33)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33))))) OR (((1 <= p33) AND (1 <= p43)) OR (((1 <= p31) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p42))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((((1 <= p5) AND (1 <= p33)) OR ((1 <= p4) AND (1 <= p32)) OR ((1 <= p4) AND (1 <= p33)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33))))) OR (((1 <= p33) AND (1 <= p43)) OR (((1 <= p31) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p42))))))
lola: processed formula length: 387
lola: 124 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: 82 markings, 82 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G ((((1 <= p5) AND (1 <= p33)) OR ((1 <= p4) AND (1 <= p32)) OR ((1 <= p4) AND (1 <= p33)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33)))) OR (((1 <= p22) AND (1 <= p44)) OR (((1 <= p27) AND (1 <= p44)) OR (((1 <= p26) AND (1 <= p44)) OR (((1 <= p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G ((((1 <= p5) AND (1 <= p33)) OR ((1 <= p4) AND (1 <= p32)) OR ((1 <= p4) AND (1 <= p33)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33)))) OR (((1 <= p22) AND (1 <= p44)) OR (((1 <= p27) AND (1 <= p44)) OR (((1 <= p26) AND (1 <= p44)) OR (((1 <= p2... (shortened)
lola: processed formula length: 490
lola: 124 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: 90 markings, 91 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p25) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p23) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p26) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p22) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p24) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p27) AND (1 <= p37) AND (1 <= p50))) U (X ((X (X (((p37 <= 0) OR (p45 <= 0)))) U ((1 <= p37) AND (1 <= p45)))) OR (G ((((1 <= p0) AND (1 <= p6) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p25) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p23) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p26) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p22) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p24) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p27) AND (1 <= p37) AND (1 <= p50))) U (X ((X (X (((p37 <= 0) OR (p45 <= 0)))) U ((1 <= p37) AND (1 <= p45)))) OR (G ((((1 <= p0) AND (1 <= p6) AND (1 <= p... (shortened)
lola: processed formula length: 944
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 21 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: 316 markings, 320 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <... (shortened)
lola: processed formula length: 545
lola: 124 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (F ((((((p0 <= 0) OR (p6 <= 0) OR (p16 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p17 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p18 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p20 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p21 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p19 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR (((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR (((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR (((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR (((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR (((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR (((1 <= p2) AND (1 <= p6) AND (1 <= p15)... (shortened)
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: processed formula: (((1 <= p0) AND (1 <= p6) AND (1 <= p16) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p17) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p18) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p20) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p21) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p19) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p15) AND (... (shortened)
lola: processed formula length: 529
lola: 139 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 36 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 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((((p0 <= 0) OR (p6 <= 0) OR (p16 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p17 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p18 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p20 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p21 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p19 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((((((p0 <= 0) OR (p6 <= 0) OR (p16 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p17 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p18 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p20 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p21 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p19 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (... (shortened)
lola: processed formula length: 1291
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 58 markings, 75 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((X ((((1 <= p29) AND (1 <= p39)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p28) AND (1 <= p38)))) AND F (((((p22 <= 0) OR (p44 <= 0)) AND ((p27 <= 0) OR (p44 <= 0)) AND ((p26 <= 0) OR (p44 <= 0)) AND ((p25 <= 0) OR (p44 <= 0)) AND ((p24 <= 0) OR (p44 <= 0)) AND ((p23 <= 0) OR (p44 <= 0))) AND (F ((((p29 <= 0) OR (p39 <= 0)) AND ((p30 <= 0) OR (p40 <= 0)) AND ((p28 <= 0) OR (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((X ((((1 <= p29) AND (1 <= p39)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p28) AND (1 <= p38)))) AND F (((((p22 <= 0) OR (p44 <= 0)) AND ((p27 <= 0) OR (p44 <= 0)) AND ((p26 <= 0) OR (p44 <= 0)) AND ((p25 <= 0) OR (p44 <= 0)) AND ((p24 <= 0) OR (p44 <= 0)) AND ((p23 <= 0) OR (p44 <= 0))) AND (F ((((p29 <= 0) OR (p39 <= 0)) AND ((p30 <= 0) OR (p40 <= 0)) AND ((p28 <= 0) OR (p... (shortened)
lola: processed formula length: 616
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 83 markings, 83 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p5) AND (1 <= p33)) OR ((1 <= p4) AND (1 <= p32)) OR ((1 <= p4) AND (1 <= p33)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p5) AND (1 <= p33)) OR ((1 <= p4) AND (1 <= p32)) OR ((1 <= p4) AND (1 <= p33)) OR ((1 <= p5) AND (1 <= p31)) OR ((1 <= p4) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p31)) OR ((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33))))))
lola: processed formula length: 288
lola: 124 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: 82 markings, 82 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p22) AND (1 <= p44)) OR ((1 <= p27) AND (1 <= p44)) OR ((1 <= p26) AND (1 <= p44)) OR ((1 <= p25) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p44)) OR ((1 <= p23) AND (1 <= p44)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p22) AND (1 <= p44)) OR ((1 <= p27) AND (1 <= p44)) OR ((1 <= p26) AND (1 <= p44)) OR ((1 <= p25) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p44)) OR ((1 <= p23) AND (1 <= p44)))))
lola: processed formula length: 197
lola: 124 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: 63 markings, 63 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p37) AND (1 <= p45))) OR ((1 <= p37) AND (1 <= p45))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p37) AND (1 <= p45))) OR ((1 <= p37) AND (1 <= p45))))
lola: processed formula length: 68
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 1 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: 86 markings, 86 edges
lola: ========================================
lola: subprocess 10 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((((p11 <= 0) OR (p46 <= 0)) AND ((p12 <= 0) OR (p46 <= 0)) AND ((p10 <= 0) OR (p46 <= 0))) OR (((p28 <= 0) OR (p34 <= 0)) AND ((p29 <= 0) OR (p35 <= 0)) AND ((p30 <= 0) OR (p36 <= 0))))) R (((p11 <= 0) OR (p46 <= 0)) AND ((p12 <= 0) OR (p46 <= 0)) AND ((p10 <= 0) OR (p46 <= 0)))) U ((F ((((1 <= p28) AND (1 <= p34)) OR ((1 <= p29) AND (1 <= p35)) OR ((1 <= p30) AND (1 <= p36)))) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((((p11 <= 0) OR (p46 <= 0)) AND ((p12 <= 0) OR (p46 <= 0)) AND ((p10 <= 0) OR (p46 <= 0))) OR (((p28 <= 0) OR (p34 <= 0)) AND ((p29 <= 0) OR (p35 <= 0)) AND ((p30 <= 0) OR (p36 <= 0))))) R (((p11 <= 0) OR (p46 <= 0)) AND ((p12 <= 0) OR (p46 <= 0)) AND ((p10 <= 0) OR (p46 <= 0)))) U ((F ((((1 <= p28) AND (1 <= p34)) OR ((1 <= p29) AND (1 <= p35)) OR ((1 <= p30) AND (1 <= p36)))) O... (shortened)
lola: processed formula length: 704
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 28 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: 2875 markings, 5685 edges
lola: ========================================
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((((1 <= p4) AND (1 <= p52)) OR ((1 <= p4) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p4) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p3) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p53)) OR ((1 <= p3) AND (1 <= p52)) OR ((1 <= p3) AND (1 <= p53)))) AND ((G (F ((F ((((p42 <= 0) OR (p45 <= 0)) AND ((p43 <= 0) OR (p45 <= 0)) AND ((p41 <= 0) OR (p45 <= 0)))) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((1 <= p4) AND (1 <= p52)) OR ((1 <= p4) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p4) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p3) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p53)) OR ((1 <= p3) AND (1 <= p52)) OR ((1 <= p3) AND (1 <= p53)))) AND ((G (F ((F ((((p42 <= 0) OR (p45 <= 0)) AND ((p43 <= 0) OR (p45 <= 0)) AND ((p41 <= 0) OR (p45 <= 0)))) OR (... (shortened)
lola: processed formula length: 879
lola: 124 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 288 markings, 431 edges
lola: ========================================
lola: subprocess 12 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((1 <= p29) AND (1 <= p39)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p28) AND (1 <= p38)))) AND (F ((((p5 <= 0) OR (p33 <= 0)) AND ((p4 <= 0) OR (p32 <= 0)) AND ((p4 <= 0) OR (p33 <= 0)) AND ((p5 <= 0) OR (p31 <= 0)) AND ((p4 <= 0) OR (p31 <= 0)) AND ((p5 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p31 <= 0)) AND ((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)))) OR (((1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p29) AND (1 <= p39)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p28) AND (1 <= p38)))) AND (F ((((p5 <= 0) OR (p33 <= 0)) AND ((p4 <= 0) OR (p32 <= 0)) AND ((p4 <= 0) OR (p33 <= 0)) AND ((p5 <= 0) OR (p31 <= 0)) AND ((p4 <= 0) OR (p31 <= 0)) AND ((p5 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p31 <= 0)) AND ((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)))) OR (((1 <... (shortened)
lola: processed formula length: 491
lola: 124 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 325 markings, 357 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no yes no yes no no no
lola:
preliminary result: yes no no no no no no yes no yes no no no
lola: memory consumption: 104860 KB
lola: time consumption: 4 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="SafeBus-COL-03"
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 SafeBus-COL-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r208-smll-162089471100106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-03.tgz
mv SafeBus-COL-03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;