Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r196-tall-174889278500084.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is ResAllocation-PT-R003C050, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r196-tall-174889278500084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 9 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 360K May 29 14:32 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 Liveness

=== Now, execution of the tool begins

BK_START 1748954182165

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ResAllocation-PT-R003C050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 12:36:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-03 12:36:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 12:36:23] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2025-06-03 12:36:23] [INFO ] Transformed 300 places.
[2025-06-03 12:36:23] [INFO ] Transformed 200 transitions.
[2025-06-03 12:36:23] [INFO ] Found NUPN structural information;
[2025-06-03 12:36:23] [INFO ] Parsed PT model containing 300 places and 200 transitions and 894 arcs in 344 ms.
Discarding 1 transitions out of 200. Remains 199
Built sparse matrix representations for Structural reductions in 23 ms.19377KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 300/300 places, 200/200 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 89 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 141 ms. Remains : 300/300 places, 200/200 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 300/300 places, 200/200 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 27 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 300 cols
[2025-06-03 12:36:24] [INFO ] Computed 150 invariants in 11 ms
[2025-06-03 12:36:24] [INFO ] Implicit Places using invariants in 280 ms returned []
[2025-06-03 12:36:24] [INFO ] Invariant cache hit.
[2025-06-03 12:36:24] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2025-06-03 12:36:24] [INFO ] Redundant transitions in 6 ms returned []
Running 150 sub problems to find dead transitions.
[2025-06-03 12:36:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 299/299 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 149/448 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2025-06-03 12:36:26] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 17 ms to minimize.
[2025-06-03 12:36:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 4 ms to minimize.
[2025-06-03 12:36:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2025-06-03 12:36:26] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2025-06-03 12:36:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-06-03 12:36:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2025-06-03 12:36:26] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-06-03 12:36:26] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2025-06-03 12:36:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2025-06-03 12:36:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-06-03 12:36:26] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2025-06-03 12:36:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 20/468 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2025-06-03 12:36:27] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2025-06-03 12:36:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2025-06-03 12:36:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2025-06-03 12:36:28] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2025-06-03 12:36:28] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 7 ms to minimize.
[2025-06-03 12:36:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2025-06-03 12:36:28] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-06-03 12:36:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2025-06-03 12:36:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2025-06-03 12:36:28] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2025-06-03 12:36:28] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 20/488 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2025-06-03 12:36:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2025-06-03 12:36:29] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-06-03 12:36:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2025-06-03 12:36:29] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2025-06-03 12:36:29] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2025-06-03 12:36:29] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2025-06-03 12:36:29] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2025-06-03 12:36:29] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2025-06-03 12:36:29] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2025-06-03 12:36:30] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2025-06-03 12:36:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
[2025-06-03 12:36:30] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2025-06-03 12:36:30] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2025-06-03 12:36:30] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 3 ms to minimize.
[2025-06-03 12:36:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 8 ms to minimize.
[2025-06-03 12:36:30] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 8 ms to minimize.
[2025-06-03 12:36:30] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2025-06-03 12:36:30] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2025-06-03 12:36:30] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2025-06-03 12:36:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 20/508 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2025-06-03 12:36:31] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2025-06-03 12:36:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-06-03 12:36:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2025-06-03 12:36:31] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
[2025-06-03 12:36:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2025-06-03 12:36:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-06-03 12:36:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2025-06-03 12:36:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2025-06-03 12:36:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2025-06-03 12:36:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2025-06-03 12:36:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2025-06-03 12:36:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-06-03 12:36:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 13/521 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/300 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 200/500 variables, 300/823 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/500 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 823 constraints, problems are : Problem set: 0 solved, 150 unsolved in 14513 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 150/150 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 299/299 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 149/448 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 1/300 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/500 variables, 300/823 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 150/973 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/500 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 973 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10980 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 150/150 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 73/73 constraints]
After SMT, in 25594ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 25712ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 26421 ms. Remains : 300/300 places, 200/200 transitions.
Finished random walk after 98 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=49 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 27150 ms.
ITS solved all properties within timeout

BK_STOP 1748954210851

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -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="ResAllocation-PT-R003C050"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is ResAllocation-PT-R003C050, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r196-tall-174889278500084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C050.tgz
mv ResAllocation-PT-R003C050 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;