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.r399-tall-171690530600539.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 Sudoku-COL-BN01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530600539
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 7.6K Apr 12 11:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 11:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 11:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 11:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 11:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 12 11:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 11:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 11:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 9.7K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-00
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-01
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-02
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-03
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-04
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-05
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-06
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-07
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-08
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-09
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-10
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-11
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-12
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-13
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-14
FORMULA_NAME Sudoku-COL-BN01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717051191148

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-BN01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 06:39:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 06:39:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 06:39:52] [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 06:39:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 06:39:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 510 ms
[2024-05-30 06:39:53] [WARNING] OR operator with single subterm is malformed PNML.
[2024-05-30 06:39:53] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 5 PT places and 1.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 06:39:53] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 4 ms.
[2024-05-30 06:39:53] [INFO ] Skeletonized 16 HLPN properties in 8 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-BN01-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40000 steps (20000 resets) in 1168 ms. (34 steps per ms) remains 9/18 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 406 ms. (98 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 230 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 165 ms. (240 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 108 ms. (366 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
// Phase 1: matrix 1 rows 5 cols
[2024-05-30 06:39:54] [INFO ] Computed 4 invariants in 6 ms
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 5/6 variables, and 4 constraints, problems are : Problem set: 9 solved, 0 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/5 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
FORMULA Sudoku-COL-BN01-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 06:39:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-30 06:39:54] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-BN01-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 06:39:54] [INFO ] Flatten gal took : 1 ms
[2024-05-30 06:39:54] [INFO ] Unfolded HLPN to a Petri net with 5 places and 1 transitions 5 arcs in 6 ms.
[2024-05-30 06:39:54] [INFO ] Unfolded 4 HLPN properties in 0 ms.
Support contains 5 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Applied a total of 0 rules in 4 ms. Remains 5 /5 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-30 06:39:54] [INFO ] Invariant cache hit.
[2024-05-30 06:39:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-30 06:39:54] [INFO ] Invariant cache hit.
[2024-05-30 06:39:54] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 5/5 places, 1/1 transitions.
Support contains 5 out of 5 places after structural reductions.
[2024-05-30 06:39:54] [INFO ] Flatten gal took : 1 ms
[2024-05-30 06:39:54] [INFO ] Flatten gal took : 1 ms
[2024-05-30 06:39:54] [INFO ] Input system was already deterministic with 1 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/7 properties
FORMULA Sudoku-COL-BN01-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 1
Applied a total of 3 rules in 6 ms. Remains 2 /5 variables (removed 3) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-05-30 06:39:54] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 06:39:54] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-30 06:39:54] [INFO ] Invariant cache hit.
[2024-05-30 06:39:54] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 2/5 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 2/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN01-LTLCardinality-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-BN01-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN01-LTLCardinality-03 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((p1&&F(!p1)))))'
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 3 places
Applied a total of 0 rules in 2 ms. Remains 2 /5 variables (removed 3) and now considering 1/1 (removed 0) transitions.
[2024-05-30 06:39:55] [INFO ] Invariant cache hit.
[2024-05-30 06:39:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-30 06:39:55] [INFO ] Invariant cache hit.
[2024-05-30 06:39:55] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-30 06:39:55] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 2/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), true, p1]
Running random walk in product with property : Sudoku-COL-BN01-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-BN01-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN01-LTLCardinality-05 finished in 586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G(p1))))'
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3 transition count 1
Applied a total of 2 rules in 0 ms. Remains 3 /5 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 3 cols
[2024-05-30 06:39:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 06:39:55] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-30 06:39:55] [INFO ] Invariant cache hit.
[2024-05-30 06:39:55] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 3/5 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 3/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN01-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-BN01-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN01-LTLCardinality-15 finished in 186 ms.
All properties solved by simple procedures.
Total runtime 3476 ms.
ITS solved all properties within timeout

BK_STOP 1717051196220

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="Sudoku-COL-BN01"
export BK_EXAMINATION="LTLCardinality"
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 Sudoku-COL-BN01, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690530600539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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