About the Execution of ITS-LoLa for RefineWMG-PT-015016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15801.450 | 3600000.00 | 533289.00 | 247902.30 | FFFT?FFFFFF?TFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r186-oct2-158987938500074.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RefineWMG-PT-015016, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500074
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.3K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 12:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 12:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 35K Mar 24 05:38 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME RefineWMG-PT-015016-00
FORMULA_NAME RefineWMG-PT-015016-01
FORMULA_NAME RefineWMG-PT-015016-02
FORMULA_NAME RefineWMG-PT-015016-03
FORMULA_NAME RefineWMG-PT-015016-04
FORMULA_NAME RefineWMG-PT-015016-05
FORMULA_NAME RefineWMG-PT-015016-06
FORMULA_NAME RefineWMG-PT-015016-07
FORMULA_NAME RefineWMG-PT-015016-08
FORMULA_NAME RefineWMG-PT-015016-09
FORMULA_NAME RefineWMG-PT-015016-10
FORMULA_NAME RefineWMG-PT-015016-11
FORMULA_NAME RefineWMG-PT-015016-12
FORMULA_NAME RefineWMG-PT-015016-13
FORMULA_NAME RefineWMG-PT-015016-14
FORMULA_NAME RefineWMG-PT-015016-15
=== Now, execution of the tool begins
BK_START 1591225269874
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:01:12] [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 23:01:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:01:12] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2020-06-03 23:01:13] [INFO ] Transformed 79 places.
[2020-06-03 23:01:13] [INFO ] Transformed 63 transitions.
[2020-06-03 23:01:13] [INFO ] Parsed PT model containing 79 places and 63 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100010 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=1052 ) 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, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 63 rows 79 cols
[2020-06-03 23:01:13] [INFO ] Computed 32 place invariants in 4 ms
[2020-06-03 23:01:13] [INFO ] [Real]Absence check using 32 positive place invariants in 21 ms returned sat
[2020-06-03 23:01:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:01:13] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-03 23:01:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:01:13] [INFO ] [Nat]Absence check using 32 positive place invariants in 13 ms returned sat
[2020-06-03 23:01:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:01:13] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-06-03 23:01:13] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 4 ms.
[2020-06-03 23:01:13] [INFO ] Added : 31 causal constraints over 7 iterations in 51 ms. Result :sat
[2020-06-03 23:01:13] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 23:01:13] [INFO ] Flatten gal took : 27 ms
FORMULA RefineWMG-PT-015016-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015016-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:01:13] [INFO ] Flatten gal took : 7 ms
[2020-06-03 23:01:13] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-03 23:01:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-015016 @ 3570 seconds
FORMULA RefineWMG-PT-015016-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-015016-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-015016-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-015016-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-015016-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-015016-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-015016-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-015016-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-015016-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-015016-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-015016-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-015016-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-015016-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-015016-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2598
rslt: Output for LTLFireability @ RefineWMG-PT-015016
{
"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 23:01:20 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 4,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (X (G (((1 <= p71) AND (1 <= p72) AND (1 <= p74))))) OR (G ((F (G ((1 <= p67))) OR X ((1 <= p67)))) AND F (G (((1 <= p71) AND (1 <= p72) AND (1 <= p74)))))))",
"processed_size": 163,
"rewrites": 86
},
"result":
{
"edges": 14184,
"markings": 9284,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 29
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((G (((((1 <= p36) AND (1 <= p37) AND (1 <= p39)) U (5 <= p4)) OR F ((3 <= p3)))) OR (p30 <= 0)))",
"processed_size": 99,
"rewrites": 86
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": 5,
"visible_transitions": 0
},
"processed": "(((p1 <= 1) OR (p2 <= 1)) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0)))",
"processed_size": 74,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 302
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 302
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p75)",
"processed_size": 10,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 332
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X (((p1 <= 1) OR (p2 <= 1)))",
"processed_size": 29,
"rewrites": 86
},
"result":
{
"edges": 17,
"markings": 17,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 332
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p23)))",
"processed_size": 18,
"rewrites": 86
},
"result":
{
"edges": 17,
"markings": 17,
"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": 369
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((X (X (F ((1 <= p8)))) OR F (G ((1 <= p8)))))",
"processed_size": 48,
"rewrites": 86
},
"result":
{
"edges": 19,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"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": 439
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((F ((X (F ((1 <= p55))) AND (3 <= p3))) AND ((3 <= p3) OR (X (F ((1 <= p55))) AND (3 <= p3))))))",
"processed_size": 102,
"rewrites": 86
},
"result":
{
"edges": 19,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 512
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (G ((1 <= p50))) U (X ((3 <= p3)) U (1 <= p37))))",
"processed_size": 55,
"rewrites": 86
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": 615
},
"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": "((1 <= p52) OR (p78 <= 0))",
"processed_size": 27,
"rewrites": 88
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 768
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((2 <= p1) AND (2 <= p2))",
"processed_size": 25,
"rewrites": 88
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1025
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p15)))",
"processed_size": 18,
"rewrites": 86
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1537
},
"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 (((p75 <= 0) OR (1 <= p27)))",
"processed_size": 31,
"rewrites": 86
},
"result":
{
"edges": 2220,
"markings": 1271,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3075
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((F ((p53 <= 0)) AND (p30 <= 0))))",
"processed_size": 39,
"rewrites": 86
},
"result":
{
"edges": 171,
"markings": 135,
"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"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": 5,
"visible_transitions": 0
},
"processed": "(((p1 <= 1) OR (p2 <= 1)) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0)))",
"processed_size": 74,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3396,
"runtime": 972.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((X(X(G(**))) OR (G((F(G(**)) OR X(**))) AND F(G(**))))) : F(G((F(*) AND *))) : X((G(((** U **) OR F(**))) OR **)) : (X(F((G(*) OR (G(*) AND *)))) AND F(**)) : (X(*) AND (F(*) OR X(G(*)))) : G(F(**)) : G(**) : X(G(**)) : F((X(X(F(**))) OR F(G(**)))) : F(**) : X((G((G(**) OR X(**))) AND X(**))) : F(G((F((X(F(**)) AND **)) AND (** OR (X(F(**)) AND **))))) : X((X(G(**)) U (X(**) U **))) : F(*)"
},
"net":
{
"arcs": 188,
"conflict_clusters": 48,
"places": 79,
"places_significant": 47,
"singleton_clusters": 0,
"transitions": 63
},
"result":
{
"preliminary_value": "no no yes unknown no no no no no no unknown no yes no ",
"value": "no no yes unknown no no no no no no unknown no yes 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: 142/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2528
lola: finding significant places
lola: 79 places, 63 transitions, 47 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: F ((G ((F (G ((1 <= p67))) OR X ((1 <= p67)))) U X (G (X (G (((1 <= p71) AND (1 <= p72) AND (1 <= p74)))))))) : NOT(G (F ((X (F (G ((1 <= p53)))) OR F ((1 <= p30)))))) : X ((G (((((1 <= p36) AND (1 <= p37) AND (1 <= p39)) U (5 <= p4)) OR F ((3 <= p3)))) OR (p30 <= 0))) : (X (((p20 <= 0) U NOT(G ((F ((1 <= p30)) U ((1 <= p16) AND (1 <= p17) AND (1 <= p19))))))) AND F ((((2 <= p1) AND (2 <= p2)) OR ((1 <= p16) AND (1 <= p17) AND (1 <= p19))))) : NOT((G ((1 <= p75)) U X (((2 <= p1) AND (2 <= p2))))) : (X (((2 <= p1) AND (2 <= p2))) U G (X (F ((1 <= p15))))) : G (((p75 <= 0) OR (1 <= p27))) : G (X ((1 <= p23))) : F ((NOT(X (NOT(X (F ((1 <= p8)))))) OR F (X (G (X ((1 <= p8))))))) : F (((p52 <= 0) AND (1 <= p78))) : (G (X ((G ((1 <= p17)) OR X ((1 <= p17))))) AND X (X ((1 <= p17)))) : ((3 <= p3) U F (G (X (((3 <= p3) U (F (X ((1 <= p55))) AND (3 <= p3))))))) : NOT(X (NOT((X (G ((1 <= p50))) U (X ((3 <= p3)) U (1 <= p37)))))) : F (((1 <= p47) U F (((1 <= p47) U NOT(G (((2 <= p1) AND (2 <= p2))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:519
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:335
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:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (G (((1 <= p71) AND (1 <= p72) AND (1 <= p74))))) OR (G ((F (G ((1 <= p67))) OR X ((1 <= p67)))) AND F (G (((1 <= p71) AND (1 <= p72) AND (1 <= p74)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (G (((1 <= p71) AND (1 <= p72) AND (1 <= p74))))) OR (G ((F (G ((1 <= p67))) OR X ((1 <= p67)))) AND F (G (((1 <= p71) AND (1 <= p72) AND (1 <= p74)))))))
lola: processed formula length: 163
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 29 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: 9284 markings, 14184 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((((1 <= p36) AND (1 <= p37) AND (1 <= p39)) U (5 <= p4)) OR F ((3 <= p3)))) OR (p30 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((((1 <= p36) AND (1 <= p37) AND (1 <= p39)) U (5 <= p4)) OR F ((3 <= p3)))) OR (p30 <= 0)))
lola: processed formula length: 99
lola: 86 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((G (((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))) OR (G ((p30 <= 0)) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0)))))) AND F ((((2 <= p1) AND (2 <= p2)) OR ((1 <= p16) AND (1 <= p17) AND (1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((2 <= p1) AND (2 <= p2)) OR ((1 <= p16) AND (1 <= 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: (((p1 <= 1) OR (p2 <= 1)) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0)))
lola: processed formula length: 74
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))) OR (G ((p30 <= 0)) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))) OR (G ((p30 <= 0)) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))))))
lola: processed formula length: 123
lola: 86 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: 4114748 markings, 6300684 edges, 822950 markings/sec, 0 secs
lola: 8070545 markings, 12358000 edges, 791159 markings/sec, 5 secs
lola: 11952945 markings, 18302915 edges, 776480 markings/sec, 10 secs
lola: 15778197 markings, 24160328 edges, 765050 markings/sec, 15 secs
lola: 19728381 markings, 30209058 edges, 790037 markings/sec, 20 secs
lola: 23786774 markings, 36423465 edges, 811679 markings/sec, 25 secs
lola: 27756318 markings, 42501832 edges, 793909 markings/sec, 30 secs
lola: 31679795 markings, 48509656 edges, 784695 markings/sec, 35 secs
lola: 35462477 markings, 54301893 edges, 756536 markings/sec, 40 secs
lola: 39212982 markings, 60044853 edges, 750101 markings/sec, 45 secs
lola: 42952522 markings, 65771023 edges, 747908 markings/sec, 50 secs
lola: 46977176 markings, 71933770 edges, 804931 markings/sec, 55 secs
lola: 51005440 markings, 78102060 edges, 805653 markings/sec, 60 secs
lola: 54885668 markings, 84043649 edges, 776046 markings/sec, 65 secs
lola: 58656312 markings, 89817442 edges, 754129 markings/sec, 70 secs
lola: 62328123 markings, 95439922 edges, 734362 markings/sec, 75 secs
lola: 65755674 markings, 100688349 edges, 685510 markings/sec, 80 secs
lola: 65974921 markings, 101024131 edges, 43849 markings/sec, 85 secs
lola: 67540830 markings, 103423137 edges, 313182 markings/sec, 90 secs
lola: 69209467 markings, 105976951 edges, 333727 markings/sec, 95 secs
lola: 71270745 markings, 109133294 edges, 412256 markings/sec, 100 secs
lola: 73758720 markings, 112943006 edges, 497595 markings/sec, 105 secs
lola: 76281481 markings, 116807850 edges, 504552 markings/sec, 110 secs
lola: 77459627 markings, 118610023 edges, 235629 markings/sec, 115 secs
lola: 77485339 markings, 118649389 edges, 5142 markings/sec, 120 secs
lola: 78484177 markings, 120178864 edges, 199768 markings/sec, 125 secs
lola: 81022965 markings, 124066386 edges, 507758 markings/sec, 130 secs
lola: 81097462 markings, 124180450 edges, 14899 markings/sec, 135 secs
lola: 81097462 markings, 124180450 edges, 0 markings/sec, 140 secs
lola: 81324232 markings, 124527695 edges, 45354 markings/sec, 145 secs
lola: 81724899 markings, 125141217 edges, 80133 markings/sec, 150 secs
lola: 82087877 markings, 125697028 edges, 72596 markings/sec, 155 secs
lola: 82521999 markings, 126361814 edges, 86824 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 3 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p1 <= 1) OR (p2 <= 1))) AND (F ((p75 <= 0)) OR X (G (((p1 <= 1) OR (p2 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p75 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p75)
lola: processed formula length: 10
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p1 <= 1) OR (p2 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p1 <= 1) OR (p2 <= 1)))
lola: processed formula length: 29
lola: 86 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p23)))
lola: processed formula length: 18
lola: 86 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 5 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (F ((1 <= p8)))) OR F (G ((1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (F ((1 <= p8)))) OR F (G ((1 <= p8)))))
lola: processed formula length: 48
lola: 86 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: add low 61
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: 18 markings, 19 edges
lola: ========================================
lola: subprocess 6 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((G ((1 <= p17)) OR X ((1 <= p17)))) AND X ((1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((G ((1 <= p17)) OR X ((1 <= p17)))) AND X ((1 <= p17))))
lola: processed formula length: 63
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 4531571 markings, 6938921 edges, 906314 markings/sec, 0 secs
lola: 8875060 markings, 13589861 edges, 868698 markings/sec, 5 secs
lola: 13095189 markings, 20051963 edges, 844026 markings/sec, 10 secs
lola: 17395938 markings, 26637488 edges, 860150 markings/sec, 15 secs
lola: 21652214 markings, 33156252 edges, 851255 markings/sec, 20 secs
lola: 25926340 markings, 39699635 edges, 854825 markings/sec, 25 secs
lola: 30186321 markings, 46222745 edges, 851996 markings/sec, 30 secs
lola: 34576706 markings, 52945518 edges, 878077 markings/sec, 35 secs
lola: 38915448 markings, 59589230 edges, 867748 markings/sec, 40 secs
lola: 43257222 markings, 66237547 edges, 868355 markings/sec, 45 secs
lola: 47685631 markings, 73018540 edges, 885682 markings/sec, 50 secs
lola: 51927418 markings, 79513792 edges, 848357 markings/sec, 55 secs
lola: 56094879 markings, 85895231 edges, 833492 markings/sec, 60 secs
lola: 60258035 markings, 92270041 edges, 832631 markings/sec, 65 secs
lola: 64410937 markings, 98629181 edges, 830580 markings/sec, 70 secs
lola: 68510175 markings, 104906165 edges, 819848 markings/sec, 75 secs
lola: 72550983 markings, 111093639 edges, 808162 markings/sec, 80 secs
lola: 75726406 markings, 115956360 edges, 635085 markings/sec, 85 secs
lola: 78767982 markings, 120614263 edges, 608315 markings/sec, 90 secs
lola: 81806260 markings, 125266166 edges, 607656 markings/sec, 95 secs
lola: 84366400 markings, 129185998 edges, 512028 markings/sec, 100 secs
lola: 84366400 markings, 129185998 edges, 0 markings/sec, 105 secs
lola: 84366400 markings, 129185998 edges, 0 markings/sec, 110 secs
lola: 84366400 markings, 129185998 edges, 0 markings/sec, 115 secs
lola: 86920410 markings, 133096830 edges, 510802 markings/sec, 120 secs
lola: 88848174 markings, 136048728 edges, 385553 markings/sec, 125 secs
lola: 89392840 markings, 136882720 edges, 108933 markings/sec, 130 secs
lola: 89392840 markings, 136882720 edges, 0 markings/sec, 135 secs
lola: 90020836 markings, 137844352 edges, 125599 markings/sec, 140 secs
lola: 90992343 markings, 139331988 edges, 194301 markings/sec, 145 secs
lola: 90992343 markings, 139331988 edges, 0 markings/sec, 150 secs
lola: 91008406 markings, 139356595 edges, 3213 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((X (F ((1 <= p55))) AND (3 <= p3))) AND ((3 <= p3) OR (X (F ((1 <= p55))) AND (3 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((X (F ((1 <= p55))) AND (3 <= p3))) AND ((3 <= p3) OR (X (F ((1 <= p55))) AND (3 <= p3))))))
lola: processed formula length: 102
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: add low 61
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: 18 markings, 19 edges
lola: ========================================
lola: subprocess 8 will run for 512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((1 <= p50))) U (X ((3 <= p3)) U (1 <= p37))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((1 <= p50))) U (X ((3 <= p3)) U (1 <= p37))))
lola: processed formula length: 55
lola: 86 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 9 will run for 615 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p52 <= 0) AND (1 <= p78)))
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: ((1 <= p52) OR (p78 <= 0))
lola: processed formula length: 27
lola: 88 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 10 will run for 768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p1 <= 1) OR (p2 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((2 <= p1) AND (2 <= p2))
lola: processed formula length: 25
lola: 88 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 11 will run for 1025 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p15)))
lola: processed formula length: 18
lola: 86 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 12 will run for 1537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p75 <= 0) OR (1 <= p27)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p75 <= 0) OR (1 <= p27)))
lola: processed formula length: 31
lola: 86 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: 1271 markings, 2220 edges
lola: ========================================
lola: subprocess 13 will run for 3075 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p53 <= 0)) AND (p30 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p53 <= 0)) AND (p30 <= 0))))
lola: processed formula length: 39
lola: 86 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: 135 markings, 171 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (F ((G (((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))) OR (G ((p30 <= 0)) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0)))))) AND F ((((2 <= p1) AND (2 <= p2)) OR ((1 <= p16) AND (1 <= p17) AND (1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((((2 <= p1) AND (2 <= p2)) OR ((1 <= p16) AND (1 <= 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: (((p1 <= 1) OR (p2 <= 1)) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0)))
lola: processed formula length: 74
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (F ((G (((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))) OR (G ((p30 <= 0)) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))) OR (G ((p30 <= 0)) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))))))
lola: processed formula length: 123
lola: 86 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: 11408 markings, 17451 edges, 2282 markings/sec, 0 secs
lola: 11408 markings, 17451 edges, 0 markings/sec, 5 secs
lola: 1953097 markings, 2990662 edges, 388338 markings/sec, 10 secs
lola: 6099984 markings, 9340572 edges, 829377 markings/sec, 15 secs
lola: 10159361 markings, 15556493 edges, 811875 markings/sec, 20 secs
lola: 14162893 markings, 21686902 edges, 800706 markings/sec, 25 secs
lola: 18219251 markings, 27898201 edges, 811272 markings/sec, 30 secs
lola: 22318237 markings, 34174768 edges, 819797 markings/sec, 35 secs
lola: 26433091 markings, 40475647 edges, 822971 markings/sec, 40 secs
lola: 30353605 markings, 46478934 edges, 784103 markings/sec, 45 secs
lola: 34215644 markings, 52392677 edges, 772408 markings/sec, 50 secs
lola: 38097336 markings, 58336521 edges, 776338 markings/sec, 55 secs
lola: 42023017 markings, 64347719 edges, 785136 markings/sec, 60 secs
lola: 46056419 markings, 70523862 edges, 806680 markings/sec, 65 secs
lola: 50102591 markings, 76719568 edges, 809234 markings/sec, 70 secs
lola: 54013214 markings, 82707713 edges, 782125 markings/sec, 75 secs
lola: 57839341 markings, 88566467 edges, 765225 markings/sec, 80 secs
lola: 61745270 markings, 94547412 edges, 781186 markings/sec, 85 secs
lola: 65616472 markings, 100475197 edges, 774240 markings/sec, 90 secs
lola: 68152192 markings, 104365681 edges, 507144 markings/sec, 95 secs
lola: 70329307 markings, 107691728 edges, 435423 markings/sec, 100 secs
lola: 70482582 markings, 107926434 edges, 30655 markings/sec, 105 secs
lola: 71422484 markings, 109365642 edges, 187980 markings/sec, 110 secs
lola: 72156052 markings, 110488917 edges, 146714 markings/sec, 115 secs
lola: 72156052 markings, 110488917 edges, 0 markings/sec, 120 secs
lola: 72156052 markings, 110488917 edges, 0 markings/sec, 125 secs
lola: 74395201 markings, 113917619 edges, 447830 markings/sec, 130 secs
lola: 75432625 markings, 115506166 edges, 207485 markings/sec, 135 secs
lola: 75432625 markings, 115506166 edges, 0 markings/sec, 140 secs
lola: 75432625 markings, 115506166 edges, 0 markings/sec, 145 secs
lola: 75432625 markings, 115506166 edges, 0 markings/sec, 150 secs
lola: 76868985 markings, 117705607 edges, 287272 markings/sec, 155 secs
lola: 79203628 markings, 121280518 edges, 466929 markings/sec, 160 secs
lola: 79203628 markings, 121280518 edges, 0 markings/sec, 165 secs
lola: 80950176 markings, 123954917 edges, 349310 markings/sec, 170 secs
lola: 81138734 markings, 124243645 edges, 37712 markings/sec, 175 secs
lola: 81381497 markings, 124615382 edges, 48553 markings/sec, 180 secs
lola: 81760502 markings, 125195737 edges, 75801 markings/sec, 185 secs
lola: 82081952 markings, 125687958 edges, 64290 markings/sec, 190 secs
lola: 82505994 markings, 126337290 edges, 84808 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G ((G ((1 <= p17)) OR X ((1 <= p17)))) AND X ((1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((G ((1 <= p17)) OR X ((1 <= p17)))) AND X ((1 <= p17))))
lola: processed formula length: 63
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 4492301 markings, 6878784 edges, 898460 markings/sec, 0 secs
lola: 8842434 markings, 13539926 edges, 870027 markings/sec, 5 secs
lola: 13136249 markings, 20114819 edges, 858763 markings/sec, 10 secs
lola: 17396160 markings, 26637832 edges, 851982 markings/sec, 15 secs
lola: 21604037 markings, 33081113 edges, 841575 markings/sec, 20 secs
lola: 25816466 markings, 39531398 edges, 842486 markings/sec, 25 secs
lola: 29968862 markings, 45889758 edges, 830479 markings/sec, 30 secs
lola: 34263572 markings, 52466040 edges, 858942 markings/sec, 35 secs
lola: 38515077 markings, 58976151 edges, 850301 markings/sec, 40 secs
lola: 42734102 markings, 65436526 edges, 843805 markings/sec, 45 secs
lola: 47086437 markings, 72101057 edges, 870467 markings/sec, 50 secs
lola: 51368188 markings, 78657484 edges, 856350 markings/sec, 55 secs
lola: 55506495 markings, 84994274 edges, 827661 markings/sec, 60 secs
lola: 59557649 markings, 91197571 edges, 810231 markings/sec, 65 secs
lola: 63675807 markings, 97503531 edges, 823632 markings/sec, 70 secs
lola: 67676430 markings, 103629466 edges, 800125 markings/sec, 75 secs
lola: 71618479 markings, 109665733 edges, 788410 markings/sec, 80 secs
lola: 75396892 markings, 115452049 edges, 755683 markings/sec, 85 secs
lola: 75778330 markings, 116036252 edges, 76288 markings/sec, 90 secs
lola: 77213216 markings, 118235048 edges, 286977 markings/sec, 95 secs
lola: 78109401 markings, 119604958 edges, 179237 markings/sec, 100 secs
lola: 79741512 markings, 122104133 edges, 326422 markings/sec, 105 secs
lola: 80754003 markings, 123654517 edges, 202498 markings/sec, 110 secs
lola: 80754003 markings, 123654517 edges, 0 markings/sec, 115 secs
lola: 82931405 markings, 126988667 edges, 435480 markings/sec, 120 secs
lola: 83908545 markings, 128484913 edges, 195428 markings/sec, 125 secs
lola: 83926170 markings, 128511880 edges, 3525 markings/sec, 130 secs
lola: 85491764 markings, 130909227 edges, 313119 markings/sec, 135 secs
lola: 87637780 markings, 134195294 edges, 429203 markings/sec, 140 secs
lola: 87670288 markings, 134245076 edges, 6502 markings/sec, 145 secs
lola: 87670288 markings, 134245076 edges, 0 markings/sec, 150 secs
lola: 88371954 markings, 135319488 edges, 140333 markings/sec, 155 secs
lola: 89307196 markings, 136751586 edges, 187048 markings/sec, 160 secs
lola: 89307196 markings, 136751586 edges, 0 markings/sec, 165 secs
lola: 89822762 markings, 137541060 edges, 103113 markings/sec, 170 secs
lola: 90747032 markings, 138956350 edges, 184854 markings/sec, 175 secs
lola: 91478260 markings, 140076036 edges, 146246 markings/sec, 180 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no yes unknown no no no no no no unknown no yes no
lola:
preliminary result: no no yes unknown no no no no no no unknown no yes no
lola: memory consumption: 3396 KB
lola: time consumption: 972 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="RefineWMG-PT-015016"
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 RefineWMG-PT-015016, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938500074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-015016.tgz
mv RefineWMG-PT-015016 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 ;