About the Execution of Marcie+red for ShieldPPPt-PT-010B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
374.327 | 37863.00 | 64773.00 | 56.40 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r408-oct2-167903727300388.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldPPPt-PT-010B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r408-oct2-167903727300388
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.0K Feb 25 21:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 21:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 21:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 21:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 185K 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 1679767439866
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPt-PT-010B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-25 18:04:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-25 18:04:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 18:04:03] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-25 18:04:03] [INFO ] Transformed 783 places.
[2023-03-25 18:04:03] [INFO ] Transformed 713 transitions.
[2023-03-25 18:04:03] [INFO ] Found NUPN structural information;
[2023-03-25 18:04:03] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 374 ms.
Structural test allowed to assert that 284 places are NOT stable. Took 19 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 499) seen :391
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) seen :0
Running SMT prover for 108 properties.
// Phase 1: matrix 713 rows 783 cols
[2023-03-25 18:04:04] [INFO ] Computed 111 place invariants in 15 ms
[2023-03-25 18:04:08] [INFO ] After 3603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:108
[2023-03-25 18:04:11] [INFO ] [Nat]Absence check using 111 positive place invariants in 476 ms returned sat
[2023-03-25 18:04:20] [INFO ] After 5797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :108
[2023-03-25 18:04:20] [INFO ] Deduced a trap composed of 21 places in 419 ms of which 16 ms to minimize.
[2023-03-25 18:04:21] [INFO ] Deduced a trap composed of 22 places in 444 ms of which 14 ms to minimize.
[2023-03-25 18:04:21] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 8 ms to minimize.
[2023-03-25 18:04:22] [INFO ] Deduced a trap composed of 22 places in 362 ms of which 12 ms to minimize.
[2023-03-25 18:04:22] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 6 ms to minimize.
[2023-03-25 18:04:22] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2023-03-25 18:04:22] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2023-03-25 18:04:22] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2023-03-25 18:04:22] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2023-03-25 18:04:22] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 0 ms to minimize.
[2023-03-25 18:04:23] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 1 ms to minimize.
[2023-03-25 18:04:23] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2023-03-25 18:04:23] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2023-03-25 18:04:23] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2023-03-25 18:04:23] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2023-03-25 18:04:23] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2023-03-25 18:04:23] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3362 ms
[2023-03-25 18:04:30] [INFO ] Deduced a trap composed of 25 places in 1244 ms of which 0 ms to minimize.
[2023-03-25 18:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1314 ms
[2023-03-25 18:04:31] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2023-03-25 18:04:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-25 18:04:33] [INFO ] After 18866ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :108
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-25 18:04:33] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :108
Fused 108 Parikh solutions to 96 different solutions.
Parikh walk visited 0 properties in 3489 ms.
Support contains 108 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 171 place count 783 transition count 542
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 173 rules applied. Total rules applied 344 place count 612 transition count 540
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 345 place count 611 transition count 540
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 345 place count 611 transition count 504
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 417 place count 575 transition count 504
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 465 place count 527 transition count 456
Iterating global reduction 3 with 48 rules applied. Total rules applied 513 place count 527 transition count 456
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 513 place count 527 transition count 439
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 547 place count 510 transition count 439
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 166
Deduced a syphon composed of 166 places in 0 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 3 with 332 rules applied. Total rules applied 879 place count 344 transition count 273
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 923 place count 322 transition count 273
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 924 place count 322 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 925 place count 321 transition count 272
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 948 place count 321 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 949 place count 320 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 950 place count 319 transition count 271
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 950 place count 319 transition count 269
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 954 place count 317 transition count 269
Applied a total of 954 rules in 152 ms. Remains 317 /783 variables (removed 466) and now considering 269/713 (removed 444) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 317/783 places, 269/713 transitions.
Finished random walk after 6333 steps, including 0 resets, run visited all 108 properties in 304 ms. (steps per millisecond=20 )
Able to resolve query StableMarking after proving 500 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 33992 ms.
ITS solved all properties within timeout
BK_STOP 1679767477729
--------------------
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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="ShieldPPPt-PT-010B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldPPPt-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 r408-oct2-167903727300388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-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 '
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 ;