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

About the Execution of Marcie+red for PGCD-COL-D05N025

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6410.796 3600000.00 3650681.00 11806.00 F?T???T??F???T?? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247300425.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is PGCD-COL-D05N025, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247300425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 23 15:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 11K Mar 31 16:48 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 PGCD-COL-D05N025-CTLCardinality-00
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-01
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-02
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-03
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-04
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-05
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-06
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-07
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-08
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-09
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-10
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-11
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-12
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-13
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-14
FORMULA_NAME PGCD-COL-D05N025-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680814960823

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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-COL-D05N025
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 21:02:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 21:02:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:02:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-06 21:02:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-06 21:02:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 400 ms
[2023-04-06 21:02:42] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 18 PT places and 18.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 121 ms.
[2023-04-06 21:02:42] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 4 ms.
[2023-04-06 21:02:42] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PGCD-COL-D05N025-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D05N025-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10092 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=229 ) properties (out of 54) seen :41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 3 rows 3 cols
[2023-04-06 21:02:43] [INFO ] Computed 2 invariants in 2 ms
[2023-04-06 21:02:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-06 21:02:44] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:6
[2023-04-06 21:02:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-06 21:02:44] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
[2023-04-06 21:02:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-06 21:02:44] [INFO ] Flatten gal took : 13 ms
[2023-04-06 21:02:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PGCD-COL-D05N025-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D05N025-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-06 21:02:44] [INFO ] Flatten gal took : 1 ms
Arc [2:1*[(MOD (ADD $x 1) 6)]] contains successor/predecessor on variables of sort CD
[2023-04-06 21:02:44] [INFO ] Unfolded HLPN to a Petri net with 18 places and 18 transitions 84 arcs in 5 ms.
[2023-04-06 21:02:44] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-04-06 21:02:44] [INFO ] Computed 7 invariants in 2 ms
[2023-04-06 21:02:44] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2023-04-06 21:02:44] [INFO ] Invariant cache hit.
[2023-04-06 21:02:44] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-06 21:02:44] [INFO ] Invariant cache hit.
[2023-04-06 21:02:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 21:02:44] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-04-06 21:02:44] [INFO ] Invariant cache hit.
[2023-04-06 21:02:44] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 18/18 places, 18/18 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-06 21:02:44] [INFO ] Flatten gal took : 4 ms
[2023-04-06 21:02:44] [INFO ] Flatten gal took : 4 ms
[2023-04-06 21:02:44] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 46) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-04-06 21:02:44] [INFO ] Invariant cache hit.
[2023-04-06 21:02:44] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-04-06 21:02:44] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 21:02:44] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:3
[2023-04-06 21:02:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-06 21:02:44] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 21:02:44] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
[2023-04-06 21:02:44] [INFO ] Flatten gal took : 3 ms
[2023-04-06 21:02:44] [INFO ] Flatten gal took : 3 ms
[2023-04-06 21:02:44] [INFO ] Input system was already deterministic with 18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 21:02:44] [INFO ] Invariant cache hit.
[2023-04-06 21:02:44] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 21:02:44] [INFO ] Flatten gal took : 3 ms
[2023-04-06 21:02:44] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:02:44] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 21:02:44] [INFO ] Invariant cache hit.
[2023-04-06 21:02:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 21:02:44] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:02:44] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:02:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 21:02:45] [INFO ] Invariant cache hit.
[2023-04-06 21:02:45] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:02:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 21:02:45] [INFO ] Invariant cache hit.
[2023-04-06 21:02:45] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 3 ms
[2023-04-06 21:02:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 21:02:45] [INFO ] Invariant cache hit.
[2023-04-06 21:02:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:02:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 21:02:45] [INFO ] Invariant cache hit.
[2023-04-06 21:02:45] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:02:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 21:02:45] [INFO ] Invariant cache hit.
[2023-04-06 21:02:45] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:02:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 21:02:45] [INFO ] Invariant cache hit.
[2023-04-06 21:02:45] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:02:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 21:02:45] [INFO ] Invariant cache hit.
[2023-04-06 21:02:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:02:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 21:02:45] [INFO ] Invariant cache hit.
[2023-04-06 21:02:45] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:02:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 21:02:45] [INFO ] Invariant cache hit.
[2023-04-06 21:02:45] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:02:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 21:02:45] [INFO ] Invariant cache hit.
[2023-04-06 21:02:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:02:45] [INFO ] Input system was already deterministic with 18 transitions.
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:02:45] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:02:45] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-04-06 21:02:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 18 transitions and 84 arcs took 1 ms.
Total runtime 3244 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 18 NrTr: 18 NrArc: 84)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.721sec


