Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r298-tajo-171654454700054.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-COL-S02J04T08, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654454700054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 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 Liveness

=== Now, execution of the tool begins

BK_START 1717103321465

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:08:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:08:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:08:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 21:08:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 21:08:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 690 ms
[2024-05-30 21:08:43] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 27 ms.
[2024-05-30 21:08:43] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-30 21:08:43] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-30 21:08:43] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 40 ms.
[2024-05-30 21:08:43] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-30 21:08:43] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 14 ms.
[2024-05-30 21:08:43] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2024-05-30 21:08:43] [INFO ] Reduced 8 identical enabling conditions.
[2024-05-30 21:08:43] [INFO ] Reduced 32 identical enabling conditions.
[2024-05-30 21:08:43] [INFO ] Reduced 88 identical enabling conditions.
[2024-05-30 21:08:43] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 0 ms.
[2024-05-30 21:08:43] [INFO ] Skeletonized 65 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-30 21:08:43] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 15 ms.
[2024-05-30 21:08:43] [INFO ] Unfolded 65 HLPN properties in 0 ms.
[2024-05-30 21:08:43] [INFO ] Reduced 8 identical enabling conditions.
[2024-05-30 21:08:43] [INFO ] Reduced 32 identical enabling conditions.
[2024-05-30 21:08:43] [INFO ] Reduced 88 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Built sparse matrix representations for Structural reductions in 3 ms.22185KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 614/614 places, 1114/1114 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 65 ms. Remains 614 /614 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-05-30 21:08:44] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2024-05-30 21:08:44] [INFO ] Computed 50 invariants in 91 ms
[2024-05-30 21:08:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-30 21:09:02] [INFO ] Deduced a trap composed of 65 places in 463 ms of which 32 ms to minimize.
[2024-05-30 21:09:03] [INFO ] Deduced a trap composed of 65 places in 378 ms of which 4 ms to minimize.
[2024-05-30 21:09:03] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-30 21:09:03] [INFO ] Deduced a trap composed of 97 places in 437 ms of which 8 ms to minimize.
[2024-05-30 21:09:04] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-05-30 21:09:04] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 11 ms to minimize.
[2024-05-30 21:09:04] [INFO ] Deduced a trap composed of 65 places in 37 ms of which 0 ms to minimize.
[2024-05-30 21:09:04] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-30 21:09:04] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-30 21:09:05] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1712 variables, and 56 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20113 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/36 constraints, State Equation: 0/614 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-30 21:09:08] [INFO ] Deduced a trap composed of 184 places in 297 ms of which 4 ms to minimize.
[2024-05-30 21:09:08] [INFO ] Deduced a trap composed of 202 places in 287 ms of which 4 ms to minimize.
[2024-05-30 21:09:09] [INFO ] Deduced a trap composed of 187 places in 325 ms of which 5 ms to minimize.
[2024-05-30 21:09:10] [INFO ] Deduced a trap composed of 301 places in 1577 ms of which 4 ms to minimize.
[2024-05-30 21:09:11] [INFO ] Deduced a trap composed of 371 places in 318 ms of which 5 ms to minimize.
[2024-05-30 21:09:16] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 4 ms to minimize.
[2024-05-30 21:09:19] [INFO ] Deduced a trap composed of 331 places in 278 ms of which 4 ms to minimize.
[2024-05-30 21:09:19] [INFO ] Deduced a trap composed of 324 places in 320 ms of which 4 ms to minimize.
[2024-05-30 21:09:20] [INFO ] Deduced a trap composed of 363 places in 272 ms of which 5 ms to minimize.
[2024-05-30 21:09:20] [INFO ] Deduced a trap composed of 295 places in 321 ms of which 4 ms to minimize.
[2024-05-30 21:09:20] [INFO ] Deduced a trap composed of 342 places in 292 ms of which 5 ms to minimize.
[2024-05-30 21:09:21] [INFO ] Deduced a trap composed of 340 places in 275 ms of which 4 ms to minimize.
[2024-05-30 21:09:21] [INFO ] Deduced a trap composed of 333 places in 327 ms of which 4 ms to minimize.
[2024-05-30 21:09:21] [INFO ] Deduced a trap composed of 325 places in 246 ms of which 4 ms to minimize.
[2024-05-30 21:09:22] [INFO ] Deduced a trap composed of 325 places in 286 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1712 variables, and 71 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/36 constraints, State Equation: 0/614 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 25/25 constraints]
After SMT, in 41878ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41923ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 42038 ms. Remains : 614/614 places, 1114/1114 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 614/614 places, 1114/1114 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 49 ms. Remains 614 /614 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
[2024-05-30 21:09:26] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-30 21:09:26] [INFO ] Invariant cache hit.
[2024-05-30 21:09:26] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-30 21:09:26] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-30 21:09:26] [INFO ] Invariant cache hit.
[2024-05-30 21:09:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-30 21:09:26] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2024-05-30 21:09:26] [INFO ] Redundant transitions in 61 ms returned []
Running 1112 sub problems to find dead transitions.
[2024-05-30 21:09:26] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-30 21:09:26] [INFO ] Invariant cache hit.
[2024-05-30 21:09:26] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-30 21:09:38] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-30 21:09:38] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-05-30 21:09:38] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-30 21:09:38] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-30 21:09:38] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-30 21:09:38] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-30 21:09:38] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 2 ms to minimize.
[2024-05-30 21:09:39] [INFO ] Deduced a trap composed of 341 places in 283 ms of which 5 ms to minimize.
[2024-05-30 21:09:39] [INFO ] Deduced a trap composed of 330 places in 241 ms of which 5 ms to minimize.
[2024-05-30 21:09:39] [INFO ] Deduced a trap composed of 311 places in 250 ms of which 12 ms to minimize.
[2024-05-30 21:09:40] [INFO ] Deduced a trap composed of 327 places in 267 ms of which 4 ms to minimize.
[2024-05-30 21:09:40] [INFO ] Deduced a trap composed of 173 places in 204 ms of which 3 ms to minimize.
[2024-05-30 21:09:40] [INFO ] Deduced a trap composed of 202 places in 208 ms of which 3 ms to minimize.
[2024-05-30 21:09:41] [INFO ] Deduced a trap composed of 371 places in 224 ms of which 3 ms to minimize.
[2024-05-30 21:09:41] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 2 ms to minimize.
[2024-05-30 21:09:41] [INFO ] Deduced a trap composed of 345 places in 226 ms of which 4 ms to minimize.
[2024-05-30 21:09:42] [INFO ] Deduced a trap composed of 337 places in 217 ms of which 3 ms to minimize.
[2024-05-30 21:09:42] [INFO ] Deduced a trap composed of 325 places in 247 ms of which 3 ms to minimize.
[2024-05-30 21:09:42] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 3 ms to minimize.
[2024-05-30 21:09:42] [INFO ] Deduced a trap composed of 351 places in 243 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-30 21:09:44] [INFO ] Deduced a trap composed of 350 places in 231 ms of which 4 ms to minimize.
[2024-05-30 21:09:44] [INFO ] Deduced a trap composed of 328 places in 268 ms of which 3 ms to minimize.
[2024-05-30 21:09:45] [INFO ] Deduced a trap composed of 338 places in 243 ms of which 3 ms to minimize.
[2024-05-30 21:09:45] [INFO ] Deduced a trap composed of 308 places in 236 ms of which 3 ms to minimize.
[2024-05-30 21:09:45] [INFO ] Deduced a trap composed of 331 places in 224 ms of which 4 ms to minimize.
[2024-05-30 21:09:54] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 4 ms to minimize.
[2024-05-30 21:09:54] [INFO ] Deduced a trap composed of 336 places in 228 ms of which 3 ms to minimize.
[2024-05-30 21:09:54] [INFO ] Deduced a trap composed of 329 places in 228 ms of which 3 ms to minimize.
[2024-05-30 21:09:55] [INFO ] Deduced a trap composed of 328 places in 227 ms of which 3 ms to minimize.
[2024-05-30 21:09:55] [INFO ] Deduced a trap composed of 317 places in 244 ms of which 4 ms to minimize.
[2024-05-30 21:09:55] [INFO ] Deduced a trap composed of 321 places in 225 ms of which 11 ms to minimize.
[2024-05-30 21:09:55] [INFO ] Deduced a trap composed of 305 places in 237 ms of which 4 ms to minimize.
[2024-05-30 21:09:57] [INFO ] Deduced a trap composed of 371 places in 225 ms of which 4 ms to minimize.
[2024-05-30 21:09:57] [INFO ] Deduced a trap composed of 369 places in 239 ms of which 3 ms to minimize.
[2024-05-30 21:09:58] [INFO ] Deduced a trap composed of 371 places in 267 ms of which 4 ms to minimize.
[2024-05-30 21:09:58] [INFO ] Deduced a trap composed of 359 places in 256 ms of which 4 ms to minimize.
[2024-05-30 21:09:58] [INFO ] Deduced a trap composed of 370 places in 279 ms of which 4 ms to minimize.
[2024-05-30 21:09:59] [INFO ] Deduced a trap composed of 366 places in 260 ms of which 3 ms to minimize.
SMT process timed out in 32119ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 32146ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 33102 ms. Remains : 614/614 places, 1114/1114 transitions.
Finished random walk after 2463 steps, including 0 resets, run found a deadlock after 20 ms. (steps per millisecond=123 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 76250 ms.
ITS solved all properties within timeout

BK_STOP 1717103399225

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -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="PolyORBLF-COL-S02J04T08"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-COL-S02J04T08, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tajo-171654454700054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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