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

About the Execution of Marcie+red for DLCround-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9170.476 3600000.00 3658360.00 10050.80 TFTFTFTFTFFTTTFF 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.r106-tall-167814483000662.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DLCround-PT-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483000662
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.6K Feb 25 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 674K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-05b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678450863777

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-05b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 12:21:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 12:21:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 12:21:05] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-10 12:21:05] [INFO ] Transformed 1999 places.
[2023-03-10 12:21:05] [INFO ] Transformed 2887 transitions.
[2023-03-10 12:21:05] [INFO ] Found NUPN structural information;
[2023-03-10 12:21:05] [INFO ] Parsed PT model containing 1999 places and 2887 transitions and 7649 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-05b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 13) seen :9
FORMULA DLCround-PT-05b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-05b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2887 rows 1999 cols
[2023-03-10 12:21:06] [INFO ] Computed 88 place invariants in 40 ms
[2023-03-10 12:21:07] [INFO ] After 629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 12:21:08] [INFO ] [Nat]Absence check using 88 positive place invariants in 214 ms returned sat
[2023-03-10 12:21:09] [INFO ] After 1228ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-10 12:21:10] [INFO ] After 1930ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 365 ms.
[2023-03-10 12:21:10] [INFO ] After 3417ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA DLCround-PT-05b-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
FORMULA DLCround-PT-05b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-05b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 56 ms.
Support contains 14 out of 1999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1999/1999 places, 2887/2887 transitions.
Graph (trivial) has 1885 edges and 1999 vertex of which 394 / 1999 are part of one of the 27 SCC in 8 ms
Free SCC test removed 367 places
Drop transitions removed 410 transitions
Reduce isomorphic transitions removed 410 transitions.
Drop transitions removed 746 transitions
Trivial Post-agglo rules discarded 746 transitions
Performed 746 trivial Post agglomeration. Transition count delta: 746
Iterating post reduction 0 with 746 rules applied. Total rules applied 747 place count 1632 transition count 1731
Reduce places removed 746 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 800 rules applied. Total rules applied 1547 place count 886 transition count 1677
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 32 rules applied. Total rules applied 1579 place count 862 transition count 1669
Reduce places removed 4 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 3 with 14 rules applied. Total rules applied 1593 place count 858 transition count 1659
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1603 place count 848 transition count 1659
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1603 place count 848 transition count 1652
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1617 place count 841 transition count 1652
Discarding 230 places :
Symmetric choice reduction at 5 with 230 rule applications. Total rules 1847 place count 611 transition count 1422
Iterating global reduction 5 with 230 rules applied. Total rules applied 2077 place count 611 transition count 1422
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 91 Pre rules applied. Total rules applied 2077 place count 611 transition count 1331
Deduced a syphon composed of 91 places in 10 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 5 with 182 rules applied. Total rules applied 2259 place count 520 transition count 1331
Discarding 47 places :
Symmetric choice reduction at 5 with 47 rule applications. Total rules 2306 place count 473 transition count 929
Iterating global reduction 5 with 47 rules applied. Total rules applied 2353 place count 473 transition count 929
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 2372 place count 473 transition count 910
Performed 124 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 124 places in 0 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 6 with 248 rules applied. Total rules applied 2620 place count 349 transition count 780
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2626 place count 349 transition count 774
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2627 place count 348 transition count 765
Iterating global reduction 7 with 1 rules applied. Total rules applied 2628 place count 348 transition count 765
Performed 43 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 7 with 86 rules applied. Total rules applied 2714 place count 305 transition count 1095
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 7 with 49 rules applied. Total rules applied 2763 place count 305 transition count 1046
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 2778 place count 290 transition count 779
Iterating global reduction 8 with 15 rules applied. Total rules applied 2793 place count 290 transition count 779
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 8 with 37 rules applied. Total rules applied 2830 place count 290 transition count 742
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2832 place count 289 transition count 753
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2834 place count 289 transition count 751
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 10 with 75 rules applied. Total rules applied 2909 place count 289 transition count 676
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 2915 place count 283 transition count 613
Iterating global reduction 10 with 6 rules applied. Total rules applied 2921 place count 283 transition count 613
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2927 place count 283 transition count 607
Free-agglomeration rule applied 152 times with reduction of 73 identical transitions.
Iterating global reduction 11 with 152 rules applied. Total rules applied 3079 place count 283 transition count 382
Reduce places removed 152 places and 0 transitions.
Drop transitions removed 164 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 165 transitions.
Graph (complete) has 310 edges and 131 vertex of which 97 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Iterating post reduction 11 with 318 rules applied. Total rules applied 3397 place count 97 transition count 205
Drop transitions removed 14 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 12 with 38 rules applied. Total rules applied 3435 place count 97 transition count 167
Discarding 21 places :
Symmetric choice reduction at 13 with 21 rule applications. Total rules 3456 place count 76 transition count 140
Iterating global reduction 13 with 21 rules applied. Total rules applied 3477 place count 76 transition count 140
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 13 with 7 rules applied. Total rules applied 3484 place count 76 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 3485 place count 75 transition count 132
Applied a total of 3485 rules in 701 ms. Remains 75 /1999 variables (removed 1924) and now considering 132/2887 (removed 2755) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 703 ms. Remains : 75/1999 places, 132/2887 transitions.
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
FORMULA DLCround-PT-05b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5926 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DLCround_PT_05b
(NrP: 1999 NrTr: 2887 NrArc: 7649)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.474sec

net check time: 0m 0.000sec

init dd package: 0m 2.770sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6980140 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16103368 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.029sec

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="DLCround-PT-05b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 DLCround-PT-05b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814483000662"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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