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-158987938500106.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-050051, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 3.2K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 11 12:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 12:02 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.2K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 9 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 9 22:57 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 110K 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-050051-00
FORMULA_NAME RefineWMG-PT-050051-01
FORMULA_NAME RefineWMG-PT-050051-02
FORMULA_NAME RefineWMG-PT-050051-03
FORMULA_NAME RefineWMG-PT-050051-04
FORMULA_NAME RefineWMG-PT-050051-05
FORMULA_NAME RefineWMG-PT-050051-06
FORMULA_NAME RefineWMG-PT-050051-07
FORMULA_NAME RefineWMG-PT-050051-08
FORMULA_NAME RefineWMG-PT-050051-09
FORMULA_NAME RefineWMG-PT-050051-10
FORMULA_NAME RefineWMG-PT-050051-11
FORMULA_NAME RefineWMG-PT-050051-12
FORMULA_NAME RefineWMG-PT-050051-13
FORMULA_NAME RefineWMG-PT-050051-14
FORMULA_NAME RefineWMG-PT-050051-15

=== Now, execution of the tool begins

BK_START 1591227464100

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:37:45] [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:37:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:37:45] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2020-06-03 23:37:45] [INFO ] Transformed 254 places.
[2020-06-03 23:37:45] [INFO ] Transformed 203 transitions.
[2020-06-03 23:37:45] [INFO ] Parsed PT model containing 254 places and 203 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100005 steps, including 0 resets, run finished after 200 ms. (steps per millisecond=500 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0]
// Phase 1: matrix 203 rows 254 cols
[2020-06-03 23:37:45] [INFO ] Computed 102 place invariants in 6 ms
[2020-06-03 23:37:46] [INFO ] [Real]Absence check using 102 positive place invariants in 38 ms returned sat
[2020-06-03 23:37:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:46] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2020-06-03 23:37:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:46] [INFO ] [Nat]Absence check using 102 positive place invariants in 43 ms returned sat
[2020-06-03 23:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:46] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2020-06-03 23:37:46] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:37:46] [INFO ] Added : 48 causal constraints over 10 iterations in 294 ms. Result :sat
[2020-06-03 23:37:46] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:37:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:47] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2020-06-03 23:37:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:47] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:47] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2020-06-03 23:37:47] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:37:47] [INFO ] Added : 95 causal constraints over 19 iterations in 244 ms. Result :sat
[2020-06-03 23:37:47] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:47] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-06-03 23:37:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:47] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:47] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2020-06-03 23:37:47] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 28 ms.
[2020-06-03 23:37:48] [INFO ] Added : 77 causal constraints over 16 iterations in 226 ms. Result :sat
[2020-06-03 23:37:48] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:48] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2020-06-03 23:37:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:48] [INFO ] [Nat]Absence check using 102 positive place invariants in 31 ms returned sat
[2020-06-03 23:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:48] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2020-06-03 23:37:48] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 6 ms.
[2020-06-03 23:37:48] [INFO ] Added : 57 causal constraints over 12 iterations in 181 ms. Result :sat
[2020-06-03 23:37:49] [INFO ] [Real]Absence check using 102 positive place invariants in 157 ms returned sat
[2020-06-03 23:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:49] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2020-06-03 23:37:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:49] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:37:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:49] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2020-06-03 23:37:49] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:37:49] [INFO ] Added : 72 causal constraints over 15 iterations in 174 ms. Result :sat
[2020-06-03 23:37:49] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:49] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2020-06-03 23:37:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:49] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:37:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:50] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2020-06-03 23:37:50] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:37:50] [INFO ] Added : 88 causal constraints over 18 iterations in 231 ms. Result :sat
[2020-06-03 23:37:50] [INFO ] [Real]Absence check using 102 positive place invariants in 230 ms returned sat
[2020-06-03 23:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:50] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-06-03 23:37:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:50] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:37:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:50] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-06-03 23:37:50] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:37:51] [INFO ] Added : 95 causal constraints over 19 iterations in 221 ms. Result :sat
[2020-06-03 23:37:51] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:51] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-06-03 23:37:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:51] [INFO ] [Nat]Absence check using 102 positive place invariants in 283 ms returned sat
[2020-06-03 23:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:51] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2020-06-03 23:37:51] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:37:51] [INFO ] Added : 35 causal constraints over 7 iterations in 84 ms. Result :sat
[2020-06-03 23:37:52] [INFO ] [Real]Absence check using 102 positive place invariants in 57 ms returned sat
[2020-06-03 23:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:52] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2020-06-03 23:37:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:52] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:52] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2020-06-03 23:37:52] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 23 ms.
[2020-06-03 23:37:52] [INFO ] Added : 61 causal constraints over 13 iterations in 181 ms. Result :sat
[2020-06-03 23:37:53] [INFO ] [Real]Absence check using 102 positive place invariants in 272 ms returned sat
[2020-06-03 23:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:53] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:37:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:53] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2020-06-03 23:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:53] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 23:37:53] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:37:53] [INFO ] Added : 65 causal constraints over 13 iterations in 210 ms. Result :sat
[2020-06-03 23:37:53] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:53] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2020-06-03 23:37:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:53] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:54] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2020-06-03 23:37:54] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:37:54] [INFO ] Added : 73 causal constraints over 15 iterations in 184 ms. Result :sat
[2020-06-03 23:37:54] [INFO ] [Real]Absence check using 102 positive place invariants in 46 ms returned sat
[2020-06-03 23:37:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:54] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2020-06-03 23:37:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:54] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:37:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:54] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2020-06-03 23:37:54] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:37:54] [INFO ] Added : 55 causal constraints over 11 iterations in 124 ms. Result :sat
[2020-06-03 23:37:54] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 23:37:54] [INFO ] Flatten gal took : 52 ms
FORMULA RefineWMG-PT-050051-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:37:54] [INFO ] Flatten gal took : 14 ms
[2020-06-03 23:37:54] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-03 23:37:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-050051 @ 3570 seconds

