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

About the Execution of LoLa+red for SmartHome-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
246.424 11006.00 18818.00 510.90 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 normal

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.r455-smll-167912647000189.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 SmartHome-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r455-smll-167912647000189
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 5.5K Feb 26 05:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 05:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 05:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 05:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 05:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K Feb 26 05:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 05:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 05:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 54K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679202128024

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 05:02:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 05:02:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 05:02:11] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-19 05:02:11] [INFO ] Transformed 213 places.
[2023-03-19 05:02:11] [INFO ] Transformed 245 transitions.
[2023-03-19 05:02:11] [INFO ] Found NUPN structural information;
[2023-03-19 05:02:11] [INFO ] Parsed PT model containing 213 places and 245 transitions and 557 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 18 transitions.
FORMULA SmartHome-PT-05-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 227 rows 196 cols
[2023-03-19 05:02:11] [INFO ] Computed 10 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 67 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 15) seen :13
FORMULA SmartHome-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
[2023-03-19 05:02:11] [INFO ] Invariant cache hit.
[2023-03-19 05:02:12] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2023-03-19 05:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:02:12] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2023-03-19 05:02:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 05:02:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-19 05:02:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 05:02:12] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2023-03-19 05:02:12] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 5 ms to minimize.
[2023-03-19 05:02:13] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 1 ms to minimize.
[2023-03-19 05:02:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2023-03-19 05:02:13] [INFO ] Computed and/alt/rep : 204/341/204 causal constraints (skipped 22 transitions) in 47 ms.
[2023-03-19 05:02:14] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2023-03-19 05:02:14] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 3 ms to minimize.
[2023-03-19 05:02:14] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2023-03-19 05:02:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 330 ms
[2023-03-19 05:02:14] [INFO ] Added : 184 causal constraints over 37 iterations in 1573 ms. Result :sat
Minimization took 112 ms.
[2023-03-19 05:02:14] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-19 05:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:02:15] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2023-03-19 05:02:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 05:02:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-19 05:02:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 05:02:15] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2023-03-19 05:02:15] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 2 ms to minimize.
[2023-03-19 05:02:15] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 0 ms to minimize.
[2023-03-19 05:02:15] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2023-03-19 05:02:15] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 0 ms to minimize.
[2023-03-19 05:02:15] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2023-03-19 05:02:15] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2023-03-19 05:02:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 596 ms
[2023-03-19 05:02:16] [INFO ] Computed and/alt/rep : 204/341/204 causal constraints (skipped 22 transitions) in 27 ms.
[2023-03-19 05:02:16] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 1 ms to minimize.
[2023-03-19 05:02:16] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 1 ms to minimize.
[2023-03-19 05:02:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
[2023-03-19 05:02:17] [INFO ] Added : 160 causal constraints over 33 iterations in 1022 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA SmartHome-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 196 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 226/226 transitions.
Graph (trivial) has 191 edges and 196 vertex of which 77 / 196 are part of one of the 5 SCC in 7 ms
Free SCC test removed 72 places
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 124 transition count 84
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 57 rules applied. Total rules applied 106 place count 76 transition count 75
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 110 place count 72 transition count 75
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 110 place count 72 transition count 72
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 69 transition count 72
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 142 place count 43 transition count 46
Iterating global reduction 3 with 26 rules applied. Total rules applied 168 place count 43 transition count 46
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 173 place count 43 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 173 place count 43 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 183 place count 38 transition count 36
Graph (complete) has 99 edges and 38 vertex of which 34 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 185 place count 34 transition count 33
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 194 place count 33 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 194 place count 33 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 196 place count 32 transition count 24
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 197 place count 31 transition count 23
Iterating global reduction 6 with 1 rules applied. Total rules applied 198 place count 31 transition count 23
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 210 place count 25 transition count 17
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 215 place count 25 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 220 place count 20 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 221 place count 19 transition count 11
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 7 with 8 rules applied. Total rules applied 229 place count 15 transition count 7
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 233 place count 11 transition count 7
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 233 place count 11 transition count 3
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 9 rules applied. Total rules applied 242 place count 6 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 245 place count 4 transition count 2
Applied a total of 245 rules in 97 ms. Remains 4 /196 variables (removed 192) and now considering 2/226 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 4/196 places, 2/226 transitions.
// Phase 1: matrix 2 rows 4 cols
[2023-03-19 05:02:17] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 333333 resets, run finished after 457 ms. (steps per millisecond=2188 ) properties (out of 1) seen :1
FORMULA SmartHome-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6755 ms.
ITS solved all properties within timeout

BK_STOP 1679202139030

--------------------
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 UpperBounds -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="SmartHome-PT-05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is SmartHome-PT-05, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r455-smll-167912647000189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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