fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r496-tall-171640602500015
Last Updated
July 7, 2024

About the Execution of LTSMin+red for FlexibleBarrier-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
338.147 7731.00 17420.00 57.50 TFTTFFTTTFFTFTTT normal

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.r496-tall-171640602500015.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 ltsminxred
Input is FlexibleBarrier-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602500015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 08:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 13 08:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:42 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 FlexibleBarrier-PT-04b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717181818052

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:56:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:56:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:56:59] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-31 18:56:59] [INFO ] Transformed 268 places.
[2024-05-31 18:56:59] [INFO ] Transformed 305 transitions.
[2024-05-31 18:56:59] [INFO ] Found NUPN structural information;
[2024-05-31 18:56:59] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (952 resets) in 1495 ms. (26 steps per ms) remains 6/16 properties
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (167 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (175 resets) in 430 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (182 resets) in 119 ms. (333 steps per ms) remains 5/6 properties
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (102 resets) in 1059 ms. (37 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (175 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (178 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
// Phase 1: matrix 305 rows 268 cols
[2024-05-31 18:57:00] [INFO ] Computed 6 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem FlexibleBarrier-PT-04b-ReachabilityFireability-2024-09 is UNSAT
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 161/268 variables, 6/113 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 161/274 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 305/573 variables, 268/542 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 0/542 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/573 variables, 0/542 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 542 constraints, problems are : Problem set: 1 solved, 4 unsolved in 729 ms.
Refiners :[Domain max(s): 268/268 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 185/268 variables, 6/89 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 185/274 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-31 18:57:01] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 17 ms to minimize.
[2024-05-31 18:57:01] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 2 ms to minimize.
[2024-05-31 18:57:01] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-31 18:57:02] [INFO ] Deduced a trap composed of 77 places in 268 ms of which 2 ms to minimize.
[2024-05-31 18:57:02] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 2 ms to minimize.
Problem FlexibleBarrier-PT-04b-ReachabilityFireability-2024-15 is UNSAT
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 5/279 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/279 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 305/573 variables, 268/547 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 3/550 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-31 18:57:02] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 1/551 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/551 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-31 18:57:02] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2024-05-31 18:57:03] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/573 variables, 2/553 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 0/553 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/573 variables, 0/553 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 553 constraints, problems are : Problem set: 2 solved, 3 unsolved in 2087 ms.
Refiners :[Domain max(s): 268/268 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 8/8 constraints]
After SMT, in 2945ms problems are : Problem set: 2 solved, 3 unsolved
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 538 ms.
Support contains 17 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 305/305 transitions.
Graph (trivial) has 193 edges and 268 vertex of which 6 / 268 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 263 transition count 242
Reduce places removed 57 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 63 rules applied. Total rules applied 121 place count 206 transition count 236
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 127 place count 200 transition count 236
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 127 place count 200 transition count 213
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 173 place count 177 transition count 213
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 231 place count 119 transition count 155
Iterating global reduction 3 with 58 rules applied. Total rules applied 289 place count 119 transition count 155
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 289 place count 119 transition count 153
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 293 place count 117 transition count 153
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 299 place count 111 transition count 147
Iterating global reduction 3 with 6 rules applied. Total rules applied 305 place count 111 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 311 place count 111 transition count 141
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 361 place count 86 transition count 116
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 367 place count 83 transition count 120
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 381 place count 83 transition count 106
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 395 place count 69 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 399 place count 69 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 400 place count 68 transition count 101
Applied a total of 400 rules in 101 ms. Remains 68 /268 variables (removed 200) and now considering 101/305 (removed 204) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 68/268 places, 101/305 transitions.
RANDOM walk for 40000 steps (925 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (83 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1224310 steps, run visited all 1 properties in 1374 ms. (steps per millisecond=891 )
Probabilistic random walk after 1224310 steps, saw 332727 distinct states, run finished after 1378 ms. (steps per millisecond=888 ) properties seen :1
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 6499 ms.
ITS solved all properties within timeout

BK_STOP 1717181825783

--------------------
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 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="FlexibleBarrier-PT-04b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FlexibleBarrier-PT-04b, 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 r496-tall-171640602500015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b 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 ;