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.r140-smll-174876533500108.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 MedleyA-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-smll-174876533500108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 107K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1748928225932

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 05:23:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-03 05:23:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:23:48] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2025-06-03 05:23:48] [INFO ] Transformed 149 places.
[2025-06-03 05:23:48] [INFO ] Transformed 340 transitions.
[2025-06-03 05:23:48] [INFO ] Found NUPN structural information;
[2025-06-03 05:23:48] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 353 ms.
Structural test allowed to assert that 32 places are NOT stable. Took 11 ms.
RANDOM walk for 40000 steps (1751 resets) in 3855 ms. (10 steps per ms) remains 45/117 properties
BEST_FIRST walk for 4001 steps (39 resets) in 57 ms. (68 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (44 resets) in 46 ms. (85 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (43 resets) in 33 ms. (117 steps per ms) remains 42/44 properties
BEST_FIRST walk for 4004 steps (44 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (42 resets) in 32 ms. (121 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (41 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (45 resets) in 54 ms. (72 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (40 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (43 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (40 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (39 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (40 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (42 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (38 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (44 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (42 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (43 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (37 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (41 resets) in 13 ms. (285 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4000 steps (44 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (36 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (39 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (39 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (44 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (42 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (37 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (46 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (40 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (42 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (44 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (36 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (40 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (41 resets) in 14 ms. (266 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4001 steps (41 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (37 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (40 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (39 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (43 resets) in 16 ms. (235 steps per ms) remains 37/40 properties
BEST_FIRST walk for 4003 steps (39 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (42 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
// Phase 1: matrix 340 rows 149 cols
[2025-06-03 05:23:50] [INFO ] Computed 12 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 53/90 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 53/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 23/113 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 23/120 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 36/149 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 36/161 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 340/489 variables, 149/310 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 0/489 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 310 constraints, problems are : Problem set: 0 solved, 37 unsolved in 2189 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 53/90 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 53/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 23/113 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 23/120 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 36/149 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 36/161 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-06-03 05:23:54] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 36 ms to minimize.
[2025-06-03 05:23:54] [INFO ] Deduced a trap composed of 32 places in 314 ms of which 3 ms to minimize.
[2025-06-03 05:23:55] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 2 ms to minimize.
[2025-06-03 05:23:55] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 2 ms to minimize.
[2025-06-03 05:23:55] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 16 ms to minimize.
[2025-06-03 05:23:55] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 3 ms to minimize.
[2025-06-03 05:23:55] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2025-06-03 05:23:56] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 3 ms to minimize.
[2025-06-03 05:23:56] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
[2025-06-03 05:23:56] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 3 ms to minimize.
[2025-06-03 05:23:56] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 7 ms to minimize.
[2025-06-03 05:23:56] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 10 ms to minimize.
[2025-06-03 05:23:56] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 2 ms to minimize.
[2025-06-03 05:23:57] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2025-06-03 05:23:57] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2025-06-03 05:23:57] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2025-06-03 05:23:57] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2025-06-03 05:23:57] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2025-06-03 05:23:57] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 19/180 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-06-03 05:23:58] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 2 ms to minimize.
SMT process timed out in 7445ms, After SMT, problems are : Problem set: 0 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 340/340 transitions.
Graph (complete) has 543 edges and 149 vertex of which 144 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 144 transition count 320
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 127 transition count 318
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 38 place count 127 transition count 315
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 124 transition count 315
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 61 place count 107 transition count 294
Iterating global reduction 2 with 17 rules applied. Total rules applied 78 place count 107 transition count 294
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 105 transition count 292
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 105 transition count 292
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 112 place count 90 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 90 transition count 276
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 88 transition count 274
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 88 transition count 274
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 125 place count 84 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 131 place count 84 transition count 303
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 84 transition count 297
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 143 place count 78 transition count 297
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 145 place count 78 transition count 299
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 147 place count 76 transition count 299
Applied a total of 147 rules in 181 ms. Remains 76 /149 variables (removed 73) and now considering 299/340 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 76/149 places, 299/340 transitions.
RANDOM walk for 198459 steps (44435 resets) in 4144 ms. (47 steps per ms) remains 0/37 properties
Able to resolve query StableMarking after proving 118 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 11849 ms.
ITS solved all properties within timeout

BK_STOP 1748928239929

--------------------
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-10"
export BK_EXAMINATION="StableMarking"
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 MedleyA-PT-10, 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 r140-smll-174876533500108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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