Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r575-smll-171734919500039.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MedleyA-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919500039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 75K Jun 2 16:33 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 MedleyA-PT-05-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-05-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717353545162

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:39:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:39:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:39:08] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2024-06-02 18:39:08] [INFO ] Transformed 115 places.
[2024-06-02 18:39:08] [INFO ] Transformed 257 transitions.
[2024-06-02 18:39:08] [INFO ] Found NUPN structural information;
[2024-06-02 18:39:08] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
RANDOM walk for 40000 steps (2993 resets) in 3072 ms. (13 steps per ms) remains 11/16 properties
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (455 resets) in 480 ms. (83 steps per ms) remains 10/11 properties
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (464 resets) in 837 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (469 resets) in 576 ms. (69 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (470 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (457 resets) in 753 ms. (53 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (370 resets) in 240 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (461 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (267 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (374 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (386 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
[2024-06-02 18:39:10] [INFO ] Flow matrix only has 253 transitions (discarded 1 similar events)
// Phase 1: matrix 253 rows 115 cols
[2024-06-02 18:39:10] [INFO ] Computed 20 invariants in 15 ms
[2024-06-02 18:39:10] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MedleyA-PT-05-ReachabilityFireability-2024-15 is UNSAT
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 42/104 variables, 15/77 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 42/119 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/114 variables, 5/124 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 10/134 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 251/365 variables, 114/248 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 93/341 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/367 variables, 1/342 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 1/343 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/367 variables, 0/343 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 1/368 variables, 1/344 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 0/344 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/368 variables, 0/344 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 344 constraints, problems are : Problem set: 1 solved, 9 unsolved in 1549 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 115/115 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem MedleyA-PT-05-ReachabilityFireability-2024-05 is UNSAT
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 45/104 variables, 15/74 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 45/119 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 10/114 variables, 5/124 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 10/134 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 251/365 variables, 114/248 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 93/341 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 2/343 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-06-02 18:39:13] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 22 ms to minimize.
[2024-06-02 18:39:13] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 2/345 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/345 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/367 variables, 1/346 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/367 variables, 1/347 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/367 variables, 6/353 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 0/353 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 1/368 variables, 1/354 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/368 variables, 0/354 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/368 variables, 0/354 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 354 constraints, problems are : Problem set: 2 solved, 8 unsolved in 2824 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 115/115 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 8/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 4606ms problems are : Problem set: 2 solved, 8 unsolved
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 2257 ms.
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 254/254 transitions.
Graph (complete) has 458 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 114 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 113 transition count 250
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 23 place count 95 transition count 214
Iterating global reduction 2 with 18 rules applied. Total rules applied 41 place count 95 transition count 214
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 63 place count 84 transition count 295
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 84 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 97 place count 84 transition count 261
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 113 place count 84 transition count 369
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 153 place count 68 transition count 345
Applied a total of 153 rules in 124 ms. Remains 68 /115 variables (removed 47) and now considering 345/254 (removed -91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 68/115 places, 345/254 transitions.
RANDOM walk for 40000 steps (5227 resets) in 979 ms. (40 steps per ms) remains 1/2 properties
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 33174 steps (256 resets) in 59 ms. (552 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-05-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 10227 ms.
ITS solved all properties within timeout

BK_STOP 1717353558142

--------------------
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 ReachabilityFireability -timeout 360 -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="MedleyA-PT-05"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-05, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r575-smll-171734919500039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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