About the Execution of 2020-gold for DrinkVendingMachine-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4304.779 | 3600000.00 | 12341.00 | 12198.70 | FTFFFFTFFFFTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r094-tall-162048902500258.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is DrinkVendingMachine-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902500258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 25K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 165K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 83K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 362K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.5K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 34K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 10:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 10:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 68K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DrinkVendingMachine-PT-02-00
FORMULA_NAME DrinkVendingMachine-PT-02-01
FORMULA_NAME DrinkVendingMachine-PT-02-02
FORMULA_NAME DrinkVendingMachine-PT-02-03
FORMULA_NAME DrinkVendingMachine-PT-02-04
FORMULA_NAME DrinkVendingMachine-PT-02-05
FORMULA_NAME DrinkVendingMachine-PT-02-06
FORMULA_NAME DrinkVendingMachine-PT-02-07
FORMULA_NAME DrinkVendingMachine-PT-02-08
FORMULA_NAME DrinkVendingMachine-PT-02-09
FORMULA_NAME DrinkVendingMachine-PT-02-10
FORMULA_NAME DrinkVendingMachine-PT-02-11
FORMULA_NAME DrinkVendingMachine-PT-02-12
FORMULA_NAME DrinkVendingMachine-PT-02-13
FORMULA_NAME DrinkVendingMachine-PT-02-14
FORMULA_NAME DrinkVendingMachine-PT-02-15
=== Now, execution of the tool begins
BK_START 1620764196116
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 20:16:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-11 20:16:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 20:16:49] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-11 20:16:49] [INFO ] Transformed 24 places.
[2021-05-11 20:16:49] [INFO ] Transformed 72 transitions.
[2021-05-11 20:16:49] [INFO ] Parsed PT model containing 24 places and 72 transitions in 88 ms.
[2021-05-11 20:16:49] [INFO ] Reduced 16 identical enabling conditions.
[2021-05-11 20:16:49] [INFO ] Reduced 16 identical enabling conditions.
[2021-05-11 20:16:49] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-11 20:16:49] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-11 20:16:49] [INFO ] Reduced 16 identical enabling conditions.
[2021-05-11 20:16:49] [INFO ] Reduced 16 identical enabling conditions.
[2021-05-11 20:16:49] [INFO ] Reduced 16 identical enabling conditions.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 607 ms. (steps per millisecond=164 ) properties seen :[1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1]
// Phase 1: matrix 52 rows 24 cols
[2021-05-11 20:16:49] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-11 20:16:49] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned unsat
[2021-05-11 20:16:49] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2021-05-11 20:16:49] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned unsat
[2021-05-11 20:16:49] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-11 20:16:49] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-11 20:16:49] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-11 20:16:49] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-11 20:16:49] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2021-05-11 20:16:49] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned unsat
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-11 20:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-11 20:16:50] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 5 ms.
[2021-05-11 20:16:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:16:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-11 20:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:16:50] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-11 20:16:50] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 4 ms.
[2021-05-11 20:16:50] [INFO ] Added : 36 causal constraints over 8 iterations in 115 ms. Result :sat
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-11 20:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-11 20:16:50] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 3 ms.
[2021-05-11 20:16:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:16:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 25 ms returned sat
[2021-05-11 20:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:16:50] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-11 20:16:50] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 3 ms.
[2021-05-11 20:16:50] [INFO ] Added : 36 causal constraints over 8 iterations in 44 ms. Result :sat
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned unsat
[2021-05-11 20:16:50] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
Successfully simplified 19 atomic propositions for a total of 26 simplifications.
[2021-05-11 20:16:50] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-11 20:16:50] [INFO ] Flatten gal took : 38 ms
FORMULA DrinkVendingMachine-PT-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 20:16:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-11 20:16:50] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:16:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DrinkVendingMachine-PT-02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 20:16:50] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-11 20:16:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DrinkVendingMachine-PT-02 @ 3570 seconds
FORMULA DrinkVendingMachine-PT-02-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-PT-02-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-PT-02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-PT-02-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-PT-02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-PT-02-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-PT-02-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-PT-02-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-PT-02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-PT-02-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for LTLFireability @ DrinkVendingMachine-PT-02
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 11 20:17:02 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 9,
"adisj": 3,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (((((((1 <= p1) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))) U (((1 <= p1) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8)))) OR F (((1 <= p21) OR (1 <= p23)))) AND ((p19 <= 0) AND (p22 <= 0))))",
"processed_size": 314,
"rewrites": 59
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((((p2 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p8 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p8 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p11 <= 0)) AND ((p3 <= 0) OR (p8 <= 0) OR (p11 <= 0)) AND ((p3 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p8 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p9 <= 0) OR (p11 <= 0)))))",
"processed_size": 365,
"rewrites": 59
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 16,
"adisj": 3,
"aneg": 0,
"comp": 64,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 64,
"taut": 0,
"tconj": 1,
"tdisj": 8,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X (F (((X (G ((((1 <= p2) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p11))))) U (((1 <= p2) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p11)))) AND (F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p20) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))) OR ((1 <= p16) OR ((1 <= p17) OR ((1 <= p18) OR ((1 <= p20) OR ((1 <= p12) OR ((1 <= p13) OR ((1 <= p14) OR (1 <= p15))))))))))))",
"processed_size": 991,
"rewrites": 59
},
"result":
{
"edges": 504,
"markings": 211,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (F (((p1 <= 0) OR (p8 <= 0)))) U G ((F ((1 <= p22)) AND (((p22 <= 0) AND (p19 <= 0)) OR (1 <= p22))))))",
"processed_size": 110,
"rewrites": 59
},
"result":
{
"edges": 23,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((p0 <= 0) OR (p8 <= 0)) R F (((1 <= p2) AND (1 <= p8) AND (1 <= p11)))))",
"processed_size": 78,
"rewrites": 59
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F (G ((p20 <= 0))) OR ((p1 <= 0) OR (p9 <= 0))))",
"processed_size": 52,
"rewrites": 59
},
"result":
{
"edges": 7485,
"markings": 1041,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p0) AND (1 <= p8))) OR ((p15 <= 0) R ((p1 <= 0) OR (p8 <= 0)))))",
"processed_size": 79,
"rewrites": 59
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G ((((1 <= p6) AND (1 <= p8) AND (2 <= p10) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p7) AND (1 <= p8) AND (1 <= p10) AND (2 <= p11)))))",
"processed_size": 155,
"rewrites": 59
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((((1 <= p1) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))))",
"processed_size": 121,
"rewrites": 59
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 24,
"aneg": 0,
"comp": 80,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((F ((((p5 <= 0) OR (p8 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p8 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p9 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p8 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p8 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p10 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p11 <= 1)))) OR (((p5 <= 0) OR (p8 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p8 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p9 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p8 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p8 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p10 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p11 <= 1)))))",
"processed_size": 1208,
"rewrites": 59
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 1
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 55208,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((((** U **) OR F(**)) AND **)) : X(F(*)) : F((F(**) OR **)) : X(F(((X(G(**)) U **) AND (F(**) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))))) : G(**) : X((X(F(*)) U G((F(**) AND (** OR **))))) : X((* R F(**))) : X((F(G(*)) OR (** OR **))) : X((F(**) OR (* R *))) : X(G(**))"
},
"net":
{
"arcs": 280,
"conflict_clusters": 13,
"places": 24,
"places_significant": 12,
"singleton_clusters": 0,
"transitions": 52
},
"result":
{
"preliminary_value": "no no no no no no no yes no no ",
"value": "no no no no no 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: 76/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24
lola: finding significant places
lola: 24 places, 52 transitions, 12 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: (X ((((((1 <= p1) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))) U (((1 <= p1) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8)))) OR F (((1 <= p21) OR (1 <= p23))))) AND X (((p19 <= 0) AND (p22 <= 0)))) : X (((1 <= 0) U NOT(G ((((1 <= p2) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p11))))))) : F ((F ((((p5 <= 0) OR (p8 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p8 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p9 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p8 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p8 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p10 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p11 <= 1)))) OR (((p5 <= 0) OR (p8 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p8 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p9 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p8 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p8 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p10 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p11 <= 1))))) : X (F (((G (X ((((1 <= p2) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p11))))) U (((1 <= p2) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p11)))) AND ((((((((F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p20) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))) OR (1 <= p16)) OR (1 <= p17)) OR (1 <= p18)) OR (1 <= p20)) OR (1 <= p12)) OR (1 <= p13)) OR (1 <= p14)) OR (1 <= p15))))) : G ((((1 <= p1) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8)))) : X ((X (NOT(G (((1 <= p1) AND (1 <= p8))))) U G ((((p22 <= 0) AND (p19 <= 0)) U (1 <= p22))))) : NOT((X (((1 <= p0) AND (1 <= p8))) U G (NOT(X (((1 <= p2) AND (1 <= p8) AND (1 <= p11))))))) : X (((NOT(G (((1 <= p20) U F ((1 <= p20))))) OR (p1 <= 0)) OR (p9 <= 0))) : (X (F (F (((1 <= p0) AND (1 <= p8))))) OR X (NOT(((1 <= p15) U ((1 <= p1) AND (1 <= p8)))))) : G (X (G ((((1 <= p6) AND (1 <= p8) AND (2 <= p10) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p7) AND (1 <= p8) AND (1 <= p10) AND (2 <= p11))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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 (((((((1 <= p1) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))) U (((1 <= p1) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8)))) OR F (((1 <= p21) OR (1 <= p23)))) AND ((p19 <= 0) AND (p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((((1 <= p1) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))) U (((1 <= p1) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8)))) OR F (((1 <= p21) OR (1 <= p23)))) AND ((p19 <= 0) AND (p22 <= 0))))
lola: processed formula length: 314
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p2 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p8 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p8 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p11 <= 0)) AND ((p3 <= 0) OR (p8 <= 0) OR (p11 <= 0)) AND ((p3 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p8 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p9 <= 0) OR (p11 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p2 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p8 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p8 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p11 <= 0)) AND ((p3 <= 0) OR (p8 <= 0) OR (p11 <= 0)) AND ((p3 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p8 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p9 <= 0) OR (p11 <= 0)))))
lola: processed formula length: 365
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((X (G ((((1 <= p2) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p11))))) U (((1 <= p2) AND (1 <= p9... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((X (G ((((1 <= p2) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p11)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p11))))) U (((1 <= p2) AND (1 <= p9... (shortened)
lola: processed formula length: 991
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 211 markings, 504 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F (((p1 <= 0) OR (p8 <= 0)))) U G ((F ((1 <= p22)) AND (((p22 <= 0) AND (p19 <= 0)) OR (1 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F (((p1 <= 0) OR (p8 <= 0)))) U G ((F ((1 <= p22)) AND (((p22 <= 0) AND (p19 <= 0)) OR (1 <= p22))))))
lola: processed formula length: 110
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20 markings, 23 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p0 <= 0) OR (p8 <= 0)) R F (((1 <= p2) AND (1 <= p8) AND (1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p0 <= 0) OR (p8 <= 0)) R F (((1 <= p2) AND (1 <= p8) AND (1 <= p11)))))
lola: processed formula length: 78
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((p20 <= 0))) OR ((p1 <= 0) OR (p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((p20 <= 0))) OR ((p1 <= 0) OR (p9 <= 0))))
lola: processed formula length: 52
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1041 markings, 7485 edges
lola: ========================================
lola: subprocess 6 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p0) AND (1 <= p8))) OR ((p15 <= 0) R ((p1 <= 0) OR (p8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p0) AND (1 <= p8))) OR ((p15 <= 0) R ((p1 <= 0) OR (p8 <= 0)))))
lola: processed formula length: 79
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 17 edges
lola: ========================================
lola: subprocess 7 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p6) AND (1 <= p8) AND (2 <= p10) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p7) AND (1 <= p8) AND (1 <= p10) AND (2 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p6) AND (1 <= p8) AND (2 <= p10) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p7) AND (1 <= p8) AND (1 <= p10) AND (2 <= p11)))))
lola: processed formula length: 155
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p1) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p1) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p8)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))))
lola: processed formula length: 121
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 9 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((((p5 <= 0) OR (p8 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p8 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p9 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p8 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p8 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((((p5 <= 0) OR (p8 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p8 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p9 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p9 <= 0) OR (p10 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p8 <= 0) OR (p10 <= 1)) AND ((p4 <= 0) OR (p8 <= 0) OR (p11 <= 1)) AND ((p5 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p1... (shortened)
lola: processed formula length: 1208
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no yes no no
lola:
preliminary result: no no no no no no no yes no no
lola: memory consumption: 55208 KB
lola: time consumption: 2 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="DrinkVendingMachine-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is DrinkVendingMachine-PT-02, 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 r094-tall-162048902500258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-PT-02.tgz
mv DrinkVendingMachine-PT-02 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 ;