Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r481-tall-167912691800301.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is Sudoku-PT-BN04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912691800301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 40K Feb 26 09:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 230K Feb 26 09:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 104K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 488K Feb 26 09:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 18K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 88K Feb 26 09:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 496K Feb 26 09:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 268K Feb 26 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 53K Mar 5 18:23 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 Sudoku-PT-BN04-UpperBounds-00
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-01
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-02
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-03
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-04
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-05
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-06
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-07
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-08
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-09
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-10
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-11
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-12
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-13
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-14
FORMULA_NAME Sudoku-PT-BN04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679157223423

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN04
Not applying reductions.
Model is PT
UpperBounds PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Sudoku_PT_BN04
(NrP: 128 NrTr: 64 NrArc: 320)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 2.838sec


RS generation: 0m 7.565sec


-> reachability set: #nodes 710410 (7.1e+05) #states 61,556,225 (7)



starting MCC model checker
--------------------------

checking: place_bound(Board_1_3_3)
normalized: place_bound(Board_1_3_3)

-> the formula is 1

FORMULA Sudoku-PT-BN04-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Columns_3_1)
normalized: place_bound(Columns_3_1)

-> the formula is 1

FORMULA Sudoku-PT-BN04-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Regions_3_1)
normalized: place_bound(Regions_3_1)

-> the formula is 1

FORMULA Sudoku-PT-BN04-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Board_1_1_2)
normalized: place_bound(Board_1_1_2)

-> the formula is 1

FORMULA Sudoku-PT-BN04-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Rows_0_3)
normalized: place_bound(Rows_0_3)

-> the formula is 1

FORMULA Sudoku-PT-BN04-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Board_0_2_0)
normalized: place_bound(Board_0_2_0)

-> the formula is 1

FORMULA Sudoku-PT-BN04-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Cells_3_3)
normalized: place_bound(Cells_3_3)

-> the formula is 1

FORMULA Sudoku-PT-BN04-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Columns_0_3)
normalized: place_bound(Columns_0_3)

-> the formula is 1

FORMULA Sudoku-PT-BN04-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Columns_0_0,Columns_0_1,Columns_0_2,Columns_0_3,Columns_1_0,Columns_1_1,Columns_1_2,Columns_1_3,Columns_2_0,Columns_2_1,Columns_2_2,Columns_2_3,Columns_3_0,Columns_3_1,Columns_3_2,Columns_3_3)
normalized: place_bound(Columns_0_0,Columns_0_1,Columns_0_2,Columns_0_3,Columns_1_0,Columns_1_1,Columns_1_2,Columns_1_3,Columns_2_0,Columns_2_1,Columns_2_2,Columns_2_3,Columns_3_0,Columns_3_1,Columns_3_2,Columns_3_3)

-> the formula is 16

FORMULA Sudoku-PT-BN04-UpperBounds-00 16 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Regions_0_0,Regions_0_1,Regions_0_2,Regions_0_3,Regions_1_0,Regions_1_1,Regions_1_2,Regions_1_3,Regions_2_0,Regions_2_1,Regions_2_2,Regions_2_3,Regions_3_0,Regions_3_1,Regions_3_2,Regions_3_3)
normalized: place_bound(Regions_0_0,Regions_0_1,Regions_0_2,Regions_0_3,Regions_1_0,Regions_1_1,Regions_1_2,Regions_1_3,Regions_2_0,Regions_2_1,Regions_2_2,Regions_2_3,Regions_3_0,Regions_3_1,Regions_3_2,Regions_3_3)

-> the formula is 16

FORMULA Sudoku-PT-BN04-UpperBounds-03 16 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Columns_0_0,Columns_0_1,Columns_0_2,Columns_0_3,Columns_1_0,Columns_1_1,Columns_1_2,Columns_1_3,Columns_2_0,Columns_2_1,Columns_2_2,Columns_2_3,Columns_3_0,Columns_3_1,Columns_3_2,Columns_3_3)
normalized: place_bound(Columns_0_0,Columns_0_1,Columns_0_2,Columns_0_3,Columns_1_0,Columns_1_1,Columns_1_2,Columns_1_3,Columns_2_0,Columns_2_1,Columns_2_2,Columns_2_3,Columns_3_0,Columns_3_1,Columns_3_2,Columns_3_3)

-> the formula is 16

