About the Execution of ITS-LoLa for SafeBus-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15728.570 | 1800000.00 | 232943.00 | 143.90 | F | 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.r187-oct2-158987942400251.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 itslola
Input is SafeBus-PT-06, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r187-oct2-158987942400251
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 9.6K Apr 12 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 12 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 13:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 13:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 10 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 10 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 9 23:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 9 23:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 448K Mar 24 05:38 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 1591284502442
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:28:24] [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, -timeout, 1800, -rebuildPNML]
[2020-06-04 15:28:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:28:24] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2020-06-04 15:28:24] [INFO ] Transformed 144 places.
[2020-06-04 15:28:24] [INFO ] Transformed 451 transitions.
[2020-06-04 15:28:24] [INFO ] Parsed PT model containing 144 places and 451 transitions in 177 ms.
Reduce places removed 6 places and 0 transitions.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 25 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 3 ms.19071KB memory used
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 72 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 24 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2020-06-04 15:28:24] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2020-06-04 15:28:24] [INFO ] Computed 29 place invariants in 9 ms
[2020-06-04 15:28:25] [INFO ] Implicit Places using invariants in 442 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 467 ms to find 6 implicit places.
[2020-06-04 15:28:25] [INFO ] Redundant transitions in 34 ms returned []
[2020-06-04 15:28:25] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 132 cols
[2020-06-04 15:28:25] [INFO ] Computed 23 place invariants in 3 ms
[2020-06-04 15:28:26] [INFO ] Dead Transitions using invariants and state equation in 1557 ms returned [31, 38, 45, 52, 59, 66, 67, 74, 81, 88, 95, 102, 103, 110, 117, 124, 131, 138, 139, 146, 153, 160, 167, 174, 175, 182, 189, 196, 203, 210, 211, 218, 225, 232, 239, 246]
Found 36 dead transitions using SMT.
Drop transitions removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions :[246, 239, 232, 225, 218, 211, 210, 203, 196, 189, 182, 175, 174, 167, 160, 153, 146, 139, 138, 131, 124, 117, 110, 103, 102, 95, 88, 81, 74, 67, 66, 59, 52, 45, 38, 31]
Starting structural reductions, iteration 1 : 132/138 places, 415/451 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 62 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2020-06-04 15:28:26] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2020-06-04 15:28:26] [INFO ] Computed 23 place invariants in 4 ms
[2020-06-04 15:28:27] [INFO ] Implicit Places using invariants in 340 ms returned []
[2020-06-04 15:28:27] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2020-06-04 15:28:27] [INFO ] Computed 23 place invariants in 24 ms
[2020-06-04 15:28:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2020-06-04 15:28:29] [INFO ] Implicit Places using invariants and state equation in 2353 ms returned []
Implicit Place search using SMT with State Equation took 2696 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 120/138 places, 523/451 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3229 ms (no deadlock found). (steps per millisecond=387 )
Random directed walk for 1250004 steps, including 0 resets, run took 2593 ms (no deadlock found). (steps per millisecond=482 )
[2020-06-04 15:28:35] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2020-06-04 15:28:35] [INFO ] Computed 23 place invariants in 3 ms
[2020-06-04 15:28:36] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2020-06-04 15:28:36] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 80 ms returned sat
[2020-06-04 15:28:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:28:36] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2020-06-04 15:28:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:28:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-04 15:28:37] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 17 ms returned sat
[2020-06-04 15:28:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:28:37] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2020-06-04 15:28:37] [INFO ] State equation strengthened by 43 read => feed constraints.
[2020-06-04 15:28:37] [INFO ] [Nat]Added 43 Read/Feed constraints in 102 ms returned sat
[2020-06-04 15:28:37] [INFO ] Deduced a trap composed of 31 places in 231 ms
[2020-06-04 15:28:37] [INFO ] Deduced a trap composed of 27 places in 52 ms
[2020-06-04 15:28:38] [INFO ] Deduced a trap composed of 23 places in 186 ms
[2020-06-04 15:28:38] [INFO ] Deduced a trap composed of 19 places in 122 ms
[2020-06-04 15:28:38] [INFO ] Deduced a trap composed of 19 places in 94 ms
[2020-06-04 15:28:39] [INFO ] Deduced a trap composed of 23 places in 675 ms
[2020-06-04 15:28:39] [INFO ] Deduced a trap composed of 19 places in 739 ms
[2020-06-04 15:28:40] [INFO ] Deduced a trap composed of 23 places in 667 ms
[2020-06-04 15:28:40] [INFO ] Deduced a trap composed of 23 places in 82 ms
[2020-06-04 15:28:40] [INFO ] Deduced a trap composed of 19 places in 170 ms
[2020-06-04 15:28:41] [INFO ] Deduced a trap composed of 31 places in 559 ms
[2020-06-04 15:28:41] [INFO ] Deduced a trap composed of 23 places in 86 ms
[2020-06-04 15:28:41] [INFO ] Deduced a trap composed of 27 places in 55 ms
[2020-06-04 15:28:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4175 ms
[2020-06-04 15:28:41] [INFO ] Computed and/alt/rep : 517/19494/344 causal constraints in 38 ms.
[2020-06-04 15:28:56] [INFO ] Added : 185 causal constraints over 37 iterations in 14950 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 253 ms.
Parikh directed walk for 110400 steps, including 1000 resets, run took 415 ms. (steps per millisecond=266 )
Random directed walk for 500003 steps, including 0 resets, run took 1058 ms (no deadlock found). (steps per millisecond=472 )
Random walk for 500000 steps, including 0 resets, run took 1222 ms (no deadlock found). (steps per millisecond=409 )
Random directed walk for 500000 steps, including 0 resets, run took 1014 ms (no deadlock found). (steps per millisecond=493 )
Random walk for 500000 steps, including 0 resets, run took 1189 ms (no deadlock found). (steps per millisecond=420 )
[2020-06-04 15:29:02] [INFO ] Flatten gal took : 165 ms
[2020-06-04 15:29:02] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2020-06-04 15:29:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 1800 - MCC
vrfy: Checking ReachabilityDeadlock @ SafeBus-PT-06 @ 1770 seconds
FORMULA ReachabilityDeadlock FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1682
rslt: Output for ReachabilityDeadlock @ SafeBus-PT-06
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityDeadlock.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=combined",
"--siphontrap=par",
"--siphondepth=10",
"--findpath=par",
"--retrylimit=0",
"--depthlimit=1000000",
"--symmetry",
"--symmtimelimit=300",
"--threads=2",
"--symmetrydepth=1073741824",
"--timelimit=1770",
"--json=ReachabilityDeadlock.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 15:29:02 2020
",
"timelimit": 1770
},
"child": null,
"exit":
{
"error": null,
"memory": 144880,
"runtime": 88.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityDeadlock.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 1,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "E (F (DEADLOCK))",
"processed_size": 16,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 2908,
"conflict_clusters": 7,
"places": 138,
"places_significant": 109,
"singleton_clusters": 0,
"transitions": 451
},
"result":
{
"edges": 7783594,
"markings": 2261393,
"produced_by": "state space",
"value": false
},
"task":
{
"findpath":
{
"depthlimit": 1000000,
"retrylimit": null,
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 2
},
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"symmetry":
{
"card": 720.000000,
"composed": 19,
"dead_branches": 0,
"generators": 27,
"interrupted": false,
"real_computed": 8,
"timelimit": 300
},
"threads": 2,
"type": "dfs"
},
"type": "reachability",
"workflow": "findpath||search"
}
}
lola: LoLA will run for 1770 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 589/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4416
lola: finding significant places
lola: 138 places, 451 transitions, 109 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityDeadlock.xml
lola: E (F (DEADLOCK))
lola: checking reachability
lola: Planning: workflow for reachability check: findpath||search (--findpath=par)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (DEADLOCK))
lola: processed formula length: 16
lola: 1 rewrites
lola: closed formula file ReachabilityDeadlock.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: SEARCH (findpath)
lola: findpath: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: findpath: starting randomized, memory-less exploration (--findpath)
lola: findpath: searching for paths with maximal depth 1000000 (--depthlimit)
lola: findpath: no retry limit given (--retrylimit)
lola: findpath: transitions are chosen hash-driven
lola: computing symmetries (--symmetry)
lola: time limit for symmetry computation of 300 seconds given (--symmtimelimit)
lola: computed 27 generators (8 in search tree, 19 by composition)
lola: representing 720 symmetries
lola: 0 dead branches visited in search tree
lola: 1 tries, 227658 fired transitions, 0 secs || 174174 markings, 270181 edges, 34835 markings/sec, 0 secs
lola: 1 tries, 476808 fired transitions, 5 secs || 342149 markings, 588122 edges, 33595 markings/sec, 5 secs
lola: 1 tries, 732557 fired transitions, 10 secs || 506282 markings, 935073 edges, 32827 markings/sec, 10 secs
lola: 2 tries, 1000540 fired transitions, 15 secs || 648905 markings, 1269322 edges, 28525 markings/sec, 15 secs
lola: 2 tries, 1294986 fired transitions, 20 secs || 781322 markings, 1620599 edges, 26483 markings/sec, 20 secs
lola: 2 tries, 1605533 fired transitions, 25 secs || 911276 markings, 1999323 edges, 25991 markings/sec, 25 secs
lola: 2 tries, 1920479 fired transitions, 30 secs || 1037604 markings, 2399033 edges, 25266 markings/sec, 30 secs
lola: 3 tries, 2207664 fired transitions, 35 secs || 1171483 markings, 2800904 edges, 26776 markings/sec, 35 secs
lola: 3 tries, 2507788 fired transitions, 40 secs || 1290563 markings, 3237207 edges, 23816 markings/sec, 40 secs
lola: 3 tries, 2806932 fired transitions, 45 secs || 1417213 markings, 3718537 edges, 25330 markings/sec, 45 secs
lola: 4 tries, 3113330 fired transitions, 50 secs || 1550623 markings, 4211540 edges, 26682 markings/sec, 50 secs
lola: 4 tries, 3443924 fired transitions, 55 secs || 1675662 markings, 4785073 edges, 25008 markings/sec, 55 secs
lola: 4 tries, 3761266 fired transitions, 60 secs || 1815325 markings, 5332798 edges, 27933 markings/sec, 60 secs
lola: 5 tries, 4065223 fired transitions, 65 secs || 1961937 markings, 5852122 edges, 29322 markings/sec, 65 secs
lola: 5 tries, 4357609 fired transitions, 70 secs || 2113477 markings, 6273921 edges, 30308 markings/sec, 70 secs
lola: 5 tries, 4661322 fired transitions, 75 secs || 2221891 markings, 6959961 edges, 21683 markings/sec, 75 secs
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2261393 markings, 7783594 edges
lola: memory consumption: 144880 KB
lola: time consumption: 88 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityDeadlock.json
lola: closed JSON file ReachabilityDeadlock.json
rslt: finished
--------------------
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="SafeBus-PT-06"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 SafeBus-PT-06, 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 r187-oct2-158987942400251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-06.tgz
mv SafeBus-PT-06 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 '
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 ;