fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r373-smll-167891824500171
Last Updated
May 14, 2023

About the Execution of LoLa+red for SafeBus-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9530.479 1800000.00 3549892.00 5751.40 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r373-smll-167891824500171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is SafeBus-PT-10, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-smll-167891824500171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 19K Feb 26 01:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 01:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Feb 26 01:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 393K Feb 26 01:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 151K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 26 01:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K Feb 26 01:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 244K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679050523324

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 10:55:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-17 10:55:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:55:27] [INFO ] Load time of PNML (sax parser for PT used): 362 ms
[2023-03-17 10:55:27] [INFO ] Transformed 316 places.
[2023-03-17 10:55:27] [INFO ] Transformed 1631 transitions.
[2023-03-17 10:55:27] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 549 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 10 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 12 ms.24231KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 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 535 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 536 ms. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 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 206 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2023-03-17 10:55:28] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 10:55:28] [INFO ] Computed 45 place invariants in 67 ms
[2023-03-17 10:55:29] [INFO ] Implicit Places using invariants in 1446 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1493 ms to find 10 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 296/306 places, 1631/1631 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1621
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1621
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 20 rules in 307 ms. Remains 286 /296 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
[2023-03-17 10:55:29] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2023-03-17 10:55:30] [INFO ] Computed 35 place invariants in 24 ms
[2023-03-17 10:55:30] [INFO ] Implicit Places using invariants in 728 ms returned []
[2023-03-17 10:55:30] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2023-03-17 10:55:30] [INFO ] Invariant cache hit.
[2023-03-17 10:55:31] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 10:55:34] [INFO ] Implicit Places using invariants and state equation in 3439 ms returned []
Implicit Place search using SMT with State Equation took 4170 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 286/306 places, 1621/1631 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 6176 ms. Remains : 286/306 places, 1621/1631 transitions.
Random walk for 1250000 steps, including 0 resets, run took 9300 ms (no deadlock found). (steps per millisecond=134 )
Random directed walk for 1250001 steps, including 0 resets, run took 6446 ms (no deadlock found). (steps per millisecond=193 )
[2023-03-17 10:55:49] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2023-03-17 10:55:49] [INFO ] Invariant cache hit.
[2023-03-17 10:55:50] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-17 10:55:50] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 631 ms returned sat
[2023-03-17 10:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:55:51] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2023-03-17 10:55:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:55:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-17 10:55:52] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 88 ms returned sat
[2023-03-17 10:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:55:52] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2023-03-17 10:55:52] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 10:55:52] [INFO ] [Nat]Added 111 Read/Feed constraints in 255 ms returned sat
[2023-03-17 10:55:53] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 6 ms to minimize.
[2023-03-17 10:55:53] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 2 ms to minimize.
[2023-03-17 10:55:53] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 2 ms to minimize.
[2023-03-17 10:55:54] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 2 ms to minimize.
[2023-03-17 10:55:54] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 2 ms to minimize.
[2023-03-17 10:55:54] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 1 ms to minimize.
[2023-03-17 10:55:54] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 1 ms to minimize.
[2023-03-17 10:55:54] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 2 ms to minimize.
[2023-03-17 10:55:55] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 1 ms to minimize.
[2023-03-17 10:55:55] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 1 ms to minimize.
[2023-03-17 10:55:55] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 1 ms to minimize.
[2023-03-17 10:55:55] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2023-03-17 10:55:55] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 1 ms to minimize.
[2023-03-17 10:55:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3167 ms
[2023-03-17 10:55:56] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 219 ms.
[2023-03-17 10:55:56] [INFO ] Added : 1 causal constraints over 1 iterations in 384 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Parikh directed walk for 15500 steps, including 999 resets, run took 269 ms. (steps per millisecond=57 )
Random directed walk for 500002 steps, including 0 resets, run took 2744 ms (no deadlock found). (steps per millisecond=182 )
Random walk for 500000 steps, including 0 resets, run took 3541 ms (no deadlock found). (steps per millisecond=141 )
Random directed walk for 500000 steps, including 0 resets, run took 2552 ms (no deadlock found). (steps per millisecond=195 )
Random walk for 500000 steps, including 0 resets, run took 3542 ms (no deadlock found). (steps per millisecond=141 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 286/286 places, 1621/1621 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 137 ms. Remains 286 /286 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
[2023-03-17 10:56:09] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2023-03-17 10:56:09] [INFO ] Invariant cache hit.
[2023-03-17 10:56:10] [INFO ] Implicit Places using invariants in 764 ms returned []
[2023-03-17 10:56:10] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2023-03-17 10:56:10] [INFO ] Invariant cache hit.
[2023-03-17 10:56:10] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 10:56:13] [INFO ] Implicit Places using invariants and state equation in 3169 ms returned []
Implicit Place search using SMT with State Equation took 3936 ms to find 0 implicit places.
[2023-03-17 10:56:13] [INFO ] Redundant transitions in 368 ms returned []
[2023-03-17 10:56:13] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2023-03-17 10:56:13] [INFO ] Invariant cache hit.
[2023-03-17 10:56:15] [INFO ] Dead Transitions using invariants and state equation in 1653 ms found 100 transitions.
Found 100 dead transitions using SMT.
Drop transitions removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 286/286 places, 1521/1621 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 158 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-17 10:56:15] [INFO ] Redundant transitions in 89 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 6361 ms. Remains : 286/286 places, 1521/1621 transitions.
Random walk for 1250000 steps, including 0 resets, run took 8412 ms (no deadlock found). (steps per millisecond=148 )
Random directed walk for 1250000 steps, including 0 resets, run took 6925 ms (no deadlock found). (steps per millisecond=180 )
[2023-03-17 10:56:30] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2023-03-17 10:56:30] [INFO ] Computed 35 place invariants in 9 ms
[2023-03-17 10:56:31] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-17 10:56:31] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 479 ms returned sat
[2023-03-17 10:56:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:56:32] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2023-03-17 10:56:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:56:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-17 10:56:33] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 81 ms returned sat
[2023-03-17 10:56:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:56:33] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2023-03-17 10:56:33] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 10:56:33] [INFO ] [Nat]Added 111 Read/Feed constraints in 126 ms returned sat
[2023-03-17 10:56:33] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 1 ms to minimize.
[2023-03-17 10:56:34] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 0 ms to minimize.
[2023-03-17 10:56:35] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2023-03-17 10:56:37] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 0 ms to minimize.
[2023-03-17 10:56:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3526 ms
[2023-03-17 10:56:37] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 85 ms.
[2023-03-17 10:56:37] [INFO ] Added : 1 causal constraints over 1 iterations in 213 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Parikh directed walk for 15800 steps, including 1000 resets, run took 183 ms. (steps per millisecond=86 )
Random directed walk for 500000 steps, including 0 resets, run took 2520 ms (no deadlock found). (steps per millisecond=198 )
Random walk for 500000 steps, including 0 resets, run took 3547 ms (no deadlock found). (steps per millisecond=140 )
Random directed walk for 500000 steps, including 0 resets, run took 2390 ms (no deadlock found). (steps per millisecond=209 )
Random walk for 500000 steps, including 0 resets, run took 3323 ms (no deadlock found). (steps per millisecond=150 )
[2023-03-17 10:56:50] [INFO ] Flatten gal took : 377 ms
[2023-03-17 10:56:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 2 ms.
[2023-03-17 10:56:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 1631 transitions and 11204 arcs took 24 ms.
Total runtime 83408 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SafeBus-PT-10
BK_EXAMINATION: ReachabilityDeadlock
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
GlobalProperty: ReachabilityDeadlock
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 6632164 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16116076 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: STP: formula with 597923 variables and 4137422 clauses shipped to Minisat
lola: SIPHON RESULT 1
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 1712 secs. Pages in use: 13

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="SafeBus-PT-10"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is SafeBus-PT-10, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-smll-167891824500171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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