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.r343-tall-167889215100131.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 ltsminxred
Input is RERS17pb115-PT-9, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r343-tall-167889215100131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 13:48 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 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 25 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 13:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 25 13:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 69M 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679132366352

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=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb115-PT-9
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:39:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 09:39:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:39:30] [INFO ] Load time of PNML (sax parser for PT used): 1941 ms
[2023-03-18 09:39:30] [INFO ] Transformed 1399 places.
[2023-03-18 09:39:30] [INFO ] Transformed 144369 transitions.
[2023-03-18 09:39:30] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2490 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 45 ms.534411KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Computed a total of 19 stabilizing places and 1 stable transitions
Ensure Unique test removed 18 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1380 transition count 144368
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 19 rules in 3837 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 3849 ms. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 326243 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2023-03-18 09:40:05] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 09:40:05] [INFO ] Computed 19 place invariants in 410 ms
[2023-03-18 09:40:29] [INFO ] [Real]Absence check using 19 positive place invariants in 84 ms returned sat
[2023-03-18 09:40:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:40:47] [INFO ] [Real]Absence check using state equation in 18659 ms returned sat
[2023-03-18 09:40:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:41:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 108 ms returned sat
[2023-03-18 09:41:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:41:29] [INFO ] [Nat]Absence check using state equation in 18357 ms returned sat
[2023-03-18 09:41:31] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 09:41:37] [INFO ] [Nat]Added 741 Read/Feed constraints in 5814 ms returned sat
[2023-03-18 09:41:45] [INFO ] Deduced a trap composed of 72 places in 7441 ms of which 3 ms to minimize.
[2023-03-18 09:41:53] [INFO ] Deduced a trap composed of 72 places in 6247 ms of which 2 ms to minimize.
[2023-03-18 09:42:00] [INFO ] Deduced a trap composed of 40 places in 6275 ms of which 2 ms to minimize.
[2023-03-18 09:42:08] [INFO ] Deduced a trap composed of 72 places in 7190 ms of which 1 ms to minimize.
[2023-03-18 09:42:17] [INFO ] Deduced a trap composed of 48 places in 7268 ms of which 1 ms to minimize.
[2023-03-18 09:42:27] [INFO ] Deduced a trap composed of 128 places in 8815 ms of which 1 ms to minimize.
[2023-03-18 09:42:36] [INFO ] Deduced a trap composed of 40 places in 8336 ms of which 2 ms to minimize.
[2023-03-18 09:42:46] [INFO ] Deduced a trap composed of 64 places in 8609 ms of which 2 ms to minimize.
[2023-03-18 09:42:55] [INFO ] Deduced a trap composed of 64 places in 8494 ms of which 2 ms to minimize.
[2023-03-18 09:43:05] [INFO ] Deduced a trap composed of 64 places in 8058 ms of which 3 ms to minimize.
[2023-03-18 09:43:13] [INFO ] Deduced a trap composed of 16 places in 7399 ms of which 7 ms to minimize.
[2023-03-18 09:43:23] [INFO ] Deduced a trap composed of 34 places in 7942 ms of which 1 ms to minimize.
[2023-03-18 09:43:31] [INFO ] Deduced a trap composed of 48 places in 7474 ms of which 1 ms to minimize.
[2023-03-18 09:43:42] [INFO ] Deduced a trap composed of 72 places in 9958 ms of which 2 ms to minimize.
[2023-03-18 09:43:51] [INFO ] Deduced a trap composed of 80 places in 6718 ms of which 1 ms to minimize.
[2023-03-18 09:44:01] [INFO ] Deduced a trap composed of 128 places in 8895 ms of which 1 ms to minimize.
[2023-03-18 09:44:09] [INFO ] Deduced a trap composed of 96 places in 7055 ms of which 2 ms to minimize.
[2023-03-18 09:44:17] [INFO ] Deduced a trap composed of 128 places in 7196 ms of which 1 ms to minimize.
[2023-03-18 09:44:25] [INFO ] Deduced a trap composed of 96 places in 6717 ms of which 0 ms to minimize.
[2023-03-18 09:44:33] [INFO ] Deduced a trap composed of 128 places in 5932 ms of which 0 ms to minimize.
[2023-03-18 09:44:40] [INFO ] Deduced a trap composed of 72 places in 6635 ms of which 1 ms to minimize.
[2023-03-18 09:44:49] [INFO ] Deduced a trap composed of 96 places in 7112 ms of which 1 ms to minimize.
[2023-03-18 09:44:58] [INFO ] Deduced a trap composed of 64 places in 7710 ms of which 1 ms to minimize.
[2023-03-18 09:45:06] [INFO ] Deduced a trap composed of 40 places in 7478 ms of which 1 ms to minimize.
[2023-03-18 09:45:15] [INFO ] Deduced a trap composed of 96 places in 7413 ms of which 3 ms to minimize.
[2023-03-18 09:45:23] [INFO ] Deduced a trap composed of 96 places in 6520 ms of which 1 ms to minimize.
[2023-03-18 09:45:30] [INFO ] Deduced a trap composed of 128 places in 6109 ms of which 0 ms to minimize.
[2023-03-18 09:45:37] [INFO ] Deduced a trap composed of 64 places in 6007 ms of which 0 ms to minimize.
[2023-03-18 09:45:44] [INFO ] Deduced a trap composed of 64 places in 5694 ms of which 0 ms to minimize.
[2023-03-18 09:45:52] [INFO ] Deduced a trap composed of 128 places in 6839 ms of which 0 ms to minimize.
[2023-03-18 09:45:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 191640 steps, including 0 resets, run timeout after 30005 ms. (steps per millisecond=6 )
Interrupted Random walk after 353412 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 196596 steps, including 0 resets, run timeout after 30005 ms. (steps per millisecond=6 )
Interrupted Random walk after 362324 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1238 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 09:47:53] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:47:53] [INFO ] Invariant cache hit.
[2023-03-18 09:48:01] [INFO ] Implicit Places using invariants in 8263 ms returned []
Implicit Place search using SMT only with invariants took 8265 ms to find 0 implicit places.
[2023-03-18 09:48:01] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:48:01] [INFO ] Invariant cache hit.
[2023-03-18 09:48:31] [INFO ] Performed 96985/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 09:48:46] [INFO ] Dead Transitions using invariants and state equation in 44627 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 54131 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 355929 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 09:49:16] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:49:16] [INFO ] Invariant cache hit.
[2023-03-18 09:49:39] [INFO ] [Real]Absence check using 19 positive place invariants in 31 ms returned sat
[2023-03-18 09:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:49:58] [INFO ] [Real]Absence check using state equation in 19058 ms returned sat
[2023-03-18 09:49:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:50:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 57 ms returned sat
[2023-03-18 09:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:50:41] [INFO ] [Nat]Absence check using state equation in 19070 ms returned sat
[2023-03-18 09:50:42] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 09:50:48] [INFO ] [Nat]Added 741 Read/Feed constraints in 5920 ms returned sat
[2023-03-18 09:50:55] [INFO ] Deduced a trap composed of 72 places in 6492 ms of which 0 ms to minimize.
[2023-03-18 09:51:03] [INFO ] Deduced a trap composed of 48 places in 6430 ms of which 1 ms to minimize.
[2023-03-18 09:51:12] [INFO ] Deduced a trap composed of 16 places in 7329 ms of which 1 ms to minimize.
[2023-03-18 09:51:19] [INFO ] Deduced a trap composed of 48 places in 6576 ms of which 1 ms to minimize.
[2023-03-18 09:51:28] [INFO ] Deduced a trap composed of 40 places in 7380 ms of which 4 ms to minimize.
[2023-03-18 09:51:36] [INFO ] Deduced a trap composed of 128 places in 7430 ms of which 1 ms to minimize.
[2023-03-18 09:51:43] [INFO ] Deduced a trap composed of 128 places in 5849 ms of which 1 ms to minimize.
[2023-03-18 09:51:51] [INFO ] Deduced a trap composed of 34 places in 6449 ms of which 1 ms to minimize.
[2023-03-18 09:51:58] [INFO ] Deduced a trap composed of 64 places in 6488 ms of which 1 ms to minimize.
[2023-03-18 09:52:06] [INFO ] Deduced a trap composed of 96 places in 6199 ms of which 2 ms to minimize.
[2023-03-18 09:52:13] [INFO ] Deduced a trap composed of 72 places in 6094 ms of which 0 ms to minimize.
[2023-03-18 09:52:21] [INFO ] Deduced a trap composed of 64 places in 6972 ms of which 1 ms to minimize.
[2023-03-18 09:52:29] [INFO ] Deduced a trap composed of 64 places in 6547 ms of which 0 ms to minimize.
[2023-03-18 09:52:37] [INFO ] Deduced a trap composed of 80 places in 6922 ms of which 1 ms to minimize.
[2023-03-18 09:52:45] [INFO ] Deduced a trap composed of 128 places in 6936 ms of which 1 ms to minimize.
[2023-03-18 09:52:51] [INFO ] Deduced a trap composed of 40 places in 5086 ms of which 1 ms to minimize.
[2023-03-18 09:52:59] [INFO ] Deduced a trap composed of 64 places in 6616 ms of which 0 ms to minimize.
[2023-03-18 09:53:07] [INFO ] Deduced a trap composed of 72 places in 6610 ms of which 1 ms to minimize.
[2023-03-18 09:53:17] [INFO ] Deduced a trap composed of 96 places in 8842 ms of which 1 ms to minimize.
[2023-03-18 09:53:27] [INFO ] Deduced a trap composed of 96 places in 9004 ms of which 1 ms to minimize.
[2023-03-18 09:53:35] [INFO ] Deduced a trap composed of 128 places in 7316 ms of which 2 ms to minimize.
[2023-03-18 09:53:44] [INFO ] Deduced a trap composed of 40 places in 7632 ms of which 1 ms to minimize.
[2023-03-18 09:53:53] [INFO ] Deduced a trap composed of 72 places in 8002 ms of which 1 ms to minimize.
[2023-03-18 09:54:02] [INFO ] Deduced a trap composed of 128 places in 7624 ms of which 1 ms to minimize.
[2023-03-18 09:54:10] [INFO ] Deduced a trap composed of 64 places in 7034 ms of which 4 ms to minimize.
[2023-03-18 09:54:17] [INFO ] Deduced a trap composed of 128 places in 6079 ms of which 4 ms to minimize.
[2023-03-18 09:54:25] [INFO ] Deduced a trap composed of 128 places in 6821 ms of which 1 ms to minimize.
[2023-03-18 09:54:34] [INFO ] Deduced a trap composed of 128 places in 7283 ms of which 0 ms to minimize.
[2023-03-18 09:54:41] [INFO ] Deduced a trap composed of 64 places in 6152 ms of which 0 ms to minimize.
[2023-03-18 09:54:48] [INFO ] Deduced a trap composed of 72 places in 5738 ms of which 0 ms to minimize.
[2023-03-18 09:54:55] [INFO ] Deduced a trap composed of 96 places in 6468 ms of which 0 ms to minimize.
[2023-03-18 09:55:03] [INFO ] Deduced a trap composed of 72 places in 6270 ms of which 1 ms to minimize.
[2023-03-18 09:55:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 188177 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 )
Interrupted Random walk after 348398 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 187374 steps, including 0 resets, run timeout after 30004 ms. (steps per millisecond=6 )
Interrupted Random walk after 343592 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 09:57:08] [INFO ] Flatten gal took : 3958 ms
[2023-03-18 09:57:08] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 3 ms.
[2023-03-18 09:57:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1399 places, 144369 transitions and 577414 arcs took 292 ms.
Total runtime 1060675 ms.
There are residual formulas that ITS could not solve within timeout
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 14962200 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15947144 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 ReachabilityDeadlock -timeout 180 -rebuildPNML
mcc2023

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="RERS17pb115-PT-9"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is RERS17pb115-PT-9, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r343-tall-167889215100131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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