About the Execution of ITS-LoLa for SafeBus-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15745.380 | 3600000.00 | 11904.00 | 88.10 | FFFFTFFTTFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r186-oct2-158987938900394.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
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 r186-oct2-158987938900394
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 3.2K Apr 12 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 12 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 11 13:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 13:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 10 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 9 23:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 9 23:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 93K Mar 24 05:38 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 1591238439316
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:40:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 02:40:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:40:41] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2020-06-04 02:40:41] [INFO ] Transformed 57 places.
[2020-06-04 02:40:41] [INFO ] Transformed 91 transitions.
[2020-06-04 02:40:41] [INFO ] Parsed PT model containing 57 places and 91 transitions in 89 ms.
Reduce places removed 3 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 202 ms. (steps per millisecond=495 ) properties seen :[1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]
[2020-06-04 02:40:41] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2020-06-04 02:40:41] [INFO ] Computed 17 place invariants in 10 ms
[2020-06-04 02:40:42] [INFO ] [Real]Absence check using 7 positive place invariants in 45 ms returned unsat
[2020-06-04 02:40:42] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-04 02:40:42] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-04 02:40:42] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-04 02:40:42] [INFO ] Flatten gal took : 36 ms
FORMULA SafeBus-PT-03-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:40:42] [INFO ] Flatten gal took : 12 ms
[2020-06-04 02:40:42] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2020-06-04 02:40:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SafeBus-PT-03 @ 3570 seconds
FORMULA SafeBus-PT-03-04 TRUE 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
FORMULA SafeBus-PT-03-12 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-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-08 TRUE 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-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-11 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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:40:42 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 1,
"aneg": 1,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "(((p15 <= 0) OR (p22 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p17 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p20 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p24 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p21 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p23 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p18 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p19 <= 0) OR (p28 <= 0) OR (p35 <= 0)))",
"processed_size": 555,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 63
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(X (((p15 <= 0) OR (p23 <= 0) OR (p28 <= 0) OR (p35 <= 0))) U G (((p27 <= 0) OR (p34 <= 0))))",
"processed_size": 97,
"rewrites": 65
},
"result":
{
"edges": 223,
"markings": 223,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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 <= p49) AND (1 <= p52)))",
"processed_size": 31,
"rewrites": 65
},
"result":
{
"edges": 38,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p13 <= 0) OR (p17 <= 0) OR (p28 <= 0) OR (p35 <= 0)) R ((p49 <= 0) OR (p52 <= 0)))",
"processed_size": 89,
"rewrites": 65
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F (((1 <= p0) AND (1 <= p1))))",
"processed_size": 33,
"rewrites": 65
},
"result":
{
"edges": 82,
"markings": 82,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((((p1 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p11 <= 0))))",
"processed_size": 94,
"rewrites": 65
},
"result":
{
"edges": 49,
"markings": 49,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((p15 <= 0) OR (p24 <= 0) OR (p28 <= 0) OR (p35 <= 0)))",
"processed_size": 61,
"rewrites": 65
},
"result":
{
"edges": 98,
"markings": 98,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F (((F (((1 <= p0) AND (1 <= p1))) AND ((p30 <= 0) OR (p43 <= 0))) OR ((p1 <= 0) OR (p12 <= 0)))))",
"processed_size": 102,
"rewrites": 65
},
"result":
{
"edges": 13282,
"markings": 5009,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"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": 8,
"visible_transitions": 0
},
"processed": "(((((1 <= p11) AND (1 <= p46)) U ((1 <= p11) AND (1 <= p46))) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p27) AND (1 <= p28))) R ((p25 <= 0) OR (p32 <= 0)))",
"processed_size": 154,
"rewrites": 65
},
"result":
{
"edges": 193,
"markings": 109,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"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": 1,
"U": 1,
"X": 0,
"aconj": 25,
"adisj": 7,
"aneg": 1,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(F ((((p30 <= 0) OR (p43 <= 0)) AND ((p29 <= 0) OR (p42 <= 0)) AND ((p31 <= 0) OR (p44 <= 0)))) U G ((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)))) AND (((((1 <= p30) AND (1 <= p43)) OR ((1 <= p29) AND (1 <= p42)) OR ((1 <= p31) AND (1 <= p44))) OR (((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)))) AND (((p10 <= 0) OR (p39 <= 0)) AND ((p11 <= 0) OR (p40 <= 0)) AND ((p12 <= 0) OR (p41 <= 0)))))))",
"processed_size": 886,
"rewrites": 65
},
"result":
{
"edges": 124,
"markings": 110,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"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": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 57,
"adisj": 3,
"aneg": 0,
"comp": 222,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 222,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "F (G ((G ((((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46)))) AND ((((1 <= p14) AND (1 <= p21) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p22) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p22) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p22) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p26) AND (1 <= p28))) AND (((1 <= p14) AND (1 <= p21) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p22) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p22) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p22) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p26) AND (1 <= p28)))))))",
"processed_size": 3461,
"rewrites": 65
},
"result":
{
"edges": 85,
"markings": 84,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p2 <= 0) OR (p5 <= 0))",
"processed_size": 25,
"rewrites": 67
},
"result":
{
"edges": 60,
"markings": 60,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p2 <= 0) OR (p5 <= 0))",
"processed_size": 25,
"rewrites": 67
},
"result":
{
"edges": 60,
"markings": 60,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p11) AND (1 <= p46))) OR G (((1 <= p48) AND (1 <= p53)))))",
"processed_size": 72,
"rewrites": 65
},
"result":
{
"edges": 69,
"markings": 59,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 107084,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(*) : (X((X(**) OR (** OR (** OR **)))) OR F(**)) : (F(**) U G((F(**) AND ((** OR **) AND *)))) : F(G((G(**) AND (** AND **)))) : G(F(((F(**) AND *) OR (* OR *)))) : (X(**) U G(*)) : (((** U **) OR *) R *) : (G((F(**) OR G(**))) OR F(**)) : (((* R *) AND X(F(**))) OR (G(**) AND F(((* R *) AND X(F(**)))))) : G(*)"
},
"net":
{
"arcs": 529,
"conflict_clusters": 4,
"places": 54,
"places_significant": 37,
"singleton_clusters": 0,
"transitions": 91
},
"result":
{
"preliminary_value": "no yes no no yes no no no no no ",
"value": "no yes no no yes 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: 1728
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: NOT(F ((((1 <= p1) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p11))))) : (X ((((X ((((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)))) OR ((1 <= p3) AND (1 <= p32))) OR ((1 <= p3) AND (1 <= p33))) OR ((1 <= p3) AND (1 <= p34)))) OR 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))))) : (F ((((p30 <= 0) OR (p43 <= 0)) AND ((p29 <= 0) OR (p42 <= 0)) AND ((p31 <= 0) OR (p44 <= 0)))) U (G (((((1 <= p30) AND (1 <= p43)) OR ((1 <= p29) AND (1 <= p42)) OR ((1 <= p31) AND (1 <= p44))) U (((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))))) AND G (NOT(((((1 <= p10) AND (1 <= p39)) OR ((1 <= p11) AND (1 <= p40)) OR ((1 <= p12) AND (1 <= p41))) U F ((((1 <= p10) AND (1 <= p39)) OR ((1 <= p11) AND (1 <= p40)) OR ((1 <= p12) AND (1 <= p41))))))))) : ((((p14 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p28 <= 0)) AND ((p14 <= 0) OR (p19 <= 0) OR (p27 <= 0) OR (p28 <= 0)) AND ((p15 <= 0) OR (p23 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p15 <= 0) OR (p24 <= 0) OR (p27 <= 0) OR (p28 <= 0)) AND ((p14 <= 0) OR (p20 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p18 <= 0) OR (p26 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p27 <= 0) OR (p28 <= 0)) AND ((p14 <= 0) OR (p19 <= 0) OR (p26 <= 0) OR (p28 <= 0)) AND ((p15 <= 0) OR (p22 <= 0) OR (p27 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p17 <= 0) OR (p27 <= 0) OR (p28 <= 0)) AND ((p14 <= 0) OR (p21 <= 0) OR (p26 <= 0) OR (p28 <= 0)) AND ((p14 <= 0) OR (p21 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p15 <= 0) OR (p24 <= 0) OR (p26 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p18 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p26 <= 0) OR (p28 <= 0)) AND ((p15 <= 0) OR (p22 <= 0) OR (p26 <= 0) OR (p28 <= 0)) AND ((p14 <= 0) OR (p19 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p15 <= 0) OR (p24 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p17 <= 0) OR (p26 <= 0) OR (p28 <= 0)) AND ((p14 <= 0) OR (p20 <= 0) OR (p27 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p18 <= 0) OR (p27 <= 0) OR (p28 <= 0)) AND ((p14 <= 0) OR (p20 <= 0) OR (p26 <= 0) OR (p28 <= 0)) AND ((p15 <= 0) OR (p23 <= 0) OR (p27 <= 0) OR (p28 <= 0)) AND ((p15 <= 0) OR (p22 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p17 <= 0) OR (p25 <= 0) OR (p28 <= 0)) AND ((p15 <= 0) OR (p23 <= 0) OR (p26 <= 0) OR (p28 <= 0))) U F ((G ((G (X ((((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46))))) AND X ((((1 <= p14) AND (1 <= p21) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p22) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p22) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p22) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p26) AND (1 <= p28)))))) AND X (G ((((1 <= p14) AND (1 <= p21) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p22) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p21) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p22) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p18) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p26) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p22) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p26) AND (1 <= p28)))))))) : G (NOT(X (G (X (X ((((NOT(F (((1 <= p0) AND (1 <= p1)))) OR ((1 <= p30) AND (1 <= p43))) AND (1 <= p1)) AND (1 <= p12)))))))) : (X (((p15 <= 0) OR (p23 <= 0) OR (p28 <= 0) OR (p35 <= 0))) U NOT(F (((1 <= p27) AND (1 <= p34))))) : NOT(((NOT((((1 <= p11) AND (1 <= p46)) U ((1 <= p11) AND (1 <= p46)))) AND ((p13 <= 0) OR (p16 <= 0) OR (p27 <= 0) OR (p28 <= 0))) U ((1 <= p25) AND (1 <= p32)))) : (G ((F (((1 <= p11) AND (1 <= p46))) OR G (((1 <= p48) AND (1 <= p53))))) OR F (((1 <= p2) AND (1 <= p5)))) : (G (((1 <= p49) AND (1 <= p52))) U (NOT((((1 <= p13) AND (1 <= p17) AND (1 <= p28) AND (1 <= p35)) U ((1 <= p49) AND (1 <= p52)))) AND F (X (((1 <= p0) AND (1 <= p1)))))) : G (NOT(F (((1 <= p15) AND (1 <= p24) AND (1 <= p28) AND (1 <= p35)))))
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X ((((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 a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: 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 <= p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p15 <= 0) OR (p22 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p17 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p20 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p24 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p21 <= 0) OR (p28 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p23 <= 0) ... (shortened)
lola: processed formula length: 555
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p15 <= 0) OR (p23 <= 0) OR (p28 <= 0) OR (p35 <= 0))) U G (((p27 <= 0) OR (p34 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((p15 <= 0) OR (p23 <= 0) OR (p28 <= 0) OR (p35 <= 0))) U G (((p27 <= 0) OR (p34 <= 0))))
lola: processed formula length: 97
lola: 65 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: 223 markings, 223 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p13 <= 0) OR (p17 <= 0) OR (p28 <= 0) OR (p35 <= 0)) R ((p49 <= 0) OR (p52 <= 0))) AND X (F (((1 <= p0) AND (1 <= p1))))) OR (G (((1 <= p49) AND (1 <= p52))) AND F (((((p13 <= 0) OR (p17 <= 0) OR (p28 <= 0) OR (p35 <= 0)) R ((p49 <= 0) OR (p52 <= 0))) AND X (F (((1 <= p0) AND (1 <= p1))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p49) AND (1 <= p52)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p49) AND (1 <= p52)))
lola: processed formula length: 31
lola: 65 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: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p13 <= 0) OR (p17 <= 0) OR (p28 <= 0) OR (p35 <= 0)) R ((p49 <= 0) OR (p52 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p13 <= 0) OR (p17 <= 0) OR (p28 <= 0) OR (p35 <= 0)) R ((p49 <= 0) OR (p52 <= 0)))
lola: processed formula length: 89
lola: 65 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p0) AND (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p0) AND (1 <= p1))))
lola: processed formula length: 33
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 82 markings, 82 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p1 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p11 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p1 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p11 <= 0))))
lola: processed formula length: 94
lola: 65 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: 49 markings, 49 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p15 <= 0) OR (p24 <= 0) OR (p28 <= 0) OR (p35 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p15 <= 0) OR (p24 <= 0) OR (p28 <= 0) OR (p35 <= 0)))
lola: processed formula length: 61
lola: 65 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: 98 markings, 98 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((F (((1 <= p0) AND (1 <= p1))) AND ((p30 <= 0) OR (p43 <= 0))) OR ((p1 <= 0) OR (p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((F (((1 <= p0) AND (1 <= p1))) AND ((p30 <= 0) OR (p43 <= 0))) OR ((p1 <= 0) OR (p12 <= 0)))))
lola: processed formula length: 102
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5009 markings, 13282 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p11) AND (1 <= p46)) U ((1 <= p11) AND (1 <= p46))) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p27) AND (1 <= p28))) R ((p25 <= 0) OR (p32 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((1 <= p11) AND (1 <= p46)) U ((1 <= p11) AND (1 <= p46))) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p27) AND (1 <= p28))) R ((p25 <= 0) OR (p32 <= 0)))
lola: processed formula length: 154
lola: 65 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: 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: 109 markings, 193 edges
lola: ========================================
lola: subprocess 7 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((p30 <= 0) OR (p43 <= 0)) AND ((p29 <= 0) OR (p42 <= 0)) AND ((p31 <= 0) OR (p44 <= 0)))) U G ((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)))) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((((p30 <= 0) OR (p43 <= 0)) AND ((p29 <= 0) OR (p42 <= 0)) AND ((p31 <= 0) OR (p44 <= 0)))) U G ((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)))) AND (... (shortened)
lola: processed formula length: 886
lola: 65 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: 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: 110 markings, 124 edges
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46)))) AND ((((1 <= p14) AND (1 <= p21) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p25)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((((1 <= p12) AND (1 <= p47)) OR ((1 <= p10) AND (1 <= p45)) OR ((1 <= p11) AND (1 <= p46)))) AND ((((1 <= p14) AND (1 <= p21) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p19) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p23) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p15) AND (1 <= p24) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p14) AND (1 <= p20) AND (1 <= p25)... (shortened)
lola: processed formula length: 3461
lola: 65 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: 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: 84 markings, 85 edges
lola: ========================================
lola: subprocess 9 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (((1 <= p11) AND (1 <= p46))) OR G (((1 <= p48) AND (1 <= p53))))) OR F (((1 <= p2) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p2) AND (1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p2 <= 0) OR (p5 <= 0))
lola: processed formula length: 25
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 60 markings, 60 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: (G ((F (((1 <= p11) AND (1 <= p46))) OR G (((1 <= p48) AND (1 <= p53))))) OR F (((1 <= p2) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (((1 <= p2) AND (1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p2 <= 0) OR (p5 <= 0))
lola: processed formula length: 25
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 60 markings, 60 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p11) AND (1 <= p46))) OR G (((1 <= p48) AND (1 <= p53)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p11) AND (1 <= p46))) OR G (((1 <= p48) AND (1 <= p53)))))
lola: processed formula length: 72
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 59 markings, 69 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes no no no no no
lola:
preliminary result: no yes no no yes no no no no no
lola: memory consumption: 107084 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="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is 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 r186-oct2-158987938900394"
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 ;