Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977700111.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977700111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 244K Mar 5 18:23 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 ShieldRVs-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679298801838

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:53:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 07:53:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:53:23] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-20 07:53:23] [INFO ] Transformed 803 places.
[2023-03-20 07:53:23] [INFO ] Transformed 903 transitions.
[2023-03-20 07:53:23] [INFO ] Found NUPN structural information;
[2023-03-20 07:53:23] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 11 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 16) seen :9
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 903 rows 803 cols
[2023-03-20 07:53:24] [INFO ] Computed 81 place invariants in 70 ms
[2023-03-20 07:53:25] [INFO ] After 465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 07:53:25] [INFO ] [Nat]Absence check using 81 positive place invariants in 33 ms returned sat
[2023-03-20 07:53:26] [INFO ] After 1245ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-20 07:53:27] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 7 ms to minimize.
[2023-03-20 07:53:27] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 2 ms to minimize.
[2023-03-20 07:53:27] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 1 ms to minimize.
[2023-03-20 07:53:27] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 9 ms to minimize.
[2023-03-20 07:53:28] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 13 ms to minimize.
[2023-03-20 07:53:28] [INFO ] Deduced a trap composed of 46 places in 309 ms of which 1 ms to minimize.
[2023-03-20 07:53:28] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 1 ms to minimize.
[2023-03-20 07:53:29] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 1 ms to minimize.
[2023-03-20 07:53:29] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 0 ms to minimize.
[2023-03-20 07:53:29] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 1 ms to minimize.
[2023-03-20 07:53:29] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 0 ms to minimize.
[2023-03-20 07:53:30] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 1 ms to minimize.
[2023-03-20 07:53:30] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 0 ms to minimize.
[2023-03-20 07:53:30] [INFO ] Deduced a trap composed of 84 places in 172 ms of which 1 ms to minimize.
[2023-03-20 07:53:30] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 14 ms to minimize.
[2023-03-20 07:53:30] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2023-03-20 07:53:30] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2023-03-20 07:53:31] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 0 ms to minimize.
[2023-03-20 07:53:31] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 2 ms to minimize.
[2023-03-20 07:53:31] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 1 ms to minimize.
[2023-03-20 07:53:31] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2023-03-20 07:53:31] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 1 ms to minimize.
[2023-03-20 07:53:32] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 0 ms to minimize.
[2023-03-20 07:53:32] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 0 ms to minimize.
[2023-03-20 07:53:32] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 1 ms to minimize.
[2023-03-20 07:53:32] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 0 ms to minimize.
[2023-03-20 07:53:32] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 0 ms to minimize.
[2023-03-20 07:53:33] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 1 ms to minimize.
[2023-03-20 07:53:33] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 1 ms to minimize.
[2023-03-20 07:53:33] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 1 ms to minimize.
[2023-03-20 07:53:33] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2023-03-20 07:53:33] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 1 ms to minimize.
[2023-03-20 07:53:33] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 1 ms to minimize.
[2023-03-20 07:53:34] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 2 ms to minimize.
[2023-03-20 07:53:34] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 11 ms to minimize.
[2023-03-20 07:53:34] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 1 ms to minimize.
[2023-03-20 07:53:34] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 0 ms to minimize.
[2023-03-20 07:53:34] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 0 ms to minimize.
[2023-03-20 07:53:34] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 1 ms to minimize.
[2023-03-20 07:53:35] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2023-03-20 07:53:35] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 1 ms to minimize.
[2023-03-20 07:53:35] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 0 ms to minimize.
[2023-03-20 07:53:35] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 8578 ms
[2023-03-20 07:53:35] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 1 ms to minimize.
[2023-03-20 07:53:36] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 1 ms to minimize.
[2023-03-20 07:53:36] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 0 ms to minimize.
[2023-03-20 07:53:36] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2023-03-20 07:53:36] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2023-03-20 07:53:36] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2023-03-20 07:53:37] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2023-03-20 07:53:37] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 1 ms to minimize.
[2023-03-20 07:53:37] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 3 ms to minimize.
[2023-03-20 07:53:37] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 1 ms to minimize.
[2023-03-20 07:53:37] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2023-03-20 07:53:38] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2023-03-20 07:53:38] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2023-03-20 07:53:38] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 1 ms to minimize.
[2023-03-20 07:53:38] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2023-03-20 07:53:38] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2023-03-20 07:53:38] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 0 ms to minimize.
[2023-03-20 07:53:38] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3030 ms
[2023-03-20 07:53:39] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2023-03-20 07:53:39] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 1 ms to minimize.
[2023-03-20 07:53:39] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 1 ms to minimize.
[2023-03-20 07:53:39] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 1 ms to minimize.
[2023-03-20 07:53:40] [INFO ] Deduced a trap composed of 57 places in 244 ms of which 1 ms to minimize.
[2023-03-20 07:53:40] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 1 ms to minimize.
[2023-03-20 07:53:40] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 0 ms to minimize.
[2023-03-20 07:53:40] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 0 ms to minimize.
[2023-03-20 07:53:41] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 1 ms to minimize.
[2023-03-20 07:53:41] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 1 ms to minimize.
[2023-03-20 07:53:41] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 1 ms to minimize.
[2023-03-20 07:53:41] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 1 ms to minimize.
[2023-03-20 07:53:42] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2023-03-20 07:53:42] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2023-03-20 07:53:42] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 1 ms to minimize.
[2023-03-20 07:53:42] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 0 ms to minimize.
[2023-03-20 07:53:42] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 1 ms to minimize.
[2023-03-20 07:53:43] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 1 ms to minimize.
[2023-03-20 07:53:43] [INFO ] Deduced a trap composed of 34 places in 266 ms of which 1 ms to minimize.
[2023-03-20 07:53:43] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 1 ms to minimize.
[2023-03-20 07:53:44] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 0 ms to minimize.
[2023-03-20 07:53:44] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 1 ms to minimize.
[2023-03-20 07:53:44] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 1 ms to minimize.
[2023-03-20 07:53:44] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 1 ms to minimize.
[2023-03-20 07:53:45] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 0 ms to minimize.
[2023-03-20 07:53:45] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 1 ms to minimize.
[2023-03-20 07:53:45] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 1 ms to minimize.
[2023-03-20 07:53:45] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 0 ms to minimize.
[2023-03-20 07:53:46] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 1 ms to minimize.
[2023-03-20 07:53:46] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 1 ms to minimize.
[2023-03-20 07:53:46] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2023-03-20 07:53:46] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 1 ms to minimize.
[2023-03-20 07:53:46] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 1 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 0 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 1 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 8520 ms
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 0 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 0 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 1 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 0 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 1 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 1 ms to minimize.
[2023-03-20 07:53:49] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 0 ms to minimize.
[2023-03-20 07:53:49] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2023-03-20 07:53:49] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2023-03-20 07:53:49] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 0 ms to minimize.
[2023-03-20 07:53:49] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 1 ms to minimize.
[2023-03-20 07:53:49] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 0 ms to minimize.
[2023-03-20 07:53:50] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2023-03-20 07:53:50] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 0 ms to minimize.
[2023-03-20 07:53:50] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 2546 ms
[2023-03-20 07:53:50] [INFO ] After 24607ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-20 07:53:50] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 109 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 803 transition count 845
Reduce places removed 58 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 65 rules applied. Total rules applied 123 place count 745 transition count 838
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 130 place count 738 transition count 838
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 130 place count 738 transition count 744
Deduced a syphon composed of 94 places in 3 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 318 place count 644 transition count 744
Discarding 106 places :
Symmetric choice reduction at 3 with 106 rule applications. Total rules 424 place count 538 transition count 638
Iterating global reduction 3 with 106 rules applied. Total rules applied 530 place count 538 transition count 638
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 530 place count 538 transition count 604
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 598 place count 504 transition count 604
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 2 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 858 place count 374 transition count 474
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 890 place count 374 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 891 place count 373 transition count 473
Applied a total of 891 rules in 194 ms. Remains 373 /803 variables (removed 430) and now considering 473/903 (removed 430) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 373/803 places, 473/903 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :2
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 473 rows 373 cols
[2023-03-20 07:53:50] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:53:50] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 07:53:51] [INFO ] [Nat]Absence check using 81 positive place invariants in 15 ms returned sat
[2023-03-20 07:53:51] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 07:53:51] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-20 07:53:51] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-20 07:53:51] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2023-03-20 07:53:51] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2023-03-20 07:53:51] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2023-03-20 07:53:51] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2023-03-20 07:53:51] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2023-03-20 07:53:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 519 ms
[2023-03-20 07:53:52] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2023-03-20 07:53:52] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2023-03-20 07:53:52] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2023-03-20 07:53:52] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2023-03-20 07:53:52] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2023-03-20 07:53:52] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-03-20 07:53:52] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2023-03-20 07:53:52] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:53:53] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2023-03-20 07:53:53] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-20 07:53:53] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2023-03-20 07:53:53] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2023-03-20 07:53:53] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2023-03-20 07:53:53] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2023-03-20 07:53:53] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1596 ms
[2023-03-20 07:53:53] [INFO ] After 2642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 243 ms.
[2023-03-20 07:53:53] [INFO ] After 2985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 93 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 473/473 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 471
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 371 transition count 471
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 371 transition count 469
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 369 transition count 469
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 364 transition count 464
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 364 transition count 464
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 363 transition count 463
Applied a total of 20 rules in 59 ms. Remains 363 /373 variables (removed 10) and now considering 463/473 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 363/373 places, 463/473 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 527155 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 527155 steps, saw 105773 distinct states, run finished after 3002 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 463 rows 363 cols
[2023-03-20 07:53:57] [INFO ] Computed 81 place invariants in 14 ms
[2023-03-20 07:53:57] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 07:53:57] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-20 07:53:57] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 07:53:57] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:53:58] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-20 07:53:58] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2023-03-20 07:53:58] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2023-03-20 07:53:58] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2023-03-20 07:53:58] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-20 07:53:58] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-20 07:53:58] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2023-03-20 07:53:58] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-20 07:53:58] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-20 07:53:58] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2023-03-20 07:53:58] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 677 ms
[2023-03-20 07:53:58] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-03-20 07:53:58] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-03-20 07:53:58] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2023-03-20 07:53:59] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2023-03-20 07:53:59] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-03-20 07:53:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 447 ms
[2023-03-20 07:53:59] [INFO ] After 1662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 212 ms.
[2023-03-20 07:53:59] [INFO ] After 1991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 93 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 463/463 transitions.
Applied a total of 0 rules in 11 ms. Remains 363 /363 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 363/363 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 463/463 transitions.
Applied a total of 0 rules in 11 ms. Remains 363 /363 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2023-03-20 07:53:59] [INFO ] Invariant cache hit.
[2023-03-20 07:53:59] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-20 07:53:59] [INFO ] Invariant cache hit.
[2023-03-20 07:53:59] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2023-03-20 07:53:59] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-20 07:54:00] [INFO ] Invariant cache hit.
[2023-03-20 07:54:00] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 806 ms. Remains : 363/363 places, 463/463 transitions.
Applied a total of 0 rules in 10 ms. Remains 363 /363 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 07:54:00] [INFO ] Invariant cache hit.
[2023-03-20 07:54:00] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 07:54:00] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-20 07:54:00] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 07:54:00] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-20 07:54:00] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2023-03-20 07:54:00] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-20 07:54:01] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2023-03-20 07:54:01] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2023-03-20 07:54:01] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2023-03-20 07:54:01] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2023-03-20 07:54:01] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2023-03-20 07:54:01] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2023-03-20 07:54:01] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2023-03-20 07:54:01] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2023-03-20 07:54:01] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2023-03-20 07:54:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 872 ms
[2023-03-20 07:54:01] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-20 07:54:01] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-20 07:54:02] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2023-03-20 07:54:02] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-20 07:54:02] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2023-03-20 07:54:02] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2023-03-20 07:54:02] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-20 07:54:02] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-20 07:54:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 611 ms
[2023-03-20 07:54:02] [INFO ] After 1987ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 186 ms.
[2023-03-20 07:54:02] [INFO ] After 2245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 07:54:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-20 07:54:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 363 places, 463 transitions and 2027 arcs took 4 ms.
[2023-03-20 07:54:02] [INFO ] Flatten gal took : 73 ms
Total runtime 39528 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/1025/inv_0_ --invariant=/tmp/1025/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 13363396 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098912 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

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="ShieldRVs-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVs-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905977700111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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