RS generation: 0m20.366sec


-> reachability set: #nodes 35891 (3.6e+04) #states 1,585,536,525,017,640 (15)



starting MCC model checker
--------------------------

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 1,585,536,525,017,640 (15)
.-> the formula is TRUE

FORMULA PGCD-COL-D05N025-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.015sec

checking: AX [EX [[~ [sum(p5, p4, p3, p2, p1, p0)<=65] | sum(p5, p4, p3, p2, p1, p0)<=21]]]
normalized: ~ [EX [~ [EX [[~ [sum(p5, p4, p3, p2, p1, p0)<=65] | sum(p5, p4, p3, p2, p1, p0)<=21]]]]]

abstracting: (sum(p5, p4, p3, p2, p1, p0)<=21)
MC time: 5m26.015sec

checking: AX [AF [[63<=sum(p17, p16, p15, p14, p13, p12) | 100<=sum(p17, p16, p15, p14, p13, p12)]]]
normalized: ~ [EX [EG [~ [[63<=sum(p17, p16, p15, p14, p13, p12) | 100<=sum(p17, p16, p15, p14, p13, p12)]]]]]

abstracting: (100<=sum(p17, p16, p15, p14, p13, p12))
MC time: 4m56.001sec

checking: EG [AG [A [AG [sum(p17, p16, p15, p14, p13, p12)<=2] U AF [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]]
normalized: EG [~ [E [true U ~ [[~ [EG [EG [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]] & ~ [E [EG [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]] U [E [true U ~ [sum(p17, p16, p15, p14, p13, p12)<=2]] & EG [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]]]]]]]]

abstracting: (sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6))
MC time: 4m29.003sec

checking: EF [EX [E [EF [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)] U ~ [EX [75<=sum(p17, p16, p15, p14, p13, p12)]]]]]
normalized: E [true U EX [E [E [true U sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)] U ~ [EX [75<=sum(p17, p16, p15, p14, p13, p12)]]]]]

abstracting: (75<=sum(p17, p16, p15, p14, p13, p12))
MC time: 4m 5.000sec

checking: EG [EX [EG [AG [[sum(p17, p16, p15, p14, p13, p12)<=92 & sum(p11, p10, p9, p8, p7, p6)<=sum(p17, p16, p15, p14, p13, p12)]]]]]
normalized: EG [EX [EG [~ [E [true U ~ [[sum(p17, p16, p15, p14, p13, p12)<=92 & sum(p11, p10, p9, p8, p7, p6)<=sum(p17, p16, p15, p14, p13, p12)]]]]]]]

abstracting: (sum(p11, p10, p9, p8, p7, p6)<=sum(p17, p16, p15, p14, p13, p12))
MC time: 3m42.000sec

checking: AG [[A [AG [~ [47<=sum(p17, p16, p15, p14, p13, p12)]] U sum(p11, p10, p9, p8, p7, p6)<=sum(p17, p16, p15, p14, p13, p12)] | [~ [43<=sum(p11, p10, p9, p8, p7, p6)] & EF [AX [1<=0]]]]]
normalized: ~ [E [true U ~ [[[E [true U ~ [EX [~ [1<=0]]]] & ~ [43<=sum(p11, p10, p9, p8, p7, p6)]] | [~ [EG [~ [sum(p11, p10, p9, p8, p7, p6)<=sum(p17, p16, p15, p14, p13, p12)]]] & ~ [E [~ [sum(p11, p10, p9, p8, p7, p6)<=sum(p17, p16, p15, p14, p13, p12)] U [E [true U 47<=sum(p17, p16, p15, p14, p13, p12)] & ~ [sum(p11, p10, p9, p8, p7, p6)<=sum(p17, p16, p15, p14, p13, p12)]]]]]]]]]

abstracting: (sum(p11, p10, p9, p8, p7, p6)<=sum(p17, p16, p15, p14, p13, p12))
MC time: 3m22.000sec

