fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853100354
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for NoC3x3-PT-2B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.730 3600000.00 3690736.00 1531.80 FFFF?FFFF?FFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853100354.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 itslola
Input is NoC3x3-PT-2B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853100354
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 3.8K Apr 8 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 8 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 7 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 6 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 03:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 6 03:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 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 548K 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 NoC3x3-PT-2B-00
FORMULA_NAME NoC3x3-PT-2B-01
FORMULA_NAME NoC3x3-PT-2B-02
FORMULA_NAME NoC3x3-PT-2B-03
FORMULA_NAME NoC3x3-PT-2B-04
FORMULA_NAME NoC3x3-PT-2B-05
FORMULA_NAME NoC3x3-PT-2B-06
FORMULA_NAME NoC3x3-PT-2B-07
FORMULA_NAME NoC3x3-PT-2B-08
FORMULA_NAME NoC3x3-PT-2B-09
FORMULA_NAME NoC3x3-PT-2B-10
FORMULA_NAME NoC3x3-PT-2B-11
FORMULA_NAME NoC3x3-PT-2B-12
FORMULA_NAME NoC3x3-PT-2B-13
FORMULA_NAME NoC3x3-PT-2B-14
FORMULA_NAME NoC3x3-PT-2B-15

=== Now, execution of the tool begins

