fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699100471
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BusinessProcesses-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.050 22504.00 42912.00 90.90 FFFFTTFTFFTFTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699100471.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 63K Mar 24 05:37 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 BusinessProcesses-PT-03-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589250435134

[2020-05-12 02:27:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:27:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:27:18] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2020-05-12 02:27:18] [INFO ] Transformed 274 places.
[2020-05-12 02:27:18] [INFO ] Transformed 237 transitions.
[2020-05-12 02:27:18] [INFO ] Found NUPN structural information;
[2020-05-12 02:27:18] [INFO ] Parsed PT model containing 274 places and 237 transitions in 160 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 120 resets, run finished after 83 ms. (steps per millisecond=120 ) properties seen :[0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1]
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 236 rows 273 cols
[2020-05-12 02:27:18] [INFO ] Computed 43 place invariants in 32 ms
[2020-05-12 02:27:18] [INFO ] [Real]Absence check using 31 positive place invariants in 75 ms returned sat
[2020-05-12 02:27:18] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 55 ms returned sat
[2020-05-12 02:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:27:19] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2020-05-12 02:27:20] [INFO ] Deduced a trap composed of 14 places in 1048 ms
[2020-05-12 02:27:21] [INFO ] Deduced a trap composed of 23 places in 707 ms
[2020-05-12 02:27:21] [INFO ] Deduced a trap composed of 8 places in 189 ms
[2020-05-12 02:27:21] [INFO ] Deduced a trap composed of 11 places in 126 ms
[2020-05-12 02:27:21] [INFO ] Deduced a trap composed of 16 places in 106 ms
[2020-05-12 02:27:21] [INFO ] Deduced a trap composed of 34 places in 95 ms
[2020-05-12 02:27:21] [INFO ] Deduced a trap composed of 42 places in 64 ms
[2020-05-12 02:27:22] [INFO ] Deduced a trap composed of 14 places in 137 ms
[2020-05-12 02:27:22] [INFO ] Deduced a trap composed of 24 places in 117 ms
[2020-05-12 02:27:23] [INFO ] Deduced a trap composed of 20 places in 1591 ms
[2020-05-12 02:27:23] [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 closed (> (+ s0 s1 s43 s46 s47 s48 s49 s102 s103 s104 s105 s106 s107 s108 s158 s159 s160 s162 s165 s166) 0)") while checking expression at index 0
[2020-05-12 02:27:23] [INFO ] [Real]Absence check using 31 positive place invariants in 39 ms returned unsat
[2020-05-12 02:27:23] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2020-05-12 02:27:23] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2020-05-12 02:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:27:24] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2020-05-12 02:27:24] [INFO ] Deduced a trap composed of 8 places in 60 ms
[2020-05-12 02:27:24] [INFO ] Deduced a trap composed of 13 places in 70 ms
[2020-05-12 02:27:24] [INFO ] Deduced a trap composed of 21 places in 49 ms
[2020-05-12 02:27:24] [INFO ] Deduced a trap composed of 15 places in 136 ms
[2020-05-12 02:27:24] [INFO ] Deduced a trap composed of 34 places in 72 ms
[2020-05-12 02:27:25] [INFO ] Deduced a trap composed of 23 places in 1009 ms
[2020-05-12 02:27:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1471 ms
[2020-05-12 02:27:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:27:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 64 ms returned sat
[2020-05-12 02:27:25] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2020-05-12 02:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:27:26] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2020-05-12 02:27:28] [INFO ] Deduced a trap composed of 15 places in 1815 ms
[2020-05-12 02:27:28] [INFO ] Deduced a trap composed of 12 places in 318 ms
[2020-05-12 02:27:28] [INFO ] Deduced a trap composed of 22 places in 285 ms
[2020-05-12 02:27:28] [INFO ] Deduced a trap composed of 26 places in 64 ms
[2020-05-12 02:27:28] [INFO ] Deduced a trap composed of 19 places in 63 ms
[2020-05-12 02:27:29] [INFO ] Deduced a trap composed of 8 places in 394 ms
[2020-05-12 02:27:29] [INFO ] Deduced a trap composed of 21 places in 62 ms
[2020-05-12 02:27:29] [INFO ] Deduced a trap composed of 27 places in 49 ms
[2020-05-12 02:27:29] [INFO ] Deduced a trap composed of 33 places in 40 ms
[2020-05-12 02:27:29] [INFO ] Deduced a trap composed of 26 places in 85 ms
[2020-05-12 02:27:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3382 ms
[2020-05-12 02:27:29] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 9 ms.
[2020-05-12 02:27:30] [INFO ] Added : 147 causal constraints over 30 iterations in 770 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-05-12 02:27:30] [INFO ] [Real]Absence check using 31 positive place invariants in 29 ms returned sat
[2020-05-12 02:27:30] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-05-12 02:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:27:30] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2020-05-12 02:27:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:27:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 63 ms returned sat
[2020-05-12 02:27:30] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 46 ms returned sat
[2020-05-12 02:27:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:27:31] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2020-05-12 02:27:31] [INFO ] Deduced a trap composed of 13 places in 30 ms
[2020-05-12 02:27:31] [INFO ] Deduced a trap composed of 15 places in 203 ms
[2020-05-12 02:27:31] [INFO ] Deduced a trap composed of 8 places in 98 ms
[2020-05-12 02:27:31] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2020-05-12 02:27:31] [INFO ] Deduced a trap composed of 27 places in 103 ms
[2020-05-12 02:27:31] [INFO ] Deduced a trap composed of 12 places in 74 ms
[2020-05-12 02:27:31] [INFO ] Deduced a trap composed of 15 places in 47 ms
[2020-05-12 02:27:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 797 ms
[2020-05-12 02:27:32] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2020-05-12 02:27:32] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2020-05-12 02:27:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:27:32] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2020-05-12 02:27:33] [INFO ] Deduced a trap composed of 19 places in 404 ms
[2020-05-12 02:27:33] [INFO ] Deduced a trap composed of 15 places in 189 ms
[2020-05-12 02:27:33] [INFO ] Deduced a trap composed of 18 places in 162 ms
[2020-05-12 02:27:35] [INFO ] Deduced a trap composed of 66 places in 1803 ms
[2020-05-12 02:27:35] [INFO ] Deduced a trap composed of 11 places in 80 ms
[2020-05-12 02:27:35] [INFO ] Deduced a trap composed of 8 places in 69 ms
[2020-05-12 02:27:35] [INFO ] Deduced a trap composed of 39 places in 115 ms
[2020-05-12 02:27:35] [INFO ] Deduced a trap composed of 33 places in 157 ms
[2020-05-12 02:27:35] [INFO ] Deduced a trap composed of 33 places in 66 ms
[2020-05-12 02:27:35] [INFO ] Deduced a trap composed of 45 places in 67 ms
[2020-05-12 02:27:35] [INFO ] Deduced a trap composed of 16 places in 82 ms
[2020-05-12 02:27:36] [INFO ] Deduced a trap composed of 35 places in 67 ms
[2020-05-12 02:27:36] [INFO ] Deduced a trap composed of 26 places in 94 ms
[2020-05-12 02:27:36] [INFO ] Deduced a trap composed of 31 places in 65 ms
[2020-05-12 02:27:36] [INFO ] Deduced a trap composed of 42 places in 86 ms
[2020-05-12 02:27:36] [INFO ] Deduced a trap composed of 27 places in 68 ms
[2020-05-12 02:27:37] [INFO ] Deduced a trap composed of 23 places in 748 ms
[2020-05-12 02:27:37] [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 closed (> (+ s0 s1 s2 s3 s4 s5 s6 s31 s32 s35 s76 s143 s144 s145 s154 s173 s174 s175 s179 s242 s243 s260 s261) 0)") while checking expression at index 4
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Finished Parikh walk after 142 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=71 )
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589250457638

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="BusinessProcesses-PT-03"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-03, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699100471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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