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 21M
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 232K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 724K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 20M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PolyORBLF-PT-S06J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-smll-152673528600254
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1526852017611


BK_STOP 1526852245017

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-PT-S06J06T08 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'UpperBounds', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 3539240, 'Memory': 824.99, 'Tool': 'lola'}, {'Time': 3539706, 'Memory': 822, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
UpperBounds lola PolyORBLF-PT-S06J06T08...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PolyORBLF-PT-S06J06T08: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S06J06T08: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
UpperBounds @ PolyORBLF-PT-S06J06T08 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 15228/65536 symbol table entries, 9133 collisions
lola: preprocessing...
lola: finding significant places
lola: 894 places, 14334 transitions, 832 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4215 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J06T08-UpperBounds.task
lola: MAX(Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Insert_Source_B_4_1 + Insert_Source_B_4_2 + Insert_Source_B_4_3 + Insert_Source_B_4_4 + Insert_Source_B_4_5 + Insert_Source_B_4_6 + Insert_Source_B_5_1 + Insert_Source_B_5_2 + Insert_Source_B_5_3 + Insert_Source_B_5_4 + Insert_Source_B_5_5 + Insert_Source_B_5_6 + Insert_Source_B_8_6 + Insert_Source_B_8_5 + Insert_Source_B_8_4 + Insert_Source_B_8_3 + Insert_Source_B_8_2 + Insert_Source_B_8_1 + Insert_Source_B_6_1 + Insert_Source_B_6_2 + Insert_Source_B_6_3 + Insert_Source_B_6_4 + Insert_Source_B_6_5 + Insert_Source_B_6_6 + Insert_Source_B_7_1 + Insert_Source_B_7_2 + Insert_Source_B_7_3 + Insert_Source_B_7_4 + Insert_Source_B_7_5 + Insert_Source_B_7_6) : MAX(P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8) : MAX(ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8) : MAX(P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_1_5 + P_1119_1_6 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_2_5 + P_1119_2_6 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_3_5 + P_1119_3_6 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_4_5 + P_1119_4_6 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_5_5 + P_1119_5_6 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_6_5 + P_1119_6_6 + P_1119_7_1 + P_1119_7_2 + P_1119_7_3 + P_1119_7_4 + P_1119_7_5 + P_1119_7_6 + P_1119_8_1 + P_1119_8_2 + P_1119_8_3 + P_1119_8_4 + P_1119_8_5 + P_1119_8_6) : MAX(QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_4_5 + QueueJobB_4_6 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_5_5 + QueueJobB_5_6 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_6_5 + QueueJobB_6_6 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_7_5 + QueueJobB_7_6 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4 + QueueJobB_8_5 + QueueJobB_8_6) : MAX(DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) : MAX(QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8) : MAX(ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_8) : MAX(AwakeTasks_6) : MAX(FetchJobE_1_5) : MAX(Idle_7) : MAX(P_1095) : MAX(CreatedJobs_2_1) : MAX(P_1119_6_6) : MAX(QueueJobB_6_1) : MAX(Insert_Source_B_3_5)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 3322 markings, 11501 edges, 664 markings/sec, 0 secs
lola: 6558 markings, 23162 edges, 647 markings/sec, 5 secs
lola: 9818 markings, 34865 edges, 652 markings/sec, 10 secs
lola: 13093 markings, 44937 edges, 655 markings/sec, 15 secs
lola: 16371 markings, 55163 edges, 656 markings/sec, 20 secs
lola: 19636 markings, 66219 edges, 653 markings/sec, 25 secs
lola: 22909 markings, 76751 edges, 655 markings/sec, 30 secs
lola: 26185 markings, 87241 edges, 655 markings/sec, 35 secs
lola: 29446 markings, 98660 edges, 652 markings/sec, 40 secs
lola: 32702 markings, 110388 edges, 651 markings/sec, 45 secs
lola: 35952 markings, 122125 edges, 650 markings/sec, 50 secs
lola: 39229 markings, 132310 edges, 655 markings/sec, 55 secs
lola: 42506 markings, 142629 edges, 655 markings/sec, 60 secs
lola: 45775 markings, 153636 edges, 654 markings/sec, 65 secs
lola: 49053 markings, 164107 edges, 656 markings/sec, 70 secs
lola: 52329 markings, 174671 edges, 655 markings/sec, 75 secs
lola: 55594 markings, 185946 edges, 653 markings/sec, 80 secs
lola: 58855 markings, 197641 edges, 652 markings/sec, 85 secs
lola: 62136 markings, 207892 edges, 656 markings/sec, 90 secs
lola: 65414 markings, 218395 edges, 656 markings/sec, 95 secs
lola: 68688 markings, 229091 edges, 655 markings/sec, 100 secs
lola: 71958 markings, 240133 edges, 654 markings/sec, 105 secs
lola: 75227 markings, 251045 edges, 654 markings/sec, 110 secs
lola: 78498 markings, 261770 edges, 654 markings/sec, 115 secs
lola: 81770 markings, 272492 edges, 654 markings/sec, 120 secs
lola: 85031 markings, 283779 edges, 652 markings/sec, 125 secs
lola: 88303 markings, 294318 edges, 654 markings/sec, 130 secs
lola: 91571 markings, 305103 edges, 654 markings/sec, 135 secs
lola: 94837 markings, 316032 edges, 653 markings/sec, 140 secs
lola: 98115 markings, 326960 edges, 656 markings/sec, 145 secs
lola: 101390 markings, 337806 edges, 655 markings/sec, 150 secs
lola: 104686 markings, 348724 edges, 659 markings/sec, 155 secs
lola: 107984 markings, 359506 edges, 660 markings/sec, 160 secs
lola: 111284 markings, 370390 edges, 660 markings/sec, 165 secs
lola: 114580 markings, 381293 edges, 659 markings/sec, 170 secs
lola: 117859 markings, 392010 edges, 656 markings/sec, 175 secs
lola: 121112 markings, 403297 edges, 651 markings/sec, 180 secs
lola: 124386 markings, 413589 edges, 655 markings/sec, 185 secs
lola: 127644 markings, 424402 edges, 652 markings/sec, 190 secs
lola: 130897 markings, 435257 edges, 651 markings/sec, 195 secs
lola: 134166 markings, 445911 edges, 654 markings/sec, 200 secs
lola: 137438 markings, 456635 edges, 654 markings/sec, 205 secs
lola: 140705 markings, 467590 edges, 653 markings/sec, 210 secs
lola: 143962 markings, 479382 edges, 651 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ''
Aborted (core dumped)
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-0 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-1 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-2 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-3 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-4 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-5 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-6 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-7 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-8 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-9 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-10 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-11 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-12 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-13 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-14 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-15 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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="PolyORBLF-PT-S06J06T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="irma4mcc-full"
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/PolyORBLF-PT-S06J06T08.tgz
mv PolyORBLF-PT-S06J06T08 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 irma4mcc-full"
echo " Input is PolyORBLF-PT-S06J06T08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-smll-152673528600254"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;