fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r161-smll-165277002800095
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for ParamProductionCell-PT-0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
235.760 8485.00 19273.00 331.80 FTFTFFTTTTFFTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r161-smll-165277002800095.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
Input is ParamProductionCell-PT-0, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-smll-165277002800095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.2K Apr 29 17:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 17:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 17:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 29 17:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 29 17:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 29 17:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 17:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 149K May 10 09:34 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 ParamProductionCell-PT-0-ReachabilityCardinality-00
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-01
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-02
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-03
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-04
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-05
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-06
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-07
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-08
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-09
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-10
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-11
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-12
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-13
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-14
FORMULA_NAME ParamProductionCell-PT-0-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655077370578

Running Version 0
[2022-06-12 23:42:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 23:42:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 23:42:53] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2022-06-12 23:42:53] [INFO ] Transformed 198 places.
[2022-06-12 23:42:53] [INFO ] Transformed 176 transitions.
[2022-06-12 23:42:53] [INFO ] Found NUPN structural information;
[2022-06-12 23:42:53] [INFO ] Parsed PT model containing 198 places and 176 transitions in 185 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 14) seen :2
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :1
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 176 rows 198 cols
[2022-06-12 23:42:54] [INFO ] Computed 49 place invariants in 25 ms
[2022-06-12 23:42:54] [INFO ] [Real]Absence check using 32 positive place invariants in 32 ms returned sat
[2022-06-12 23:42:54] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 11 ms returned sat
[2022-06-12 23:42:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:54] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-06-12 23:42:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:42:55] [INFO ] [Real]Absence check using 32 positive place invariants in 17 ms returned sat
[2022-06-12 23:42:55] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 7 ms returned sat
[2022-06-12 23:42:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:55] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2022-06-12 23:42:55] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-06-12 23:42:55] [INFO ] [Real]Added 59 Read/Feed constraints in 10 ms returned sat
[2022-06-12 23:42:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:42:55] [INFO ] [Nat]Absence check using 32 positive place invariants in 17 ms returned sat
[2022-06-12 23:42:55] [INFO ] [Nat]Absence check using 32 positive and 17 generalized place invariants in 7 ms returned sat
[2022-06-12 23:42:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:55] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2022-06-12 23:42:55] [INFO ] [Nat]Added 59 Read/Feed constraints in 14 ms returned sat
[2022-06-12 23:42:55] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 8 ms to minimize.
[2022-06-12 23:42:55] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2022-06-12 23:42:55] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2022-06-12 23:42:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 435 ms
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using 32 positive place invariants in 16 ms returned sat
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 7 ms returned sat
[2022-06-12 23:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2022-06-12 23:42:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using 32 positive place invariants in 18 ms returned sat
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 4 ms returned unsat
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using 32 positive place invariants in 19 ms returned sat
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 7 ms returned sat
[2022-06-12 23:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2022-06-12 23:42:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using 32 positive place invariants in 18 ms returned sat
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 9 ms returned sat
[2022-06-12 23:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2022-06-12 23:42:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned unsat
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using 32 positive place invariants in 21 ms returned sat
[2022-06-12 23:42:56] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 26 ms returned sat
[2022-06-12 23:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:57] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2022-06-12 23:42:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:42:57] [INFO ] [Real]Absence check using 32 positive place invariants in 15 ms returned sat
[2022-06-12 23:42:57] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 12 ms returned sat
[2022-06-12 23:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:57] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2022-06-12 23:42:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:42:57] [INFO ] [Real]Absence check using 32 positive place invariants in 14 ms returned sat
[2022-06-12 23:42:57] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 6 ms returned sat
[2022-06-12 23:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:57] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2022-06-12 23:42:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:42:57] [INFO ] [Real]Absence check using 32 positive place invariants in 20 ms returned sat
[2022-06-12 23:42:57] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 10 ms returned sat
[2022-06-12 23:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:57] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2022-06-12 23:42:57] [INFO ] Solution in real domain found non-integer solution.
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 0 different solutions.
All properties solved without resorting to model-checking.

BK_STOP 1655077379063

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ParamProductionCell-PT-0"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is ParamProductionCell-PT-0, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r161-smll-165277002800095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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