Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r441-tajo-167905986900077.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVs-PT-030B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r441-tajo-167905986900077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 370K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679557777490

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=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-030B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:49:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-23 07:49:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:49:39] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2023-03-23 07:49:39] [INFO ] Transformed 1203 places.
[2023-03-23 07:49:39] [INFO ] Transformed 1353 transitions.
[2023-03-23 07:49:39] [INFO ] Found NUPN structural information;
[2023-03-23 07:49:39] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 193 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1203 transition count 1232
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 1082 transition count 1232
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 1082 transition count 1082
Deduced a syphon composed of 150 places in 11 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 932 transition count 1082
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 7 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 2 with 960 rules applied. Total rules applied 1502 place count 452 transition count 602
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 1502 rules in 166 ms. Remains 452 /1203 variables (removed 751) and now considering 602/1353 (removed 751) transitions.
// Phase 1: matrix 602 rows 452 cols
[2023-03-23 07:49:39] [INFO ] Computed 121 place invariants in 15 ms
[2023-03-23 07:49:39] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-23 07:49:39] [INFO ] Invariant cache hit.
[2023-03-23 07:49:40] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
[2023-03-23 07:49:40] [INFO ] Invariant cache hit.
[2023-03-23 07:49:40] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 452/1203 places, 602/1353 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 1470 ms. Remains : 452/1203 places, 602/1353 transitions.
Discarding 180 transitions out of 602. Remains 422
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 421) seen :398
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-23 07:49:41] [INFO ] Invariant cache hit.
[2023-03-23 07:49:41] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-23 07:49:42] [INFO ] After 1018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-23 07:49:42] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-23 07:49:43] [INFO ] After 655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-23 07:49:43] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 5 ms to minimize.
[2023-03-23 07:49:43] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2023-03-23 07:49:43] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-23 07:49:43] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-23 07:49:43] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2023-03-23 07:49:43] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2023-03-23 07:49:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 399 ms
[2023-03-23 07:49:44] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2023-03-23 07:49:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-23 07:49:44] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2023-03-23 07:49:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-23 07:49:44] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2023-03-23 07:49:44] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2023-03-23 07:49:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2023-03-23 07:49:44] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 1 ms to minimize.
[2023-03-23 07:49:44] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2023-03-23 07:49:44] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1114 ms
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1256 ms
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 480 ms
[2023-03-23 07:49:48] [INFO ] After 5773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 898 ms.
[2023-03-23 07:49:49] [INFO ] After 7054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 4 properties in 3819 ms.
Support contains 55 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 602/602 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 422 transition count 572
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 422 transition count 572
Partial Free-agglomeration rule applied 52 times.
Drop transitions removed 52 transitions
Iterating global reduction 0 with 52 rules applied. Total rules applied 112 place count 422 transition count 572
Applied a total of 112 rules in 89 ms. Remains 422 /452 variables (removed 30) and now considering 572/602 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 422/452 places, 572/602 transitions.
Finished random walk after 14344 steps, including 39 resets, run visited all 19 properties in 220 ms. (steps per millisecond=65 )
Able to resolve query QuasiLiveness after proving 422 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 14669 ms.
ITS solved all properties within timeout

BK_STOP 1679557793941

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 QuasiLiveness -timeout 180 -rebuildPNML

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="ShieldRVs-PT-030B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldRVs-PT-030B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r441-tajo-167905986900077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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