checking: EX [[~ [A [[[sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0) | 87<=sum(p11, p10, p9, p8, p7, p6)] & sum(p17, p16, p15, p14, p13, p12)<=75] U ~ [[sum(p11, p10, p9, p8, p7, p6)<=67 & EF [2<=sum(p11, p10, p9, p8, p7, p6)]]]]] & ~ [sum(p11, p10, p9, p8, p7, p6)<=89]]]
normalized: EX [[~ [sum(p11, p10, p9, p8, p7, p6)<=89] & ~ [[~ [EG [[sum(p11, p10, p9, p8, p7, p6)<=67 & E [true U 2<=sum(p11, p10, p9, p8, p7, p6)]]]] & ~ [E [[sum(p11, p10, p9, p8, p7, p6)<=67 & E [true U 2<=sum(p11, p10, p9, p8, p7, p6)]] U [~ [[sum(p17, p16, p15, p14, p13, p12)<=75 & [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0) | 87<=sum(p11, p10, p9, p8, p7, p6)]]] & [sum(p11, p10, p9, p8, p7, p6)<=67 & E [true U 2<=sum(p11, p10, p9, p8, p7, p6)]]]]]]]]]

abstracting: (2<=sum(p11, p10, p9, p8, p7, p6))
MC time: 3m 4.001sec

checking: AG [[[EF [[86<=sum(p17, p16, p15, p14, p13, p12) & 79<=sum(p5, p4, p3, p2, p1, p0)]] | sum(p5, p4, p3, p2, p1, p0)<=20] | [[AF [EX [sum(p5, p4, p3, p2, p1, p0)<=37]] & EF [sum(p17, p16, p15, p14, p13, p12)<=sum(p11, p10, p9, p8, p7, p6)]] | [sum(p11, p10, p9, p8, p7, p6)<=1 & AG [[21<=sum(p17, p16, p15, p14, p13, p12) & 23<=sum(p11, p10, p9, p8, p7, p6)]]]]]]
normalized: ~ [E [true U ~ [[[[sum(p11, p10, p9, p8, p7, p6)<=1 & ~ [E [true U ~ [[21<=sum(p17, p16, p15, p14, p13, p12) & 23<=sum(p11, p10, p9, p8, p7, p6)]]]]] | [E [true U sum(p17, p16, p15, p14, p13, p12)<=sum(p11, p10, p9, p8, p7, p6)] & ~ [EG [~ [EX [sum(p5, p4, p3, p2, p1, p0)<=37]]]]]] | [sum(p5, p4, p3, p2, p1, p0)<=20 | E [true U [86<=sum(p17, p16, p15, p14, p13, p12) & 79<=sum(p5, p4, p3, p2, p1, p0)]]]]]]]

abstracting: (79<=sum(p5, p4, p3, p2, p1, p0))
MC time: 2m47.000sec

checking: [EG [[[EG [~ [63<=sum(p5, p4, p3, p2, p1, p0)]] | ~ [26<=sum(p11, p10, p9, p8, p7, p6)]] | [~ [6<=sum(p17, p16, p15, p14, p13, p12)] | [[~ [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)] | ~ [67<=sum(p11, p10, p9, p8, p7, p6)]] & sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]] | EG [sum(p17, p16, p15, p14, p13, p12)<=sum(p11, p10, p9, p8, p7, p6)]]
normalized: [EG [sum(p17, p16, p15, p14, p13, p12)<=sum(p11, p10, p9, p8, p7, p6)] | EG [[[[sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6) & [~ [67<=sum(p11, p10, p9, p8, p7, p6)] | ~ [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)]]] | ~ [6<=sum(p17, p16, p15, p14, p13, p12)]] | [~ [26<=sum(p11, p10, p9, p8, p7, p6)] | EG [~ [63<=sum(p5, p4, p3, p2, p1, p0)]]]]]]

abstracting: (63<=sum(p5, p4, p3, p2, p1, p0))
MC time: 2m32.000sec

