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.r586-smll-171734923800103.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 greatspnxred
Input is MedleyA-PT-21, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r586-smll-171734923800103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 70K Jun 2 16:33 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 StableMarking

=== Now, execution of the tool begins

BK_START 1717352761238

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-21
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:26:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:26:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:26:03] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-06-02 18:26:03] [INFO ] Transformed 306 places.
[2024-06-02 18:26:03] [INFO ] Transformed 298 transitions.
[2024-06-02 18:26:03] [INFO ] Found NUPN structural information;
[2024-06-02 18:26:03] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 355 ms.
Graph (trivial) has 235 edges and 306 vertex of which 6 / 306 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Structural test allowed to assert that 171 places are NOT stable. Took 45 ms.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
RANDOM walk for 40000 steps (8 resets) in 3331 ms. (12 steps per ms) remains 29/135 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
// Phase 1: matrix 293 rows 301 cols
[2024-06-02 18:26:05] [INFO ] Computed 20 invariants in 31 ms
[2024-06-02 18:26:05] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 104/133 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 104/141 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 168/301 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 168/321 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 292/593 variables, 301/622 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 1/594 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/594 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/594 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 623 constraints, problems are : Problem set: 0 solved, 29 unsolved in 2568 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 301/301 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 104/133 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 104/141 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 18:26:08] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 27 ms to minimize.
[2024-06-02 18:26:08] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 5 ms to minimize.
[2024-06-02 18:26:08] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 18:26:08] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:26:08] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 168/301 variables, 12/158 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 168/326 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 18:26:08] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-06-02 18:26:08] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-06-02 18:26:09] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:26:09] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:26:09] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 18:26:09] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:26:09] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 292/593 variables, 301/634 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/593 variables, 29/663 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 18:26:10] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:26:10] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 3 ms to minimize.
[2024-06-02 18:26:11] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/593 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 18:26:11] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:26:11] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:26:11] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/593 variables, 3/669 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 18:26:12] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/594 variables, and 670 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5014 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 301/301 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 19/19 constraints]
After SMT, in 7710ms problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 293/293 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 301 transition count 202
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 181 place count 211 transition count 202
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 181 place count 211 transition count 179
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 227 place count 188 transition count 179
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 257 place count 158 transition count 149
Iterating global reduction 2 with 30 rules applied. Total rules applied 287 place count 158 transition count 149
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 287 place count 158 transition count 140
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 305 place count 149 transition count 140
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 373 place count 115 transition count 106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 379 place count 112 transition count 129
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 406 place count 112 transition count 102
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 435 place count 85 transition count 100
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 436 place count 85 transition count 100
Applied a total of 436 rules in 183 ms. Remains 85 /301 variables (removed 216) and now considering 100/293 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 85/301 places, 100/293 transitions.
RANDOM walk for 1633 steps (38 resets) in 98 ms. (16 steps per ms) remains 0/29 properties
Able to resolve query StableMarking after proving 137 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 10002 ms.
ITS solved all properties within timeout

BK_STOP 1717352773070

--------------------
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 StableMarking -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="MedleyA-PT-21"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-21, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r586-smll-171734923800103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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