fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r143-tall-165271830100029
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for IBM319-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
230.132 5515.00 10835.00 194.70 FTFTFTFTFTTTTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r143-tall-165271830100029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
Input is IBM319-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830100029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 11K Apr 29 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 29 16:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 16:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.0K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 9 08:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 29 16:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 29 16:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 29 16:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 29 16:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 184K May 10 09:34 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 IBM319-PT-none-ReachabilityCardinality-00
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-01
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-02
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-03
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-04
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-05
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-06
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-07
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-08
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-09
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-10
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-11
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-12
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-13
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-14
FORMULA_NAME IBM319-PT-none-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655068598304

Running Version 0
[2022-06-12 21:16:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:16:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:16:40] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2022-06-12 21:16:40] [INFO ] Transformed 253 places.
[2022-06-12 21:16:40] [INFO ] Transformed 178 transitions.
[2022-06-12 21:16:40] [INFO ] Found NUPN structural information;
[2022-06-12 21:16:40] [INFO ] Completing missing partition info from NUPN : creating a component with [alpha, merge_s00002239_activated, join_s00001164_input_s00001127, join_s00001163_input_s00001128, callToProcess_s00002943_inputCriterion_s00001053_used, merge_s00002240_input_s00001052, merge_s00001162_input_s00001052, callToProcess_s00002802_inputCriterion_s00001053_used, merge_s00002241_input_s00001127, callToProcess_s00002121_inputCriterion_s00001053_used, callToTask_s00002869_inputCriterion_s00001053_used, callToTask_s00002896_inputCriterion_s00001053_used, callToTask_s00002949_inputCriterion_s00001053_used, callToTask_s00002958_inputCriterion_s00001053_used, callToTask_s00002966_inputCriterion_s00001053_used, decision_s00002055_activated, decision_s00002760_activated, decision_s00002948_activated, join_s00001163_activated_s00001062, fork_s00001071_activated_s00001073, fork_s00001298_activated_s00001073, fork_s00001298_activated_s00001078, decision_s00001123_input_s00001052, callToTask_s00002929_inputCriterion_s00001053_used, callToTask_s00002965_inputCriterion_s00001053_used, callToTask_s00002063_input_s00001052, callToTask_s00002931_input_s00001052, callToTask_s00002932_input_s00001052, callToTask_s00002954_inputCriterion_s00001053_used, callToTask_s00002951_input_s00001052, callToTask_s00002962_input_s00001052, callToTask_s00002963_inputCriterion_s00001053_used, callToTask_s00002954_input_s00001052, callToTask_s00002962_inputCriterion_s00001053_used, callToTask_s00002961_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001066, callToTask_s00002965_input_s00001052, callToTask_s00002956_input_s00001052, callToTask_s00002929_input_s00001052, callToTask_s00002960_inputCriterion_s00001053_used, callToTask_s00001168_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001068, callToTask_s00002950_inputCriterion_s00001053_used, callToTask_s00002930_inputCriterion_s00001053_used, callToTask_s00002254_inputCriterion_s00001053_used, callToTask_s00002063_inputCriterion_s00001053_used, callToProcess_s00002499_output_s00001054, callToProcess_s00002038_output_s00001077, callToTask_s00002063_output_s00001054, callToTask_s00002931_output_s00001054, callToTask_s00002044_output_s00001077, callToProcess_s00002802_output_s00001054, callToTask_s00002951_output_s00001054, callToTask_s00002952_output_s00001054, callToTask_s00002963_output_s00001054, callToTask_s00002955_output_s00001054, callToProcess_s00001108_input_s00001052, callToTask_s00002869_output_s00001054, callToTask_s00002965_output_s00001054, callToTask_s00002959_output_s00001054, callToTask_s00002966_output_s00001054, callToTask_s00002958_output_s00001054, callToTask_s00002961_output_s00001077, callToTask_s00002951_output_s00001077, callToTask_s00001852_output_s00001077, callToTask_s00002965_output_s00001077, callToTask_s00002966_output_s00001077, callToTask_s00002959_output_s00001077, callToTask_s00002869_output_s00001077, callToProcess_s00002499_input_s00001066, callToTask_s00001406_output_s00001077, callToProcess_s00002802_output_s00001077, callToTask_s00002966_input_s00001066, process_s00000343__s00003019_output_s00001249, callToProcess_s00002944_output_s00001077, callToProcess_s00002499_output_s00001083, callToTask_s00002964_input_s00001066, callToTask_s00002954_input_s00001066, callToTask_s00002931_inputCriterion_s00001053_used, callToTask_s00002952_input_s00001066, callToTask_s00002950_input_s00001066, callToTask_s00002960_input_s00001128, callToTask_s00001406_input_s00001066, callToTask_s00002063_input_s00001066, merge_s00002239_input_s00001066, merge_s00001162_input_s00001068, merge_s00001161_input_s00001068, merge_s00002241_input_s00001066]
[2022-06-12 21:16:40] [INFO ] Parsed PT model containing 253 places and 178 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA IBM319-PT-none-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 200 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :4
FORMULA IBM319-PT-none-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBM319-PT-none-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBM319-PT-none-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBM319-PT-none-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 124 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 126 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 118 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 114 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 178 rows 253 cols
[2022-06-12 21:16:40] [INFO ] Computed 84 place invariants in 31 ms
[2022-06-12 21:16:40] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2022-06-12 21:16:40] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 30 ms returned sat
[2022-06-12 21:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:40] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2022-06-12 21:16:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:41] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-12 21:16:41] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 11 ms returned sat
[2022-06-12 21:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:41] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2022-06-12 21:16:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:41] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-06-12 21:16:41] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 5 ms returned unsat
[2022-06-12 21:16:41] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-12 21:16:41] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 12 ms returned sat
[2022-06-12 21:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:41] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2022-06-12 21:16:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:41] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:16:41] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 11 ms returned sat
[2022-06-12 21:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:41] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-06-12 21:16:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:41] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-12 21:16:41] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 26 ms returned sat
[2022-06-12 21:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:42] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2022-06-12 21:16:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:42] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-06-12 21:16:42] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 19 ms returned sat
[2022-06-12 21:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:42] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2022-06-12 21:16:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned unsat
[2022-06-12 21:16:42] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:16:42] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 10 ms returned sat
[2022-06-12 21:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:42] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-06-12 21:16:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:42] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:16:42] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 10 ms returned sat
[2022-06-12 21:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:42] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2022-06-12 21:16:42] [INFO ] Solution in real domain found non-integer solution.
FORMULA IBM319-PT-none-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM319-PT-none-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM319-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM319-PT-none-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM319-PT-none-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM319-PT-none-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM319-PT-none-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM319-PT-none-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM319-PT-none-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 0 different solutions.
All properties solved without resorting to model-checking.

BK_STOP 1655068603819

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="IBM319-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-4028"
echo " Executing tool gold2021"
echo " Input is IBM319-PT-none, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r143-tall-165271830100029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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