About the Execution of ITS-LoLa for DNAwalker-PT-08ringLL
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15745.970 | 3600000.00 | 1680176.00 | 588.80 | FFTFFFFFTTFFTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987881900138.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DNAwalker-PT-08ringLL, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881900138
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 4.0K Mar 31 04:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 31 04:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 29 20:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 29 20:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 27 06:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 112K Mar 24 05:37 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 DNAwalker-PT-08ringLL-00
FORMULA_NAME DNAwalker-PT-08ringLL-01
FORMULA_NAME DNAwalker-PT-08ringLL-02
FORMULA_NAME DNAwalker-PT-08ringLL-03
FORMULA_NAME DNAwalker-PT-08ringLL-04
FORMULA_NAME DNAwalker-PT-08ringLL-05
FORMULA_NAME DNAwalker-PT-08ringLL-06
FORMULA_NAME DNAwalker-PT-08ringLL-07
FORMULA_NAME DNAwalker-PT-08ringLL-08
FORMULA_NAME DNAwalker-PT-08ringLL-09
FORMULA_NAME DNAwalker-PT-08ringLL-10
FORMULA_NAME DNAwalker-PT-08ringLL-11
FORMULA_NAME DNAwalker-PT-08ringLL-12
FORMULA_NAME DNAwalker-PT-08ringLL-13
FORMULA_NAME DNAwalker-PT-08ringLL-14
FORMULA_NAME DNAwalker-PT-08ringLL-15
=== Now, execution of the tool begins
BK_START 1591205271825
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:27:53] [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-03 17:27:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:27:53] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2020-06-03 17:27:53] [INFO ] Transformed 27 places.
[2020-06-03 17:27:53] [INFO ] Transformed 260 transitions.
[2020-06-03 17:27:53] [INFO ] Parsed PT model containing 27 places and 260 transitions in 115 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 8030 resets, run finished after 373 ms. (steps per millisecond=268 ) properties seen :[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, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-03 17:27:54] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2020-06-03 17:27:54] [INFO ] Computed 0 place invariants in 6 ms
[2020-06-03 17:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:27:54] [INFO ] [Real]Absence check using state equation in 90 ms returned unsat
[2020-06-03 17:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:27:54] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2020-06-03 17:27:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:27:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:27:54] [INFO ] [Nat]Absence check using state equation in 178 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 17:27:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 17:27:55] [INFO ] Flatten gal took : 69 ms
FORMULA DNAwalker-PT-08ringLL-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-08ringLL-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 17:27:55] [INFO ] Flatten gal took : 18 ms
[2020-06-03 17:27:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-03 17:27:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DNAwalker-PT-08ringLL @ 3570 seconds
FORMULA DNAwalker-PT-08ringLL-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1909
rslt: Output for LTLFireability @ DNAwalker-PT-08ringLL
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 17:27:55 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 194
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 194
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 (((1 <= p21) AND (2 <= p23)))",
"processed_size": 31,
"rewrites": 79
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 209
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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 (((p3 <= 0) OR (p11 <= 1)))",
"processed_size": 30,
"rewrites": 79
},
"result":
{
"edges": 73,
"markings": 43,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 226
},
"exit":
{
"localtimelimitreached": false
},
"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 <= p21) AND (2 <= p23)))",
"processed_size": 31,
"rewrites": 79
},
"result":
{
"edges": 9,
"markings": 9,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 209
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 209
},
"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": "((p17 <= 1) OR (p19 <= 0))",
"processed_size": 27,
"rewrites": 81
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 44
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 226
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 (((2 <= p17) AND (1 <= p19)))",
"processed_size": 31,
"rewrites": 79
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 247
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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 (G (((2 <= p19) AND (1 <= p23))))",
"processed_size": 35,
"rewrites": 79
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 226
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((X (G (((2 <= p7) AND (1 <= p9)))) OR (F (((2 <= p11))) OR (((2 <= p16) AND (1 <= p26)) OR ((1 <= p13) AND (2 <= p16))))))",
"processed_size": 125,
"rewrites": 79
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 249
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"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": 6,
"visible_transitions": 0
},
"processed": "X ((F (G (((1 <= p1) AND (2 <= p11)))) AND G (F ((X (G (((2 <= p13) AND (1 <= p15)))) OR ((p14 <= 1) OR (p19 <= 0)))))))",
"processed_size": 120,
"rewrites": 79
},
"result":
{
"edges": 110911648,
"markings": 15311216,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 267
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((X (F ((X (((p15 <= 0) OR (p16 <= 1))) OR G (((p23 <= 1) OR (p26 <= 0)))))) AND F (G (((2 <= p1) AND (1 <= p3))))) U ((2 <= p3) AND (1 <= p26)))",
"processed_size": 147,
"rewrites": 79
},
"result":
{
"edges": 13147,
"markings": 10959,
"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": 301
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 301
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p12 <= 0) OR (p14 <= 1))",
"processed_size": 27,
"rewrites": 79
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 344
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G (((p17 <= 1) OR (p21 <= 0))) OR ((p12 <= 0) OR (p14 <= 1))))",
"processed_size": 67,
"rewrites": 79
},
"result":
{
"edges": 45708381,
"markings": 5763212,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 338
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "X (((p11 <= 0) OR (p17 <= 1) OR ((2 <= p1) AND (1 <= p11))))",
"processed_size": 62,
"rewrites": 79
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "(F (((1 <= p1) AND (2 <= p24))) U X (((1 <= p1) AND (2 <= p24))))",
"processed_size": 65,
"rewrites": 79
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 474
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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 (X (G (((1 <= p19) AND (2 <= p23)))))",
"processed_size": 39,
"rewrites": 79
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((F ((F (G (((p19 <= 1)))) AND ((p0 <= 1) OR (p1 <= 0)))) OR ((2 <= p1) AND (1 <= p7)))))",
"processed_size": 95,
"rewrites": 79
},
"result":
{
"edges": 292630515,
"markings": 33588712,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"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": 717
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((X ((F (((1 <= p1) AND (2 <= p26))) OR ((1 <= p1) AND (2 <= p26)))) OR (F (((1 <= p3) AND (2 <= p5))) OR ((p5 <= 1) OR (p24 <= 0))))))",
"processed_size": 140,
"rewrites": 79
},
"result":
{
"edges": 21502326,
"markings": 2738697,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1069
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p3) AND (2 <= p7))) AND G (((1 <= p17) AND (2 <= p19)))))",
"processed_size": 71,
"rewrites": 79
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"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": 2138
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F ((F (G (((p1 <= 1)))) OR (1 <= p8))) AND (2 <= p1)))",
"processed_size": 58,
"rewrites": 79
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 1,
"aneg": 4,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G ((F ((((p15 <= 1) OR (p17 <= 0)) R ((p1 <= 1) OR (p15 <= 0)))) AND (((F (((2 <= p23) AND (1 <= p24))) AND ((2 <= p15) AND (1 <= p17))) U ((p11 <= 1) OR (p17 <= 0))) OR (((p15 <= 1) OR (p17 <= 0)) R ((p1 <= 1) OR (p15 <= 0)))))))",
"processed_size": 238,
"rewrites": 79
},
"result":
{
"edges": 262536089,
"markings": 40049688,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 47580,
"runtime": 1661.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(**) OR ((G(**) AND X(F(**))) OR (G(**) AND F((X(**) OR (G(**) AND X(F(**)))))))) : (X(G(**)) OR (X(F(**)) AND (F(**) OR X(**)))) : X(G((F((* R *)) AND (((F(**) AND (** AND **)) U **) OR (* R *))))) : G((X(G(**)) OR (F(**) OR (** OR **)))) : X((F(G(**)) AND G(F((X(G(**)) OR (** OR **)))))) : ((X(F((X(*) OR G(*)))) AND F(G(**))) U **) : F((F((F(G(*)) OR **)) AND **)) : (X((G(*) OR (** OR **))) AND **) : X(**) : (F(**) U X(**)) : X(X(G(**))) : X(F((F((F(G(*)) AND **)) OR **))) : X(G((X((F(**) OR **)) OR (F(**) OR (* OR *))))) : X((F(**) AND G(**)))"
},
"net":
{
"arcs": 760,
"conflict_clusters": 7,
"places": 27,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "no no yes no no no no no yes no no yes no no ",
"value": "no no yes no no no no no yes no no yes 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: 287/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 260 transitions, 27 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: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: (G (((p3 <= 0) OR (p11 <= 1))) U (G (((1 <= p21) AND (2 <= p23))) U X (((1 <= p21) AND (2 <= p23))))) : (X (G (((2 <= p19) AND (1 <= p23)))) OR (F (X (((2 <= p19) AND (1 <= p23)))) AND (F (((2 <= p17) AND (1 <= p19))) OR X (((2 <= p17) AND (1 <= p19)))))) : G (X (G (((((F (((2 <= p23) AND (1 <= p24))) AND (2 <= p15)) AND (1 <= p17)) U ((p11 <= 1) OR (p17 <= 0))) U NOT((((2 <= p15) AND (1 <= p17)) U ((2 <= p1) AND (1 <= p15)))))))) : G ((((G (X (((2 <= p7) AND (1 <= p9)))) OR F ((((1 <= p13) AND (2 <= p16)) U ((2 <= p11))))) OR ((2 <= p16) AND (1 <= p26))) OR ((1 <= p13) AND (2 <= p16)))) : X ((F (G (((1 <= p1) AND (2 <= p11)))) AND G (F (((G (X (((2 <= p13) AND (1 <= p15)))) OR (p14 <= 1)) OR (p19 <= 0)))))) : ((F (X (NOT(G ((X (((1 <= p15) AND (2 <= p16))) AND F (((2 <= p23) AND (1 <= p26)))))))) AND F (G (((2 <= p1) AND (1 <= p3))))) U ((2 <= p3) AND (1 <= p26))) : F ((F ((F (NOT(X (X (F (X (((2 <= p1)))))))) OR (1 <= p8))) AND (2 <= p1))) : (X (((NOT((((1 <= p16) AND (2 <= p26)) U F (((2 <= p17) AND (1 <= p21))))) OR (p12 <= 0)) OR (p14 <= 1))) AND ((p12 <= 0) OR (p14 <= 1))) : X (((p11 <= 0) OR (p17 <= 1) OR ((2 <= p1) AND (1 <= p11)))) : (F (((1 <= p1) AND (2 <= p24))) U X (((1 <= p1) AND (2 <= p24)))) : X (X (G (((1 <= p19) AND (2 <= p23))))) : F (X ((F ((NOT(G (F (((2 <= p19))))) AND ((p0 <= 1) OR (p1 <= 0)))) OR ((2 <= p1) AND (1 <= p7))))) : NOT(F (X ((((NOT(X ((F (((1 <= p1) AND (2 <= p26))) OR ((1 <= p1) AND (2 <= p26))))) AND NOT(F (((1 <= p3) AND (2 <= p5))))) AND (2 <= p5)) AND (1 <= p24))))) : (NOT(X (NOT(F (((1 <= p3) AND (2 <= p7)))))) AND X (G (((1 <= p17) AND (2 <= p19)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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:356
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: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:525
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 194 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p21) AND (2 <= p23))) OR ((G (((1 <= p21) AND (2 <= p23))) AND X (F (((1 <= p21) AND (2 <= p23))))) OR (G (((p3 <= 0) OR (p11 <= 1))) AND F ((X (((1 <= p21) AND (2 <= p23))) OR (G (((1 <= p21) AND (2 <= p23))) AND X (F (((1 <= p21) AND (2 <= p23))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 194 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p21) AND (2 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p21) AND (2 <= p23)))
lola: processed formula length: 31
lola: 79 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p3 <= 0) OR (p11 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p3 <= 0) OR (p11 <= 1)))
lola: processed formula length: 30
lola: 79 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: 43 markings, 73 edges
lola: ========================================
lola: subprocess 2 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p21) AND (2 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p21) AND (2 <= p23)))
lola: processed formula length: 31
lola: 79 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: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((2 <= p19) AND (1 <= p23)))) OR (X (F (((2 <= p19) AND (1 <= p23)))) AND (F (((2 <= p17) AND (1 <= p19))) OR X (((2 <= p17) AND (1 <= p19))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((2 <= p17) AND (1 <= p19)))
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: ((p17 <= 1) OR (p19 <= 0))
lola: processed formula length: 27
lola: 81 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((2 <= p17) AND (1 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((2 <= p17) AND (1 <= p19)))
lola: processed formula length: 31
lola: 79 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((2 <= p19) AND (1 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((2 <= p19) AND (1 <= p23))))
lola: processed formula length: 35
lola: 79 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((((p15 <= 1) OR (p17 <= 0)) R ((p1 <= 1) OR (p15 <= 0)))) AND (((F (((2 <= p23) AND (1 <= p24))) AND ((2 <= p15) AND (1 <= p17))) U ((p11 <= 1) OR (p17 <= 0))) OR (((p15 <= 1) OR (p17 <= 0)) R ((p1 <= 1) OR (p15 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((((p15 <= 1) OR (p17 <= 0)) R ((p1 <= 1) OR (p15 <= 0)))) AND (((F (((2 <= p23) AND (1 <= p24))) AND ((2 <= p15) AND (1 <= p17))) U ((p11 <= 1) OR (p17 <= 0))) OR (((p15 <= 1) OR (p17 <= 0)) R ((p1 <= 1) OR (p15 <= 0)))))))
lola: processed formula length: 238
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 1315437 markings, 7642622 edges, 263087 markings/sec, 0 secs
lola: 2358690 markings, 13876531 edges, 208651 markings/sec, 5 secs
lola: 3368430 markings, 20126109 edges, 201948 markings/sec, 10 secs
lola: 4353732 markings, 26004882 edges, 197060 markings/sec, 15 secs
lola: 5351597 markings, 32108408 edges, 199573 markings/sec, 20 secs
lola: 6248136 markings, 37680729 edges, 179308 markings/sec, 25 secs
lola: 7275943 markings, 44188439 edges, 205561 markings/sec, 30 secs
lola: 8290611 markings, 50256258 edges, 202934 markings/sec, 35 secs
lola: 9217752 markings, 56176401 edges, 185428 markings/sec, 40 secs
lola: 10135454 markings, 61676673 edges, 183540 markings/sec, 45 secs
lola: 10684289 markings, 65305552 edges, 109767 markings/sec, 50 secs
lola: 11454991 markings, 70062734 edges, 154140 markings/sec, 55 secs
lola: 12190210 markings, 74859975 edges, 147044 markings/sec, 60 secs
lola: 12840551 markings, 78710576 edges, 130068 markings/sec, 65 secs
lola: 13533119 markings, 82992908 edges, 138514 markings/sec, 70 secs
lola: 14237965 markings, 87797080 edges, 140969 markings/sec, 75 secs
lola: 14980367 markings, 92795608 edges, 148480 markings/sec, 80 secs
lola: 15606197 markings, 96719274 edges, 125166 markings/sec, 85 secs
lola: 16436257 markings, 101957987 edges, 166012 markings/sec, 90 secs
lola: 17233172 markings, 107569506 edges, 159383 markings/sec, 95 secs
lola: 17964129 markings, 112362403 edges, 146191 markings/sec, 100 secs
lola: 18684460 markings, 117023090 edges, 144066 markings/sec, 105 secs
lola: 19354317 markings, 121371673 edges, 133971 markings/sec, 110 secs
lola: 20065863 markings, 125876969 edges, 142309 markings/sec, 115 secs
lola: 20786875 markings, 130117291 edges, 144202 markings/sec, 120 secs
lola: 21541950 markings, 135079101 edges, 151015 markings/sec, 125 secs
lola: 22319444 markings, 139735740 edges, 155499 markings/sec, 130 secs
lola: 22959772 markings, 144006806 edges, 128066 markings/sec, 135 secs
lola: 23777496 markings, 149200399 edges, 163545 markings/sec, 140 secs
lola: 24537246 markings, 154138359 edges, 151950 markings/sec, 145 secs
lola: 25064309 markings, 157503639 edges, 105413 markings/sec, 150 secs
lola: 25811815 markings, 162294675 edges, 149501 markings/sec, 155 secs
lola: 26412855 markings, 166675154 edges, 120208 markings/sec, 160 secs
lola: 27158760 markings, 171227472 edges, 149181 markings/sec, 165 secs
lola: 27722475 markings, 175246180 edges, 112743 markings/sec, 170 secs
lola: 28554707 markings, 180539524 edges, 166446 markings/sec, 175 secs
lola: 29400701 markings, 185797772 edges, 169199 markings/sec, 180 secs
lola: 30126799 markings, 190682186 edges, 145220 markings/sec, 185 secs
lola: 30948915 markings, 196084020 edges, 164423 markings/sec, 190 secs
lola: 31680610 markings, 201316241 edges, 146339 markings/sec, 195 secs
lola: 32460768 markings, 206113133 edges, 156032 markings/sec, 200 secs
lola: 33290152 markings, 211468014 edges, 165877 markings/sec, 205 secs
lola: 34073883 markings, 217282742 edges, 156746 markings/sec, 210 secs
lola: 34883212 markings, 222822152 edges, 161866 markings/sec, 215 secs
lola: 35614101 markings, 227513792 edges, 146178 markings/sec, 220 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 5577588 KB
lola: time consumption: 1080 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G (((2 <= p7) AND (1 <= p9)))) OR (F (((2 <= p11))) OR (((2 <= p16) AND (1 <= p26)) OR ((1 <= p13) AND (2 <= p16))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G (((2 <= p7) AND (1 <= p9)))) OR (F (((2 <= p11))) OR (((2 <= p16) AND (1 <= p26)) OR ((1 <= p13) AND (2 <= p16))))))
lola: processed formula length: 125
lola: 79 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((1 <= p1) AND (2 <= p11)))) AND G (F ((X (G (((2 <= p13) AND (1 <= p15)))) OR ((p14 <= 1) OR (p19 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((1 <= p1) AND (2 <= p11)))) AND G (F ((X (G (((2 <= p13) AND (1 <= p15)))) OR ((p14 <= 1) OR (p19 <= 0)))))))
lola: processed formula length: 120
lola: 79 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: 1439726 markings, 9699105 edges, 287945 markings/sec, 0 secs
lola: 2569406 markings, 17688622 edges, 225936 markings/sec, 5 secs
lola: 3638494 markings, 25097580 edges, 213818 markings/sec, 10 secs
lola: 4734798 markings, 32725146 edges, 219261 markings/sec, 15 secs
lola: 5666235 markings, 39356785 edges, 186287 markings/sec, 20 secs
lola: 6664355 markings, 46837802 edges, 199624 markings/sec, 25 secs
lola: 7541622 markings, 53128999 edges, 175453 markings/sec, 30 secs
lola: 8477607 markings, 59631305 edges, 187197 markings/sec, 35 secs
lola: 9149920 markings, 64539939 edges, 134463 markings/sec, 40 secs
lola: 9975477 markings, 70670123 edges, 165111 markings/sec, 45 secs
lola: 10801064 markings, 76616106 edges, 165117 markings/sec, 50 secs
lola: 11633339 markings, 82641739 edges, 166455 markings/sec, 55 secs
lola: 12489699 markings, 88993666 edges, 171272 markings/sec, 60 secs
lola: 13246728 markings, 94680004 edges, 151406 markings/sec, 65 secs
lola: 14136537 markings, 101408586 edges, 177962 markings/sec, 70 secs
lola: 14977181 markings, 108265516 edges, 168129 markings/sec, 75 secs
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: 15311216 markings, 110911648 edges
lola: ========================================
lola: subprocess 5 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (F ((X (((p15 <= 0) OR (p16 <= 1))) OR G (((p23 <= 1) OR (p26 <= 0)))))) AND F (G (((2 <= p1) AND (1 <= p3))))) U ((2 <= p3) AND (1 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (F ((X (((p15 <= 0) OR (p16 <= 1))) OR G (((p23 <= 1) OR (p26 <= 0)))))) AND F (G (((2 <= p1) AND (1 <= p3))))) U ((2 <= p3) AND (1 <= p26)))
lola: processed formula length: 147
lola: 79 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: 10959 markings, 13147 edges
lola: ========================================
lola: subprocess 6 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G (((p17 <= 1) OR (p21 <= 0))) OR ((p12 <= 0) OR (p14 <= 1)))) AND ((p12 <= 0) OR (p14 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p12 <= 0) OR (p14 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p12 <= 0) OR (p14 <= 1))
lola: processed formula length: 27
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p17 <= 1) OR (p21 <= 0))) OR ((p12 <= 0) OR (p14 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p17 <= 1) OR (p21 <= 0))) OR ((p12 <= 0) OR (p14 <= 1))))
lola: processed formula length: 67
lola: 79 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: 914009 markings, 6733085 edges, 182802 markings/sec, 0 secs
lola: 1722711 markings, 12987794 edges, 161740 markings/sec, 5 secs
lola: 2447647 markings, 18711230 edges, 144987 markings/sec, 10 secs
lola: 3204928 markings, 24560948 edges, 151456 markings/sec, 15 secs
lola: 3929209 markings, 30348630 edges, 144856 markings/sec, 20 secs
lola: 4671657 markings, 36219871 edges, 148490 markings/sec, 25 secs
lola: 5432576 markings, 42705761 edges, 152184 markings/sec, 30 secs
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: 5763212 markings, 45708381 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p11 <= 0) OR (p17 <= 1) OR ((2 <= p1) AND (1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p11 <= 0) OR (p17 <= 1) OR ((2 <= p1) AND (1 <= p11))))
lola: processed formula length: 62
lola: 79 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 8 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p1) AND (2 <= p24))) U X (((1 <= p1) AND (2 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p1) AND (2 <= p24))) U X (((1 <= p1) AND (2 <= p24))))
lola: processed formula length: 65
lola: 79 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p19) AND (2 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p19) AND (2 <= p23)))))
lola: processed formula length: 39
lola: 79 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((F (G (((p19 <= 1)))) AND ((p0 <= 1) OR (p1 <= 0)))) OR ((2 <= p1) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((F (G (((p19 <= 1)))) AND ((p0 <= 1) OR (p1 <= 0)))) OR ((2 <= p1) AND (1 <= p7)))))
lola: processed formula length: 95
lola: 79 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: 1224267 markings, 9426783 edges, 244853 markings/sec, 0 secs
lola: 2161276 markings, 17037376 edges, 187402 markings/sec, 5 secs
lola: 3051521 markings, 24342574 edges, 178049 markings/sec, 10 secs
lola: 3873079 markings, 30982196 edges, 164312 markings/sec, 15 secs
lola: 4737322 markings, 37984247 edges, 172849 markings/sec, 20 secs
lola: 5511781 markings, 44445772 edges, 154892 markings/sec, 25 secs
lola: 6341923 markings, 51502827 edges, 166028 markings/sec, 30 secs
lola: 7042727 markings, 57830090 edges, 140161 markings/sec, 35 secs
lola: 7832783 markings, 64223548 edges, 158011 markings/sec, 40 secs
lola: 8594726 markings, 70365624 edges, 152389 markings/sec, 45 secs
lola: 9292388 markings, 76126085 edges, 139532 markings/sec, 50 secs
lola: 10066477 markings, 82678005 edges, 154818 markings/sec, 55 secs
lola: 10692419 markings, 88251430 edges, 125188 markings/sec, 60 secs
lola: 11485853 markings, 94723634 edges, 158687 markings/sec, 65 secs
lola: 12287278 markings, 101454397 edges, 160285 markings/sec, 70 secs
lola: 13057332 markings, 108059726 edges, 154011 markings/sec, 75 secs
lola: 13911535 markings, 115734894 edges, 170841 markings/sec, 80 secs
lola: 14707970 markings, 123558316 edges, 159287 markings/sec, 85 secs
lola: 15482730 markings, 130512621 edges, 154952 markings/sec, 90 secs
lola: 16314775 markings, 137122522 edges, 166409 markings/sec, 95 secs
lola: 17025328 markings, 143233086 edges, 142111 markings/sec, 100 secs
lola: 17844481 markings, 150088350 edges, 163831 markings/sec, 105 secs
lola: 18594075 markings, 156326449 edges, 149919 markings/sec, 110 secs
lola: 19299065 markings, 162227697 edges, 140998 markings/sec, 115 secs
lola: 20064541 markings, 168580558 edges, 153095 markings/sec, 120 secs
lola: 20753484 markings, 174731932 edges, 137789 markings/sec, 125 secs
lola: 21494901 markings, 181151033 edges, 148283 markings/sec, 130 secs
lola: 22227585 markings, 187665367 edges, 146537 markings/sec, 135 secs
lola: 22856895 markings, 193555499 edges, 125862 markings/sec, 140 secs
lola: 23573936 markings, 199848106 edges, 143408 markings/sec, 145 secs
lola: 24342292 markings, 206200633 edges, 153671 markings/sec, 150 secs
lola: 24991617 markings, 211983866 edges, 129865 markings/sec, 155 secs
lola: 25768294 markings, 218696174 edges, 155335 markings/sec, 160 secs
lola: 26517701 markings, 225323390 edges, 149881 markings/sec, 165 secs
lola: 27092126 markings, 230814661 edges, 114885 markings/sec, 170 secs
lola: 27908258 markings, 237719809 edges, 163226 markings/sec, 175 secs
lola: 28694692 markings, 244582081 edges, 157287 markings/sec, 180 secs
lola: 29290520 markings, 250418491 edges, 119166 markings/sec, 185 secs
lola: 30098901 markings, 257688915 edges, 161676 markings/sec, 190 secs
lola: 30861996 markings, 264839529 edges, 152619 markings/sec, 195 secs
lola: 31596215 markings, 272268738 edges, 146844 markings/sec, 200 secs
lola: 32396791 markings, 280121357 edges, 160115 markings/sec, 205 secs
lola: 33161149 markings, 288042139 edges, 152872 markings/sec, 210 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 33588712 markings, 292630515 edges
lola: ========================================
lola: subprocess 11 will run for 717 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((F (((1 <= p1) AND (2 <= p26))) OR ((1 <= p1) AND (2 <= p26)))) OR (F (((1 <= p3) AND (2 <= p5))) OR ((p5 <= 1) OR (p24 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((F (((1 <= p1) AND (2 <= p26))) OR ((1 <= p1) AND (2 <= p26)))) OR (F (((1 <= p3) AND (2 <= p5))) OR ((p5 <= 1) OR (p24 <= 0))))))
lola: processed formula length: 140
lola: 79 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: 1171952 markings, 8897848 edges, 234390 markings/sec, 0 secs
lola: 2093727 markings, 16237199 edges, 184355 markings/sec, 5 secs
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: 2738697 markings, 21502326 edges
lola: ========================================
lola: subprocess 12 will run for 1069 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p3) AND (2 <= p7))) AND G (((1 <= p17) AND (2 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p3) AND (2 <= p7))) AND G (((1 <= p17) AND (2 <= p19)))))
lola: processed formula length: 71
lola: 79 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 13 will run for 2138 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((F (G (((p1 <= 1)))) OR (1 <= p8))) AND (2 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((F (G (((p1 <= 1)))) OR (1 <= p8))) AND (2 <= p1)))
lola: processed formula length: 58
lola: 79 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: 10 markings, 10 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((F ((((p15 <= 1) OR (p17 <= 0)) R ((p1 <= 1) OR (p15 <= 0)))) AND (((F (((2 <= p23) AND (1 <= p24))) AND ((2 <= p15) AND (1 <= p17))) U ((p11 <= 1) OR (p17 <= 0))) OR (((p15 <= 1) OR (p17 <= 0)) R ((p1 <= 1) OR (p15 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((((p15 <= 1) OR (p17 <= 0)) R ((p1 <= 1) OR (p15 <= 0)))) AND (((F (((2 <= p23) AND (1 <= p24))) AND ((2 <= p15) AND (1 <= p17))) U ((p11 <= 1) OR (p17 <= 0))) OR (((p15 <= 1) OR (p17 <= 0)) R ((p1 <= 1) OR (p15 <= 0)))))))
lola: processed formula length: 238
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 1383443 markings, 8020971 edges, 276689 markings/sec, 0 secs
lola: 2432771 markings, 14276692 edges, 209866 markings/sec, 5 secs
lola: 3475616 markings, 20721150 edges, 208569 markings/sec, 10 secs
lola: 4321166 markings, 25838173 edges, 169110 markings/sec, 15 secs
lola: 5213821 markings, 31398986 edges, 178531 markings/sec, 20 secs
lola: 6048376 markings, 36499369 edges, 166911 markings/sec, 25 secs
lola: 6899348 markings, 41714279 edges, 170194 markings/sec, 30 secs
lola: 7719399 markings, 46966574 edges, 164010 markings/sec, 35 secs
lola: 8384741 markings, 51029176 edges, 133068 markings/sec, 40 secs
lola: 9147919 markings, 55635505 edges, 152636 markings/sec, 45 secs
lola: 9890228 markings, 60342675 edges, 148462 markings/sec, 50 secs
lola: 10626760 markings, 64947812 edges, 147306 markings/sec, 55 secs
lola: 11565117 markings, 70973411 edges, 187671 markings/sec, 60 secs
lola: 12601535 markings, 77146251 edges, 207284 markings/sec, 65 secs
lola: 13536493 markings, 83004945 edges, 186992 markings/sec, 70 secs
lola: 14489169 markings, 89259780 edges, 190535 markings/sec, 75 secs
lola: 15306978 markings, 94677967 edges, 163562 markings/sec, 80 secs
lola: 16270898 markings, 100916631 edges, 192784 markings/sec, 85 secs
lola: 17244941 markings, 107648237 edges, 194809 markings/sec, 90 secs
lola: 18143608 markings, 113765916 edges, 179733 markings/sec, 95 secs
lola: 19143428 markings, 120055558 edges, 199964 markings/sec, 100 secs
lola: 20088288 markings, 125972296 edges, 188972 markings/sec, 105 secs
lola: 21035123 markings, 131538586 edges, 189367 markings/sec, 110 secs
lola: 21934014 markings, 137561993 edges, 179778 markings/sec, 115 secs
lola: 22740993 markings, 142584472 edges, 161396 markings/sec, 120 secs
lola: 23720592 markings, 148856612 edges, 195920 markings/sec, 125 secs
lola: 24579091 markings, 154503248 edges, 171700 markings/sec, 130 secs
lola: 25359883 markings, 159502204 edges, 156158 markings/sec, 135 secs
lola: 26267163 markings, 165607429 edges, 181456 markings/sec, 140 secs
lola: 27181008 markings, 171414255 edges, 182769 markings/sec, 145 secs
lola: 27890503 markings, 176298264 edges, 141899 markings/sec, 150 secs
lola: 28797697 markings, 182130949 edges, 181439 markings/sec, 155 secs
lola: 29707500 markings, 188098857 edges, 181961 markings/sec, 160 secs
lola: 30576568 markings, 193594529 edges, 173814 markings/sec, 165 secs
lola: 31427429 markings, 199464638 edges, 170172 markings/sec, 170 secs
lola: 32260360 markings, 204827233 edges, 166586 markings/sec, 175 secs
lola: 33045189 markings, 210093938 edges, 156966 markings/sec, 180 secs
lola: 33887850 markings, 215805360 edges, 168532 markings/sec, 185 secs
lola: 34727630 markings, 221731853 edges, 167956 markings/sec, 190 secs
lola: 35470717 markings, 226396565 edges, 148617 markings/sec, 195 secs
lola: 36299852 markings, 232270328 edges, 165827 markings/sec, 200 secs
lola: 37033717 markings, 238002866 edges, 146773 markings/sec, 205 secs
lola: 37852016 markings, 244242435 edges, 163660 markings/sec, 210 secs
lola: 38632330 markings, 251126140 edges, 156063 markings/sec, 215 secs
lola: 39432304 markings, 258074599 edges, 159995 markings/sec, 220 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 40049688 markings, 262536089 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no no yes no no yes no no
lola:
preliminary result: no no yes no no no no no yes no no yes no no
lola: memory consumption: 47580 KB
lola: time consumption: 1661 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="DNAwalker-PT-08ringLL"
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 DNAwalker-PT-08ringLL, 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 r178-tajo-158987881900138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-08ringLL.tgz
mv DNAwalker-PT-08ringLL 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 ;