Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097400233.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is DLCshifumi-PT-3a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097400233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 778K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCshifumi-PT-3a-00
FORMULA_NAME DLCshifumi-PT-3a-01
FORMULA_NAME DLCshifumi-PT-3a-02
FORMULA_NAME DLCshifumi-PT-3a-03
FORMULA_NAME DLCshifumi-PT-3a-04
FORMULA_NAME DLCshifumi-PT-3a-05
FORMULA_NAME DLCshifumi-PT-3a-06
FORMULA_NAME DLCshifumi-PT-3a-07
FORMULA_NAME DLCshifumi-PT-3a-08
FORMULA_NAME DLCshifumi-PT-3a-09
FORMULA_NAME DLCshifumi-PT-3a-10
FORMULA_NAME DLCshifumi-PT-3a-11
FORMULA_NAME DLCshifumi-PT-3a-12
FORMULA_NAME DLCshifumi-PT-3a-13
FORMULA_NAME DLCshifumi-PT-3a-14
FORMULA_NAME DLCshifumi-PT-3a-15

=== Now, execution of the tool begins

BK_START 1620549856059

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 08:44:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-09 08:44:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:44:17] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2021-05-09 08:44:17] [INFO ] Transformed 544 places.
[2021-05-09 08:44:17] [INFO ] Transformed 3097 transitions.
[2021-05-09 08:44:17] [INFO ] Found NUPN structural information;
[2021-05-09 08:44:17] [INFO ] Parsed PT model containing 544 places and 3097 transitions in 223 ms.
Ensure Unique test removed 405 transitions
Reduce redundant transitions removed 405 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1364 ms. (steps per millisecond=73 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0]
[2021-05-09 08:44:19] [INFO ] Flow matrix only has 440 transitions (discarded 2252 similar events)
// Phase 1: matrix 440 rows 544 cols
[2021-05-09 08:44:19] [INFO ] Computed 282 place invariants in 14 ms
[2021-05-09 08:44:19] [INFO ] [Real]Absence check using 282 positive place invariants in 132 ms returned sat
[2021-05-09 08:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:20] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2021-05-09 08:44:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:20] [INFO ] [Nat]Absence check using 282 positive place invariants in 56 ms returned unsat
[2021-05-09 08:44:20] [INFO ] [Real]Absence check using 282 positive place invariants in 118 ms returned sat
[2021-05-09 08:44:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:21] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2021-05-09 08:44:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:21] [INFO ] [Nat]Absence check using 282 positive place invariants in 52 ms returned unsat
[2021-05-09 08:44:21] [INFO ] [Real]Absence check using 282 positive place invariants in 118 ms returned sat
[2021-05-09 08:44:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:22] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2021-05-09 08:44:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:22] [INFO ] [Nat]Absence check using 282 positive place invariants in 79 ms returned unsat
[2021-05-09 08:44:22] [INFO ] [Real]Absence check using 282 positive place invariants in 120 ms returned sat
[2021-05-09 08:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:23] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2021-05-09 08:44:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:23] [INFO ] [Nat]Absence check using 282 positive place invariants in 82 ms returned unsat
[2021-05-09 08:44:23] [INFO ] [Real]Absence check using 282 positive place invariants in 116 ms returned sat
[2021-05-09 08:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:24] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2021-05-09 08:44:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:24] [INFO ] [Nat]Absence check using 282 positive place invariants in 38 ms returned unsat
[2021-05-09 08:44:24] [INFO ] [Real]Absence check using 282 positive place invariants in 110 ms returned sat
[2021-05-09 08:44:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:25] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2021-05-09 08:44:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:25] [INFO ] [Nat]Absence check using 282 positive place invariants in 13 ms returned unsat
[2021-05-09 08:44:25] [INFO ] [Real]Absence check using 282 positive place invariants in 109 ms returned sat
[2021-05-09 08:44:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:26] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2021-05-09 08:44:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:26] [INFO ] [Nat]Absence check using 282 positive place invariants in 94 ms returned unsat
[2021-05-09 08:44:26] [INFO ] [Real]Absence check using 282 positive place invariants in 7 ms returned unsat
[2021-05-09 08:44:26] [INFO ] [Real]Absence check using 282 positive place invariants in 122 ms returned sat
[2021-05-09 08:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:27] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2021-05-09 08:44:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:27] [INFO ] [Nat]Absence check using 282 positive place invariants in 85 ms returned unsat
[2021-05-09 08:44:27] [INFO ] [Real]Absence check using 282 positive place invariants in 107 ms returned sat
[2021-05-09 08:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:28] [INFO ] [Real]Absence check using state equation in 975 ms returned sat
[2021-05-09 08:44:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:28] [INFO ] [Nat]Absence check using 282 positive place invariants in 83 ms returned unsat
[2021-05-09 08:44:28] [INFO ] [Real]Absence check using 282 positive place invariants in 117 ms returned sat
[2021-05-09 08:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:29] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2021-05-09 08:44:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:29] [INFO ] [Nat]Absence check using 282 positive place invariants in 69 ms returned unsat
[2021-05-09 08:44:29] [INFO ] [Real]Absence check using 282 positive place invariants in 120 ms returned sat
[2021-05-09 08:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:30] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2021-05-09 08:44:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:30] [INFO ] [Nat]Absence check using 282 positive place invariants in 24 ms returned unsat
[2021-05-09 08:44:30] [INFO ] [Real]Absence check using 282 positive place invariants in 86 ms returned unsat
[2021-05-09 08:44:31] [INFO ] [Real]Absence check using 282 positive place invariants in 112 ms returned sat
[2021-05-09 08:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:31] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2021-05-09 08:44:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:31] [INFO ] [Nat]Absence check using 282 positive place invariants in 13 ms returned unsat
[2021-05-09 08:44:31] [INFO ] [Real]Absence check using 282 positive place invariants in 7 ms returned unsat
[2021-05-09 08:44:32] [INFO ] [Real]Absence check using 282 positive place invariants in 113 ms returned sat
[2021-05-09 08:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:32] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2021-05-09 08:44:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:32] [INFO ] [Nat]Absence check using 282 positive place invariants in 59 ms returned unsat
[2021-05-09 08:44:32] [INFO ] [Real]Absence check using 282 positive place invariants in 104 ms returned sat
[2021-05-09 08:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:44:33] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2021-05-09 08:44:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:44:33] [INFO ] [Nat]Absence check using 282 positive place invariants in 13 ms returned unsat
Successfully simplified 17 atomic propositions for a total of 19 simplifications.
[2021-05-09 08:44:33] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-09 08:44:34] [INFO ] Flatten gal took : 178 ms
FORMULA DLCshifumi-PT-3a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 08:44:34] [INFO ] Applying decomposition
[2021-05-09 08:44:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-09 08:44:34] [INFO ] Flatten gal took : 113 ms
[2021-05-09 08:44:34] [INFO ] Decomposing Gal with order
[2021-05-09 08:44:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:44:34] [INFO ] Removed a total of 4080 redundant transitions.
[2021-05-09 08:44:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-09 08:44:34] [INFO ] Flatten gal took : 205 ms
[2021-05-09 08:44:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 231 labels/synchronizations in 91 ms.
[2021-05-09 08:44:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DLCshifumi-PT-3a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 08:44:34] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-09 08:44:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 23 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DLCshifumi-PT-3a @ 3570 seconds

FORMULA DLCshifumi-PT-3a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-3a-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-3a-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-3a-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-3a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-3a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-3a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLCardinality @ DLCshifumi-PT-3a

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 9 08:44:35 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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 <= p124))",
"processed_size": 13,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p378 <= 0))",
"processed_size": 13,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"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 (X ((((1 <= p446)) AND ((p85 <= 0)))))",
"processed_size": 40,
"rewrites": 24
},
"result":
{
"edges": 676,
"markings": 126,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F (((((1 <= p50)) AND ((p135 <= 0))) OR (((1 <= p543)) AND ((p33 <= 0))))))",
"processed_size": 78,
"rewrites": 24
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X (G ((F (G ((((1 <= p497)) AND ((p282 <= 0))))) AND (((p497 <= 0)) OR ((1 <= p282))))))",
"processed_size": 89,
"rewrites": 24
},
"result":
{
"edges": 707,
"markings": 41,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p45 <= 0))",
"processed_size": 12,
"rewrites": 26
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "(((p24 <= 0)) OR ((1 <= p92)))",
"processed_size": 31,
"rewrites": 26
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"error": null,
"memory": 45656,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(**) : (** AND (X(F(*)) OR **)) : X((** OR (G(F(**)) AND F(**)))) : F(*) : X(X(*)) : X(F((* OR *))) : X(G((F(G(*)) AND **)))"
},
"net":
{
"arcs": 10255,
"conflict_clusters": 122,
"places": 544,
"places_significant": 262,
"singleton_clusters": 0,
"transitions": 2692
},
"result":
{
"preliminary_value": "no no yes no yes yes no ",
"value": "no no yes no yes 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: 3236/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 544
lola: finding significant places
lola: 544 places, 2692 transitions, 262 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p378 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p478 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: (G (((0 <= 0) U (1 <= 0))) OR F (((1 <= p45)))) : (((p378 <= 0)) AND (NOT(G (X ((((p285 <= 0)) OR ((1 <= p88)))))) OR ((1 <= p124)))) : X ((G (F ((((p465 <= 0)) OR ((1 <= p66))))) U ((1 <= p478)))) : NOT(G ((((p24 <= 0)) OR ((1 <= p92))))) : X (NOT(X ((((p446 <= 0)) OR ((1 <= p85)))))) : NOT(X ((G ((((p50 <= 0)) OR ((1 <= p135)))) AND G ((((p543 <= 0)) OR ((1 <= p33))))))) : G (X ((F (NOT(F ((((p497 <= 0)) OR ((1 <= p282)))))) AND (((p497 <= 0)) OR ((1 <= p282))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:431
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p378 <= 0)) AND (X (F ((((1 <= p285)) AND ((p88 <= 0))))) OR ((1 <= p124))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p124))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p124))
lola: processed formula length: 13
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p378 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p378 <= 0))
lola: processed formula length: 13
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p285)) AND ((p88 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p285)) AND ((p88 <= 0)))))
lola: processed formula length: 40
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p478)) OR (G (F ((((p465 <= 0)) OR ((1 <= p66))))) AND F (((1 <= p478))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p478)) OR (G (F ((((p465 <= 0)) OR ((1 <= p66))))) AND F (((1 <= p478))))))
lola: processed formula length: 87
lola: 24 rewrites
lola: closed formula file LTLCardinality.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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((1 <= p446)) AND ((p85 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((1 <= p446)) AND ((p85 <= 0)))))
lola: processed formula length: 40
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 126 markings, 676 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((((1 <= p50)) AND ((p135 <= 0))) OR (((1 <= p543)) AND ((p33 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((((1 <= p50)) AND ((p135 <= 0))) OR (((1 <= p543)) AND ((p33 <= 0))))))
lola: processed formula length: 78
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (G ((((1 <= p497)) AND ((p282 <= 0))))) AND (((p497 <= 0)) OR ((1 <= p282))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G ((((1 <= p497)) AND ((p282 <= 0))))) AND (((p497 <= 0)) OR ((1 <= p282))))))
lola: processed formula length: 89
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 41 markings, 707 edges
lola: ========================================
lola: subprocess 5 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p45)))
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: ((p45 <= 0))
lola: processed formula length: 12
lola: 26 rewrites
lola: closed formula file LTLCardinality.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 6 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p24)) AND ((p92 <= 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: (((p24 <= 0)) OR ((1 <= p92)))
lola: processed formula length: 31
lola: 26 rewrites
lola: closed formula file LTLCardinality.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: RESULT
lola:
SUMMARY: no no yes no yes yes no
lola:
preliminary result: no no yes no yes yes no
lola: memory consumption: 45656 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="DLCshifumi-PT-3a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is DLCshifumi-PT-3a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097400233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-3a.tgz
mv DLCshifumi-PT-3a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;