Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038291700275.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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 itstools
Input is CloudDeployment-PT-2b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291700275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 166K May 5 16:51 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 CloudDeployment-PT-2b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-2b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620573741671

Running Version 0
[2021-05-09 15:22:24] [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]
[2021-05-09 15:22:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:22:24] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2021-05-09 15:22:24] [INFO ] Transformed 556 places.
[2021-05-09 15:22:24] [INFO ] Transformed 684 transitions.
[2021-05-09 15:22:24] [INFO ] Found NUPN structural information;
[2021-05-09 15:22:24] [INFO ] Parsed PT model containing 556 places and 684 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 684 rows 556 cols
[2021-05-09 15:22:24] [INFO ] Computed 9 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 154 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :7
FORMULA CloudDeployment-PT-2b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :1
FORMULA CloudDeployment-PT-2b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :1
FORMULA CloudDeployment-PT-2b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 7) seen :3
FORMULA CloudDeployment-PT-2b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 684 rows 556 cols
[2021-05-09 15:22:24] [INFO ] Computed 9 place invariants in 8 ms
[2021-05-09 15:22:24] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 21 ms returned sat
[2021-05-09 15:22:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:22:25] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2021-05-09 15:22:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:22:25] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 15 ms returned sat
[2021-05-09 15:22:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:22:25] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-09 15:22:25] [INFO ] Computed and/alt/rep : 671/1398/671 causal constraints (skipped 12 transitions) in 96 ms.
[2021-05-09 15:22:30] [INFO ] Added : 495 causal constraints over 99 iterations in 4742 ms. Result :unknown
[2021-05-09 15:22:30] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 27 ms returned sat
[2021-05-09 15:22:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:22:30] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2021-05-09 15:22:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:22:30] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 23 ms returned sat
[2021-05-09 15:22:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:22:31] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2021-05-09 15:22:31] [INFO ] Computed and/alt/rep : 671/1398/671 causal constraints (skipped 12 transitions) in 69 ms.
[2021-05-09 15:22:35] [INFO ] Added : 478 causal constraints over 96 iterations in 4509 ms. Result :unknown
[2021-05-09 15:22:35] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 23 ms returned sat
[2021-05-09 15:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:22:36] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2021-05-09 15:22:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:22:36] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 11 ms returned sat
[2021-05-09 15:22:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:22:36] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-09 15:22:36] [INFO ] Computed and/alt/rep : 671/1398/671 causal constraints (skipped 12 transitions) in 85 ms.
[2021-05-09 15:22:40] [INFO ] Added : 477 causal constraints over 96 iterations in 4378 ms. Result :sat
Minimization took 324 ms.
[2021-05-09 15:22:41] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 9 ms returned sat
[2021-05-09 15:22:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:22:41] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-09 15:22:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:22:41] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 11 ms returned sat
[2021-05-09 15:22:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:22:41] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-09 15:22:41] [INFO ] Computed and/alt/rep : 671/1398/671 causal constraints (skipped 12 transitions) in 34 ms.
[2021-05-09 15:22:45] [INFO ] Added : 468 causal constraints over 94 iterations in 3944 ms. Result :sat
Minimization took 374 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 65700 steps, including 777 resets, run finished after 149 ms. (steps per millisecond=440 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 65900 steps, including 891 resets, run finished after 89 ms. (steps per millisecond=740 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 556 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 556/556 places, 684/684 transitions.
Graph (trivial) has 557 edges and 556 vertex of which 161 / 556 are part of one of the 15 SCC in 38 ms
Free SCC test removed 146 places
Drop transitions removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Graph (complete) has 929 edges and 410 vertex of which 394 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.11 ms
Discarding 16 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 210 rules applied. Total rules applied 212 place count 394 transition count 277
Reduce places removed 202 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 204 rules applied. Total rules applied 416 place count 192 transition count 275
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 418 place count 190 transition count 275
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 418 place count 190 transition count 266
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 436 place count 181 transition count 266
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 494 place count 123 transition count 208
Iterating global reduction 3 with 58 rules applied. Total rules applied 552 place count 123 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 554 place count 123 transition count 206
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 554 place count 123 transition count 198
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 570 place count 115 transition count 198
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 632 place count 84 transition count 167
Performed 13 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 658 place count 71 transition count 190
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 663 place count 71 transition count 185
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 689 place count 71 transition count 159
Free-agglomeration rule applied 20 times with reduction of 2 identical transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 709 place count 71 transition count 137
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 240 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 41 rules applied. Total rules applied 750 place count 50 transition count 117
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 751 place count 50 transition count 116
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 752 place count 49 transition count 113
Iterating global reduction 7 with 1 rules applied. Total rules applied 753 place count 49 transition count 113
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 765 place count 49 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 766 place count 48 transition count 100
Applied a total of 766 rules in 154 ms. Remains 48 /556 variables (removed 508) and now considering 100/684 (removed 584) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/556 places, 100/684 transitions.
Normalized transition count is 72 out of 100 initially.
// Phase 1: matrix 72 rows 48 cols
[2021-05-09 15:22:46] [INFO ] Computed 7 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 27320 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 4) seen :4
FORMULA CloudDeployment-PT-2b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620573767672

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

+ 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
+ [[ -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 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=/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="CloudDeployment-PT-2b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is CloudDeployment-PT-2b, 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 r045-oct2-162038291700275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-2b.tgz
mv CloudDeployment-PT-2b 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 ;