fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r056-tall-174854042400533
Last Updated
June 24, 2025

About the Execution of 2024-gold for DatabaseWithMutex-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15683.540 21576.00 39919.00 163.10 F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r056-tall-174854042400533.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is DatabaseWithMutex-PT-20, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-tall-174854042400533
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 380K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.6M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 340K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 148K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 462K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 198K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 721K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 766K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.2M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 754K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.6M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 38K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.7M May 29 14:32 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 StableMarking

=== Now, execution of the tool begins

BK_START 1748649822128

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DatabaseWithMutex-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 00:03:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 00:03:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:03:43] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2025-05-31 00:03:43] [INFO ] Transformed 3260 places.
[2025-05-31 00:03:43] [INFO ] Transformed 3200 transitions.
[2025-05-31 00:03:43] [INFO ] Found NUPN structural information;
[2025-05-31 00:03:43] [INFO ] Parsed PT model containing 3260 places and 3200 transitions and 23200 arcs in 422 ms.
Structural test allowed to assert that 420 places are NOT stable. Took 29 ms.
RANDOM walk for 40000 steps (8 resets) in 4449 ms. (8 steps per ms) remains 207/2840 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 19 ms. (20 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 14 ms. (26 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 14 ms. (26 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 16 ms. (23 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 15 ms. (25 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 14 ms. (26 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 14 ms. (26 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 12 ms. (31 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 12 ms. (31 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 12 ms. (31 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 16 ms. (23 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 207/207 properties
// Phase 1: matrix 3200 rows 3260 cols
[2025-05-31 00:03:45] [INFO ] Computed 460 invariants in 149 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 721/928 variables, 58/265 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/928 variables, 721/986 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/928 variables, 1/987 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 928/6460 variables, and 987 constraints, problems are : Problem set: 0 solved, 207 unsolved in 5048 ms.
Refiners :[Domain max(s): 928/3260 constraints, Positive P Invariants (semi-flows): 58/78 constraints, Generalized P Invariants (flows): 1/382 constraints, State Equation: 0/3260 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 721/928 variables, 58/265 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/928 variables, 721/986 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/928 variables, 1/987 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 00:03:52] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 15 ms to minimize.
[2025-05-31 00:03:52] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2025-05-31 00:03:52] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2025-05-31 00:03:52] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2025-05-31 00:03:52] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2025-05-31 00:03:52] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2025-05-31 00:03:53] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2025-05-31 00:03:53] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2025-05-31 00:03:53] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2025-05-31 00:03:53] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2025-05-31 00:03:53] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2025-05-31 00:03:53] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2025-05-31 00:03:54] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2025-05-31 00:03:54] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2025-05-31 00:03:55] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2025-05-31 00:03:55] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2025-05-31 00:03:55] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2025-05-31 00:03:55] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2025-05-31 00:03:55] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2025-05-31 00:03:55] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/928 variables, 20/1007 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 00:03:55] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2025-05-31 00:03:55] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 928/6460 variables, and 1009 constraints, problems are : Problem set: 0 solved, 207 unsolved in 5026 ms.
Refiners :[Domain max(s): 928/3260 constraints, Positive P Invariants (semi-flows): 58/78 constraints, Generalized P Invariants (flows): 1/382 constraints, State Equation: 0/3260 constraints, PredecessorRefiner: 0/207 constraints, Known Traps: 22/22 constraints]
After SMT, in 10502ms problems are : Problem set: 0 solved, 207 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 207 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 3260 transition count 2504
Reduce places removed 716 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 800 transitions
Trivial Post-agglo rules discarded 800 transitions
Performed 800 trivial Post agglomeration. Transition count delta: 800
Iterating post reduction 1 with 1516 rules applied. Total rules applied 2212 place count 2544 transition count 1704
Reduce places removed 800 places and 0 transitions.
Iterating post reduction 2 with 800 rules applied. Total rules applied 3012 place count 1744 transition count 1704
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 3012 place count 1744 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 3812 place count 1344 transition count 1304
Free-agglomeration rule applied 400 times.
Iterating global reduction 3 with 400 rules applied. Total rules applied 4212 place count 1344 transition count 904
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 3 with 400 rules applied. Total rules applied 4612 place count 944 transition count 904
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4613 place count 944 transition count 903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4614 place count 943 transition count 903
Applied a total of 4614 rules in 6962 ms. Remains 943 /3260 variables (removed 2317) and now considering 903/3200 (removed 2297) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6973 ms. Remains : 943/3260 places, 903/3200 transitions.
RANDOM walk for 17903 steps (0 resets) in 1975 ms. (9 steps per ms) remains 0/207 properties
Able to resolve query StableMarking after proving 2841 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 20216 ms.
ITS solved all properties within timeout

BK_STOP 1748649843704

--------------------
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 StableMarking -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="DatabaseWithMutex-PT-20"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is DatabaseWithMutex-PT-20, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r056-tall-174854042400533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-20.tgz
mv DatabaseWithMutex-PT-20 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;