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.r312-tall-165472283000989.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 itstools
Input is Szymanski-PT-a02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472283000989
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 7 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 7 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 6 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 7.6K Jun 7 17:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 17:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 7 17:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 101K Jun 6 12:11 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654969011018

Running Version 202205111006
[2022-06-11 17:36:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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-11 17:36:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 17:36:52] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2022-06-11 17:36:52] [INFO ] Transformed 61 places.
[2022-06-11 17:36:52] [INFO ] Transformed 224 transitions.
[2022-06-11 17:36:52] [INFO ] Parsed PT model containing 61 places and 224 transitions in 196 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a02-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 79 out of 216 initially.
// Phase 1: matrix 79 rows 49 cols
[2022-06-11 17:36:52] [INFO ] Computed 3 place invariants in 15 ms
FORMULA Szymanski-PT-a02-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 33 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :24
FORMULA Szymanski-PT-a02-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :17
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :9
[2022-06-11 17:36:52] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2022-06-11 17:36:52] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 17:36:52] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-11 17:36:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 17:36:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 17:36:52] [INFO ] [Real]Absence check using state equation in 38 ms returned unsat
[2022-06-11 17:36:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 17:36:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 17:36:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 17:36:52] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
[2022-06-11 17:36:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:36:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 17:36:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 17:36:52] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2022-06-11 17:36:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:36:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 17:36:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 17:36:52] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-11 17:36:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 17:36:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:36:52] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 17:36:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 17:36:52] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-11 17:36:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 17:36:52] [INFO ] [Nat]Added 9 Read/Feed constraints in 11 ms returned sat
[2022-06-11 17:36:52] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 7 ms to minimize.
[2022-06-11 17:36:53] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2022-06-11 17:36:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 109 ms
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-11 17:36:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 17:36:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 17:36:53] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-06-11 17:36:53] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-06-11 17:36:53] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
[2022-06-11 17:36:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 94 ms
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-11 17:36:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 17:36:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 17:36:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-06-11 17:36:53] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2022-06-11 17:36:53] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2022-06-11 17:36:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 88 ms
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-11 17:36:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 17:36:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 17:36:53] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-06-11 17:36:53] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-06-11 17:36:53] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2022-06-11 17:36:53] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2022-06-11 17:36:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 128 ms
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 17:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 17:36:53] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2, 2, 2, 2, 2, 2, 2, 2] Max seen :[2, 2, 2, 2, 2, 2, 2, 2, 2]
FORMULA Szymanski-PT-a02-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 1559 ms.

BK_STOP 1654969013743

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -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=@none -Xss128m -Xms40m -Xmx8192m

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="Szymanski-PT-a02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Szymanski-PT-a02, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472283000989"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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