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-167987247100274.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 EisenbergMcGuire-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 EisenbergMcGuire-PT-10-CTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-10-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680835556822

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 02:45:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 02:45:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 02:45:58] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2023-04-07 02:45:58] [INFO ] Transformed 1090 places.
[2023-04-07 02:45:58] [INFO ] Transformed 5200 transitions.
[2023-04-07 02:45:58] [INFO ] Found NUPN structural information;
[2023-04-07 02:45:58] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 318 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 110 out of 1090 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 77 place count 1013 transition count 4430
Iterating global reduction 0 with 77 rules applied. Total rules applied 154 place count 1013 transition count 4430
Applied a total of 154 rules in 350 ms. Remains 1013 /1090 variables (removed 77) and now considering 4430/5200 (removed 770) transitions.
[2023-04-07 02:45:59] [INFO ] Flow matrix only has 1560 transitions (discarded 2870 similar events)
// Phase 1: matrix 1560 rows 1013 cols
[2023-04-07 02:45:59] [INFO ] Computed 31 invariants in 32 ms
[2023-04-07 02:45:59] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-04-07 02:45:59] [INFO ] Flow matrix only has 1560 transitions (discarded 2870 similar events)
[2023-04-07 02:45:59] [INFO ] Invariant cache hit.
[2023-04-07 02:46:00] [INFO ] State equation strengthened by 553 read => feed constraints.
[2023-04-07 02:46:04] [INFO ] Implicit Places using invariants and state equation in 4577 ms returned []
Implicit Place search using SMT with State Equation took 5238 ms to find 0 implicit places.
[2023-04-07 02:46:04] [INFO ] Flow matrix only has 1560 transitions (discarded 2870 similar events)
[2023-04-07 02:46:04] [INFO ] Invariant cache hit.
[2023-04-07 02:46:05] [INFO ] Dead Transitions using invariants and state equation in 1380 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1013/1090 places, 4430/5200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6974 ms. Remains : 1013/1090 places, 4430/5200 transitions.
Support contains 110 out of 1013 places after structural reductions.
[2023-04-07 02:46:06] [INFO ] Flatten gal took : 315 ms
[2023-04-07 02:46:06] [INFO ] Flatten gal took : 165 ms
[2023-04-07 02:46:06] [INFO ] Input system was already deterministic with 4430 transitions.
Support contains 109 out of 1013 places (down from 110) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 68) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 56) seen :0
Running SMT prover for 56 properties.
[2023-04-07 02:46:07] [INFO ] Flow matrix only has 1560 transitions (discarded 2870 similar events)
[2023-04-07 02:46:07] [INFO ] Invariant cache hit.
[2023-04-07 02:46:09] [INFO ] [Real]Absence check using 21 positive place invariants in 31 ms returned sat
[2023-04-07 02:46:09] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 02:46:09] [INFO ] After 1298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:56
[2023-04-07 02:46:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 26 ms returned sat
[2023-04-07 02:46:10] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 02:46:14] [INFO ] After 3856ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :54
[2023-04-07 02:46:14] [INFO ] State equation strengthened by 553 read => feed constraints.
[2023-04-07 02:46:20] [INFO ] After 5082ms SMT Verify possible using 553 Read/Feed constraints in natural domain returned unsat :2 sat :54
[2023-04-07 02:46:20] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 6 ms to minimize.
[2023-04-07 02:46:20] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 1 ms to minimize.
[2023-04-07 02:46:21] [INFO ] Deduced a trap composed of 3 places in 350 ms of which 2 ms to minimize.
[2023-04-07 02:46:21] [INFO ] Deduced a trap composed of 3 places in 315 ms of which 1 ms to minimize.
[2023-04-07 02:46:21] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 0 ms to minimize.
[2023-04-07 02:46:22] [INFO ] Deduced a trap composed of 108 places in 164 ms of which 1 ms to minimize.
[2023-04-07 02:46:22] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 0 ms to minimize.
[2023-04-07 02:46:22] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2023-04-07 02:46:22] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 0 ms to minimize.
[2023-04-07 02:46:22] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 0 ms to minimize.
[2023-04-07 02:46:23] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2023-04-07 02:46:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2984 ms
[2023-04-07 02:46:23] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2023-04-07 02:46:23] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 0 ms to minimize.
[2023-04-07 02:46:23] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 0 ms to minimize.
[2023-04-07 02:46:23] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 0 ms to minimize.
[2023-04-07 02:46:24] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2023-04-07 02:46:24] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 0 ms to minimize.
[2023-04-07 02:46:24] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 0 ms to minimize.
[2023-04-07 02:46:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1458 ms
[2023-04-07 02:46:24] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 0 ms to minimize.
[2023-04-07 02:46:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-04-07 02:46:25] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2023-04-07 02:46:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-04-07 02:46:25] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 0 ms to minimize.
[2023-04-07 02:46:25] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 1 ms to minimize.
[2023-04-07 02:46:25] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 0 ms to minimize.
[2023-04-07 02:46:26] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 0 ms to minimize.
[2023-04-07 02:46:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 826 ms
[2023-04-07 02:46:26] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 0 ms to minimize.
[2023-04-07 02:46:26] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 0 ms to minimize.
[2023-04-07 02:46:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 374 ms
[2023-04-07 02:46:26] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 1 ms to minimize.
[2023-04-07 02:46:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-04-07 02:46:27] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 1 ms to minimize.
[2023-04-07 02:46:27] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2023-04-07 02:46:27] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 0 ms to minimize.
[2023-04-07 02:46:27] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2023-04-07 02:46:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 820 ms
[2023-04-07 02:46:28] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 0 ms to minimize.
[2023-04-07 02:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-04-07 02:46:29] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-07 02:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-04-07 02:46:29] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2023-04-07 02:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-04-07 02:46:30] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 1 ms to minimize.
[2023-04-07 02:46:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-04-07 02:46:31] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2023-04-07 02:46:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-04-07 02:46:32] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 0 ms to minimize.
[2023-04-07 02:46:32] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2023-04-07 02:46:32] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2023-04-07 02:46:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 539 ms
[2023-04-07 02:46:32] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 1 ms to minimize.
[2023-04-07 02:46:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-04-07 02:46:34] [INFO ] After 19332ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :53
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-04-07 02:46:34] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :53
Fused 56 Parikh solutions to 54 different solutions.
Parikh walk visited 0 properties in 2293 ms.
Support contains 90 out of 1013 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1013 transition count 4427
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1010 transition count 4427
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 300 Pre rules applied. Total rules applied 6 place count 1010 transition count 4127
Deduced a syphon composed of 300 places in 4 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 606 place count 710 transition count 4127
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 610 place count 706 transition count 4087
Iterating global reduction 2 with 4 rules applied. Total rules applied 614 place count 706 transition count 4087
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 792 place count 617 transition count 3998
Applied a total of 792 rules in 463 ms. Remains 617 /1013 variables (removed 396) and now considering 3998/4430 (removed 432) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 617/1013 places, 3998/4430 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Interrupted probabilistic random walk after 149490 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{3=1, 6=1, 10=1, 12=1, 15=1, 18=1, 20=1, 25=1, 28=1, 53=1}
Probabilistic random walk after 149490 steps, saw 107499 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :10
Running SMT prover for 44 properties.
[2023-04-07 02:46:40] [INFO ] Flow matrix only has 1128 transitions (discarded 2870 similar events)
// Phase 1: matrix 1128 rows 617 cols
[2023-04-07 02:46:40] [INFO ] Computed 31 invariants in 6 ms
[2023-04-07 02:46:40] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-04-07 02:46:40] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 02:46:41] [INFO ] After 553ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:44
[2023-04-07 02:46:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-07 02:46:41] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2023-04-07 02:46:43] [INFO ] After 2085ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :44
[2023-04-07 02:46:43] [INFO ] State equation strengthened by 517 read => feed constraints.
[2023-04-07 02:46:46] [INFO ] After 2597ms SMT Verify possible using 517 Read/Feed constraints in natural domain returned unsat :0 sat :44
[2023-04-07 02:46:46] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2023-04-07 02:46:47] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 0 ms to minimize.
[2023-04-07 02:46:47] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 1 ms to minimize.
[2023-04-07 02:46:47] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 0 ms to minimize.
[2023-04-07 02:46:47] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2023-04-07 02:46:47] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2023-04-07 02:46:47] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2023-04-07 02:46:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1306 ms
[2023-04-07 02:46:48] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2023-04-07 02:46:48] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 0 ms to minimize.
[2023-04-07 02:46:48] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 1 ms to minimize.
[2023-04-07 02:46:48] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 1 ms to minimize.
[2023-04-07 02:46:48] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2023-04-07 02:46:49] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 0 ms to minimize.
[2023-04-07 02:46:49] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2023-04-07 02:46:49] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 1 ms to minimize.
[2023-04-07 02:46:49] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 0 ms to minimize.
[2023-04-07 02:46:49] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 11 ms to minimize.
[2023-04-07 02:46:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1948 ms
[2023-04-07 02:46:50] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2023-04-07 02:46:50] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 0 ms to minimize.
[2023-04-07 02:46:50] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 1 ms to minimize.
[2023-04-07 02:46:50] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2023-04-07 02:46:50] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 0 ms to minimize.
[2023-04-07 02:46:50] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2023-04-07 02:46:51] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-04-07 02:46:51] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 0 ms to minimize.
[2023-04-07 02:46:51] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 3 ms to minimize.
[2023-04-07 02:46:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1598 ms
[2023-04-07 02:46:51] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 0 ms to minimize.
[2023-04-07 02:46:51] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2023-04-07 02:46:52] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2023-04-07 02:46:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 599 ms
[2023-04-07 02:46:52] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:46:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-04-07 02:46:52] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-07 02:46:52] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2023-04-07 02:46:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 291 ms
[2023-04-07 02:46:53] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2023-04-07 02:46:53] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2023-04-07 02:46:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2023-04-07 02:46:53] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 0 ms to minimize.
[2023-04-07 02:46:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-04-07 02:46:53] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 0 ms to minimize.
[2023-04-07 02:46:53] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 0 ms to minimize.
[2023-04-07 02:46:53] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:46:54] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:46:54] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2023-04-07 02:46:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 677 ms
[2023-04-07 02:46:54] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2023-04-07 02:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-04-07 02:46:54] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2023-04-07 02:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-04-07 02:46:55] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2023-04-07 02:46:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-04-07 02:46:55] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 0 ms to minimize.
[2023-04-07 02:46:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-04-07 02:46:55] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 1 ms to minimize.
[2023-04-07 02:46:55] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2023-04-07 02:46:56] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:46:56] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2023-04-07 02:46:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 604 ms
[2023-04-07 02:46:56] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 0 ms to minimize.
[2023-04-07 02:46:56] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2023-04-07 02:46:56] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2023-04-07 02:46:56] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2023-04-07 02:46:56] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2023-04-07 02:46:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 630 ms
[2023-04-07 02:46:57] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2023-04-07 02:46:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-04-07 02:46:59] [INFO ] Deduced a trap composed of 72 places in 296 ms of which 1 ms to minimize.
[2023-04-07 02:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2023-04-07 02:46:59] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-04-07 02:47:00] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 0 ms to minimize.
[2023-04-07 02:47:00] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-07 02:47:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2023-04-07 02:47:00] [INFO ] After 16397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :44
Attempting to minimize the solution found.
Minimization took 2820 ms.
[2023-04-07 02:47:03] [INFO ] After 22169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :44
Parikh walk visited 0 properties in 369 ms.
Support contains 76 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 3998/3998 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 617 transition count 3990
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 609 transition count 3990
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 607 transition count 3970
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 607 transition count 3970
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 606 transition count 3969
Applied a total of 22 rules in 268 ms. Remains 606 /617 variables (removed 11) and now considering 3969/3998 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 606/617 places, 3969/3998 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Interrupted probabilistic random walk after 135916 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135916 steps, saw 98758 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 44 properties.
[2023-04-07 02:47:07] [INFO ] Flow matrix only has 1099 transitions (discarded 2870 similar events)
// Phase 1: matrix 1099 rows 606 cols
[2023-04-07 02:47:07] [INFO ] Computed 31 invariants in 8 ms
[2023-04-07 02:47:07] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-07 02:47:07] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 02:47:07] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:44
[2023-04-07 02:47:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-07 02:47:08] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 02:47:10] [INFO ] After 1946ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :44
[2023-04-07 02:47:10] [INFO ] State equation strengthened by 499 read => feed constraints.
[2023-04-07 02:47:13] [INFO ] After 2686ms SMT Verify possible using 499 Read/Feed constraints in natural domain returned unsat :0 sat :44
[2023-04-07 02:47:13] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 0 ms to minimize.
[2023-04-07 02:47:13] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 0 ms to minimize.
[2023-04-07 02:47:13] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 1 ms to minimize.
[2023-04-07 02:47:14] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 1 ms to minimize.
[2023-04-07 02:47:14] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-04-07 02:47:14] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
[2023-04-07 02:47:14] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2023-04-07 02:47:14] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2023-04-07 02:47:14] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-04-07 02:47:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1566 ms
[2023-04-07 02:47:15] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 1 ms to minimize.
[2023-04-07 02:47:15] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 0 ms to minimize.
[2023-04-07 02:47:15] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 1 ms to minimize.
[2023-04-07 02:47:15] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 0 ms to minimize.
[2023-04-07 02:47:15] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-04-07 02:47:16] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 0 ms to minimize.
[2023-04-07 02:47:16] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2023-04-07 02:47:16] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 0 ms to minimize.
[2023-04-07 02:47:16] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2023-04-07 02:47:16] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2023-04-07 02:47:16] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2023-04-07 02:47:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1972 ms
[2023-04-07 02:47:17] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 0 ms to minimize.
[2023-04-07 02:47:17] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2023-04-07 02:47:17] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2023-04-07 02:47:17] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2023-04-07 02:47:17] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2023-04-07 02:47:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 815 ms
[2023-04-07 02:47:18] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-04-07 02:47:18] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2023-04-07 02:47:18] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-04-07 02:47:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 494 ms
[2023-04-07 02:47:18] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2023-04-07 02:47:18] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2023-04-07 02:47:18] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2023-04-07 02:47:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 435 ms
[2023-04-07 02:47:19] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 0 ms to minimize.
[2023-04-07 02:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-04-07 02:47:19] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 0 ms to minimize.
[2023-04-07 02:47:19] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2023-04-07 02:47:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 291 ms
[2023-04-07 02:47:19] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2023-04-07 02:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-04-07 02:47:19] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2023-04-07 02:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-04-07 02:47:20] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2023-04-07 02:47:20] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 0 ms to minimize.
[2023-04-07 02:47:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 311 ms
[2023-04-07 02:47:20] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 0 ms to minimize.
[2023-04-07 02:47:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-04-07 02:47:20] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2023-04-07 02:47:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-04-07 02:47:21] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2023-04-07 02:47:21] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 0 ms to minimize.
[2023-04-07 02:47:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2023-04-07 02:47:22] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2023-04-07 02:47:22] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2023-04-07 02:47:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2023-04-07 02:47:23] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2023-04-07 02:47:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-04-07 02:47:23] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2023-04-07 02:47:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-04-07 02:47:24] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 0 ms to minimize.
[2023-04-07 02:47:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-04-07 02:47:24] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2023-04-07 02:47:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-04-07 02:47:24] [INFO ] After 14295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :44
Attempting to minimize the solution found.
Minimization took 2576 ms.
[2023-04-07 02:47:27] [INFO ] After 19672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :44
Parikh walk visited 0 properties in 356 ms.
Support contains 76 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 3969/3969 transitions.
Applied a total of 0 rules in 142 ms. Remains 606 /606 variables (removed 0) and now considering 3969/3969 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 606/606 places, 3969/3969 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 3969/3969 transitions.
Applied a total of 0 rules in 136 ms. Remains 606 /606 variables (removed 0) and now considering 3969/3969 (removed 0) transitions.
[2023-04-07 02:47:28] [INFO ] Flow matrix only has 1099 transitions (discarded 2870 similar events)
[2023-04-07 02:47:28] [INFO ] Invariant cache hit.
[2023-04-07 02:47:28] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-04-07 02:47:28] [INFO ] Flow matrix only has 1099 transitions (discarded 2870 similar events)
[2023-04-07 02:47:28] [INFO ] Invariant cache hit.
[2023-04-07 02:47:28] [INFO ] State equation strengthened by 499 read => feed constraints.
[2023-04-07 02:47:31] [INFO ] Implicit Places using invariants and state equation in 2974 ms returned []
Implicit Place search using SMT with State Equation took 3345 ms to find 0 implicit places.
[2023-04-07 02:47:31] [INFO ] Redundant transitions in 243 ms returned []
[2023-04-07 02:47:31] [INFO ] Flow matrix only has 1099 transitions (discarded 2870 similar events)
[2023-04-07 02:47:31] [INFO ] Invariant cache hit.
[2023-04-07 02:47:32] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4830 ms. Remains : 606/606 places, 3969/3969 transitions.
Graph (trivial) has 2722 edges and 606 vertex of which 98 / 606 are part of one of the 10 SCC in 5 ms
Free SCC test removed 88 places
Drop transitions removed 332 transitions
Ensure Unique test removed 2849 transitions
Reduce isomorphic transitions removed 3181 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 518 transition count 696
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 186 place count 426 transition count 695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 187 place count 425 transition count 695
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 187 place count 425 transition count 677
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 230 place count 400 transition count 677
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 518 place count 256 transition count 533
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 560 place count 256 transition count 491
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 562 place count 255 transition count 496
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 568 place count 255 transition count 490
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 599 place count 255 transition count 459
Free-agglomeration rule applied 113 times.
Iterating global reduction 5 with 113 rules applied. Total rules applied 712 place count 255 transition count 346
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 5 with 113 rules applied. Total rules applied 825 place count 142 transition count 346
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 834 place count 142 transition count 346
Applied a total of 834 rules in 66 ms. Remains 142 /606 variables (removed 464) and now considering 346/3969 (removed 3623) transitions.
Running SMT prover for 44 properties.
// Phase 1: matrix 346 rows 142 cols
[2023-04-07 02:47:32] [INFO ] Computed 24 invariants in 2 ms
[2023-04-07 02:47:33] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-04-07 02:47:33] [INFO ] [Real]Absence check using 21 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 02:47:33] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:44
[2023-04-07 02:47:33] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-07 02:47:33] [INFO ] [Nat]Absence check using 21 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-07 02:47:34] [INFO ] After 574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :44
[2023-04-07 02:47:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-07 02:47:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-04-07 02:47:34] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-04-07 02:47:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-04-07 02:47:34] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-04-07 02:47:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 200 ms
[2023-04-07 02:47:34] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-04-07 02:47:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-07 02:47:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-04-07 02:47:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-04-07 02:47:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-04-07 02:47:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-04-07 02:47:35] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-04-07 02:47:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-04-07 02:47:35] [INFO ] After 1721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :44
Attempting to minimize the solution found.
Minimization took 518 ms.
[2023-04-07 02:47:35] [INFO ] After 2471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :44
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-10-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 02:47:35] [INFO ] Flatten gal took : 143 ms
[2023-04-07 02:47:36] [INFO ] Flatten gal took : 145 ms
[2023-04-07 02:47:36] [INFO ] Input system was already deterministic with 4430 transitions.
Support contains 103 out of 1013 places (down from 104) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1013 transition count 4420
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1003 transition count 4420
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 1003 transition count 4110
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 693 transition count 4110
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 653 place count 680 transition count 3980
Iterating global reduction 2 with 13 rules applied. Total rules applied 666 place count 680 transition count 3980
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 846 place count 590 transition count 3890
Applied a total of 846 rules in 375 ms. Remains 590 /1013 variables (removed 423) and now considering 3890/4430 (removed 540) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 390 ms. Remains : 590/1013 places, 3890/4430 transitions.
[2023-04-07 02:47:36] [INFO ] Flatten gal took : 94 ms
[2023-04-07 02:47:37] [INFO ] Flatten gal took : 96 ms
[2023-04-07 02:47:37] [INFO ] Input system was already deterministic with 3890 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1013 transition count 4420
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1003 transition count 4420
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 1003 transition count 4112
Deduced a syphon composed of 308 places in 3 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 695 transition count 4112
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 648 place count 683 transition count 3992
Iterating global reduction 2 with 12 rules applied. Total rules applied 660 place count 683 transition count 3992
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 838 place count 594 transition count 3903
Applied a total of 838 rules in 295 ms. Remains 594 /1013 variables (removed 419) and now considering 3903/4430 (removed 527) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 296 ms. Remains : 594/1013 places, 3903/4430 transitions.
[2023-04-07 02:47:37] [INFO ] Flatten gal took : 95 ms
[2023-04-07 02:47:37] [INFO ] Flatten gal took : 99 ms
[2023-04-07 02:47:37] [INFO ] Input system was already deterministic with 3903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1001 transition count 4310
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1001 transition count 4310
Applied a total of 24 rules in 62 ms. Remains 1001 /1013 variables (removed 12) and now considering 4310/4430 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 1001/1013 places, 4310/4430 transitions.
[2023-04-07 02:47:38] [INFO ] Flatten gal took : 88 ms
[2023-04-07 02:47:38] [INFO ] Flatten gal took : 99 ms
[2023-04-07 02:47:38] [INFO ] Input system was already deterministic with 4310 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1000 transition count 4300
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1000 transition count 4300
Applied a total of 26 rules in 51 ms. Remains 1000 /1013 variables (removed 13) and now considering 4300/4430 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 1000/1013 places, 4300/4430 transitions.
[2023-04-07 02:47:38] [INFO ] Flatten gal took : 86 ms
[2023-04-07 02:47:38] [INFO ] Flatten gal took : 110 ms
[2023-04-07 02:47:38] [INFO ] Input system was already deterministic with 4300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1001 transition count 4310
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1001 transition count 4310
Applied a total of 24 rules in 61 ms. Remains 1001 /1013 variables (removed 12) and now considering 4310/4430 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 1001/1013 places, 4310/4430 transitions.
[2023-04-07 02:47:38] [INFO ] Flatten gal took : 94 ms
[2023-04-07 02:47:39] [INFO ] Flatten gal took : 110 ms
[2023-04-07 02:47:39] [INFO ] Input system was already deterministic with 4310 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1013 transition count 4420
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1003 transition count 4420
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 1003 transition count 4112
Deduced a syphon composed of 308 places in 3 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 695 transition count 4112
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 648 place count 683 transition count 3992
Iterating global reduction 2 with 12 rules applied. Total rules applied 660 place count 683 transition count 3992
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 840 place count 593 transition count 3902
Applied a total of 840 rules in 256 ms. Remains 593 /1013 variables (removed 420) and now considering 3902/4430 (removed 528) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 257 ms. Remains : 593/1013 places, 3902/4430 transitions.
[2023-04-07 02:47:39] [INFO ] Flatten gal took : 80 ms
[2023-04-07 02:47:39] [INFO ] Flatten gal took : 87 ms
[2023-04-07 02:47:39] [INFO ] Input system was already deterministic with 3902 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1002 transition count 4320
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1002 transition count 4320
Applied a total of 22 rules in 52 ms. Remains 1002 /1013 variables (removed 11) and now considering 4320/4430 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 1002/1013 places, 4320/4430 transitions.
[2023-04-07 02:47:40] [INFO ] Flatten gal took : 85 ms
[2023-04-07 02:47:40] [INFO ] Flatten gal took : 95 ms
[2023-04-07 02:47:40] [INFO ] Input system was already deterministic with 4320 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1001 transition count 4310
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1001 transition count 4310
Applied a total of 24 rules in 51 ms. Remains 1001 /1013 variables (removed 12) and now considering 4310/4430 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 1001/1013 places, 4310/4430 transitions.
[2023-04-07 02:47:40] [INFO ] Flatten gal took : 83 ms
[2023-04-07 02:47:40] [INFO ] Flatten gal took : 92 ms
[2023-04-07 02:47:40] [INFO ] Input system was already deterministic with 4310 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1000 transition count 4300
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1000 transition count 4300
Applied a total of 26 rules in 59 ms. Remains 1000 /1013 variables (removed 13) and now considering 4300/4430 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 1000/1013 places, 4300/4430 transitions.
[2023-04-07 02:47:40] [INFO ] Flatten gal took : 86 ms
[2023-04-07 02:47:41] [INFO ] Flatten gal took : 98 ms
[2023-04-07 02:47:41] [INFO ] Input system was already deterministic with 4300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1002 transition count 4320
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1002 transition count 4320
Applied a total of 22 rules in 50 ms. Remains 1002 /1013 variables (removed 11) and now considering 4320/4430 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 1002/1013 places, 4320/4430 transitions.
[2023-04-07 02:47:41] [INFO ] Flatten gal took : 81 ms
[2023-04-07 02:47:41] [INFO ] Flatten gal took : 91 ms
[2023-04-07 02:47:41] [INFO ] Input system was already deterministic with 4320 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1013 transition count 4421
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 1004 transition count 4421
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 18 place count 1004 transition count 4113
Deduced a syphon composed of 308 places in 3 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 634 place count 696 transition count 4113
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 645 place count 685 transition count 4003
Iterating global reduction 2 with 11 rules applied. Total rules applied 656 place count 685 transition count 4003
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 836 place count 595 transition count 3913
Applied a total of 836 rules in 280 ms. Remains 595 /1013 variables (removed 418) and now considering 3913/4430 (removed 517) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 280 ms. Remains : 595/1013 places, 3913/4430 transitions.
[2023-04-07 02:47:41] [INFO ] Flatten gal took : 76 ms
[2023-04-07 02:47:42] [INFO ] Flatten gal took : 90 ms
[2023-04-07 02:47:42] [INFO ] Input system was already deterministic with 3913 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1000 transition count 4300
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1000 transition count 4300
Applied a total of 26 rules in 50 ms. Remains 1000 /1013 variables (removed 13) and now considering 4300/4430 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 1000/1013 places, 4300/4430 transitions.
[2023-04-07 02:47:42] [INFO ] Flatten gal took : 80 ms
[2023-04-07 02:47:42] [INFO ] Flatten gal took : 95 ms
[2023-04-07 02:47:42] [INFO ] Input system was already deterministic with 4300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1001 transition count 4310
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1001 transition count 4310
Applied a total of 24 rules in 51 ms. Remains 1001 /1013 variables (removed 12) and now considering 4310/4430 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 1001/1013 places, 4310/4430 transitions.
[2023-04-07 02:47:42] [INFO ] Flatten gal took : 78 ms
[2023-04-07 02:47:42] [INFO ] Flatten gal took : 89 ms
[2023-04-07 02:47:43] [INFO ] Input system was already deterministic with 4310 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1000 transition count 4300
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1000 transition count 4300
Applied a total of 26 rules in 59 ms. Remains 1000 /1013 variables (removed 13) and now considering 4300/4430 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 1000/1013 places, 4300/4430 transitions.
[2023-04-07 02:47:43] [INFO ] Flatten gal took : 85 ms
[2023-04-07 02:47:43] [INFO ] Flatten gal took : 99 ms
[2023-04-07 02:47:43] [INFO ] Input system was already deterministic with 4300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 4430/4430 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1001 transition count 4310
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1001 transition count 4310
Applied a total of 24 rules in 51 ms. Remains 1001 /1013 variables (removed 12) and now considering 4310/4430 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 1001/1013 places, 4310/4430 transitions.
[2023-04-07 02:47:43] [INFO ] Flatten gal took : 82 ms
[2023-04-07 02:47:43] [INFO ] Flatten gal took : 91 ms
[2023-04-07 02:47:43] [INFO ] Input system was already deterministic with 4310 transitions.
[2023-04-07 02:47:44] [INFO ] Flatten gal took : 111 ms
[2023-04-07 02:47:44] [INFO ] Flatten gal took : 91 ms
[2023-04-07 02:47:44] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-04-07 02:47:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1013 places, 4430 transitions and 22320 arcs took 21 ms.
Total runtime 105899 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 1013 NrTr: 4430 NrArc: 22320)

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

net check time: 0m 0.003sec

init dd package: 0m 2.674sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9728756 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100268 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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.039sec

55684 90769 122329 154741 149777 178649 421805 346278 543970 698619 695138 795748 1556283

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="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="CTLFireability"
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 EisenbergMcGuire-PT-10, examination is CTLFireability"
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-167987247100274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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