FORMULA Sudoku-PT-BN04-UpperBounds-04 16 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Cells_0_0,Cells_0_1,Cells_0_2,Cells_0_3,Cells_1_0,Cells_1_1,Cells_1_2,Cells_1_3,Cells_2_0,Cells_2_1,Cells_2_2,Cells_2_3,Cells_3_0,Cells_3_1,Cells_3_2,Cells_3_3)
normalized: place_bound(Cells_0_0,Cells_0_1,Cells_0_2,Cells_0_3,Cells_1_0,Cells_1_1,Cells_1_2,Cells_1_3,Cells_2_0,Cells_2_1,Cells_2_2,Cells_2_3,Cells_3_0,Cells_3_1,Cells_3_2,Cells_3_3)

-> the formula is 16

FORMULA Sudoku-PT-BN04-UpperBounds-05 16 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Rows_0_0,Rows_0_1,Rows_0_2,Rows_0_3,Rows_1_0,Rows_1_1,Rows_1_2,Rows_1_3,Rows_2_0,Rows_2_1,Rows_2_2,Rows_2_3,Rows_3_0,Rows_3_1,Rows_3_2,Rows_3_3)
normalized: place_bound(Rows_0_0,Rows_0_1,Rows_0_2,Rows_0_3,Rows_1_0,Rows_1_1,Rows_1_2,Rows_1_3,Rows_2_0,Rows_2_1,Rows_2_2,Rows_2_3,Rows_3_0,Rows_3_1,Rows_3_2,Rows_3_3)

-> the formula is 16

FORMULA Sudoku-PT-BN04-UpperBounds-06 16 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Regions_0_0,Regions_0_1,Regions_0_2,Regions_0_3,Regions_1_0,Regions_1_1,Regions_1_2,Regions_1_3,Regions_2_0,Regions_2_1,Regions_2_2,Regions_2_3,Regions_3_0,Regions_3_1,Regions_3_2,Regions_3_3)
normalized: place_bound(Regions_0_0,Regions_0_1,Regions_0_2,Regions_0_3,Regions_1_0,Regions_1_1,Regions_1_2,Regions_1_3,Regions_2_0,Regions_2_1,Regions_2_2,Regions_2_3,Regions_3_0,Regions_3_1,Regions_3_2,Regions_3_3)

-> the formula is 16

FORMULA Sudoku-PT-BN04-UpperBounds-07 16 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Board_0_0_0,Board_0_0_1,Board_0_0_2,Board_0_0_3,Board_0_1_0,Board_0_1_1,Board_0_1_2,Board_0_1_3,Board_0_2_0,Board_0_2_1,Board_0_2_2,Board_0_2_3,Board_0_3_0,Board_0_3_1,Board_0_3_2,Board_0_3_3,Board_1_0_0,Board_1_0_1,Board_1_0_2,Board_1_0_3,Board_1_1_0,Board_1_1_1,Board_1_1_2,Board_1_1_3,Board_1_2_0,Board_1_2_1,Board_1_2_2,Board_1_2_3,Board_1_3_0,Board_1_3_1,Board_1_3_2,Board_1_3_3,Board_2_0_0,Board_2_0_1,Board_2_0_2,Board_2_0_3,Board_2_1_0,Board_2_1_1,Board_2_1_2,Board_2_1_3,Board_2_2_0,Board_2_2_1,Board_2_2_2,Board_2_2_3,Board_2_3_0,Board_2_3_1,Board_2_3_2,Board_2_3_3,Board_3_0_0,Board_3_0_1,Board_3_0_2,Board_3_0_3,Board_3_1_0,Board_3_1_1,Board_3_1_2,Board_3_1_3,Board_3_2_0,Board_3_2_1,Board_3_2_2,Board_3_2_3,Board_3_3_0,Board_3_3_1,Board_3_3_2,Board_3_3_3)
normalized: place_bound(Board_0_0_0,Board_0_0_1,Board_0_0_2,Board_0_0_3,Board_0_1_0,Board_0_1_1,Board_0_1_2,Board_0_1_3,Board_0_2_0,Board_0_2_1,Board_0_2_2,Board_0_2_3,Board_0_3_0,Board_0_3_1,Board_0_3_2,Board_0_3_3,Board_1_0_0,Board_1_0_1,Board_1_0_2,Board_1_0_3,Board_1_1_0,Board_1_1_1,Board_1_1_2,Board_1_1_3,Board_1_2_0,Board_1_2_1,Board_1_2_2,Board_1_2_3,Board_1_3_0,Board_1_3_1,Board_1_3_2,Board_1_3_3,Board_2_0_0,Board_2_0_1,Board_2_0_2,Board_2_0_3,Board_2_1_0,Board_2_1_1,Board_2_1_2,Board_2_1_3,Board_2_2_0,Board_2_2_1,Board_2_2_2,Board_2_2_3,Board_2_3_0,Board_2_3_1,Board_2_3_2,Board_2_3_3,Board_3_0_0,Board_3_0_1,Board_3_0_2,Board_3_0_3,Board_3_1_0,Board_3_1_1,Board_3_1_2,Board_3_1_3,Board_3_2_0,Board_3_2_1,Board_3_2_2,Board_3_2_3,Board_3_3_0,Board_3_3_1,Board_3_3_2,Board_3_3_3)

