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

About the Execution of 2022-gold for ShieldRVs-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
274.123 28325.00 57232.00 48.10 F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r448-tajo-167905989600058.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is ShieldRVs-PT-010B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r448-tajo-167905989600058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.7K Feb 26 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 18:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 122K 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679476698717

Running Version 202205111006
[2023-03-22 09:18:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-22 09:18:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:18:20] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-03-22 09:18:20] [INFO ] Transformed 403 places.
[2023-03-22 09:18:20] [INFO ] Transformed 453 transitions.
[2023-03-22 09:18:20] [INFO ] Found NUPN structural information;
[2023-03-22 09:18:20] [INFO ] Parsed PT model containing 403 places and 453 transitions in 232 ms.
Structural test allowed to assert that 191 places are NOT stable. Took 12 ms.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 595 ms. (steps per millisecond=16 ) properties (out of 212) seen :197
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 453 rows 403 cols
[2023-03-22 09:18:21] [INFO ] Computed 41 place invariants in 19 ms
[2023-03-22 09:18:21] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 09:18:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 16 ms returned sat
[2023-03-22 09:18:22] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-22 09:18:22] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 7 ms to minimize.
[2023-03-22 09:18:22] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 0 ms to minimize.
[2023-03-22 09:18:22] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2023-03-22 09:18:22] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2023-03-22 09:18:22] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2023-03-22 09:18:22] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2023-03-22 09:18:22] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2023-03-22 09:18:22] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2023-03-22 09:18:22] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2023-03-22 09:18:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 756 ms
[2023-03-22 09:18:22] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2023-03-22 09:18:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-22 09:18:22] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2023-03-22 09:18:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-22 09:18:23] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2023-03-22 09:18:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-22 09:18:23] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2023-03-22 09:18:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-22 09:18:23] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 0 ms to minimize.
[2023-03-22 09:18:23] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2023-03-22 09:18:23] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2023-03-22 09:18:23] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 0 ms to minimize.
[2023-03-22 09:18:23] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2023-03-22 09:18:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 549 ms
[2023-03-22 09:18:24] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 0 ms to minimize.
[2023-03-22 09:18:24] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2023-03-22 09:18:24] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2023-03-22 09:18:24] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 1 ms to minimize.
[2023-03-22 09:18:24] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2023-03-22 09:18:24] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
[2023-03-22 09:18:24] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 0 ms to minimize.
[2023-03-22 09:18:25] [INFO ] Deduced a trap composed of 20 places in 342 ms of which 1 ms to minimize.
[2023-03-22 09:18:25] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 0 ms to minimize.
[2023-03-22 09:18:25] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2023-03-22 09:18:25] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 1 ms to minimize.
[2023-03-22 09:18:25] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 0 ms to minimize.
[2023-03-22 09:18:26] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2023-03-22 09:18:26] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2023-03-22 09:18:26] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2412 ms
[2023-03-22 09:18:26] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2023-03-22 09:18:26] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 0 ms to minimize.
[2023-03-22 09:18:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2023-03-22 09:18:26] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 4 ms to minimize.
[2023-03-22 09:18:26] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2023-03-22 09:18:26] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2023-03-22 09:18:26] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2023-03-22 09:18:27] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2023-03-22 09:18:27] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2023-03-22 09:18:27] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 0 ms to minimize.
[2023-03-22 09:18:27] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2023-03-22 09:18:27] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2023-03-22 09:18:27] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2023-03-22 09:18:27] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2023-03-22 09:18:27] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-22 09:18:27] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2023-03-22 09:18:28] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 0 ms to minimize.
[2023-03-22 09:18:28] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2023-03-22 09:18:28] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2023-03-22 09:18:28] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2023-03-22 09:18:28] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2023-03-22 09:18:28] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2023-03-22 09:18:28] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2023-03-22 09:18:28] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2001 ms
[2023-03-22 09:18:28] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2023-03-22 09:18:28] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2023-03-22 09:18:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-03-22 09:18:28] [INFO ] After 7156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 293 ms.
[2023-03-22 09:18:29] [INFO ] After 7787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 17603 ms.
Support contains 15 out of 403 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 403/403 places, 453/453 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 403 transition count 412
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 362 transition count 412
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 82 place count 362 transition count 362
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 182 place count 312 transition count 362
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 239 place count 255 transition count 305
Iterating global reduction 2 with 57 rules applied. Total rules applied 296 place count 255 transition count 305
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 296 place count 255 transition count 275
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 356 place count 225 transition count 275
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 492 place count 157 transition count 207
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 514 place count 157 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 515 place count 156 transition count 206
Applied a total of 515 rules in 121 ms. Remains 156 /403 variables (removed 247) and now considering 206/453 (removed 247) transitions.
Finished structural reductions, in 1 iterations. Remains : 156/403 places, 206/453 transitions.
Finished random walk after 977 steps, including 7 resets, run visited all 15 properties in 36 ms. (steps per millisecond=27 )
Able to resolve query StableMarking after proving 213 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 26967 ms.

BK_STOP 1679476727042

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldRVs-PT-010B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is ShieldRVs-PT-010B, 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 r448-tajo-167905989600058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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