About the Execution of 2020-gold for SafeBus-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4294.651 | 3600000.00 | 15727.00 | 291.10 | TFTFFFFFFFFFFFFF | 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-162089471100134.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-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-162089471100134
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 824K
-rw-r--r-- 1 mcc users 25K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 176K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 290K 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 4.2K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 11:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 11:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 25 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 25 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 95K 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-PT-03-00
FORMULA_NAME SafeBus-PT-03-01
FORMULA_NAME SafeBus-PT-03-02
FORMULA_NAME SafeBus-PT-03-03
FORMULA_NAME SafeBus-PT-03-04
FORMULA_NAME SafeBus-PT-03-05
FORMULA_NAME SafeBus-PT-03-06
FORMULA_NAME SafeBus-PT-03-07
FORMULA_NAME SafeBus-PT-03-08
FORMULA_NAME SafeBus-PT-03-09
FORMULA_NAME SafeBus-PT-03-10
FORMULA_NAME SafeBus-PT-03-11
FORMULA_NAME SafeBus-PT-03-12
FORMULA_NAME SafeBus-PT-03-13
FORMULA_NAME SafeBus-PT-03-14
FORMULA_NAME SafeBus-PT-03-15
=== Now, execution of the tool begins
BK_START 1621059941386
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-15 06:25:44] [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 06:25:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 06:25:44] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2021-05-15 06:25:44] [INFO ] Transformed 57 places.
[2021-05-15 06:25:44] [INFO ] Transformed 91 transitions.
[2021-05-15 06:25:44] [INFO ] Found NUPN structural information;
[2021-05-15 06:25:44] [INFO ] Parsed PT model containing 57 places and 91 transitions in 140 ms.
Reduce places removed 3 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 387 ms. (steps per millisecond=258 ) 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]
[2021-05-15 06:25:45] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-15 06:25:45] [INFO ] Computed 17 place invariants in 15 ms
[2021-05-15 06:25:45] [INFO ] [Real]Absence check using 7 positive place invariants in 25 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-15 06:25:45] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-15 06:25:45] [INFO ] Flatten gal took : 66 ms
FORMULA SafeBus-PT-03-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 06:25:45] [INFO ] Applying decomposition
[2021-05-15 06:25:45] [INFO ] Flatten gal took : 23 ms
[2021-05-15 06:25:45] [INFO ] Decomposing Gal with order
[2021-05-15 06:25:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 06:25:45] [INFO ] Removed a total of 187 redundant transitions.
[2021-05-15 06:25:45] [INFO ] Flatten gal took : 71 ms
[2021-05-15 06:25:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 9 ms.
[2021-05-15 06:25:45] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2021-05-15 06:25:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SafeBus-PT-03 @ 3570 seconds
FORMULA SafeBus-PT-03-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-09 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-PT-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 06:25:46 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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 <= p15) AND (1 <= p22) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p28) AND (1 <= p35)))))",
"processed_size": 563,
"rewrites": 59
},
"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
},
"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 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48))))) OR (((1 <= p10) AND (1 <= p39)) OR (((1 <= p11) AND (1 <= p40)) OR ((1 <= p12) AND (1 <= p41))))))",
"processed_size": 396,
"rewrites": 59
},
"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 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48)))) OR (((1 <= p2) AND (1 <= p5)) OR (((1 <= p2) AND (1 <= p4)) OR (((1 <= p2) AND (1 <= p7)) OR (((1 <= p2) AND (1 <= p6)) OR (((1 <= p2) AND (1 <= p9)) OR ((1 <= p2) AND (1 <= p8)))))))))))",
"processed_size": 487,
"rewrites": 59
},
"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": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((1 <= p2) AND (1 <= p7)) OR (G (((1 <= p27) AND (1 <= p34))) AND F (((1 <= p2) AND (1 <= p7))))))",
"processed_size": 102,
"rewrites": 59
},
"result":
{
"edges": 72,
"markings": 72,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1,
"X": 3,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"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": 6,
"visible_transitions": 0
},
"processed": "((F (((1 <= p0) AND (1 <= p1))) AND (((1 <= p25)) AND ((1 <= p32)))) U X (X (X (((1 <= p3) AND (1 <= p33))))))",
"processed_size": 110,
"rewrites": 59
},
"result":
{
"edges": 82,
"markings": 82,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 18
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"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": "F (G ((X (F (((1 <= p38) AND (1 <= p44)))) AND G (((p36 <= 0) OR (p42 <= 0))))))",
"processed_size": 81,
"rewrites": 59
},
"result":
{
"edges": 285,
"markings": 275,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F ((X (G (((1 <= p49) AND (1 <= p51) AND (1 <= p15) AND (1 <= p24) AND (1 <= p28) AND (1 <= p35)))) OR F (((1 <= p14) AND (1 <= p20) AND (1 <= p27) AND (1 <= p28)))))",
"processed_size": 166,
"rewrites": 59
},
"result":
{
"edges": 101,
"markings": 85,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p39) AND (1 <= p49))))",
"processed_size": 35,
"rewrites": 59
},
"result":
{
"edges": 41,
"markings": 41,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p0) AND (1 <= p1))))",
"processed_size": 33,
"rewrites": 59
},
"result":
{
"edges": 62,
"markings": 61,
"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": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p2) AND (1 <= p8)))))",
"processed_size": 185,
"rewrites": 59
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 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 (((((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)) AND ((p3 <= 0) OR (p34 <= 0))) OR (((p30 <= 0) OR (p43 <= 0)) AND ((p29 <= 0) OR (p42 <= 0)) AND ((p31 <= 0) OR (p44 <= 0))))) R (((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)) AND ((p3 <= 0) OR (p34 <= 0)))) U ((F ((((1 <= p30) AND (1 <= p43)) OR ((1 <= p29) AND (1 <= p42)) OR ((1 <= p31) AND (1 <= p44)))) OR (G ((((1 <= p30) AND (1 <= p43)) OR ((1 <= p29) AND (1 <= p42)) OR ((1 <= p31) AND (1 <= p44)))) AND F ((((1 <= p30) AND (1 <= p43)) OR ((1 <= p29) AND (1 <= p42)) OR ((1 <= p31) AND (1 <= p44)))))) AND (((1 <= p30) AND (1 <= p43)) OR ((1 <= p29) AND (1 <= p42)) OR ((1 <= p31) AND (1 <= p44)))))",
"processed_size": 698,
"rewrites": 59
},
"result":
{
"edges": 5691,
"markings": 2878,
"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
},
"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 <= p37) AND (1 <= p43)) OR ((1 <= p38) AND (1 <= p44)) OR ((1 <= p36) AND (1 <= p42)))) AND (F ((((p39 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p50 <= 0)) AND ((p40 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p41 <= 0) OR (p48 <= 0)))) OR (((1 <= p37) AND (1 <= p43)) OR ((1 <= p38) AND (1 <= p44)) OR ((1 <= p36) AND (1 <= p42)))))))",
"processed_size": 500,
"rewrites": 59
},
"result":
{
"edges": 461,
"markings": 390,
"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
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p38) AND (1 <= p44)))",
"processed_size": 31,
"rewrites": 59
},
"result":
{
"edges": 38,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": 12,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p38) AND (1 <= p44)))",
"processed_size": 31,
"rewrites": 59
},
"result":
{
"edges": 38,
"markings": 38,
"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"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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 ((G (((1 <= p50) AND (1 <= p53))) OR ((1 <= p50) AND (1 <= p53))))",
"processed_size": 68,
"rewrites": 59
},
"result":
{
"edges": 39,
"markings": 39,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"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": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 97488,
"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 **)))) : X((** OR (G(**) AND F(**)))) : (F((G(**) OR **)) OR G(**)) : ((F(**) AND (** AND **)) U X(X(X(**)))) : F(G((X(F(**)) AND G(*)))) : G(F(**)) : F((X(G(**)) OR F(**))) : F(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 no no no no no no ",
"value": "yes no no no no no 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: 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: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: X (F ((((1 <= p15) AND (1 <= p22) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p28) AND (1 <= p35))))) : (NOT((F (((((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33)) OR ((1 <= p3) AND (1 <= p34))) AND (((1 <= p30) AND (1 <= p43)) OR ((1 <= p29) AND (1 <= p42)) OR ((1 <= p31) AND (1 <= p44))))) U (((1 <= p3) AND (1 <= p32)) OR ((1 <= p3) AND (1 <= p33)) OR ((1 <= p3) AND (1 <= p34))))) U ((G ((((1 <= p30) AND (1 <= p43)) OR ((1 <= p29) AND (1 <= p42)) OR ((1 <= p31) AND (1 <= p44)))) U F ((((1 <= p30) AND (1 <= p43)) OR ((1 <= p29) AND (1 <= p42)) OR ((1 <= p31) AND (1 <= p44))))) AND (((1 <= p30) AND (1 <= p43)) OR ((1 <= p29) AND (1 <= p42)) OR ((1 <= p31) AND (1 <= p44))))) : G (F ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p2) AND (1 <= p8))))) : G ((((X (G ((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48))))) OR ((1 <= p10) AND (1 <= p39))) OR ((1 <= p11) AND (1 <= p40))) OR ((1 <= p12) AND (1 <= p41)))) : X (X (F (((((((NOT(F ((((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48))) U (((1 <= p30) AND (1 <= p43)) OR ((1 <= p29) AND (1 <= p42)) OR ((1 <= p31) AND (1 <= p44)))) U (((p39 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p50 <= 0)) AND ((p40 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p41 <= 0) OR (p48 <= 0)))))) OR ((1 <= p2) AND (1 <= p5))) OR ((1 <= p2) AND (1 <= p4))) OR ((1 <= p2) AND (1 <= p7))) OR ((1 <= p2) AND (1 <= p6))) OR ((1 <= p2) AND (1 <= p9))) OR ((1 <= p2) AND (1 <= p8)))))) : X (F (X (G ((NOT(G ((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48))))) U (((1 <= p37) AND (1 <= p43)) OR ((1 <= p38) AND (1 <= p44)) OR ((1 <= p36) AND (1 <= p42)))))))) : X ((G (((1 <= p27) AND (1 <= p34))) U ((1 <= p2) AND (1 <= p7)))) : (F ((NOT(G (((1 <= p50) AND (1 <= p53)))) U (G (((1 <= p50) AND (1 <= p53))) OR ((1 <= p50) AND (1 <= p53))))) OR G (((1 <= p38) AND (1 <= p44)))) : (((F ((((1 <= p0) AND (1 <= p1) AND (1 <= p31) AND (1 <= p44)) U F (((1 <= p0) AND (1 <= p1))))) AND ((1 <= p25))) AND ((1 <= p32))) U X (X (X (((1 <= p3) AND (1 <= p33)))))) : NOT(G (F (X ((NOT(X ((X (((1 <= p25) AND (1 <= p32))) U F (((1 <= p38) AND (1 <= p44)))))) OR F (((1 <= p36) AND (1 <= p42)))))))) : F (G (F (((1 <= p39) AND (1 <= p49))))) : F ((G (X (((1 <= p49) AND (1 <= p51) AND (1 <= p15) AND (1 <= p24) AND (1 <= p28) AND (1 <= p35)))) OR F (((1 <= p14) AND (1 <= p20) AND (1 <= p27) AND (1 <= p28))))) : (((1 <= p0) AND (1 <= p8) AND (1 <= p28)) U F (G (((1 <= p0) AND (1 <= p1)))))
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:431
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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 <= p15) AND (1 <= p22) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p15) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p15) AND (1 <= p22) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p28) AND (1 <= p35)) OR ((1 <= p15) AND (1 <=... (shortened)
lola: processed formula length: 563
lola: 59 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 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48))))) OR (((1 <= p10) AND (1 <= p39)) OR (((1 <= p11) AND (1 <= p40)) OR ((1 <= p12) AND (1 <= p41))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48))))) OR (((1 <= p10) AND (1 <= p39)) OR (((1 <= p11) AND (1 <= p40)) OR ((1 <= p12) AND (1 <= p41))))))
lola: processed formula length: 396
lola: 59 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 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48)))) OR (((1 <= p2) AND (1 <= p5)) OR (((1 <= p2) AND (1 <= p4)) OR (((1 <= p2) AND (1 <= p7)) OR (((1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G ((((1 <= p39) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p48)) OR ((1 <= p40) AND (1 <= p50)) OR ((1 <= p40) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p41) AND (1 <= p48)))) OR (((1 <= p2) AND (1 <= p5)) OR (((1 <= p2) AND (1 <= p4)) OR (((1 <= p2) AND (1 <= p7)) OR (((1 <=... (shortened)
lola: processed formula length: 487
lola: 59 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: X ((((1 <= p2) AND (1 <= p7)) OR (G (((1 <= p27) AND (1 <= p34))) AND F (((1 <= p2) AND (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p2) AND (1 <= p7)) OR (G (((1 <= p27) AND (1 <= p34))) AND F (((1 <= p2) AND (1 <= p7))))))
lola: processed formula length: 102
lola: 59 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: 72 markings, 72 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p0) AND (1 <= p1))) AND (((1 <= p25)) AND ((1 <= p32)))) U X (X (X (((1 <= p3) AND (1 <= p33))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (((1 <= p0) AND (1 <= p1))) AND (((1 <= p25)) AND ((1 <= p32)))) U X (X (X (((1 <= p3) AND (1 <= p33))))))
lola: processed formula length: 110
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 18 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 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F (((1 <= p38) AND (1 <= p44)))) AND G (((p36 <= 0) OR (p42 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F (((1 <= p38) AND (1 <= p44)))) AND G (((p36 <= 0) OR (p42 <= 0))))))
lola: processed formula length: 81
lola: 59 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: 275 markings, 285 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G (((1 <= p49) AND (1 <= p51) AND (1 <= p15) AND (1 <= p24) AND (1 <= p28) AND (1 <= p35)))) OR F (((1 <= p14) AND (1 <= p20) AND (1 <= p27) AND (1 <= p28)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G (((1 <= p49) AND (1 <= p51) AND (1 <= p15) AND (1 <= p24) AND (1 <= p28) AND (1 <= p35)))) OR F (((1 <= p14) AND (1 <= p20) AND (1 <= p27) AND (1 <= p28)))))
lola: processed formula length: 166
lola: 59 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: 85 markings, 101 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p39) AND (1 <= p49))))
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 <= p39) AND (1 <= p49))))
lola: processed formula length: 35
lola: 59 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: 41 markings, 41 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p0) AND (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p0) AND (1 <= p1))))
lola: processed formula length: 33
lola: 59 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: 61 markings, 62 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p2) AND (1 <= p8)))))
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 <= p2) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p4)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p2) AND (1 <= p8)))))
lola: processed formula length: 185
lola: 59 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: 65 markings, 65 edges
lola: ========================================
lola: subprocess 10 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)) AND ((p3 <= 0) OR (p34 <= 0))) OR (((p30 <= 0) OR (p43 <= 0)) AND ((p29 <= 0) OR (p42 <= 0)) AND ((p31 <= 0) OR (p44 <= 0))))) R (((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)) AND ((p3 <= 0) OR (p34 <= 0)))) U ((F ((((1 <= p30) AND (1 <= p43)) OR ((1 <= p29) AND (1 <= p42)) OR ((1 <= p31) AND (1 <= p44)))) OR (G (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)) AND ((p3 <= 0) OR (p34 <= 0))) OR (((p30 <= 0) OR (p43 <= 0)) AND ((p29 <= 0) OR (p42 <= 0)) AND ((p31 <= 0) OR (p44 <= 0))))) R (((p3 <= 0) OR (p32 <= 0)) AND ((p3 <= 0) OR (p33 <= 0)) AND ((p3 <= 0) OR (p34 <= 0)))) U ((F ((((1 <= p30) AND (1 <= p43)) OR ((1 <= p29) AND (1 <= p42)) OR ((1 <= p31) AND (1 <= p44)))) OR (G (... (shortened)
lola: processed formula length: 698
lola: 59 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: 2878 markings, 5691 edges
lola: ========================================
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((1 <= p37) AND (1 <= p43)) OR ((1 <= p38) AND (1 <= p44)) OR ((1 <= p36) AND (1 <= p42)))) AND (F ((((p39 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p50 <= 0)) AND ((p40 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p41 <= 0) OR (p48 <= 0)))) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p37) AND (1 <= p43)) OR ((1 <= p38) AND (1 <= p44)) OR ((1 <= p36) AND (1 <= p42)))) AND (F ((((p39 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p48 <= 0)) AND ((p40 <= 0) OR (p50 <= 0)) AND ((p40 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p41 <= 0) OR (p48 <= 0)))) ... (shortened)
lola: processed formula length: 500
lola: 59 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: 390 markings, 461 edges
lola: ========================================
lola: subprocess 12 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G (((1 <= p50) AND (1 <= p53))) OR ((1 <= p50) AND (1 <= p53)))) OR G (((1 <= p38) AND (1 <= p44))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p38) AND (1 <= p44)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p38) AND (1 <= p44)))
lola: processed formula length: 31
lola: 59 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: 38 markings, 38 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((G (((1 <= p50) AND (1 <= p53))) OR ((1 <= p50) AND (1 <= p53)))) OR G (((1 <= p38) AND (1 <= p44))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (((1 <= p38) AND (1 <= p44)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p38) AND (1 <= p44)))
lola: processed formula length: 31
lola: 59 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: 38 markings, 38 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p50) AND (1 <= p53))) OR ((1 <= p50) AND (1 <= p53))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p50) AND (1 <= p53))) OR ((1 <= p50) AND (1 <= p53))))
lola: processed formula length: 68
lola: 59 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: 39 markings, 39 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no no no no no no no
lola:
preliminary result: yes no no no no no no no no no no no no
lola: memory consumption: 97488 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-PT-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-PT-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-162089471100134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-03.tgz
mv SafeBus-PT-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 ;