BK_START 1591140870028

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:34:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 23:34:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:34:33] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2020-06-02 23:34:33] [INFO ] Transformed 2003 places.
[2020-06-02 23:34:33] [INFO ] Transformed 2292 transitions.
[2020-06-02 23:34:33] [INFO ] Found NUPN structural information;
[2020-06-02 23:34:33] [INFO ] Parsed PT model containing 2003 places and 2292 transitions in 261 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 159 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 164 resets, run finished after 616 ms. (steps per millisecond=162 ) properties seen :[1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0]
// Phase 1: matrix 2292 rows 2003 cols
[2020-06-02 23:34:34] [INFO ] Computed 66 place invariants in 85 ms
[2020-06-02 23:34:35] [INFO ] [Real]Absence check using 66 positive place invariants in 309 ms returned sat
[2020-06-02 23:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:34:44] [INFO ] [Real]Absence check using state equation in 9606 ms returned sat
[2020-06-02 23:34:47] [INFO ] Deduced a trap composed of 31 places in 2132 ms
[2020-06-02 23:34:48] [INFO ] Deduced a trap composed of 125 places in 1019 ms
[2020-06-02 23:34:49] [INFO ] Deduced a trap composed of 49 places in 870 ms
[2020-06-02 23:34:50] [INFO ] Deduced a trap composed of 28 places in 1316 ms
[2020-06-02 23:34:52] [INFO ] Deduced a trap composed of 46 places in 1413 ms
[2020-06-02 23:34:53] [INFO ] Deduced a trap composed of 117 places in 620 ms
[2020-06-02 23:34:53] [INFO ] Deduced a trap composed of 85 places in 544 ms
[2020-06-02 23:34:54] [INFO ] Deduced a trap composed of 125 places in 492 ms
[2020-06-02 23:34:54] [INFO ] Deduced a trap composed of 64 places in 500 ms
[2020-06-02 23:34:54] [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 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s474 s476 s477 s479 s480 s482 s483) 0)") while checking expression at index 0
[2020-06-02 23:34:55] [INFO ] [Real]Absence check using 66 positive place invariants in 143 ms returned sat
[2020-06-02 23:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:35:04] [INFO ] [Real]Absence check using state equation in 8763 ms returned sat
[2020-06-02 23:35:05] [INFO ] Deduced a trap composed of 51 places in 673 ms
[2020-06-02 23:35:06] [INFO ] Deduced a trap composed of 57 places in 609 ms
[2020-06-02 23:35:06] [INFO ] Deduced a trap composed of 60 places in 526 ms
[2020-06-02 23:35:07] [INFO ] Deduced a trap composed of 81 places in 434 ms
[2020-06-02 23:35:07] [INFO ] Deduced a trap composed of 87 places in 471 ms
[2020-06-02 23:35:08] [INFO ] Deduced a trap composed of 77 places in 460 ms
[2020-06-02 23:35:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3857 ms
[2020-06-02 23:35:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:35:09] [INFO ] [Nat]Absence check using 66 positive place invariants in 242 ms returned sat
[2020-06-02 23:35:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:35:17] [INFO ] [Nat]Absence check using state equation in 8119 ms returned sat
[2020-06-02 23:35:18] [INFO ] Deduced a trap composed of 108 places in 851 ms
[2020-06-02 23:35:18] [INFO ] Deduced a trap composed of 44 places in 768 ms
[2020-06-02 23:35:19] [INFO ] Deduced a trap composed of 71 places in 757 ms
[2020-06-02 23:35:20] [INFO ] Deduced a trap composed of 95 places in 701 ms
[2020-06-02 23:35:21] [INFO ] Deduced a trap composed of 61 places in 694 ms
[2020-06-02 23:35:22] [INFO ] Deduced a trap composed of 63 places in 591 ms
[2020-06-02 23:35:22] [INFO ] Deduced a trap composed of 80 places in 573 ms
[2020-06-02 23:35:23] [INFO ] Deduced a trap composed of 88 places in 561 ms
[2020-06-02 23:35:24] [INFO ] Deduced a trap composed of 77 places in 524 ms
[2020-06-02 23:35:24] [INFO ] Deduced a trap composed of 105 places in 514 ms
[2020-06-02 23:35:25] [INFO ] Deduced a trap composed of 81 places in 450 ms
[2020-06-02 23:35:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 8057 ms
[2020-06-02 23:35:25] [INFO ] Computed and/alt/rep : 2291/5656/2291 causal constraints in 154 ms.
[2020-06-02 23:35:28] [INFO ] Added : 105 causal constraints over 21 iterations in 3400 ms. Result :(error "Failed to check-sat")
[2020-06-02 23:35:29] [INFO ] [Real]Absence check using 66 positive place invariants in 139 ms returned sat
[2020-06-02 23:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:35:37] [INFO ] [Real]Absence check using state equation in 8495 ms returned sat
[2020-06-02 23:35:39] [INFO ] Deduced a trap composed of 55 places in 1443 ms
[2020-06-02 23:35:40] [INFO ] Deduced a trap composed of 27 places in 954 ms
[2020-06-02 23:35:41] [INFO ] Deduced a trap composed of 57 places in 886 ms
[2020-06-02 23:35:42] [INFO ] Deduced a trap composed of 144 places in 918 ms
[2020-06-02 23:35:43] [INFO ] Deduced a trap composed of 111 places in 730 ms
[2020-06-02 23:35:43] [INFO ] Deduced a trap composed of 63 places in 638 ms
[2020-06-02 23:35:44] [INFO ] Deduced a trap composed of 90 places in 566 ms
[2020-06-02 23:35:44] [INFO ] Deduced a trap composed of 99 places in 459 ms
[2020-06-02 23:35:45] [INFO ] Deduced a trap composed of 89 places in 460 ms
[2020-06-02 23:35:46] [INFO ] Deduced a trap composed of 77 places in 480 ms
[2020-06-02 23:35:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 8578 ms
[2020-06-02 23:35:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:35:46] [INFO ] [Nat]Absence check using 66 positive place invariants in 250 ms returned sat
[2020-06-02 23:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:35:54] [INFO ] [Nat]Absence check using state equation in 8099 ms returned sat
[2020-06-02 23:35:55] [INFO ] Deduced a trap composed of 72 places in 977 ms
[2020-06-02 23:35:57] [INFO ] Deduced a trap composed of 104 places in 1012 ms
[2020-06-02 23:35:58] [INFO ] Deduced a trap composed of 84 places in 1037 ms
[2020-06-02 23:35:59] [INFO ] Deduced a trap composed of 97 places in 912 ms
[2020-06-02 23:36:00] [INFO ] Deduced a trap composed of 77 places in 903 ms
[2020-06-02 23:36:01] [INFO ] Deduced a trap composed of 68 places in 866 ms
[2020-06-02 23:36:02] [INFO ] Deduced a trap composed of 64 places in 842 ms
[2020-06-02 23:36:02] [INFO ] Deduced a trap composed of 66 places in 769 ms
[2020-06-02 23:36:03] [INFO ] Deduced a trap composed of 99 places in 720 ms
[2020-06-02 23:36:04] [INFO ] Deduced a trap composed of 124 places in 633 ms
[2020-06-02 23:36:05] [INFO ] Deduced a trap composed of 74 places in 554 ms
[2020-06-02 23:36:05] [INFO ] Deduced a trap composed of 77 places in 459 ms
[2020-06-02 23:36:05] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 10837 ms
[2020-06-02 23:36:05] [INFO ] Computed and/alt/rep : 2291/5656/2291 causal constraints in 135 ms.
[2020-06-02 23:36:06] [INFO ] Added : 15 causal constraints over 3 iterations in 584 ms. Result :unknown
[2020-06-02 23:36:06] [INFO ] [Real]Absence check using 66 positive place invariants in 145 ms returned sat
[2020-06-02 23:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:36:07] [INFO ] [Real]Absence check using state equation in 979 ms returned unsat
[2020-06-02 23:36:08] [INFO ] [Real]Absence check using 66 positive place invariants in 161 ms returned sat
[2020-06-02 23:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:36:09] [INFO ] [Real]Absence check using state equation in 1361 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 5 simplifications.
[2020-06-02 23:36:10] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-02 23:36:10] [INFO ] Flatten gal took : 384 ms
FORMULA NoC3x3-PT-2B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:36:10] [INFO ] Applying decomposition
[2020-06-02 23:36:10] [INFO ] Flatten gal took : 167 ms
[2020-06-02 23:36:10] [INFO ] Decomposing Gal with order
[2020-06-02 23:36:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 23:36:11] [INFO ] Removed a total of 407 redundant transitions.
[2020-06-02 23:36:11] [INFO ] Flatten gal took : 309 ms
[2020-06-02 23:36:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 1458 labels/synchronizations in 146 ms.
[2020-06-02 23:36:11] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 10 ms.
[2020-06-02 23:36:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 33 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ NoC3x3-PT-2B @ 3570 seconds

FORMULA NoC3x3-PT-2B-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2B-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2B-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2B-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2B-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2B-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2B-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2B-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2B-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2B-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2B-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 10881888 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16138028 kB

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

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="NoC3x3-PT-2B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is NoC3x3-PT-2B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-csrt-158987853100354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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