FORMULA RefineWMG-PT-050051-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050051-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2991
rslt: Output for LTLFireability @ RefineWMG-PT-050051

{
"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:37:55 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 <= p28)",
"processed_size": 10,
"rewrites": 89
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 ((p97 <= 0))",
"processed_size": 14,
"rewrites": 87
},
"result":
{
"edges": 52,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "F (G (((1 <= p96) AND (1 <= p97) AND (1 <= p99))))",
"processed_size": 50,
"rewrites": 87
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p38) OR ((1 <= p0) AND (1 <= p251) AND (1 <= p252)))))",
"processed_size": 68,
"rewrites": 87
},
"result":
{
"edges": 52,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 463
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 463
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F (((1 <= p6) AND (1 <= p7) AND (1 <= p9))) U ((1 <= p6) AND (1 <= p7) AND (1 <= p9)))",
"processed_size": 87,
"rewrites": 87
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((1 <= p137) AND F ((((1 <= p148) U (1 <= p232)) AND X (((1 <= p108) U (1 <= p232)))))))",
"processed_size": 91,
"rewrites": 87
},
"result":
{
"edges": 2754,
"markings": 1431,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X (((X (G (((p202 <= 0) OR (p1 <= 1) OR (p2 <= 1)))) OR (p147 <= 0)) AND X ((1 <= p88)))))",
"processed_size": 95,
"rewrites": 87
},
"result":
{
"edges": 52,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 810
},
"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": "F (G ((3 <= p3)))",
"processed_size": 17,
"rewrites": 87
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1080
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((p221 <= 0) OR (p222 <= 0) OR (p224 <= 0))))",
"processed_size": 53,
"rewrites": 87
},
"result":
{
"edges": 172,
"markings": 136,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1621
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G ((p88 <= 0)) AND F (G (((1 <= p51) AND (1 <= p52) AND (1 <= p54))))))",
"processed_size": 75,
"rewrites": 87
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 9,
"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": 3242
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 5,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F ((G (F ((p198 <= 0))) AND F ((p178 <= 0)))) AND G ((F ((1 <= p230)) OR (1 <= p237)))))",
"processed_size": 92,
"rewrites": 87
},
"result":
{
"edges": 8049,
"markings": 3204,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 28
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3420,
"runtime": 579.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(*) AND (F(*) OR X(G(*)))) : F((F((G(F(*)) AND F(*))) AND G((F(**) OR **)))) : G(F(((X((G(F(*)) OR F(*))) R *) OR *))) : F((G(*) AND F(G(**)))) : (F(G(**)) AND (F((X(*) OR (* OR G(**)))) AND X(**))) : X(G(**)) : (X(X(G(**))) AND (F(**) U **)) : X((** AND F(((** U **) AND X((** U **)))))) : X(X(((X(G(*)) OR *) AND X(**)))) : F(G(**)) : G(F(*))"
},
"net":
{
"arcs": 608,
"conflict_clusters": 153,
"places": 254,
"places_significant": 152,
"singleton_clusters": 0,
"transitions": 203
},
"result":
{
"preliminary_value": "no no unknown no no no no yes no no no ",
"value": "no no unknown no no no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 457/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8128
lola: finding significant places
lola: 254 places, 203 transitions, 152 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: NOT((G ((1 <= p28)) U X ((1 <= p97)))) : F ((F ((NOT(F (G ((1 <= p198)))) AND NOT(G ((1 <= p178))))) AND G ((F ((1 <= p230)) OR (1 <= p237))))) : NOT(F (G (((G ((X ((1 <= p18)) U G (X ((1 <= p18))))) U (1 <= p10)) AND (1 <= p202))))) : NOT(G ((F ((1 <= p88)) OR NOT(F (G (((1 <= p51) AND (1 <= p52) AND (1 <= p54)))))))) : (NOT((G ((X (((1 <= p96) AND (1 <= p97) AND (1 <= p99))) AND (1 <= p65))) U G (NOT(G (((1 <= p96) AND (1 <= p97) AND (1 <= p99))))))) AND X (((1 <= p96) AND (1 <= p97) AND (1 <= p99)))) : G (X (((1 <= p38) OR ((1 <= p0) AND (1 <= p251) AND (1 <= p252))))) : (X (X (G (((1 <= p252) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0)))))) AND (F ((X (((1 <= p26) AND (1 <= p27) AND (1 <= p29))) U ((1 <= p6) AND (1 <= p7) AND (1 <= p9)))) U ((1 <= p6) AND (1 <= p7) AND (1 <= p9)))) : (X ((1 <= p137)) AND F ((X (((1 <= p148) U (1 <= p232))) AND X ((X ((1 <= p108)) U X ((1 <= p232))))))) : (NOT(X (X ((F (X (((1 <= p202) AND (2 <= p1) AND (2 <= p2)))) AND (1 <= p147))))) AND X (X (X ((1 <= p88))))) : G (F (G (X ((3 <= p3))))) : NOT(F (G (((1 <= p221) AND (1 <= p222) AND (1 <= p224)))))
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:494
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p97 <= 0)) AND (F ((p28 <= 0)) OR X (G ((p97 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p28 <= 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 <= p28)
lola: processed formula length: 10
lola: 89 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 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p97 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p97 <= 0))
lola: processed formula length: 14
lola: 87 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: 52 markings, 52 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((X ((G (F ((p18 <= 0))) OR F ((p18 <= 0)))) R (p10 <= 0)) OR (p202 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((X ((G (F ((p18 <= 0))) OR F ((p18 <= 0)))) R (p10 <= 0)) OR (p202 <= 0))))
lola: processed formula length: 82
lola: 87 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: 2391299 markings, 3610311 edges, 478260 markings/sec, 0 secs
lola: 4720785 markings, 7127345 edges, 465897 markings/sec, 5 secs
lola: 7087365 markings, 10700423 edges, 473316 markings/sec, 10 secs
lola: 9516301 markings, 14367639 edges, 485787 markings/sec, 15 secs
lola: 11947618 markings, 18038402 edges, 486263 markings/sec, 20 secs
lola: 14365136 markings, 21688408 edges, 483504 markings/sec, 25 secs
lola: 16767616 markings, 25315670 edges, 480496 markings/sec, 30 secs
lola: 19111649 markings, 28854789 edges, 468807 markings/sec, 35 secs
lola: 21411534 markings, 32327134 edges, 459977 markings/sec, 40 secs
lola: 23693020 markings, 35771706 edges, 456297 markings/sec, 45 secs
lola: 25979727 markings, 39224208 edges, 457341 markings/sec, 50 secs
lola: 28299961 markings, 42727272 edges, 464047 markings/sec, 55 secs
lola: 30673727 markings, 46311235 edges, 474753 markings/sec, 60 secs
lola: 33092760 markings, 49963484 edges, 483807 markings/sec, 65 secs
lola: 35436154 markings, 53501578 edges, 468679 markings/sec, 70 secs
lola: 37818319 markings, 57098121 edges, 476433 markings/sec, 75 secs
lola: 40184231 markings, 60670150 edges, 473182 markings/sec, 80 secs
lola: 42567935 markings, 64269065 edges, 476741 markings/sec, 85 secs
lola: 44977678 markings, 67907354 edges, 481949 markings/sec, 90 secs
lola: 45744128 markings, 69064515 edges, 153290 markings/sec, 95 secs
lola: 45800001 markings, 69148844 edges, 11175 markings/sec, 100 secs
lola: 46836507 markings, 70715362 edges, 207301 markings/sec, 105 secs
lola: 47432235 markings, 71614249 edges, 119146 markings/sec, 110 secs
lola: 48697979 markings, 73525080 edges, 253149 markings/sec, 115 secs
lola: 48741681 markings, 73590258 edges, 8740 markings/sec, 120 secs
lola: 49514313 markings, 74766368 edges, 154526 markings/sec, 125 secs
lola: 49981922 markings, 75462810 edges, 93522 markings/sec, 130 secs
lola: 50034783 markings, 75542653 edges, 10572 markings/sec, 135 secs
lola: 50544840 markings, 76312729 edges, 102011 markings/sec, 140 secs
lola: 50943724 markings, 76914929 edges, 79777 markings/sec, 145 secs
lola: 51182328 markings, 77275227 edges, 47721 markings/sec, 150 secs
lola: 51191364 markings, 77288847 edges, 1807 markings/sec, 155 secs
lola: 51708252 markings, 78069215 edges, 103378 markings/sec, 160 secs
lola: 51714924 markings, 78079277 edges, 1334 markings/sec, 165 secs
lola: 51785314 markings, 78185602 edges, 14078 markings/sec, 170 secs
lola: 53205297 markings, 80329454 edges, 283997 markings/sec, 175 secs
lola: 54683681 markings, 82561540 edges, 295677 markings/sec, 180 secs
lola: 54683681 markings, 82561540 edges, 0 markings/sec, 185 secs
lola: 54683681 markings, 82561540 edges, 0 markings/sec, 190 secs
lola: 54683681 markings, 82561540 edges, 0 markings/sec, 195 secs
lola: 54706177 markings, 82595492 edges, 4499 markings/sec, 200 secs
lola: 56204815 markings, 84858133 edges, 299728 markings/sec, 205 secs
lola: 56323091 markings, 85036747 edges, 23655 markings/sec, 210 secs
lola: 56323091 markings, 85036747 edges, 0 markings/sec, 215 secs
lola: 56339226 markings, 85061105 edges, 3227 markings/sec, 220 secs
lola: 57017223 markings, 86084702 edges, 135599 markings/sec, 225 secs
lola: 57017223 markings, 86084702 edges, 0 markings/sec, 230 secs
lola: 57125066 markings, 86247517 edges, 21569 markings/sec, 235 secs
lola: 57125066 markings, 86247517 edges, 0 markings/sec, 240 secs
lola: 57134869 markings, 86262334 edges, 1961 markings/sec, 245 secs
lola: 57181647 markings, 86332979 edges, 9356 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p96) AND (1 <= p97) AND (1 <= p99)))) AND (F ((X (((p96 <= 0) OR (p97 <= 0) OR (p99 <= 0))) OR ((p65 <= 0) OR G (((1 <= p96) AND (1 <= p97) AND (1 <= p99)))))) AND X (((1 <= p96) AND (1 <= p97) AND (1 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p96) AND (1 <= p97) AND (1 <= p99))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p96) AND (1 <= p97) AND (1 <= p99))))
lola: processed formula length: 50
lola: 87 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: add low 201
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: 8 markings, 9 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p38) OR ((1 <= p0) AND (1 <= p251) AND (1 <= p252)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p38) OR ((1 <= p0) AND (1 <= p251) AND (1 <= p252)))))
lola: processed formula length: 68
lola: 87 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: 52 markings, 52 edges
lola: ========================================
lola: subprocess 4 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G (((1 <= p252) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0)))))) AND (F (((1 <= p6) AND (1 <= p7) AND (1 <= p9))) U ((1 <= p6) AND (1 <= p7) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p6) AND (1 <= p7) AND (1 <= p9))) U ((1 <= p6) AND (1 <= p7) AND (1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p6) AND (1 <= p7) AND (1 <= p9))) U ((1 <= p6) AND (1 <= p7) AND (1 <= p9)))
lola: processed formula length: 87
lola: 87 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p137) AND F ((((1 <= p148) U (1 <= p232)) AND X (((1 <= p108) U (1 <= p232)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p137) AND F ((((1 <= p148) U (1 <= p232)) AND X (((1 <= p108) U (1 <= p232)))))))
lola: processed formula length: 91
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1431 markings, 2754 edges
lola: ========================================
lola: subprocess 6 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((X (G (((p202 <= 0) OR (p1 <= 1) OR (p2 <= 1)))) OR (p147 <= 0)) AND X ((1 <= p88)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((X (G (((p202 <= 0) OR (p1 <= 1) OR (p2 <= 1)))) OR (p147 <= 0)) AND X ((1 <= p88)))))
lola: processed formula length: 95
lola: 87 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: 52 markings, 52 edges
lola: ========================================
lola: subprocess 7 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((3 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((3 <= p3)))
lola: processed formula length: 17
lola: 87 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: add low 201
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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 1080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p221 <= 0) OR (p222 <= 0) OR (p224 <= 0))))
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 (((p221 <= 0) OR (p222 <= 0) OR (p224 <= 0))))
lola: processed formula length: 53
lola: 87 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: 136 markings, 172 edges
lola: ========================================
lola: subprocess 9 will run for 1621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p88 <= 0)) AND F (G (((1 <= p51) AND (1 <= p52) AND (1 <= p54))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p88 <= 0)) AND F (G (((1 <= p51) AND (1 <= p52) AND (1 <= p54))))))
lola: processed formula length: 75
lola: 87 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: 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 10 will run for 3242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((G (F ((p198 <= 0))) AND F ((p178 <= 0)))) AND G ((F ((1 <= p230)) OR (1 <= p237)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((G (F ((p198 <= 0))) AND F ((p178 <= 0)))) AND G ((F ((1 <= p230)) OR (1 <= p237)))))
lola: processed formula length: 92
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 28 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3204 markings, 8049 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F (((X ((G (F ((p18 <= 0))) OR F ((p18 <= 0)))) R (p10 <= 0)) OR (p202 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((X ((G (F ((p18 <= 0))) OR F ((p18 <= 0)))) R (p10 <= 0)) OR (p202 <= 0))))
lola: processed formula length: 82
lola: 87 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: 2417912 markings, 3650442 edges, 483582 markings/sec, 0 secs
lola: 4881677 markings, 7370244 edges, 492753 markings/sec, 5 secs
lola: 7318479 markings, 11049402 edges, 487360 markings/sec, 10 secs
lola: 9667607 markings, 14596103 edges, 469826 markings/sec, 15 secs
lola: 12008299 markings, 18130052 edges, 468138 markings/sec, 20 secs
lola: 14441923 markings, 21804327 edges, 486725 markings/sec, 25 secs
lola: 16875372 markings, 25478391 edges, 486690 markings/sec, 30 secs
lola: 19250286 markings, 29064026 edges, 474983 markings/sec, 35 secs
lola: 21627199 markings, 32652695 edges, 475383 markings/sec, 40 secs
lola: 23954075 markings, 36165839 edges, 465375 markings/sec, 45 secs
lola: 26318254 markings, 39735331 edges, 472836 markings/sec, 50 secs
lola: 28649669 markings, 43255327 edges, 466283 markings/sec, 55 secs
lola: 31089089 markings, 46938331 edges, 487884 markings/sec, 60 secs
lola: 33582534 markings, 50702928 edges, 498689 markings/sec, 65 secs
lola: 36095863 markings, 54497581 edges, 502666 markings/sec, 70 secs
lola: 38526145 markings, 58166816 edges, 486056 markings/sec, 75 secs
lola: 40943661 markings, 61816734 edges, 483503 markings/sec, 80 secs
lola: 43318886 markings, 65402947 edges, 475045 markings/sec, 85 secs
lola: 45709835 markings, 69012777 edges, 478190 markings/sec, 90 secs
lola: 46761094 markings, 70600528 edges, 210252 markings/sec, 95 secs
lola: 48308706 markings, 72937390 edges, 309522 markings/sec, 100 secs
lola: 50379973 markings, 76064200 edges, 414253 markings/sec, 105 secs
lola: 50849530 markings, 76772700 edges, 93911 markings/sec, 110 secs
lola: 51436111 markings, 77658318 edges, 117316 markings/sec, 115 secs
lola: 53129084 markings, 80214387 edges, 338595 markings/sec, 120 secs
lola: 55137199 markings, 83246287 edges, 401623 markings/sec, 125 secs
lola: 55160096 markings, 83280865 edges, 4579 markings/sec, 130 secs
lola: 55160096 markings, 83280865 edges, 0 markings/sec, 135 secs
lola: 55160096 markings, 83280865 edges, 0 markings/sec, 140 secs
lola: 55160096 markings, 83280865 edges, 0 markings/sec, 145 secs
lola: 55160096 markings, 83280865 edges, 0 markings/sec, 150 secs
lola: 56483952 markings, 85279559 edges, 264771 markings/sec, 155 secs
lola: 57013870 markings, 86079673 edges, 105984 markings/sec, 160 secs
lola: 57013870 markings, 86079673 edges, 0 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no unknown no no no no yes no no no
lola:
preliminary result: no no unknown no no no no yes no no no
lola: memory consumption: 3420 KB
lola: time consumption: 579 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-050051"
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-050051, 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-158987938500106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-050051.tgz
mv RefineWMG-PT-050051 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;