fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r223-smll-167840362200006
Last Updated
May 14, 2023

About the Execution of 2022-gold for GPUForwardProgress-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
197.800 9348.00 15611.00 368.90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r223-smll-167840362200006.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is GPUForwardProgress-PT-12b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-167840362200006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 14:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 14:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 14:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 14:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 65K Mar 5 18:22 model.pnml

--------------------
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 GPUForwardProgress-PT-12b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678578379049

Running Version 202205111006
[2023-03-11 23:46:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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]
[2023-03-11 23:46:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 23:46:21] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2023-03-11 23:46:21] [INFO ] Transformed 264 places.
[2023-03-11 23:46:21] [INFO ] Transformed 277 transitions.
[2023-03-11 23:46:21] [INFO ] Found NUPN structural information;
[2023-03-11 23:46:21] [INFO ] Parsed PT model containing 264 places and 277 transitions in 358 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 277 rows 264 cols
[2023-03-11 23:46:21] [INFO ] Computed 14 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 92 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :11
FORMULA GPUForwardProgress-PT-12b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :1
FORMULA GPUForwardProgress-PT-12b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
// Phase 1: matrix 277 rows 264 cols
[2023-03-11 23:46:21] [INFO ] Computed 14 place invariants in 9 ms
[2023-03-11 23:46:22] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 19 ms returned sat
[2023-03-11 23:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:22] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2023-03-11 23:46:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:46:23] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 13 ms returned sat
[2023-03-11 23:46:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:23] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-11 23:46:23] [INFO ] Computed and/alt/rep : 271/481/271 causal constraints (skipped 5 transitions) in 41 ms.
[2023-03-11 23:46:23] [INFO ] Added : 98 causal constraints over 20 iterations in 605 ms. Result :sat
Minimization took 67 ms.
[2023-03-11 23:46:24] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 15 ms returned sat
[2023-03-11 23:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:24] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-11 23:46:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:46:24] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 11 ms returned sat
[2023-03-11 23:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:24] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2023-03-11 23:46:24] [INFO ] Computed and/alt/rep : 271/481/271 causal constraints (skipped 5 transitions) in 29 ms.
[2023-03-11 23:46:25] [INFO ] Added : 115 causal constraints over 23 iterations in 579 ms. Result :sat
Minimization took 60 ms.
[2023-03-11 23:46:25] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 13 ms returned sat
[2023-03-11 23:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:25] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-11 23:46:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:46:25] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 16 ms returned sat
[2023-03-11 23:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:25] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2023-03-11 23:46:25] [INFO ] Computed and/alt/rep : 271/481/271 causal constraints (skipped 5 transitions) in 35 ms.
[2023-03-11 23:46:26] [INFO ] Added : 99 causal constraints over 20 iterations in 591 ms. Result :sat
Minimization took 62 ms.
[2023-03-11 23:46:26] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 14 ms returned sat
[2023-03-11 23:46:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:26] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-11 23:46:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:46:26] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 15 ms returned sat
[2023-03-11 23:46:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:46:26] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-11 23:46:26] [INFO ] Computed and/alt/rep : 271/481/271 causal constraints (skipped 5 transitions) in 28 ms.
[2023-03-11 23:46:27] [INFO ] Added : 84 causal constraints over 18 iterations in 580 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA GPUForwardProgress-PT-12b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 264 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 264/264 places, 276/276 transitions.
Graph (trivial) has 236 edges and 264 vertex of which 7 / 264 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 387 edges and 258 vertex of which 241 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.13 ms
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 240 transition count 116
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 160 rules applied. Total rules applied 311 place count 94 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 312 place count 93 transition count 102
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 312 place count 93 transition count 78
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 360 place count 69 transition count 78
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 374 place count 55 transition count 64
Iterating global reduction 3 with 14 rules applied. Total rules applied 388 place count 55 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 388 place count 55 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 392 place count 53 transition count 62
Graph (complete) has 98 edges and 53 vertex of which 19 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.0 ms
Discarding 34 places :
Also discarding 33 output transitions
Drop transitions removed 33 transitions
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 12 rules applied. Total rules applied 404 place count 19 transition count 18
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 427 place count 8 transition count 6
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 432 place count 5 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 433 place count 5 transition count 4
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 434 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 435 place count 4 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 436 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 436 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 438 place count 2 transition count 1
Applied a total of 438 rules in 91 ms. Remains 2 /264 variables (removed 262) and now considering 1/276 (removed 275) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/264 places, 1/276 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-11 23:46:27] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 480 ms. (steps per millisecond=2083 ) properties (out of 1) seen :1
FORMULA GPUForwardProgress-PT-12b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7066 ms.

BK_STOP 1678578388397

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -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=@none -Xss128m -Xms40m -Xmx8192m

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="GPUForwardProgress-PT-12b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is GPUForwardProgress-PT-12b, 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 r223-smll-167840362200006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-12b.tgz
mv GPUForwardProgress-PT-12b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "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
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;