-> the formula is 16

FORMULA Sudoku-PT-BN04-UpperBounds-01 16 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Board_0_0_0,Board_0_0_1,Board_0_0_2,Board_0_0_3,Board_0_1_0,Board_0_1_1,Board_0_1_2,Board_0_1_3,Board_0_2_0,Board_0_2_1,Board_0_2_2,Board_0_2_3,Board_0_3_0,Board_0_3_1,Board_0_3_2,Board_0_3_3,Board_1_0_0,Board_1_0_1,Board_1_0_2,Board_1_0_3,Board_1_1_0,Board_1_1_1,Board_1_1_2,Board_1_1_3,Board_1_2_0,Board_1_2_1,Board_1_2_2,Board_1_2_3,Board_1_3_0,Board_1_3_1,Board_1_3_2,Board_1_3_3,Board_2_0_0,Board_2_0_1,Board_2_0_2,Board_2_0_3,Board_2_1_0,Board_2_1_1,Board_2_1_2,Board_2_1_3,Board_2_2_0,Board_2_2_1,Board_2_2_2,Board_2_2_3,Board_2_3_0,Board_2_3_1,Board_2_3_2,Board_2_3_3,Board_3_0_0,Board_3_0_1,Board_3_0_2,Board_3_0_3,Board_3_1_0,Board_3_1_1,Board_3_1_2,Board_3_1_3,Board_3_2_0,Board_3_2_1,Board_3_2_2,Board_3_2_3,Board_3_3_0,Board_3_3_1,Board_3_3_2,Board_3_3_3)
normalized: place_bound(Board_0_0_0,Board_0_0_1,Board_0_0_2,Board_0_0_3,Board_0_1_0,Board_0_1_1,Board_0_1_2,Board_0_1_3,Board_0_2_0,Board_0_2_1,Board_0_2_2,Board_0_2_3,Board_0_3_0,Board_0_3_1,Board_0_3_2,Board_0_3_3,Board_1_0_0,Board_1_0_1,Board_1_0_2,Board_1_0_3,Board_1_1_0,Board_1_1_1,Board_1_1_2,Board_1_1_3,Board_1_2_0,Board_1_2_1,Board_1_2_2,Board_1_2_3,Board_1_3_0,Board_1_3_1,Board_1_3_2,Board_1_3_3,Board_2_0_0,Board_2_0_1,Board_2_0_2,Board_2_0_3,Board_2_1_0,Board_2_1_1,Board_2_1_2,Board_2_1_3,Board_2_2_0,Board_2_2_1,Board_2_2_2,Board_2_2_3,Board_2_3_0,Board_2_3_1,Board_2_3_2,Board_2_3_3,Board_3_0_0,Board_3_0_1,Board_3_0_2,Board_3_0_3,Board_3_1_0,Board_3_1_1,Board_3_1_2,Board_3_1_3,Board_3_2_0,Board_3_2_1,Board_3_2_2,Board_3_2_3,Board_3_3_0,Board_3_3_1,Board_3_3_2,Board_3_3_3)

-> the formula is 16

FORMULA Sudoku-PT-BN04-UpperBounds-02 16 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 722103 (7.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1687773 18034176 19721949
used/not used/entry size/cache size: 15577425 51531439 16 1024MB
basic ops cache: hits/miss/sum: 0 8128 8128
used/not used/entry size/cache size: 24306 16752910 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 86395 711260 797655
used/not used/entry size/cache size: 684895 7703713 32 256MB
max state cache: hits/miss/sum: 431975 3556300 3988275
used/not used/entry size/cache size: 684895 7703713 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66480116
1 549120
2 67455
3 10758
4 1280
5 131
6 4
7 0
8 0
9 0
>= 10 0

Total processing time: 0m15.257sec


BK_STOP 1679157238729

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

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:1554 (24), effective:64 (1)

initing FirstDep: 0m 0.000sec

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="Sudoku-PT-BN04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
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-5348"
echo " Executing tool marcie"
echo " Input is Sudoku-PT-BN04, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r481-tall-167912691800301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-BN04.tgz
mv Sudoku-PT-BN04 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 ;