Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r506-tall-171649622300031.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is JoinFreeModules-PT-0100, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r506-tall-171649622300031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 14:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 11 14:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 14:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 14:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 304K May 18 16:42 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 1717217946230

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=JoinFreeModules-PT-0100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:59:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 04:59:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:59:07] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-06-01 04:59:07] [INFO ] Transformed 501 places.
[2024-06-01 04:59:07] [INFO ] Transformed 801 transitions.
[2024-06-01 04:59:07] [INFO ] Parsed PT model containing 501 places and 801 transitions and 2302 arcs in 208 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 1 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.15320KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 500/500 places, 801/801 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 118 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
// Phase 1: matrix 801 rows 500 cols
[2024-06-01 04:59:07] [INFO ] Computed 100 invariants in 28 ms
[2024-06-01 04:59:07] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20272ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20305ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 20470 ms. Remains : 500/500 places, 801/801 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 500/500 places, 801/801 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 29 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2024-06-01 04:59:28] [INFO ] Invariant cache hit.
[2024-06-01 04:59:28] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 04:59:28] [INFO ] Invariant cache hit.
[2024-06-01 04:59:28] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 04:59:28] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-06-01 04:59:28] [INFO ] Redundant transitions in 39 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 04:59:28] [INFO ] Invariant cache hit.
[2024-06-01 04:59:28] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:00:12] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 7 ms to minimize.
[2024-06-01 05:00:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:00:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 7 ms to minimize.
[2024-06-01 05:00:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
[2024-06-01 05:00:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
[2024-06-01 05:00:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:00:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:00:28] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:00:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:00:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 1)
(s2 100)
(s3 0)
(s4 0)
(s5 102)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 2)
(s11 1)
(s12 96)
(s13 2)
(s14 2)
(s15 10)
(s16 83)
(s17 0)
(s18 0)
(s19 10)
(s20 2)
(s21 1)
(s22 100)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 100)
(s28 2)
(s29 1)
(s30 4)
(s31 90)
(s32 0)
(s33 1)
(s34 8)
(s35 2)
(s36 1)
(s37 100)
(s38 0)
(s39 0)
(s40 3)
(s41 0)
(s42 100)
(s43 0)
(s44 0)
(s45 102)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 2)
(s51 101)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 100)
(s57 0)
(s58 3)
(s59 0)
(s60 2)
(s61 101)
(s62 0)
(s63 0)
(s64 0)
(s65 4)
(s66 0)
(s67 99)
(s68 0)
(s69 0)
(s70 2)
(s71 101)
(s72 0)
(s73 0)
(s74 0)
(s75 2)
(s76 1)
(s77 100)
(s78 0)
(s79 0)
(s80 2)
(s81 101)
(s82 0)
(s83 0)
(s84 0)
(s85 2)
(s86 1)
(s87 0)
(s88 50)
(s89 50)
(s90 2)
(s91 79)
(s92 1)
(s93 1)
(s94 20)
(s95 2)
(s96 1)
(s97 0)
(s98 50)
(s99 50)
(s100 2)
(s101 1)
(s102 100)
(s103 0)
(s104 0)
(s105 2)
(s106 2)
(s107 99)
(s108 0)
(s109 0)
(s110 2)
(s111 101)
(s112 0)
(s113 0)
(s114 0)
(s115 2)
(s116 85)
(s117 0)
(s118 0)
(s119 16)
(s120 8)
(s121 1)
(s122 0)
(s123 0)
(s124 94)
(s125 3)
(s126 0)
(s127 100)
(s128 0)
(s129 0)
(s130 2)
(s131 101)
(s132 0)
(s133 0)
(s134 0)
(s135 5)
(s136 97)
(s137 0)
(s138 0)
(s139 1)
(s140 102)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 2)
(s146 1)
(s147 100)
(s148 0)
(s149 0)
(s150 2)
(s151 101)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 103)
(s160 2)
(s161 101)
(s162 0)
(s163 0)
(s164 0)
(s165 2)
(s166 100)
(s167 1)
(s168 0)
(s169 0)
(s170 3)
(s171 0)
(s172 82)
(s173 2)
(s174 16)
(s175 0)
(s176 0)
(s177 97)
(s178 2)
(s179 4)
(s180 1)
(s181 0)
(s182 0)
(s183 102)
(s184 0)
(s185 2)
(s186 2)
(s187 99)
(s188 0)
(s189 0)
(s190 4)
(s191 29)
(s192 0)
(s193 0)
(s194 70)
(s195 5)
(s196 1)
(s197 0)
(s198 97)
(s199 0)
(s200 4)
(s201 2)
(s202 84)
(s203 9)
(s204 4)
(s205 1)
(s206 102)
(s207 0)
(s208 0)
(s209 0)
(s210 2)
(s211 1)
(s212 100)
(s213 0)
(s214 0)
(s215 5)
(s216 0)
(s217 93)
(s218 5)
(s219 0)
(s220 1)
(s221 0)
(s222 102)
(s223 0)
(s224 0)
(s225 4)
(s226 98)
(s227 1)
(s228 0)
(s229 0)
(s230 4)
(s231 2)
(s232 96)
(s233 1)
(s234 0)
(s235 1)
(s236 0)
(s237 102)
(s238 0)
(s239 0)
(s240 2)
(s241 101)
(s242 0)
(s243 0)
(s244 0)
(s245 3)
(s246 0)
(s247 100)
(s248 0)
(s249 0)
(s250 2)
(s251 100)
(s252 1)
(s253 0)
(s254 0)
(s255 2)
(s256 4)
(s257 1)
(s258 0)
(s259 96)
(s260 2)
(s261 0)
(s262 1)
(s263 2)
(s264 98)
(s265 5)
(s266 0)
(s267 93)
(s268 5)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 98)
(s274 4)
(s275 2)
(s276 101)
(s277 0)
(s278 0)
(s279 0)
(s280 3)
(s281 0)
(s282 100)
(s283 0)
(s284 0)
(s285 1)
(s286 0)
(s287 102)
(s288 0)
(s289 0)
(s290 64)
(s291 0)
(s292 39)
(s293 0)
(s294 0)
(s295 3)
(s296 0)
(s297 100)
(s298 0)
(s299 0)
(s300 2)
(s301 0)
(s302 96)
(s303 5)
(s304 0)
(s305 2)
(s306 1)
(s307 100)
(s308 0)
(s309 0)
(s310 5)
(s311 1)
(s312 88)
(s313 3)
(s314 6)
(s315 2)
(s316 97)
(s317 0)
(s318 2)
(s319 2)
(s320 3)
(s321 0)
(s322 100)
(s323 0)
(s324 0)
(s325 2)
(s326 1)
(s327 94)
(s328 3)
(s329 3)
(s330 0)
(s331 0)
(s332 100)
(s333 3)
(s334 0)
(s335 2)
(s336 100)
(s337 1)
(s338 0)
(s339 0)
(s340 2)
(s341 1)
(s342 94)
(s343 3)
(s344 3)
(s345 1)
(s346 2)
(s347 100)
(s348 0)
(s349 0)
(s350 2)
(s351 1)
(s352 100)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 95)
(s358 4)
(s359 4)
(s360 3)
(s361 2)
(s362 90)
(s363 4)
(s364 4)
(s365 7)
(s366 2)
(s367 2)
(s368 3)
(s369 89)
(s370 1)
(s371 0)
(s372 102)
(s373 0)
(s374 0)
(s375 2)
(s376 1)
(s377 100)
(s378 0)
(s379 0)
(s380 2)
(s381 1)
(s382 0)
(s383 2)
(s384 98)
(s385 2)
(s386 88)
(s387 13)
(s388 0)
(s389 0)
(s390 1)
(s391 2)
(s392 100)
(s393 0)
(s394 0)
(s395 4)
(s396 0)
(s397 99)
(s398 0)
(s399 0)
(s400 1)
(s401 0)
(s402 102)
(s403 0)
(s404 0)
(s405 2)
(s406 1)
(s407 100)
(s408 0)
(s409 0)
(s410 2)
(s411 101)
(s412 0)
(s413 0)
(s414 0)
(s415 1)
(s416 2)
(s417 4)
(s418 0)
(s419 96)
(s420 2)
(s421 101)
(s422 0)
(s423 0)
(s424 0)
(s425 2)
(s426 1)
(s427 100)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 2)
(s434 101)
(s435 3)
(s436 0)
(s437 100)
(s438 0)
(s439 0)
(s440 2)
(s441 101)
(s442 0)
(s443 0)
(s444 0)
(s445 2)
(s446 4)
(s447 97)
(s448 0)
(s449 0)
(s450 3)
(s451 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1310 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 10/10 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 60585 ms. Remains : 500/500 places, 801/801 transitions.
Random walk for 1250001 steps, including 0 resets, run took 10211 ms (no deadlock found). (steps per millisecond=122 )
Random directed walk for 1250104 steps, including 0 resets, run took 22217 ms (no deadlock found). (steps per millisecond=56 )
[2024-06-01 05:01:01] [INFO ] Invariant cache hit.
[2024-06-01 05:01:01] [INFO ] [Real]Absence check using 100 positive place invariants in 2 ms returned unsat
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 113995 ms.
ITS solved all properties within timeout

BK_STOP 1717218061456

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0100"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is JoinFreeModules-PT-0100, 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 r506-tall-171649622300031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0100.tgz
mv JoinFreeModules-PT-0100 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 ;