fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r126-tajo-158961389800070
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Philosophers-COL-002000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.700 3600000.00 10051138.00 4961.20 TTTFTF?TFFTTTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961389800070.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-COL-002000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961389800070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 3.4K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 96K Apr 27 15:14 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 Philosophers-COL-002000-ReachabilityCardinality-00
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-01
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-02
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-03
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-04
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-05
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-06
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-07
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-08
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-09
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-10
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-11
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-12
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-13
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-14
FORMULA_NAME Philosophers-COL-002000-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589781207916

[2020-05-18 05:53:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 05:53:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 05:53:29] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-18 05:53:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 566 ms
[2020-05-18 05:53:30] [INFO ] sort/places :
Philo->think,fork,catch1,catch2,eat,

[2020-05-18 05:53:30] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 10000 PT places and 10000.0 transition bindings in 18 ms.
[2020-05-18 05:53:30] [INFO ] Computed order based on color domains.
[2020-05-18 05:53:30] [INFO ] Unfolded HLPN to a Petri net with 10000 places and 10000 transitions in 77 ms.
[2020-05-18 05:53:30] [INFO ] Unfolded HLPN properties in 13 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 233 ms.
Working with output stream class java.io.PrintStream
FORMULA Philosophers-COL-002000-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-002000-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 14559 ms. (steps per millisecond=0 ) properties seen :[1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1]
FORMULA Philosophers-COL-002000-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-002000-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-002000-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-002000-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-002000-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-002000-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-002000-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-002000-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-002000-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3875 ms. (steps per millisecond=2 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 8000 steps, including 0 resets, run timeout after 5281 ms. (steps per millisecond=1 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1834 ms. (steps per millisecond=5 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3138 ms. (steps per millisecond=3 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2142 ms. (steps per millisecond=4 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 10000 rows 10000 cols
[2020-05-18 05:54:01] [INFO ] Computed 4000 place invariants in 163 ms
[2020-05-18 05:54:02] [INFO ] [Real]Absence check using 4000 positive place invariants in 44 ms returned unsat
[2020-05-18 05:54:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (= 1 (+ s1429 s5429 s7429 s9429))") while checking expression at index 1
[2020-05-18 05:54:12] [INFO ] [Real]Absence check using 4000 positive place invariants in 4183 ms returned (error "Solver has unexpectedly terminated")
[2020-05-18 05:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:54:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2020-05-18 05:54:13] [INFO ] [Real]Absence check using 4000 positive place invariants in 22 ms returned unsat
[2020-05-18 05:54:14] [INFO ] [Real]Absence check using 4000 positive place invariants in 22 ms returned unsat
FORMULA Philosophers-COL-002000-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Philosophers-COL-002000-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Philosophers-COL-002000-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 10000 out of 10000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 154 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Interrupted random walk after 46497 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :[0, 0]
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5476 ms. (steps per millisecond=1 ) properties seen :[0, 0]
Interrupted Best-First random walk after 26977 steps, including 0 resets, run timeout after 5078 ms. (steps per millisecond=5 ) properties seen :[0, 1]
FORMULA Philosophers-COL-002000-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 10000 rows 10000 cols
[2020-05-18 05:54:55] [INFO ] Computed 4000 place invariants in 101 ms
[2020-05-18 05:55:38] [INFO ] [Real]Absence check using 4000 positive place invariants in 42640 ms returned sat
[2020-05-18 05:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:55:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:55:40] [INFO ] [Real]Absence check using state equation in 1462 ms returned (error "Failed to check-sat")
Support contains 10000 out of 10000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 151 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Interrupted random walk after 65348 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties seen :[0]
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5518 ms. (steps per millisecond=1 ) properties seen :[0]
Probabilistic random walk after 281625 steps, saw 71 distinct states, run finished after 30047 ms. (steps per millisecond=9 ) properties seen :[0]
// Phase 1: matrix 10000 rows 10000 cols
[2020-05-18 05:56:45] [INFO ] Computed 4000 place invariants in 88 ms
[2020-05-18 05:57:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:57:30] [INFO ] [Real]Absence check using 4000 positive place invariants in 44116 ms returned (error "Failed to check-sat")
[2020-05-18 05:57:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:57:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
Support contains 10000 out of 10000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 223 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 81 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2020-05-18 05:57:31] [INFO ] Computed 4000 place invariants in 134 ms
[2020-05-18 05:57:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:57:32] [INFO ] Implicit Places using invariants in 1352 ms returned []
Implicit Place search using SMT only with invariants took 1355 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2020-05-18 05:57:32] [INFO ] Computed 4000 place invariants in 151 ms
[2020-05-18 05:57:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:58:04] [INFO ] Performed 2520/10000 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2020-05-18 05:58:32] [INFO ] Dead Transitions with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= s2980 1) (>= s4980 1))") after 60182 ms
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Interrupted random walk after 66065 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties seen :[0]
// Phase 1: matrix 10000 rows 10000 cols
[2020-05-18 05:59:02] [INFO ] Computed 4000 place invariants in 94 ms
[2020-05-18 05:59:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 05:59:23] [INFO ] [Real]Absence check using 4000 positive place invariants in 19016 ms returned (error "Failed to check-sat")
[2020-05-18 05:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 05:59:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
Applied a total of 0 rules in 86 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2020-05-18 05:59:23] [INFO ] Computed 4000 place invariants in 121 ms
[2020-05-18 06:00:05] [INFO ] [Real]Absence check using 4000 positive place invariants in 40946 ms returned sat
[2020-05-18 06:00:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 06:00:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 06:00:08] [INFO ] [Real]Absence check using state equation in 3123 ms returned (error "Failed to check-sat")
[2020-05-18 06:00:09] [INFO ] Flatten gal took : 731 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 06:00:10] [INFO ] Flatten gal took : 770 ms
[2020-05-18 06:00:10] [INFO ] Applying decomposition
[2020-05-18 06:00:11] [INFO ] Flatten gal took : 696 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="Philosophers-COL-002000"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 Philosophers-COL-002000, 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 r126-tajo-158961389800070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-002000.tgz
mv Philosophers-COL-002000 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 ;