fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r141-qhx2-152673582600062
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for QuasiCertifProtocol-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15739.440 6727.00 15358.00 301.90 T normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..............................
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 55K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is QuasiCertifProtocol-PT-02, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-qhx2-152673582600062
=====================================================================


--------------------
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 QuasiCertifProtocol-PT-02-ReachabilityDeadlock-0

=== Now, execution of the tool begins

BK_START 1527893308517

Flatten gal took : 142 ms
Constant places removed 11 places and 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 75 transition count 55
Performed 2 Post agglomeration using F-continuation condition.
Constant places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 73 transition count 53
Applied a total of 13 rules in 26 ms. Remains 73 /86 variables (removed 13) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 73 cols
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 53 rows 73 cols
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph7939302932788956898.txt, -o, /tmp/graph7939302932788956898.bin, -w, /tmp/graph7939302932788956898.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph7939302932788956898.bin, -l, -1, -v, -w, /tmp/graph7939302932788956898.weights, -q, 0, -e, 0.001], workingDir=null]
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityDeadlock.pnml.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityDeadlock.pnml.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
built 17 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1017,0.075395,5576,430,98,1347,155,248,1468,45,407,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,47,0.123562,7220,179,38,4321,912,650,13502,194,3049,5607

System contains 47 deadlocks (shown below if less than --print-limit option) !
FORMULA QuasiCertifProtocol-PT-02-ReachabilityDeadlock-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 47 states ] showing 10 first states
[ i6={[ u22={[ ]
} u17={[ ]
} u14={[ ]
} u10={[ ]
} u9={[ ]
} ]
} i5={[ u21={[ ]
} u20={[ ]
} u16={[ ]
} u8={[ ]
} ]
} i4={[ u19={[ ]
} u18={[ ]
} u15={[ ]
} u7={[ ]
} ]
} i3={[ u5={[ n7_0_2=1 n7_0_1=1 s5_0=1 n7_0_0=1 ]
} u3={[ ]
} u2={[ Cstart_2=1 ]
} ]
} i2={[ u12={[ ]
} u4={[ ]
} u1={[ Cstart_1=1 ]
} ]
} u0={[ ]
} i1={[ u13={[ Cstart_0=1 ]
} u11={[ ]
} u6={[ n7_1_2=1 s5_1=1 n7_1_1=1 n7_1_0=1 ]
} ]
} ]
[ i6={[ u22={[ ]
} u17={[ ]
} u14={[ ]
} u10={[ ]
} u9={[ ]
} ]
} i5={[ u21={[ ]
} u20={[ ]
} u16={[ ]
} u8={[ ]
} ]
} i4={[ u19={[ ]
} u18={[ ]
} u15={[ ]
} u7={[ ]
} ]
} i3={[ u5={[ n7_0_2=1 n7_0_1=1 s5_0=1 n7_0_0=1 ]
} u3={[ ]
} u2={[ Cstart_2=1 ]
} ]
} i2={[ u12={[ ]
} u4={[ s5_2=1 n7_2_2=1 n7_2_1=1 n7_2_0=1 ]
} u1={[ Cstart_1=1 ]
} ]
} u0={[ ]
} i1={[ u13={[ Cstart_0=1 ]
} u11={[ ]
} u6={[ ]
} ]
} ]
[ i6={[ u22={[ ]
} u17={[ ]
} u14={[ ]
} u10={[ ]
} u9={[ ]
} ]
} i5={[ u21={[ ]
} u20={[ ]
} u16={[ ]
} u8={[ ]
} ]
} i4={[ u19={[ ]
} u18={[ ]
} u15={[ ]
} u7={[ ]
} ]
} i3={[ u5={[ ]
} u3={[ ]
} u2={[ ]
} ]
} i2={[ u12={[ ]
} u4={[ ]
} u1={[ ]
} ]
} u0={[ malicious_reservoir=1 ]
} i1={[ u13={[ ]
} u11={[ ]
} u6={[ ]
} ]
} ]
[ i6={[ u22={[ ]
} u17={[ ]
} u14={[ ]
} u10={[ ]
} u9={[ ]
} ]
} i5={[ u21={[ ]
} u20={[ ]
} u16={[ ]
} u8={[ ]
} ]
} i4={[ u19={[ ]
} u18={[ ]
} u15={[ ]
} u7={[ ]
} ]
} i3={[ u5={[ ]
} u3={[ n9_0_0=1 ]
} u2={[ ]
} ]
} i2={[ u12={[ n9_2_0=1 ]
} u4={[ ]
} u1={[ ]
} ]
} u0={[ ]
} i1={[ u13={[ ]
} u11={[ n9_1_0=1 ]
} u6={[ ]
} ]
} ]
[ i6={[ u22={[ ]
} u17={[ ]
} u14={[ ]
} u10={[ ]
} u9={[ ]
} ]
} i5={[ u21={[ ]
} u20={[ ]
} u16={[ ]
} u8={[ ]
} ]
} i4={[ u19={[ ]
} u18={[ ]
} u15={[ ]
} u7={[ ]
} ]
} i3={[ u5={[ ]
} u3={[ n9_0_2=1 ]
} u2={[ ]
} ]
} i2={[ u12={[ n9_2_2=1 ]
} u4={[ ]
} u1={[ ]
} ]
} u0={[ ]
} i1={[ u13={[ ]
} u11={[ n9_1_2=1 ]
} u6={[ ]
} ]
} ]
[ i6={[ u22={[ ]
} u17={[ ]
} u14={[ ]
} u10={[ ]
} u9={[ ]
} ]
} i5={[ u21={[ ]
} u20={[ ]
} u16={[ ]
} u8={[ ]
} ]
} i4={[ u19={[ ]
} u18={[ ]
} u15={[ ]
} u7={[ ]
} ]
} i3={[ u5={[ ]
} u3={[ ]
} u2={[ Cstart_2=1 ]
} ]
} i2={[ u12={[ ]
} u4={[ s5_2=1 n7_2_2=1 n7_2_1=1 n7_2_0=1 ]
} u1={[ Cstart_1=1 ]
} ]
} u0={[ ]
} i1={[ u13={[ Cstart_0=1 ]
} u11={[ ]
} u6={[ n7_1_2=1 s5_1=1 n7_1_1=1 n7_1_0=1 ]
} ]
} ]
[ i6={[ u22={[ ]
} u17={[ ]
} u14={[ ]
} u10={[ ]
} u9={[ ]
} ]
} i5={[ u21={[ ]
} u20={[ ]
} u16={[ ]
} u8={[ ]
} ]
} i4={[ u19={[ ]
} u18={[ ]
} u15={[ ]
} u7={[ ]
} ]
} i3={[ u5={[ ]
} u3={[ n9_0_1=1 ]
} u2={[ ]
} ]
} i2={[ u12={[ n9_2_1=1 ]
} u4={[ ]
} u1={[ ]
} ]
} u0={[ ]
} i1={[ u13={[ ]
} u11={[ n9_1_1=1 ]
} u6={[ ]
} ]
} ]
[ i6={[ u22={[ ]
} u17={[ ]
} u14={[ ]
} u10={[ ]
} u9={[ ]
} ]
} i5={[ u21={[ ]
} u20={[ ]
} u16={[ ]
} u8={[ ]
} ]
} i4={[ u19={[ ]
} u18={[ ]
} u15={[ ]
} u7={[ ]
} ]
} i3={[ u5={[ ]
} u3={[ n9_0_2=1 n9_0_1=1 n9_0_0=1 ]
} u2={[ c1_2=1 ]
} ]
} i2={[ u12={[ n9_2_2=1 n9_2_1=1 n9_2_0=1 ]
} u4={[ ]
} u1={[ c1_1=1 ]
} ]
} u0={[ ]
} i1={[ u13={[ c1_0=1 ]
} u11={[ ]
[ n8_1_2=1 n8_1_1=1 n8_1_0=1 ]
} u6={[ ]
} ]
} ]
[ i6={[ u22={[ ]
} u17={[ ]
} u14={[ ]
} u10={[ ]
} u9={[ ]
} ]
} i5={[ u21={[ ]
} u20={[ ]
} u16={[ ]
} u8={[ ]
} ]
} i4={[ u19={[ ]
} u18={[ ]
} u15={[ ]
} u7={[ ]
} ]
} i3={[ u5={[ ]
} u3={[ n9_0_2=1 n9_0_1=1 n9_0_0=1 ]
} u2={[ c1_2=1 ]
} ]
} i2={[ u12={[ ]
} u4={[ ]
} u1={[ c1_1=1 ]
} ]
} u0={[ ]
} i1={[ u13={[ c1_0=1 ]
} u11={[ n9_1_2=1 n9_1_1=1 n9_1_0=1 ]
} u6={[ ]
} ]
} ]
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527893315244

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 01, 2018 10:48:32 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
Jun 01, 2018 10:48:32 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 10:48:32 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 104 ms
Jun 01, 2018 10:48:32 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 86 places.
Jun 01, 2018 10:48:32 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 56 transitions.
Jun 01, 2018 10:48:32 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 15 ms
Jun 01, 2018 10:48:32 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 135 ms
Jun 01, 2018 10:48:32 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.simple.gal : 13 ms
Jun 01, 2018 10:48:32 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 56 transitions.
Jun 01, 2018 10:48:33 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 01, 2018 10:48:33 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 30 ms
Jun 01, 2018 10:48:33 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 53 transitions.
Jun 01, 2018 10:48:33 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 105 ms
Jun 01, 2018 10:48:33 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 0 place invariants in 7 ms
Begin: Fri Jun 1 22:48:33 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Fri Jun 1 22:48:33 2018
network size: 73 nodes, 298 links, 46 weight
quality increased from -0.019258 to 0.472649
end computation: Fri Jun 1 22:48:33 2018
level 1:
start computation: Fri Jun 1 22:48:33 2018
network size: 23 nodes, 154 links, 46 weight
quality increased from 0.472649 to 0.629962
end computation: Fri Jun 1 22:48:33 2018
level 2:
start computation: Fri Jun 1 22:48:33 2018
network size: 7 nodes, 24 links, 46 weight
quality increased from 0.629962 to 0.629962
end computation: Fri Jun 1 22:48:33 2018
End: Fri Jun 1 22:48:33 2018
Total duration: 0 sec
0.629962
Jun 01, 2018 10:48:33 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 01, 2018 10:48:33 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 39 ms
Jun 01, 2018 10:48:33 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 01, 2018 10:48:33 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 35 redundant transitions.
Jun 01, 2018 10:48:33 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 5 ms
Jun 01, 2018 10:48:34 PM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:318)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 01, 2018 10:48:34 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 816ms conformant to PINS in folder :/home/mcc/execution

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="QuasiCertifProtocol-PT-02"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstoolsl"
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

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is QuasiCertifProtocol-PT-02, 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 r141-qhx2-152673582600062"
echo "====================================================================="
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
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 ;