Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r111-smll-174867015900082.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is HealthRecord-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015900082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 73K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748785806446

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 13:50:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 13:50:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:50:09] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2025-06-01 13:50:09] [INFO ] Transformed 163 places.
[2025-06-01 13:50:09] [INFO ] Transformed 348 transitions.
[2025-06-01 13:50:09] [INFO ] Found NUPN structural information;
[2025-06-01 13:50:09] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 617 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-01 13:50:09] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
// Phase 1: matrix 307 rows 163 cols
[2025-06-01 13:50:09] [INFO ] Computed 18 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (913 resets) in 65 ms. (151 steps per ms)
FORMULA HealthRecord-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (1077 resets) in 112 ms. (796 steps per ms)
FORMULA HealthRecord-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-01 13:50:09] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
[2025-06-01 13:50:09] [INFO ] Invariant cache hit.
[2025-06-01 13:50:10] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2025-06-01 13:50:10] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2025-06-01 13:50:10] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2025-06-01 13:50:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 13:50:10] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2025-06-01 13:50:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-06-01 13:50:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 13:50:10] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2025-06-01 13:50:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:50:10] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 55 ms.
[2025-06-01 13:50:11] [INFO ] Added : 13 causal constraints over 3 iterations in 185 ms. Result :sat
Minimization took 187 ms.
[2025-06-01 13:50:11] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:50:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:50:11] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-06-01 13:50:11] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-01 13:50:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-01 13:50:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:50:11] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2025-06-01 13:50:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:50:11] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 39 ms.
[2025-06-01 13:50:11] [INFO ] Added : 12 causal constraints over 3 iterations in 116 ms. Result :sat
Minimization took 174 ms.
[2025-06-01 13:50:12] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 13:50:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 13:50:12] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-06-01 13:50:12] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2025-06-01 13:50:12] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 15 ms to minimize.
[2025-06-01 13:50:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-06-01 13:50:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:50:12] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-06-01 13:50:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:50:12] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2025-06-01 13:50:12] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2025-06-01 13:50:12] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2025-06-01 13:50:12] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2025-06-01 13:50:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 298 ms
[2025-06-01 13:50:12] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 41 ms.
[2025-06-01 13:50:13] [INFO ] Added : 19 causal constraints over 4 iterations in 140 ms. Result :sat
Minimization took 174 ms.
[2025-06-01 13:50:13] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-01 13:50:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-01 13:50:13] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2025-06-01 13:50:13] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:50:13] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 39 ms.
[2025-06-01 13:50:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:50:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:50:13] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-06-01 13:50:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:50:13] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 40 ms.
[2025-06-01 13:50:13] [INFO ] Added : 32 causal constraints over 7 iterations in 204 ms. Result :sat
Minimization took 177 ms.
[2025-06-01 13:50:14] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:50:14] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-01 13:50:14] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2025-06-01 13:50:14] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-01 13:50:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:50:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:50:14] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2025-06-01 13:50:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 13:50:14] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 30 ms.
[2025-06-01 13:50:14] [INFO ] Added : 13 causal constraints over 3 iterations in 106 ms. Result :sat
Minimization took 172 ms.
[2025-06-01 13:50:14] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:50:14] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:50:14] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2025-06-01 13:50:14] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:50:15] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 30 ms.
[2025-06-01 13:50:15] [INFO ] Added : 18 causal constraints over 4 iterations in 133 ms. Result :sat
Minimization took 230 ms.
[2025-06-01 13:50:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 13:50:15] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 13:50:15] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-06-01 13:50:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-01 13:50:15] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
[2025-06-01 13:50:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2025-06-01 13:50:15] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 27 ms.
[2025-06-01 13:50:15] [INFO ] Added : 17 causal constraints over 4 iterations in 123 ms. Result :sat
Minimization took 197 ms.
[2025-06-01 13:50:15] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-01 13:50:16] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:50:16] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2025-06-01 13:50:16] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:50:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:50:16] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 13:50:16] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-06-01 13:50:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2025-06-01 13:50:16] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 26 ms.
[2025-06-01 13:50:16] [INFO ] Added : 26 causal constraints over 6 iterations in 152 ms. Result :sat
Minimization took 161 ms.
[2025-06-01 13:50:16] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:50:16] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-01 13:50:16] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-01 13:50:16] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 13:50:16] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 26 ms.
[2025-06-01 13:50:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:50:16] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 13:50:17] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-06-01 13:50:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:50:17] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 29 ms.
[2025-06-01 13:50:17] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2025-06-01 13:50:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2025-06-01 13:50:17] [INFO ] Added : 30 causal constraints over 7 iterations in 242 ms. Result :sat
Minimization took 175 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 319/319 transitions.
Graph (trivial) has 237 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 697 edges and 161 vertex of which 152 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) 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 4 place count 152 transition count 300
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 150 transition count 298
Discarding 83 places :
Symmetric choice reduction at 2 with 83 rule applications. Total rules 91 place count 67 transition count 132
Iterating global reduction 2 with 83 rules applied. Total rules applied 174 place count 67 transition count 132
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 184 place count 57 transition count 112
Iterating global reduction 2 with 10 rules applied. Total rules applied 194 place count 57 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 203 place count 57 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 207 place count 55 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 217 place count 50 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 50 transition count 128
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 221 place count 50 transition count 125
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 224 place count 47 transition count 125
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 226 place count 47 transition count 383
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 230 place count 45 transition count 381
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 231 place count 44 transition count 327
Iterating global reduction 5 with 1 rules applied. Total rules applied 232 place count 44 transition count 327
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 233 place count 43 transition count 325
Iterating global reduction 5 with 1 rules applied. Total rules applied 234 place count 43 transition count 325
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 254 place count 43 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 256 place count 43 transition count 303
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 269 place count 43 transition count 303
Applied a total of 269 rules in 143 ms. Remains 43 /163 variables (removed 120) and now considering 303/319 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 43/163 places, 303/319 transitions.
[2025-06-01 13:50:17] [INFO ] Flow matrix only has 238 transitions (discarded 65 similar events)
// Phase 1: matrix 238 rows 43 cols
[2025-06-01 13:50:18] [INFO ] Computed 9 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (137 resets) in 564 ms. (1769 steps per ms)
FORMULA HealthRecord-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000000 steps (485 resets) in 1577 ms. (2534 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-01 13:50:20] [INFO ] Flow matrix only has 238 transitions (discarded 65 similar events)
[2025-06-01 13:50:20] [INFO ] Invariant cache hit.
[2025-06-01 13:50:20] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-06-01 13:50:20] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-01 13:50:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-01 13:50:20] [INFO ] [Real]Added 43 Read/Feed constraints in 10 ms returned sat
[2025-06-01 13:50:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-06-01 13:50:20] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-01 13:50:20] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2025-06-01 13:50:20] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2025-06-01 13:50:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-06-01 13:50:20] [INFO ] Computed and/alt/rep : 105/670/105 causal constraints (skipped 117 transitions) in 24 ms.
[2025-06-01 13:50:20] [INFO ] Added : 0 causal constraints over 0 iterations in 43 ms. Result :sat
Minimization took 53 ms.
[2025-06-01 13:50:20] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-06-01 13:50:20] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-06-01 13:50:20] [INFO ] [Real]Added 43 Read/Feed constraints in 9 ms returned sat
[2025-06-01 13:50:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 26 ms returned sat
[2025-06-01 13:50:20] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2025-06-01 13:50:20] [INFO ] [Nat]Added 43 Read/Feed constraints in 13 ms returned sat
[2025-06-01 13:50:20] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
[2025-06-01 13:50:20] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2025-06-01 13:50:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2025-06-01 13:50:21] [INFO ] Computed and/alt/rep : 105/670/105 causal constraints (skipped 117 transitions) in 26 ms.
[2025-06-01 13:50:21] [INFO ] Added : 0 causal constraints over 0 iterations in 54 ms. Result :sat
Minimization took 75 ms.
[2025-06-01 13:50:21] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-01 13:50:21] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-01 13:50:21] [INFO ] [Real]Added 43 Read/Feed constraints in 9 ms returned sat
[2025-06-01 13:50:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-01 13:50:21] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-01 13:50:21] [INFO ] [Nat]Added 43 Read/Feed constraints in 10 ms returned sat
[2025-06-01 13:50:21] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2025-06-01 13:50:21] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2025-06-01 13:50:21] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2025-06-01 13:50:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 153 ms
[2025-06-01 13:50:21] [INFO ] Computed and/alt/rep : 105/670/105 causal constraints (skipped 117 transitions) in 21 ms.
[2025-06-01 13:50:21] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Minimization took 48 ms.
[2025-06-01 13:50:21] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-01 13:50:21] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-06-01 13:50:21] [INFO ] [Real]Added 43 Read/Feed constraints in 9 ms returned sat
[2025-06-01 13:50:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:50:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-06-01 13:50:21] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-06-01 13:50:21] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2025-06-01 13:50:21] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2025-06-01 13:50:21] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2025-06-01 13:50:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2025-06-01 13:50:21] [INFO ] Computed and/alt/rep : 105/670/105 causal constraints (skipped 117 transitions) in 20 ms.
[2025-06-01 13:50:21] [INFO ] Added : 1 causal constraints over 1 iterations in 50 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA HealthRecord-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 43 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p27) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 301/301 transitions.
Graph (trivial) has 12 edges and 43 vertex of which 2 / 43 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 241 edges and 42 vertex of which 32 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 32 transition count 278
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 23 place count 32 transition count 277
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 31 transition count 277
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 25 transition count 154
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 25 transition count 154
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 48 place count 25 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 25 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 24 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 23 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 23 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 22 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 22 transition count 139
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 66 place count 22 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 21 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 21 transition count 125
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 20 transition count 97
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 20 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 19 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 19 transition count 96
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 85 place count 19 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 90 place count 19 transition count 79
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 91 place count 18 transition count 57
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 18 transition count 57
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 93 place count 17 transition count 56
Iterating global reduction 5 with 1 rules applied. Total rules applied 94 place count 17 transition count 56
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 102 place count 17 transition count 48
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 112 place count 17 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 116 place count 17 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 117 place count 16 transition count 43
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 7 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 120 place count 13 transition count 43
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 126 place count 13 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 130 place count 11 transition count 35
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 133 place count 11 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 149 place count 11 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 150 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 152 place count 10 transition count 14
Applied a total of 152 rules in 62 ms. Remains 10 /43 variables (removed 33) and now considering 14/301 (removed 287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 10/43 places, 14/301 transitions.
[2025-06-01 13:50:22] [INFO ] Flow matrix only has 12 transitions (discarded 2 similar events)
// Phase 1: matrix 12 rows 10 cols
[2025-06-01 13:50:22] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA HealthRecord-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 525 ms. (1901 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 13:50:22] [INFO ] Flatten gal took : 28 ms
[2025-06-01 13:50:22] [INFO ] Flatten gal took : 6 ms
[2025-06-01 13:50:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12601075300999160688.gal : 5 ms
[2025-06-01 13:50:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6529275440081708012.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12601075300999160688.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6529275440081708012.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 14074 ms.

BK_STOP 1748785823019

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="HealthRecord-PT-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is HealthRecord-PT-15, 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 r111-smll-174867015900082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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