checking: [AF [[EX [~ [sum(p17, p16, p15, p14, p13, p12)<=34]] & [[~ [sum(p17, p16, p15, p14, p13, p12)<=56] | ~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]] & A [[EX [sum(p5, p4, p3, p2, p1, p0)<=36] | [AG [10<=sum(p5, p4, p3, p2, p1, p0)] | EG [sum(p11, p10, p9, p8, p7, p6)<=40]]] U [~ [EG [sum(p11, p10, p9, p8, p7, p6)<=52]] | AX [sum(p17, p16, p15, p14, p13, p12)<=90]]]]]] | AX [~ [6<=sum(p17, p16, p15, p14, p13, p12)]]]
normalized: [~ [EX [6<=sum(p17, p16, p15, p14, p13, p12)]] | ~ [EG [~ [[[[~ [EG [~ [[~ [EX [~ [sum(p17, p16, p15, p14, p13, p12)<=90]]] | ~ [EG [sum(p11, p10, p9, p8, p7, p6)<=52]]]]]] & ~ [E [~ [[~ [EX [~ [sum(p17, p16, p15, p14, p13, p12)<=90]]] | ~ [EG [sum(p11, p10, p9, p8, p7, p6)<=52]]]] U [~ [[[EG [sum(p11, p10, p9, p8, p7, p6)<=40] | ~ [E [true U ~ [10<=sum(p5, p4, p3, p2, p1, p0)]]]] | EX [sum(p5, p4, p3, p2, p1, p0)<=36]]] & ~ [[~ [EX [~ [sum(p17, p16, p15, p14, p13, p12)<=90]]] | ~ [EG [sum(p11, p10, p9, p8, p7, p6)<=52]]]]]]]] & [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)] | ~ [sum(p17, p16, p15, p14, p13, p12)<=56]]] & EX [~ [sum(p17, p16, p15, p14, p13, p12)<=34]]]]]]]

abstracting: (sum(p17, p16, p15, p14, p13, p12)<=34)
MC time: 2m18.000sec

checking: A [[EX [[~ [EF [47<=sum(p5, p4, p3, p2, p1, p0)]] | ~ [EG [sum(p5, p4, p3, p2, p1, p0)<=31]]]] | ~ [[EG [~ [sum(p5, p4, p3, p2, p1, p0)<=4]] | EF [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)]]]] U [~ [EF [[[sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0) | sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)] | AF [73<=sum(p11, p10, p9, p8, p7, p6)]]]] | [A [[sum(p5, p4, p3, p2, p1, p0)<=75 | sum(p17, p16, p15, p14, p13, p12)<=78] U AX [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]] & sum(p17, p16, p15, p14, p13, p12)<=80]]]
normalized: [~ [EG [~ [[[sum(p17, p16, p15, p14, p13, p12)<=80 & [~ [EG [EX [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]] & ~ [E [EX [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]] U [~ [[sum(p5, p4, p3, p2, p1, p0)<=75 | sum(p17, p16, p15, p14, p13, p12)<=78]] & EX [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]]]]] | ~ [E [true U [~ [EG [~ [73<=sum(p11, p10, p9, p8, p7, p6)]]] | [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0) | sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)]]]]]]]] & ~ [E [~ [[[sum(p17, p16, p15, p14, p13, p12)<=80 & [~ [EG [EX [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]] & ~ [E [EX [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]] U [~ [[sum(p5, p4, p3, p2, p1, p0)<=75 | sum(p17, p16, p15, p14, p13, p12)<=78]] & EX [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]]]]] | ~ [E [true U [~ [EG [~ [73<=sum(p11, p10, p9, p8, p7, p6)]]] | [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0) | sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)]]]]]] U [~ [[~ [[E [true U sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)] | EG [~ [sum(p5, p4, p3, p2, p1, p0)<=4]]]] | EX [[~ [EG [sum(p5, p4, p3, p2, p1, p0)<=31]] | ~ [E [true U 47<=sum(p5, p4, p3, p2, p1, p0)]]]]]] & ~ [[[sum(p17, p16, p15, p14, p13, p12)<=80 & [~ [EG [EX [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]] & ~ [E [EX [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]] U [~ [[sum(p5, p4, p3, p2, p1, p0)<=75 | sum(p17, p16, p15, p14, p13, p12)<=78]] & EX [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]]]]] | ~ [E [true U [~ [EG [~ [73<=sum(p11, p10, p9, p8, p7, p6)]]] | [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0) | sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)]]]]]]]]]]

abstracting: (sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9750192 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16106360 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:28101 (1561), effective:9917 (550)

initing FirstDep: 0m 0.000sec


idd.h:1025: Timeout: after 325 sec


idd.h:1025: Timeout: after 295 sec


idd.h:1025: Timeout: after 268 sec


idd.h:1025: Timeout: after 244 sec


idd.h:1025: Timeout: after 221 sec


idd.h:1025: Timeout: after 201 sec


idd.h:1025: Timeout: after 183 sec


idd.h:1025: Timeout: after 166 sec


idd.h:1025: Timeout: after 151 sec


idd.h:1025: Timeout: after 137 sec


idd.h:1025: Timeout: after 125 sec

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="PGCD-COL-D05N025"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is PGCD-COL-D05N025, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-167987247300425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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