fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r344-tall-167889215800006
Last Updated
May 14, 2023

About the Execution of Marcie+red for RERS17pb113-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5618.592 1800000.00 1853001.00 35929.20 [undef] Time out reached

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.r344-tall-167889215800006.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 marciexred
Input is RERS17pb113-PT-2, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r344-tall-167889215800006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 18:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 15M 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 booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679120797980

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=marciexred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb113-PT-2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 06:26:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 06:26:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 06:26:40] [INFO ] Load time of PNML (sax parser for PT used): 654 ms
[2023-03-18 06:26:40] [INFO ] Transformed 639 places.
[2023-03-18 06:26:41] [INFO ] Transformed 31353 transitions.
[2023-03-18 06:26:41] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 915 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 29 ms.44363KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Computed a total of 13 stabilizing places and 1 stable transitions
Ensure Unique test removed 12 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 626 transition count 31352
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 13 rules in 944 ms. Remains 626 /639 variables (removed 13) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 958 ms. Remains : 626/639 places, 31352/31353 transitions.
Interrupted Random walk after 908849 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=30 )
[2023-03-18 06:27:12] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-18 06:27:12] [INFO ] Computed 13 place invariants in 112 ms
[2023-03-18 06:27:16] [INFO ] [Real]Absence check using 13 positive place invariants in 23 ms returned sat
[2023-03-18 06:27:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 06:27:31] [INFO ] [Real]Absence check using state equation in 15022 ms returned sat
[2023-03-18 06:27:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 06:27:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-18 06:27:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 06:27:50] [INFO ] [Nat]Absence check using state equation in 15813 ms returned sat
[2023-03-18 06:27:51] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-18 06:27:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 06:27:56] [INFO ] [Nat]Added 268 Read/Feed constraints in 5866 ms returned sat
[2023-03-18 06:27:59] [INFO ] Deduced a trap composed of 24 places in 1647 ms of which 23 ms to minimize.
[2023-03-18 06:28:01] [INFO ] Deduced a trap composed of 65 places in 1742 ms of which 1 ms to minimize.
[2023-03-18 06:28:02] [INFO ] Deduced a trap composed of 40 places in 1074 ms of which 2 ms to minimize.
[2023-03-18 06:28:04] [INFO ] Deduced a trap composed of 48 places in 1957 ms of which 2 ms to minimize.
[2023-03-18 06:28:06] [INFO ] Deduced a trap composed of 40 places in 1563 ms of which 0 ms to minimize.
[2023-03-18 06:28:08] [INFO ] Deduced a trap composed of 64 places in 1553 ms of which 0 ms to minimize.
[2023-03-18 06:28:11] [INFO ] Deduced a trap composed of 64 places in 2221 ms of which 0 ms to minimize.
[2023-03-18 06:28:13] [INFO ] Deduced a trap composed of 48 places in 2126 ms of which 14 ms to minimize.
[2023-03-18 06:28:16] [INFO ] Deduced a trap composed of 64 places in 2105 ms of which 0 ms to minimize.
[2023-03-18 06:28:18] [INFO ] Deduced a trap composed of 64 places in 1908 ms of which 1 ms to minimize.
[2023-03-18 06:28:20] [INFO ] Deduced a trap composed of 40 places in 1622 ms of which 1 ms to minimize.
[2023-03-18 06:28:22] [INFO ] Deduced a trap composed of 64 places in 1267 ms of which 0 ms to minimize.
[2023-03-18 06:28:23] [INFO ] Deduced a trap composed of 40 places in 711 ms of which 1 ms to minimize.
[2023-03-18 06:28:25] [INFO ] Deduced a trap composed of 48 places in 1139 ms of which 0 ms to minimize.
[2023-03-18 06:28:26] [INFO ] Deduced a trap composed of 48 places in 1063 ms of which 0 ms to minimize.
[2023-03-18 06:28:27] [INFO ] Deduced a trap composed of 48 places in 868 ms of which 0 ms to minimize.
[2023-03-18 06:28:29] [INFO ] Deduced a trap composed of 40 places in 822 ms of which 0 ms to minimize.
[2023-03-18 06:28:30] [INFO ] Deduced a trap composed of 40 places in 763 ms of which 0 ms to minimize.
[2023-03-18 06:28:32] [INFO ] Deduced a trap composed of 64 places in 967 ms of which 1 ms to minimize.
[2023-03-18 06:28:33] [INFO ] Deduced a trap composed of 64 places in 517 ms of which 0 ms to minimize.
[2023-03-18 06:28:35] [INFO ] Deduced a trap composed of 64 places in 556 ms of which 1 ms to minimize.
[2023-03-18 06:28:37] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 40304 ms
[2023-03-18 06:28:39] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2265 ms.
[2023-03-18 06:28:40] [INFO ] Added : 0 causal constraints over 0 iterations in 3427 ms. Result :sat
Interrupted Parikh directed walk after 44576 steps, including 44576 resets, run timeout after 30001 ms. (steps per millisecond=1 )
Parikh directed walk for 44576 steps, including 44576 resets, run took 30001 ms. (steps per millisecond=1 )
Random directed walk for 500003 steps, including 0 resets, run took 19452 ms (no deadlock found). (steps per millisecond=25 )
Random walk for 500000 steps, including 0 resets, run took 15784 ms (no deadlock found). (steps per millisecond=31 )
Random directed walk for 500013 steps, including 0 resets, run took 19478 ms (no deadlock found). (steps per millisecond=25 )
Random walk for 500000 steps, including 0 resets, run took 13636 ms (no deadlock found). (steps per millisecond=36 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 230 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-18 06:30:19] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-18 06:30:19] [INFO ] Invariant cache hit.
[2023-03-18 06:30:21] [INFO ] Implicit Places using invariants in 1871 ms returned []
Implicit Place search using SMT only with invariants took 1872 ms to find 0 implicit places.
[2023-03-18 06:30:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-18 06:30:21] [INFO ] Invariant cache hit.
[2023-03-18 06:30:30] [INFO ] Dead Transitions using invariants and state equation in 9081 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 11183 ms. Remains : 626/626 places, 31352/31352 transitions.
Interrupted Random walk after 1115328 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=37 )
[2023-03-18 06:31:00] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-18 06:31:00] [INFO ] Invariant cache hit.
[2023-03-18 06:31:04] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-18 06:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 06:31:19] [INFO ] [Real]Absence check using state equation in 15159 ms returned sat
[2023-03-18 06:31:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 06:31:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-18 06:31:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 06:31:38] [INFO ] [Nat]Absence check using state equation in 15465 ms returned sat
[2023-03-18 06:31:38] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-18 06:31:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 06:31:42] [INFO ] [Nat]Added 268 Read/Feed constraints in 3634 ms returned sat
[2023-03-18 06:31:43] [INFO ] Deduced a trap composed of 48 places in 1413 ms of which 1 ms to minimize.
[2023-03-18 06:31:46] [INFO ] Deduced a trap composed of 48 places in 1761 ms of which 1 ms to minimize.
[2023-03-18 06:31:47] [INFO ] Deduced a trap composed of 48 places in 1231 ms of which 1 ms to minimize.
[2023-03-18 06:31:49] [INFO ] Deduced a trap composed of 24 places in 1460 ms of which 1 ms to minimize.
[2023-03-18 06:31:51] [INFO ] Deduced a trap composed of 40 places in 930 ms of which 0 ms to minimize.
[2023-03-18 06:31:53] [INFO ] Deduced a trap composed of 65 places in 1295 ms of which 0 ms to minimize.
[2023-03-18 06:31:54] [INFO ] Deduced a trap composed of 48 places in 1040 ms of which 1 ms to minimize.
[2023-03-18 06:31:55] [INFO ] Deduced a trap composed of 64 places in 997 ms of which 0 ms to minimize.
[2023-03-18 06:31:57] [INFO ] Deduced a trap composed of 64 places in 1487 ms of which 0 ms to minimize.
[2023-03-18 06:31:59] [INFO ] Deduced a trap composed of 40 places in 1685 ms of which 0 ms to minimize.
[2023-03-18 06:32:01] [INFO ] Deduced a trap composed of 40 places in 1084 ms of which 1 ms to minimize.
[2023-03-18 06:32:02] [INFO ] Deduced a trap composed of 64 places in 827 ms of which 0 ms to minimize.
[2023-03-18 06:32:03] [INFO ] Deduced a trap composed of 64 places in 1011 ms of which 1 ms to minimize.
[2023-03-18 06:32:04] [INFO ] Deduced a trap composed of 48 places in 649 ms of which 3 ms to minimize.
[2023-03-18 06:32:06] [INFO ] Deduced a trap composed of 40 places in 740 ms of which 0 ms to minimize.
[2023-03-18 06:32:07] [INFO ] Deduced a trap composed of 64 places in 612 ms of which 0 ms to minimize.
[2023-03-18 06:32:08] [INFO ] Deduced a trap composed of 40 places in 454 ms of which 0 ms to minimize.
[2023-03-18 06:32:08] [INFO ] Deduced a trap composed of 64 places in 608 ms of which 1 ms to minimize.
[2023-03-18 06:32:10] [INFO ] Deduced a trap composed of 64 places in 636 ms of which 0 ms to minimize.
[2023-03-18 06:32:11] [INFO ] Deduced a trap composed of 64 places in 753 ms of which 1 ms to minimize.
[2023-03-18 06:32:12] [INFO ] Deduced a trap composed of 40 places in 501 ms of which 1 ms to minimize.
[2023-03-18 06:32:12] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 30551 ms
[2023-03-18 06:32:15] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2368 ms.
[2023-03-18 06:32:16] [INFO ] Added : 0 causal constraints over 0 iterations in 3666 ms. Result :sat
Parikh directed walk for 363000 steps, including 1000 resets, run took 14626 ms. (steps per millisecond=24 )
Random directed walk for 500008 steps, including 0 resets, run took 22144 ms (no deadlock found). (steps per millisecond=22 )
Random walk for 500000 steps, including 0 resets, run took 16078 ms (no deadlock found). (steps per millisecond=31 )
Random directed walk for 500012 steps, including 0 resets, run took 21904 ms (no deadlock found). (steps per millisecond=22 )
Random walk for 500000 steps, including 0 resets, run took 15357 ms (no deadlock found). (steps per millisecond=32 )
[2023-03-18 06:33:48] [INFO ] Flatten gal took : 1177 ms
[2023-03-18 06:33:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2023-03-18 06:33:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 639 places, 31353 transitions and 125418 arcs took 92 ms.
Total runtime 428640 ms.
There are residual formulas that ITS could not solve within timeout
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//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//ReachabilityDeadlock.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: RERS17pb113_PT_2
(NrP: 639 NrTr: 31353 NrArc: 125418)

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

net check time: 0m 0.024sec

init dd package: 0m 2.899sec

TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 10510500 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16080440 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML
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 6.358sec

2184 2553 3666 3662 5349 6376 8521 10162 7745 8510 9605 8510 9972 13694 12716 13002 15261 14936 16044 17591 18300 17099 17648 17339 16806 16850 14573 12880 14285 16723 15445 16890 16325 17695 19156 19699 18079 18173 18341 17464 17169 17459 17463 18971 15736 14971 13229 14312 15107 18638 17732 20120 21315 23262 23696 22516 20609 19842 21227 21349 21819 24827 23944 23944 24916 23693 22609 22384 24408 23939 26161 25492 24857 20414 21046 21415 22591 23610 25229 25391 24033 24084 22788 21733 20400 21151

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="RERS17pb113-PT-2"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 marciexred"
echo " Input is RERS17pb113-PT-2, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r344-tall-167889215800006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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