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

About the Execution of Marcie+red for QuasiCertifProtocol-COL-28

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10547.800 406593.00 423590.00 1297.90 TFTFTFTFTFTTFFTT 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.r298-tall-167873952300846.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 QuasiCertifProtocol-COL-28, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952300846
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 120K 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

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

=== Now, execution of the tool begins

BK_START 1679684845022

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=QuasiCertifProtocol-COL-28
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 19:07:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 19:07:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 19:07:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 19:07:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 19:07:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 681 ms
[2023-03-24 19:07:27] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2023-03-24 19:07:27] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-24 19:07:27] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
[2023-03-24 19:07:27] [INFO ] Flatten gal took : 19 ms
[2023-03-24 19:07:27] [INFO ] Flatten gal took : 5 ms
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2023-03-24 19:07:27] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 44 ms.
[2023-03-24 19:07:27] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Incomplete random walk after 10000 steps, including 301 resets, run finished after 902 ms. (steps per millisecond=11 ) properties (out of 16) seen :2
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 776 ms. (steps per millisecond=12 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 1123 ms. (steps per millisecond=8 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 446 rows 2998 cols
[2023-03-24 19:07:31] [INFO ] Computed 2553 place invariants in 102 ms
[2023-03-24 19:07:34] [INFO ] After 1241ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:13
[2023-03-24 19:07:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2023-03-24 19:07:35] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 520 ms returned sat
[2023-03-24 19:07:59] [INFO ] After 23166ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :3
[2023-03-24 19:07:59] [INFO ] After 23170ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 19:07:59] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :3
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 2 different solutions.
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 50 ms.
Support contains 1979 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2997 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2997 transition count 445
Applied a total of 2 rules in 201 ms. Remains 2997 /2998 variables (removed 1) and now considering 445/446 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 2997/2998 places, 445/446 transitions.
Incomplete random walk after 10000 steps, including 310 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Finished probabilistic random walk after 7722 steps, run visited all 4 properties in 411 ms. (steps per millisecond=18 )
Probabilistic random walk after 7722 steps, saw 7568 distinct states, run finished after 415 ms. (steps per millisecond=18 ) properties seen :4
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 34502 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

Unfolding complete |P|=2998|T|=446|A|=6489
Time for unfolding: 0m 1.918sec

Net: QuasiCertifProtocol_COL_28
(NrP: 2998 NrTr: 446 NrArc: 6489)

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

net check time: 0m 0.000sec

init dd package: 0m 2.792sec


before gc: list nodes free: 1357599

after gc: idd nodes used:39720699, unused:24279301; list nodes free:117014781

RS generation: 5m26.777sec


-> last computed set: #nodes 39717731 (4.0e+07) #states 2,097,153 (6)


CANNOT_COMPUTE


BK_STOP 1679685251615

--------------------
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.001sec

idd.cc:820: DD Exception: No free nodes

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="QuasiCertifProtocol-COL-28"
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 QuasiCertifProtocol-COL-28, 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 r298-tall-167873952300846"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-28.tgz
mv QuasiCertifProtocol-COL-28 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 ;