Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699100503.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-07, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100503
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.4K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 100K Mar 24 05:37 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 BusinessProcesses-PT-07-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589251278158

[2020-05-12 02:41:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:41:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:41:20] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-05-12 02:41:20] [INFO ] Transformed 386 places.
[2020-05-12 02:41:20] [INFO ] Transformed 360 transitions.
[2020-05-12 02:41:20] [INFO ] Found NUPN structural information;
[2020-05-12 02:41:20] [INFO ] Parsed PT model containing 386 places and 360 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 105 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1]
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 360 rows 386 cols
[2020-05-12 02:41:20] [INFO ] Computed 62 place invariants in 15 ms
[2020-05-12 02:41:20] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2020-05-12 02:41:20] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 16 ms returned sat
[2020-05-12 02:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:21] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2020-05-12 02:41:21] [INFO ] Deduced a trap composed of 93 places in 167 ms
[2020-05-12 02:41:21] [INFO ] Deduced a trap composed of 20 places in 121 ms
[2020-05-12 02:41:21] [INFO ] Deduced a trap composed of 12 places in 105 ms
[2020-05-12 02:41:21] [INFO ] Deduced a trap composed of 11 places in 116 ms
[2020-05-12 02:41:22] [INFO ] Deduced a trap composed of 12 places in 218 ms
[2020-05-12 02:41:22] [INFO ] Deduced a trap composed of 14 places in 119 ms
[2020-05-12 02:41:22] [INFO ] Deduced a trap composed of 13 places in 220 ms
[2020-05-12 02:41:23] [INFO ] Deduced a trap composed of 109 places in 995 ms
[2020-05-12 02:41:24] [INFO ] Deduced a trap composed of 114 places in 576 ms
[2020-05-12 02:41:25] [INFO ] Deduced a trap composed of 27 places in 1129 ms
[2020-05-12 02:41:25] [INFO ] Deduced a trap composed of 104 places in 113 ms
[2020-05-12 02:41:27] [INFO ] Deduced a trap composed of 28 places in 1522 ms
[2020-05-12 02:41:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s55 s58 s59 s62 s63 s64 s65 s66 s67 s68 s69 s70 s225 s226 s227 s274) 0)") while checking expression at index 0
[2020-05-12 02:41:27] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned sat
[2020-05-12 02:41:27] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 14 ms returned sat
[2020-05-12 02:41:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:28] [INFO ] [Real]Absence check using state equation in 1154 ms returned sat
[2020-05-12 02:41:28] [INFO ] Deduced a trap composed of 11 places in 208 ms
[2020-05-12 02:41:28] [INFO ] Deduced a trap composed of 18 places in 103 ms
[2020-05-12 02:41:29] [INFO ] Deduced a trap composed of 19 places in 374 ms
[2020-05-12 02:41:29] [INFO ] Deduced a trap composed of 75 places in 135 ms
[2020-05-12 02:41:29] [INFO ] Deduced a trap composed of 13 places in 109 ms
[2020-05-12 02:41:29] [INFO ] Deduced a trap composed of 12 places in 108 ms
[2020-05-12 02:41:29] [INFO ] Deduced a trap composed of 29 places in 66 ms
[2020-05-12 02:41:29] [INFO ] Deduced a trap composed of 32 places in 44 ms
[2020-05-12 02:41:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1362 ms
[2020-05-12 02:41:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:41:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 65 ms returned sat
[2020-05-12 02:41:29] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 13 ms returned sat
[2020-05-12 02:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:31] [INFO ] [Nat]Absence check using state equation in 1407 ms returned sat
[2020-05-12 02:41:31] [INFO ] Deduced a trap composed of 11 places in 541 ms
[2020-05-12 02:41:31] [INFO ] Deduced a trap composed of 18 places in 106 ms
[2020-05-12 02:41:32] [INFO ] Deduced a trap composed of 15 places in 152 ms
[2020-05-12 02:41:32] [INFO ] Deduced a trap composed of 12 places in 98 ms
[2020-05-12 02:41:32] [INFO ] Deduced a trap composed of 29 places in 93 ms
[2020-05-12 02:41:32] [INFO ] Deduced a trap composed of 32 places in 50 ms
[2020-05-12 02:41:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1247 ms
[2020-05-12 02:41:32] [INFO ] Computed and/alt/rep : 359/1286/359 causal constraints in 26 ms.
[2020-05-12 02:41:33] [INFO ] Added : 236 causal constraints over 48 iterations in 1454 ms. Result :sat
[2020-05-12 02:41:34] [INFO ] Deduced a trap composed of 92 places in 110 ms
[2020-05-12 02:41:34] [INFO ] Deduced a trap composed of 94 places in 876 ms
[2020-05-12 02:41:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s21 s22 s41 s42 s43 s58 s59 s62 s63 s66 s67 s71 s75 s76 s77 s79 s80 s81 s82 s85 s88 s89 s90 s104 s107 s108 s109 s113 s128 s129 s130 s134 s135 s136 s140 s141 s142 s159 s162 s181 s186 s196 s201 s205 s207 s211 s221 s226 s231 s236 s241 s246 s251 s256 s261 s265 s268 s269 s270 s271 s274 s275 s276 s277 s278 s279 s280 s281 s284 s287 s288 s289 s290 s291 s292 s300 s301 s304 s305 s307 s325 s326 s327 s328 s343 s344 s347 s348 s351 s358 s359) 0)") while checking expression at index 1
[2020-05-12 02:41:35] [INFO ] [Real]Absence check using 33 positive place invariants in 200 ms returned unsat
[2020-05-12 02:41:35] [INFO ] [Real]Absence check using 33 positive place invariants in 185 ms returned sat
[2020-05-12 02:41:35] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 79 ms returned unsat
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 10 out of 386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 209 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 45 ms
Free SCC test removed 6 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 805 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 0 with 88 rules applied. Total rules applied 90 place count 378 transition count 271
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 170 place count 298 transition count 271
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 170 place count 298 transition count 213
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 294 place count 232 transition count 213
Symmetric choice reduction at 2 with 43 rule applications. Total rules 337 place count 232 transition count 213
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 43 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 423 place count 189 transition count 170
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 423 place count 189 transition count 165
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 434 place count 183 transition count 165
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 538 place count 130 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 540 place count 129 transition count 117
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 542 place count 129 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 544 place count 127 transition count 115
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 549 place count 127 transition count 115
Applied a total of 549 rules in 215 ms. Remains 127 /386 variables (removed 259) and now considering 115/360 (removed 245) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/386 places, 115/360 transitions.
Incomplete random walk after 1000000 steps, including 49354 resets, run finished after 1691 ms. (steps per millisecond=591 ) properties seen :[1, 0]
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 112 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=112 )
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589251297785

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="BusinessProcesses-PT-07"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-07, 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 r021-oct2-158897699100503"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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