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.r138-smll-167819420200305.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 DiscoveryGPU-PT-07b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420200305
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 8.0K Feb 25 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 54K Mar 5 18:22 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 DiscoveryGPU-PT-07b-CTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678738586545

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:16:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 20:16:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:16:29] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-13 20:16:29] [INFO ] Transformed 212 places.
[2023-03-13 20:16:29] [INFO ] Transformed 224 transitions.
[2023-03-13 20:16:29] [INFO ] Found NUPN structural information;
[2023-03-13 20:16:29] [INFO ] Parsed PT model containing 212 places and 224 transitions and 582 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 202 transition count 224
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 20 place count 192 transition count 214
Iterating global reduction 1 with 10 rules applied. Total rules applied 30 place count 192 transition count 214
Applied a total of 30 rules in 58 ms. Remains 192 /212 variables (removed 20) and now considering 214/224 (removed 10) transitions.
// Phase 1: matrix 214 rows 192 cols
[2023-03-13 20:16:29] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-13 20:16:30] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-13 20:16:30] [INFO ] Invariant cache hit.
[2023-03-13 20:16:30] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2023-03-13 20:16:30] [INFO ] Invariant cache hit.
[2023-03-13 20:16:30] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/212 places, 214/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 853 ms. Remains : 192/212 places, 214/224 transitions.
Support contains 100 out of 192 places after structural reductions.
[2023-03-13 20:16:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 20:16:30] [INFO ] Flatten gal took : 64 ms
[2023-03-13 20:16:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 20:16:30] [INFO ] Flatten gal took : 27 ms
[2023-03-13 20:16:30] [INFO ] Input system was already deterministic with 214 transitions.
Support contains 89 out of 192 places (down from 100) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 65) seen :60
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 20:16:32] [INFO ] Invariant cache hit.
[2023-03-13 20:16:32] [INFO ] [Real]Absence check using 2 positive place invariants in 25 ms returned sat
[2023-03-13 20:16:32] [INFO ] After 189ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-13 20:16:32] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 9 ms to minimize.
[2023-03-13 20:16:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-13 20:16:32] [INFO ] After 405ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-13 20:16:32] [INFO ] After 638ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-13 20:16:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-13 20:16:33] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-13 20:16:33] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2023-03-13 20:16:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-13 20:16:33] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-13 20:16:33] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 57 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 16 ms
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 18 ms
[2023-03-13 20:16:33] [INFO ] Input system was already deterministic with 214 transitions.
Computed a total of 33 stabilizing places and 33 stable transitions
Graph (complete) has 347 edges and 192 vertex of which 178 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 214/214 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 189 transition count 214
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 163 transition count 188
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 163 transition count 188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 155 transition count 180
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 155 transition count 180
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 77 place count 149 transition count 174
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 149 transition count 174
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 89 place count 143 transition count 168
Iterating global reduction 1 with 6 rules applied. Total rules applied 95 place count 143 transition count 168
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 100 place count 138 transition count 158
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 138 transition count 158
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 110 place count 133 transition count 153
Iterating global reduction 1 with 5 rules applied. Total rules applied 115 place count 133 transition count 153
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 120 place count 128 transition count 148
Iterating global reduction 1 with 5 rules applied. Total rules applied 125 place count 128 transition count 148
Applied a total of 125 rules in 66 ms. Remains 128 /192 variables (removed 64) and now considering 148/214 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 128/192 places, 148/214 transitions.
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 29 ms
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 20 ms
[2023-03-13 20:16:33] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 214/214 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 214
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 30 place count 162 transition count 188
Iterating global reduction 1 with 26 rules applied. Total rules applied 56 place count 162 transition count 188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 154 transition count 180
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 154 transition count 180
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 148 transition count 174
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 148 transition count 174
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 143 transition count 169
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 143 transition count 169
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 139 transition count 161
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 139 transition count 161
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 106 place count 135 transition count 157
Iterating global reduction 1 with 4 rules applied. Total rules applied 110 place count 135 transition count 157
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 132 transition count 154
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 132 transition count 154
Applied a total of 116 rules in 29 ms. Remains 132 /192 variables (removed 60) and now considering 154/214 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 132/192 places, 154/214 transitions.
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 11 ms
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 11 ms
[2023-03-13 20:16:33] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 214/214 transitions.
Graph (complete) has 347 edges and 192 vertex of which 180 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 179 transition count 162
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 137 transition count 162
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 85 place count 137 transition count 149
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 111 place count 124 transition count 149
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 121 place count 114 transition count 139
Iterating global reduction 2 with 10 rules applied. Total rules applied 131 place count 114 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 131 place count 114 transition count 137
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 112 transition count 137
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 139 place count 108 transition count 133
Iterating global reduction 2 with 4 rules applied. Total rules applied 143 place count 108 transition count 133
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 147 place count 104 transition count 127
Iterating global reduction 2 with 4 rules applied. Total rules applied 151 place count 104 transition count 127
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 155 place count 100 transition count 121
Iterating global reduction 2 with 4 rules applied. Total rules applied 159 place count 100 transition count 121
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 98 transition count 119
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 98 transition count 119
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 199 place count 80 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 200 place count 79 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 79 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 202 place count 78 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 203 place count 78 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 204 place count 77 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 205 place count 77 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 75 transition count 95
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 87 edges and 73 vertex of which 69 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 76 edges and 69 vertex of which 28 / 69 are part of one of the 14 SCC in 3 ms
Free SCC test removed 14 places
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 2 with 27 rules applied. Total rules applied 234 place count 55 transition count 67
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 40 rules applied. Total rules applied 274 place count 32 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 276 place count 30 transition count 50
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 281 place count 25 transition count 40
Iterating global reduction 5 with 5 rules applied. Total rules applied 286 place count 25 transition count 40
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 291 place count 20 transition count 30
Iterating global reduction 5 with 5 rules applied. Total rules applied 296 place count 20 transition count 30
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 301 place count 15 transition count 20
Iterating global reduction 5 with 5 rules applied. Total rules applied 306 place count 15 transition count 20
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 311 place count 10 transition count 15
Iterating global reduction 5 with 5 rules applied. Total rules applied 316 place count 10 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 317 place count 10 transition count 14
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 318 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 319 place count 9 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 321 place count 7 transition count 11
Applied a total of 321 rules in 71 ms. Remains 7 /192 variables (removed 185) and now considering 11/214 (removed 203) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 7/192 places, 11/214 transitions.
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 1 ms
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 1 ms
[2023-03-13 20:16:33] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 214/214 transitions.
Graph (complete) has 347 edges and 192 vertex of which 178 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 177 transition count 162
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 136 transition count 162
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 83 place count 136 transition count 149
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 109 place count 123 transition count 149
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 120 place count 112 transition count 138
Iterating global reduction 2 with 11 rules applied. Total rules applied 131 place count 112 transition count 138
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 131 place count 112 transition count 136
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 110 transition count 136
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 140 place count 105 transition count 131
Iterating global reduction 2 with 5 rules applied. Total rules applied 145 place count 105 transition count 131
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 150 place count 100 transition count 124
Iterating global reduction 2 with 5 rules applied. Total rules applied 155 place count 100 transition count 124
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 95 transition count 116
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 95 transition count 116
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 168 place count 92 transition count 113
Iterating global reduction 2 with 3 rules applied. Total rules applied 171 place count 92 transition count 113
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 205 place count 75 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 206 place count 74 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 207 place count 74 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 208 place count 73 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 209 place count 73 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 72 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 72 transition count 92
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 212 place count 72 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 214 place count 70 transition count 90
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 82 edges and 68 vertex of which 64 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 69 edges and 64 vertex of which 26 / 64 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 2 with 24 rules applied. Total rules applied 238 place count 51 transition count 65
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 34 rules applied. Total rules applied 272 place count 31 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 273 place count 30 transition count 51
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 279 place count 24 transition count 39
Iterating global reduction 5 with 6 rules applied. Total rules applied 285 place count 24 transition count 39
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 291 place count 18 transition count 27
Iterating global reduction 5 with 6 rules applied. Total rules applied 297 place count 18 transition count 27
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 302 place count 13 transition count 17
Iterating global reduction 5 with 5 rules applied. Total rules applied 307 place count 13 transition count 17
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 312 place count 8 transition count 12
Iterating global reduction 5 with 5 rules applied. Total rules applied 317 place count 8 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 8 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 320 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 322 place count 5 transition count 8
Applied a total of 322 rules in 56 ms. Remains 5 /192 variables (removed 187) and now considering 8/214 (removed 206) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 5/192 places, 8/214 transitions.
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 0 ms
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 0 ms
[2023-03-13 20:16:33] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 214/214 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 214
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 28 place count 164 transition count 190
Iterating global reduction 1 with 24 rules applied. Total rules applied 52 place count 164 transition count 190
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 157 transition count 183
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 157 transition count 183
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 153 transition count 179
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 153 transition count 179
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 149 transition count 175
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 149 transition count 175
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 145 transition count 167
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 145 transition count 167
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 141 transition count 163
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 141 transition count 163
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 137 transition count 159
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 137 transition count 159
Applied a total of 106 rules in 24 ms. Remains 137 /192 variables (removed 55) and now considering 159/214 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 137/192 places, 159/214 transitions.
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 11 ms
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 12 ms
[2023-03-13 20:16:33] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 214/214 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 214
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 28 place count 164 transition count 190
Iterating global reduction 1 with 24 rules applied. Total rules applied 52 place count 164 transition count 190
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 60 place count 156 transition count 182
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 156 transition count 182
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 151 transition count 177
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 151 transition count 177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 148 transition count 174
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 148 transition count 174
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 145 transition count 168
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 145 transition count 168
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 142 transition count 165
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 142 transition count 165
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 139 transition count 162
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 139 transition count 162
Applied a total of 102 rules in 20 ms. Remains 139 /192 variables (removed 53) and now considering 162/214 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 139/192 places, 162/214 transitions.
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 10 ms
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 10 ms
[2023-03-13 20:16:33] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 214/214 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 214
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 32 place count 160 transition count 186
Iterating global reduction 1 with 28 rules applied. Total rules applied 60 place count 160 transition count 186
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 68 place count 152 transition count 178
Iterating global reduction 1 with 8 rules applied. Total rules applied 76 place count 152 transition count 178
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 147 transition count 173
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 147 transition count 173
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 142 transition count 168
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 142 transition count 168
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 138 transition count 160
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 138 transition count 160
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 134 transition count 156
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 134 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 130 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 130 transition count 152
Applied a total of 120 rules in 21 ms. Remains 130 /192 variables (removed 62) and now considering 152/214 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 130/192 places, 152/214 transitions.
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 8 ms
[2023-03-13 20:16:33] [INFO ] Flatten gal took : 10 ms
[2023-03-13 20:16:34] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 214/214 transitions.
Graph (complete) has 347 edges and 192 vertex of which 178 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 177 transition count 163
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 137 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 136 transition count 162
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 83 place count 136 transition count 149
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 109 place count 123 transition count 149
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 120 place count 112 transition count 138
Iterating global reduction 3 with 11 rules applied. Total rules applied 131 place count 112 transition count 138
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 131 place count 112 transition count 136
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 110 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 106 transition count 132
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 106 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 147 place count 102 transition count 126
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 102 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 155 place count 98 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 98 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 161 place count 96 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 96 transition count 118
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 197 place count 79 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 198 place count 78 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 78 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 77 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 77 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 76 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 76 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 74 transition count 95
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 86 edges and 72 vertex of which 68 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 73 edges and 68 vertex of which 28 / 68 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 25 rules applied. Total rules applied 230 place count 54 transition count 69
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 37 rules applied. Total rules applied 267 place count 33 transition count 53
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 269 place count 32 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 270 place count 31 transition count 52
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 275 place count 26 transition count 42
Iterating global reduction 7 with 5 rules applied. Total rules applied 280 place count 26 transition count 42
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 284 place count 22 transition count 34
Iterating global reduction 7 with 4 rules applied. Total rules applied 288 place count 22 transition count 34
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 292 place count 18 transition count 26
Iterating global reduction 7 with 4 rules applied. Total rules applied 296 place count 18 transition count 26
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 300 place count 14 transition count 22
Iterating global reduction 7 with 4 rules applied. Total rules applied 304 place count 14 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 306 place count 14 transition count 20
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 307 place count 14 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 308 place count 13 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 311 place count 10 transition count 16
Applied a total of 311 rules in 47 ms. Remains 10 /192 variables (removed 182) and now considering 16/214 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 10/192 places, 16/214 transitions.
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 1 ms
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 1 ms
[2023-03-13 20:16:34] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 214/214 transitions.
Graph (complete) has 347 edges and 192 vertex of which 180 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.17 ms
Discarding 12 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 179 transition count 167
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 142 transition count 167
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 75 place count 142 transition count 151
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 107 place count 126 transition count 151
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 118 place count 115 transition count 140
Iterating global reduction 2 with 11 rules applied. Total rules applied 129 place count 115 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 129 place count 115 transition count 139
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 114 transition count 139
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 135 place count 110 transition count 135
Iterating global reduction 2 with 4 rules applied. Total rules applied 139 place count 110 transition count 135
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 143 place count 106 transition count 130
Iterating global reduction 2 with 4 rules applied. Total rules applied 147 place count 106 transition count 130
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 151 place count 102 transition count 123
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 102 transition count 123
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 158 place count 99 transition count 120
Iterating global reduction 2 with 3 rules applied. Total rules applied 161 place count 99 transition count 120
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 193 place count 83 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 194 place count 82 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 195 place count 82 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 196 place count 81 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 197 place count 81 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 198 place count 80 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 199 place count 80 transition count 100
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 80 transition count 100
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 78 transition count 98
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 9 rules applied. Total rules applied 211 place count 77 transition count 90
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 221 place count 69 transition count 88
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 223 place count 68 transition count 87
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 225 place count 67 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 225 place count 67 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 66 transition count 85
Applied a total of 227 rules in 92 ms. Remains 66 /192 variables (removed 126) and now considering 85/214 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 92 ms. Remains : 66/192 places, 85/214 transitions.
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 6 ms
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 6 ms
[2023-03-13 20:16:34] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 214/214 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 191 transition count 214
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 174 transition count 197
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 174 transition count 197
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 170 transition count 193
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 170 transition count 193
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 167 transition count 190
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 167 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 165 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 165 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 164 transition count 186
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 164 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 163 transition count 185
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 163 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 162 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 162 transition count 184
Applied a total of 59 rules in 20 ms. Remains 162 /192 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 162/192 places, 184/214 transitions.
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 11 ms
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 12 ms
[2023-03-13 20:16:34] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 214/214 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 189 transition count 214
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 28 place count 164 transition count 189
Iterating global reduction 1 with 25 rules applied. Total rules applied 53 place count 164 transition count 189
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 157 transition count 182
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 157 transition count 182
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 153 transition count 178
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 153 transition count 178
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 149 transition count 174
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 149 transition count 174
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 145 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 145 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 95 place count 141 transition count 162
Iterating global reduction 1 with 4 rules applied. Total rules applied 99 place count 141 transition count 162
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 138 transition count 159
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 138 transition count 159
Applied a total of 105 rules in 20 ms. Remains 138 /192 variables (removed 54) and now considering 159/214 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 138/192 places, 159/214 transitions.
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 9 ms
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 10 ms
[2023-03-13 20:16:34] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 214/214 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 214
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 30 place count 162 transition count 188
Iterating global reduction 1 with 26 rules applied. Total rules applied 56 place count 162 transition count 188
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 156 transition count 182
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 156 transition count 182
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 151 transition count 177
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 151 transition count 177
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 146 transition count 172
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 146 transition count 172
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 142 transition count 164
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 142 transition count 164
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 138 transition count 160
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 138 transition count 160
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 134 transition count 156
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 134 transition count 156
Applied a total of 112 rules in 20 ms. Remains 134 /192 variables (removed 58) and now considering 156/214 (removed 58) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 134/192 places, 156/214 transitions.
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 9 ms
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 9 ms
[2023-03-13 20:16:34] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 214/214 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 214
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 33 place count 159 transition count 185
Iterating global reduction 1 with 29 rules applied. Total rules applied 62 place count 159 transition count 185
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 71 place count 150 transition count 176
Iterating global reduction 1 with 9 rules applied. Total rules applied 80 place count 150 transition count 176
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 144 transition count 170
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 144 transition count 170
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 138 transition count 164
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 138 transition count 164
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 132 transition count 152
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 132 transition count 152
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 122 place count 126 transition count 146
Iterating global reduction 1 with 6 rules applied. Total rules applied 128 place count 126 transition count 146
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 134 place count 120 transition count 140
Iterating global reduction 1 with 6 rules applied. Total rules applied 140 place count 120 transition count 140
Applied a total of 140 rules in 18 ms. Remains 120 /192 variables (removed 72) and now considering 140/214 (removed 74) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 120/192 places, 140/214 transitions.
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 8 ms
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 8 ms
[2023-03-13 20:16:34] [INFO ] Input system was already deterministic with 140 transitions.
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 13 ms
[2023-03-13 20:16:34] [INFO ] Flatten gal took : 12 ms
[2023-03-13 20:16:34] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-13 20:16:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 192 places, 214 transitions and 556 arcs took 2 ms.
Total runtime 5206 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 192 NrTr: 214 NrArc: 556)

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

net check time: 0m 0.000sec

init dd package: 0m 3.468sec


RS generation: 3m 3.556sec


-> reachability set: #nodes 275277 (2.8e+05) #states 122,073,944,284 (11)



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

checking: AF [AG [EF [AG [~ [[p109<=1 & 1<=p109]]]]]]
normalized: ~ [EG [E [true U ~ [E [true U ~ [E [true U [p109<=1 & 1<=p109]]]]]]]]

abstracting: (1<=p109)
states: 5,720,191,557 (9)
abstracting: (p109<=1)
states: 122,073,944,284 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-07b-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m54.944sec

checking: EG [EF [[p171<=1 & 1<=p171]]]
normalized: EG [E [true U [p171<=1 & 1<=p171]]]

abstracting: (1<=p171)
states: 4,399,696,378 (9)
abstracting: (p171<=1)
states: 122,073,944,284 (11)
...........................
before gc: list nodes free: 639323

after gc: idd nodes used:1053204, unused:62946796; list nodes free:297153265
.................................................
EG iterations: 76
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-07b-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m20.576sec

checking: AG [AF [AX [EX [[p93<=0 & 0<=p93]]]]]
normalized: ~ [E [true U EG [EX [~ [EX [[p93<=0 & 0<=p93]]]]]]]

abstracting: (0<=p93)
states: 122,073,944,284 (11)
abstracting: (p93<=0)
states: 117,585,309,751 (11)
....................................................
before gc: list nodes free: 983349

after gc: idd nodes used:2644192, unused:61355808; list nodes free:298851686
..........................
EG iterations: 76
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-07b-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m38.335sec

checking: AF [AG [[[p121<=0 & 0<=p121] | [p157<=1 & 1<=p157]]]]
normalized: ~ [EG [E [true U ~ [[[p157<=1 & 1<=p157] | [p121<=0 & 0<=p121]]]]]]

abstracting: (0<=p121)
states: 122,073,944,284 (11)
abstracting: (p121<=0)
states: 117,404,912,239 (11)
abstracting: (1<=p157)
states: 5,358,501,352 (9)
abstracting: (p157<=1)
states: 122,073,944,284 (11)
.........................................
before gc: list nodes free: 9058533

after gc: idd nodes used:1248666, unused:62751334; list nodes free:306776550
.........................................
EG iterations: 82
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-07b-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m34.823sec

checking: AF [EX [AX [[[p108<=1 & 1<=p108] & [[p157<=0 & 0<=p157] & [p163<=1 & 1<=p163]]]]]]
normalized: ~ [EG [~ [EX [~ [EX [~ [[[[p163<=1 & 1<=p163] & [p157<=0 & 0<=p157]] & [p108<=1 & 1<=p108]]]]]]]]]

abstracting: (1<=p108)
states: 4,377,964,296 (9)
abstracting: (p108<=1)
states: 122,073,944,284 (11)
abstracting: (0<=p157)
states: 122,073,944,284 (11)
abstracting: (p157<=0)
states: 116,715,442,932 (11)
abstracting: (1<=p163)
states: 4,399,187,988 (9)
abstracting: (p163<=1)
states: 122,073,944,284 (11)
.....................................
before gc: list nodes free: 485775

after gc: idd nodes used:2298692, unused:61701308; list nodes free:301340662
.MC time: 4m50.690sec

checking: AG [EF [[[A [[[p183<=0 & 0<=p183] | [p63<=1 & 1<=p63]] U [p154<=1 & 1<=p154]] | [p76<=1 & 1<=p76]] | [[p59<=0 & 0<=p59] | [p63<=1 & 1<=p63]]]]]
normalized: ~ [E [true U ~ [E [true U [[[p63<=1 & 1<=p63] | [p59<=0 & 0<=p59]] | [[p76<=1 & 1<=p76] | [~ [EG [~ [[p154<=1 & 1<=p154]]]] & ~ [E [~ [[p154<=1 & 1<=p154]] U [~ [[[p63<=1 & 1<=p63] | [p183<=0 & 0<=p183]]] & ~ [[p154<=1 & 1<=p154]]]]]]]]]]]]

abstracting: (1<=p154)
states: 4,399,187,988 (9)
abstracting: (p154<=1)
states: 122,073,944,284 (11)
abstracting: (0<=p183)
states: 122,073,944,284 (11)
abstracting: (p183<=0)
states: 98,254,068,158 (10)
abstracting: (1<=p63)
states: 4,377,773,736 (9)
abstracting: (p63<=1)
states: 122,073,944,284 (11)
abstracting: (1<=p154)
states: 4,399,187,988 (9)
abstracting: (p154<=1)
states: 122,073,944,284 (11)
abstracting: (1<=p154)
states: 4,399,187,988 (9)
abstracting: (p154<=1)
states: 122,073,944,284 (11)
.
EG iterations: 1
abstracting: (1<=p76)
states: 5,047,906,272 (9)
abstracting: (p76<=1)
states: 122,073,944,284 (11)
abstracting: (0<=p59)
states: 122,073,944,284 (11)
abstracting: (p59<=0)
states: 116,353,992,811 (11)
abstracting: (1<=p63)
states: 4,377,773,736 (9)
abstracting: (p63<=1)
states: 122,073,944,284 (11)
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-07b-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m58.302sec

checking: [AG [[[EX [[p93<=0 & 0<=p93]] | E [[p44<=0 & 0<=p44] U [[p51<=0 & 0<=p51] | [p181<=1 & 1<=p181]]]] & EX [AX [[[p74<=0 & 0<=p74] | [p10<=1 & 1<=p10]]]]]] | EX [[EX [0<=0] & [AX [[p85<=1 & 1<=p85]] & AX [EX [[p162<=0 & 0<=p162]]]]]]]
normalized: [EX [[[~ [EX [~ [EX [[p162<=0 & 0<=p162]]]]] & ~ [EX [~ [[p85<=1 & 1<=p85]]]]] & EX [0<=0]]] | ~ [E [true U ~ [[EX [~ [EX [~ [[[p10<=1 & 1<=p10] | [p74<=0 & 0<=p74]]]]]] & [E [[p44<=0 & 0<=p44] U [[p181<=1 & 1<=p181] | [p51<=0 & 0<=p51]]] | EX [[p93<=0 & 0<=p93]]]]]]]]

abstracting: (0<=p93)
states: 122,073,944,284 (11)
abstracting: (p93<=0)
states: 117,585,309,751 (11)
.abstracting: (0<=p51)
states: 122,073,944,284 (11)
abstracting: (p51<=0)
states: 117,139,257,108 (11)
abstracting: (1<=p181)
states: 16,350,320,676 (10)
abstracting: (p181<=1)
states: 122,073,944,284 (11)
abstracting: (0<=p44)
states: 122,073,944,284 (11)
abstracting: (p44<=0)
states: 116,377,372,252 (11)
abstracting: (0<=p74)
states: 122,073,944,284 (11)
abstracting: (p74<=0)
states: 117,688,682,732 (11)
abstracting: (1<=p10)
states: 4,205,769,744 (9)
abstracting: (p10<=1)
states: 122,073,944,284 (11)
..
before gc: list nodes free: 9204258

after gc: idd nodes used:1158127, unused:62841873; list nodes free:307139873
MC time: 4m27.004sec

checking: A [[AG [[[1<=p46 & p46<=1] | [p48<=0 & 0<=p48]]] & EF [~ [EG [[[0<=p22 & p22<=0] | [p108<=0 & 0<=p108]]]]]] U E [~ [AX [EF [[[p95<=0 & 0<=p95] | [p176<=1 & 1<=p176]]]]] U EF [~ [[[p187<=0 & 0<=p187] & [[p169<=0 & 0<=p169] | [p71<=1 & 1<=p71]]]]]]]
normalized: [~ [EG [~ [E [EX [~ [E [true U [[p176<=1 & 1<=p176] | [p95<=0 & 0<=p95]]]]] U E [true U ~ [[[[p71<=1 & 1<=p71] | [p169<=0 & 0<=p169]] & [p187<=0 & 0<=p187]]]]]]]] & ~ [E [~ [E [EX [~ [E [true U [[p176<=1 & 1<=p176] | [p95<=0 & 0<=p95]]]]] U E [true U ~ [[[[p71<=1 & 1<=p71] | [p169<=0 & 0<=p169]] & [p187<=0 & 0<=p187]]]]]] U [~ [[E [true U ~ [EG [[[p108<=0 & 0<=p108] | [0<=p22 & p22<=0]]]]] & ~ [E [true U ~ [[[p48<=0 & 0<=p48] | [1<=p46 & p46<=1]]]]]]] & ~ [E [EX [~ [E [true U [[p176<=1 & 1<=p176] | [p95<=0 & 0<=p95]]]]] U E [true U ~ [[[[p71<=1 & 1<=p71] | [p169<=0 & 0<=p169]] & [p187<=0 & 0<=p187]]]]]]]]]]

abstracting: (0<=p187)
states: 122,073,944,284 (11)
abstracting: (p187<=0)
states: 97,039,703,290 (10)
abstracting: (0<=p169)
states: 122,073,944,284 (11)
abstracting: (p169<=0)
states: 117,681,883,876 (11)
abstracting: (1<=p71)
states: 4,668,892,281 (9)
abstracting: (p71<=1)
states: 122,073,944,284 (11)
MC time: 3m54.000sec

checking: AX [E [~ [[p11<=1 & 1<=p11]] U ~ [[[p138<=1 & 1<=p138] | [EF [[[p26<=0 & 0<=p26] | [p11<=1 & 1<=p11]]] | [AX [[p35<=1 & 1<=p35]] & [[[p183<=0 & 0<=p183] | [p83<=1 & 1<=p83]] | [[p166<=0 & 0<=p166] | [p31<=1 & 1<=p31]]]]]]]]]
normalized: ~ [EX [~ [E [~ [[p11<=1 & 1<=p11]] U ~ [[[[[[[p31<=1 & 1<=p31] | [p166<=0 & 0<=p166]] | [[p83<=1 & 1<=p83] | [p183<=0 & 0<=p183]]] & ~ [EX [~ [[p35<=1 & 1<=p35]]]]] | E [true U [[p11<=1 & 1<=p11] | [p26<=0 & 0<=p26]]]] | [p138<=1 & 1<=p138]]]]]]]

abstracting: (1<=p138)
states: 4,710,866,896 (9)
abstracting: (p138<=1)
states: 122,073,944,284 (11)
abstracting: (0<=p26)
states: 122,073,944,284 (11)
abstracting: (p26<=0)
states: 117,868,174,540 (11)
abstracting: (1<=p11)
states: 5,482,916,847 (9)
abstracting: (p11<=1)
states: 122,073,944,284 (11)
abstracting: (1<=p35)
states: 4,934,283,392 (9)
abstracting: (p35<=1)
states: 122,073,944,284 (11)
.abstracting: (0<=p183)
states: 122,073,944,284 (11)
abstracting: (p183<=0)
states: 98,254,068,158 (10)
abstracting: (1<=p83)
states: 5,491,522,041 (9)
abstracting: (p83<=1)
states: 122,073,944,284 (11)
abstracting: (0<=p166)
states: 122,073,944,284 (11)
abstracting: (p166<=0)
states: 117,404,912,015 (11)
abstracting: (1<=p31)
states: 4,834,122,811 (9)
abstracting: (p31<=1)
states: 122,073,944,284 (11)
abstracting: (1<=p11)
states: 5,482,916,847 (9)
abstracting: (p11<=1)
states: 122,073,944,284 (11)
.-> the formula is FALSE

FORMULA DiscoveryGPU-PT-07b-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 1.568sec

checking: [AF [AX [AF [[[p133<=1 & 1<=p133] & [[p170<=0 & 0<=p170] & [p24<=1 & 1<=p24]]]]]] & [AX [AG [[[p29<=1 & 1<=p29] & [[p172<=0 & 0<=p172] & [p153<=1 & 1<=p153]]]]] | [EF [[p143<=1 & 1<=p143]] | [EG [~ [[p7<=1 & 1<=p7]]] & [AX [EX [[p144<=0 & 0<=p144]]] | EG [[p156<=0 & 0<=p156]]]]]]]
normalized: [[[[[EG [[p156<=0 & 0<=p156]] | ~ [EX [~ [EX [[p144<=0 & 0<=p144]]]]]] & EG [~ [[p7<=1 & 1<=p7]]]] | E [true U [p143<=1 & 1<=p143]]] | ~ [EX [E [true U ~ [[[[p153<=1 & 1<=p153] & [p172<=0 & 0<=p172]] & [p29<=1 & 1<=p29]]]]]]] & ~ [EG [EX [EG [~ [[[[p24<=1 & 1<=p24] & [p170<=0 & 0<=p170]] & [p133<=1 & 1<=p133]]]]]]]]

abstracting: (1<=p133)
states: 6,157,915,785 (9)
abstracting: (p133<=1)
states: 122,073,944,284 (11)
abstracting: (0<=p170)
states: 122,073,944,284 (11)
abstracting: (p170<=0)
states: 117,674,247,906 (11)
abstracting: (1<=p24)
states: 4,482,258,087 (9)
abstracting: (p24<=1)
states: 122,073,944,284 (11)
.
EG iterations: 1
..........................
before gc: list nodes free: 5002435

after gc: idd nodes used:2880415, unused:61119585; list nodes free:298851423
.MC time: 3m45.431sec

checking: E [[~ [[[p67<=0 & 0<=p67] | [p96<=1 & 1<=p96]]] | [[p76<=1 & 1<=p76] & [EG [[[[p182<=0 & 0<=p182] | [p187<=1 & 1<=p187]] & AF [[[p136<=0 & 0<=p136] | [p155<=1 & 1<=p155]]]]] | AX [[[p163<=0 & 0<=p163] | [p134<=1 & 1<=p134]]]]]] U A [[[p120<=0 & 0<=p120] | [[p163<=0 & 0<=p163] | [p164<=1 & 1<=p164]]] U ~ [EF [AG [[p99<=0 & 0<=p99]]]]]]
normalized: E [[[[~ [EX [~ [[[p134<=1 & 1<=p134] | [p163<=0 & 0<=p163]]]]] | EG [[~ [EG [~ [[[p155<=1 & 1<=p155] | [p136<=0 & 0<=p136]]]]] & [[p187<=1 & 1<=p187] | [p182<=0 & 0<=p182]]]]] & [p76<=1 & 1<=p76]] | ~ [[[p96<=1 & 1<=p96] | [p67<=0 & 0<=p67]]]] U [~ [EG [E [true U ~ [E [true U ~ [[p99<=0 & 0<=p99]]]]]]] & ~ [E [E [true U ~ [E [true U ~ [[p99<=0 & 0<=p99]]]]] U [~ [[[[p164<=1 & 1<=p164] | [p163<=0 & 0<=p163]] | [p120<=0 & 0<=p120]]] & E [true U ~ [E [true U ~ [[p99<=0 & 0<=p99]]]]]]]]]]

abstracting: (0<=p99)
states: 122,073,944,284 (11)
abstracting: (p99<=0)
states: 117,855,414,272 (11)
abstracting: (0<=p120)
states: 122,073,944,284 (11)
abstracting: (p120<=0)
states: 117,404,912,239 (11)
abstracting: (0<=p163)
states: 122,073,944,284 (11)
abstracting: (p163<=0)
states: 117,674,756,296 (11)
abstracting: (1<=p164)
states: 5,061,881,720 (9)
abstracting: (p164<=1)
states: 122,073,944,284 (11)
abstracting: (0<=p99)
states: 122,073,944,284 (11)
abstracting: (p99<=0)
states: 117,855,414,272 (11)
abstracting: (0<=p99)
states: 122,073,944,284 (11)
abstracting: (p99<=0)
states: 117,855,414,272 (11)

EG iterations: 0
abstracting: (0<=p67)
states: 122,073,944,284 (11)
abstracting: (p67<=0)
states: 117,026,412,796 (11)
abstracting: (1<=p96)
states: 4,488,634,533 (9)
abstracting: (p96<=1)
states: 122,073,944,284 (11)
abstracting: (1<=p76)
states: 5,047,906,272 (9)
abstracting: (p76<=1)
states: 122,073,944,284 (11)
abstracting: (0<=p182)
states: 122,073,944,284 (11)
abstracting: (p182<=0)
states: 105,723,623,608 (11)
abstracting: (1<=p187)
states: 25,034,240,994 (10)
abstracting: (p187<=1)
states: 122,073,944,284 (11)
abstracting: (0<=p136)
states: 122,073,944,284 (11)
abstracting: (p136<=0)
states: 117,371,120,206 (11)
abstracting: (1<=p155)
states: 4,392,060,408 (9)
abstracting: (p155<=1)
states: 122,073,944,284 (11)
.............................MC time: 3m13.005sec

checking: AF [[[EF [EX [[[p39<=0 & 0<=p39] | [p145<=1 & 1<=p145]]]] & EF [[[~ [[p27<=0 & 0<=p27]] & ~ [[p30<=1 & 1<=p30]]] & [~ [[p170<=1 & 1<=p170]] & [~ [[p14<=1 & 1<=p14]] | ~ [[p28<=1 & 1<=p28]]]]]]] & [AX [[EG [~ [[p70<=1 & 1<=p70]]] & ~ [E [[p140<=1 & 1<=p140] U [p165<=1 & 1<=p165]]]]] & [[EX [[~ [[p106<=0 & 0<=p106]] & ~ [[p32<=1 & 1<=p32]]]] | ~ [[p84<=1 & 1<=p84]]] | [AX [[p9<=1 & 1<=p9]] | [~ [[p144<=1 & 1<=p144]] & ~ [[p130<=1 & 1<=p130]]]]]]]]
normalized: ~ [EG [~ [[[[[[~ [[p130<=1 & 1<=p130]] & ~ [[p144<=1 & 1<=p144]]] | ~ [EX [~ [[p9<=1 & 1<=p9]]]]] | [~ [[p84<=1 & 1<=p84]] | EX [[~ [[p32<=1 & 1<=p32]] & ~ [[p106<=0 & 0<=p106]]]]]] & ~ [EX [~ [[~ [E [[p140<=1 & 1<=p140] U [p165<=1 & 1<=p165]]] & EG [~ [[p70<=1 & 1<=p70]]]]]]]] & [E [true U [[[~ [[p28<=1 & 1<=p28]] | ~ [[p14<=1 & 1<=p14]]] & ~ [[p170<=1 & 1<=p170]]] & [~ [[p30<=1 & 1<=p30]] & ~ [[p27<=0 & 0<=p27]]]]] & E [true U EX [[[p145<=1 & 1<=p145] | [p39<=0 & 0<=p39]]]]]]]]]

abstracting: (0<=p39)
states: 122,073,944,284 (11)
abstracting: (p39<=0)
states: 117,148,536,772 (11)
abstracting: (1<=p145)
states: 4,702,824,078 (9)
abstracting: (p145<=1)
states: 122,073,944,284 (11)
.abstracting: (0<=p27)
states: 122,073,944,284 (11)
abstracting: (p27<=0)
states: 117,861,116,580 (11)
abstracting: (1<=p30)
states: 4,842,597,184 (9)
abstracting: (p30<=1)
states: 122,073,944,284 (11)
abstracting: (1<=p170)
states: 4,399,696,378 (9)
abstracting: (p170<=1)
states: 122,073,944,284 (11)
abstracting: (1<=p14)
states: 5,118,798,024 (9)
abstracting: (p14<=1)
states: 122,073,944,284 (11)
abstracting: (1<=p28)
states: 4,212,827,704 (9)
abstracting: (p28<=1)
states: 122,073,944,284 (11)
abstracting: (1<=p70)
states: 4,668,892,281 (9)
abstracting: (p70<=1)
states: 122,073,944,284 (11)
.
EG iterations: 1
abstracting: (1<=p165)
states: 5,052,580,845 (9)
abstracting: (p165<=1)
states: 122,073,944,284 (11)
abstracting: (1<=p140)
states: 5,432,686,608 (9)
abstracting: (p140<=1)
states: 122,073,944,284 (11)
.abstracting: (0<=p106)
states: 122,073,944,284 (11)
abstracting: (p106<=0)
states: 117,688,344,044 (11)
abstracting: (1<=p32)
states: 4,204,353,971 (9)
abstracting: (p32<=1)
states: 122,073,944,284 (11)

before gc: list nodes free: 5999162

after gc: idd nodes used:2792459, unused:61207541; list nodes free:299458611
MC time: 2m45.032sec

checking: [~ [E [[[[[EF [[[p109<=0 & 0<=p109] | [p26<=1 & 1<=p26]]] & [[p110<=0 & 0<=p110] | [p137<=1 & 1<=p137]]] | [[p119<=0 & 0<=p119] | AF [[p95<=1 & 1<=p95]]]] & EX [[p99<=1 & 1<=p99]]] | ~ [EF [[p35<=0 & 0<=p35]]]] U A [[AF [[p25<=0 & 0<=p25]] & EX [[p57<=1 & 1<=p57]]] U EG [EF [[[p92<=0 & 0<=p92] | [p38<=1 & 1<=p38]]]]]]] & A [[[E [[[[p191<=0 & 0<=p191] | [[p154<=1 & 1<=p154] | [p184<=0 & 0<=p184]]] & [p59<=1 & 1<=p59]] U [[p59<=0 & 0<=p59] | [[p33<=0 & 0<=p33] | [[p113<=1 & 1<=p113] & [[p28<=0 & 0<=p28] | [p126<=1 & 1<=p126]]]]]] | [[EX [[p8<=1 & 1<=p8]] & [p0<=1 & 1<=p0]] | AX [AG [[[p191<=0 & 0<=p191] | [p85<=1 & 1<=p85]]]]]] & ~ [[[E [[p186<=1 & 1<=p186] U [p145<=1 & 1<=p145]] & [p136<=0 & 0<=p136]] | ~ [[[p116<=1 & 1<=p116] | [p118<=1 & 1<=p118]]]]]] U E [AF [[[p173<=1 & 1<=p173] & [[p54<=0 & 0<=p54] | [p48<=1 & 1<=p48]]]] U [p108<=1 & 1<=p108]]]]
normalized: [[~ [EG [~ [E [~ [EG [~ [[[[p48<=1 & 1<=p48] | [p54<=0 & 0<=p54]] & [p173<=1 & 1<=p173]]]]] U [p108<=1 & 1<=p108]]]]] & ~ [E [~ [E [~ [EG [~ [[[[p48<=1 & 1<=p48] | [p54<=0 & 0<=p54]] & [p173<=1 & 1<=p173]]]]] U [p108<=1 & 1<=p108]]] U [~ [[~ [[~ [[[p118<=1 & 1<=p118] | [p116<=1 & 1<=p116]]] | [[p136<=0 & 0<=p136] & E [[p186<=1 & 1<=p186] U [p145<=1 & 1<=p145]]]]] & [[~ [EX [E [true U ~ [[[p85<=1 & 1<=p85] | [p191<=0 & 0<=p191]]]]]] | [[p0<=1 & 1<=p0] & EX [[p8<=1 & 1<=p8]]]] | E [[[p59<=1 & 1<=p59] & [[[p184<=0 & 0<=p184] | [p154<=1 & 1<=p154]] | [p191<=0 & 0<=p191]]] U [[[[[p126<=1 & 1<=p126] | [p28<=0 & 0<=p28]] & [p113<=1 & 1<=p113]] | [p33<=0 & 0<=p33]] | [p59<=0 & 0<=p59]]]]]] & ~ [E [~ [EG [~ [[[[p48<=1 & 1<=p48] | [p54<=0 & 0<=p54]] & [p173<=1 & 1<=p173]]]]] U [p108<=1 & 1<=p108]]]]]]] & ~ [E [[~ [E [true U [p35<=0 & 0<=p35]]] | [EX [[p99<=1 & 1<=p99]] & [[~ [EG [~ [[p95<=1 & 1<=p95]]]] | [p119<=0 & 0<=p119]] | [[[p137<=1 & 1<=p137] | [p110<=0 & 0<=p110]] & E [true U [[p26<=1 & 1<=p26] | [p109<=0 & 0<=p109]]]]]]] U [~ [EG [~ [EG [E [true U [[p38<=1 & 1<=p38] | [p92<=0 & 0<=p92]]]]]]] & ~ [E [~ [EG [E [true U [[p38<=1 & 1<=p38] | [p92<=0 & 0<=p92]]]]] U [~ [[EX [[p57<=1 & 1<=p57]] & ~ [EG [~ [[p25<=0 & 0<=p25]]]]]] & ~ [EG [E [true U [[p38<=1 & 1<=p38] | [p92<=0 & 0<=p92]]]]]]]]]]]]

abstracting: (0<=p92)
states: 122,073,944,284 (11)
abstracting: (p92<=0)
states: 117,233,335,607 (11)
abstracting: (1<=p38)
states: 6,036,618,240 (9)
abstracting: (p38<=1)
states: 122,073,944,284 (11)

EG iterations: 0
abstracting: (0<=p25)
states: 122,073,944,284 (11)
abstracting: (p25<=0)
states: 117,591,686,197 (11)
.............................................................................
EG iterations: 77
abstracting: (1<=p57)
states: 4,384,899,296 (9)
abstracting: (p57<=1)
states: 122,073,944,284 (11)
MC time: 2m22.061sec

checking: AF [EX [AX [[[p108<=1 & 1<=p108] & [[p157<=0 & 0<=p157] & [p163<=1 & 1<=p163]]]]]]
normalized: ~ [EG [~ [EX [~ [EX [~ [[[[p163<=1 & 1<=p163] & [p157<=0 & 0<=p157]] & [p108<=1 & 1<=p108]]]]]]]]]

abstracting: (1<=p108)
states: 4,377,964,296 (9)
abstracting: (p108<=1)
states: 122,073,944,284 (11)
abstracting: (0<=p157)
states: 122,073,944,284 (11)
abstracting: (p157<=0)
states: 116,715,442,932 (11)
abstracting: (1<=p163)
states: 4,399,187,988 (9)
abstracting: (p163<=1)
states: 122,073,944,284 (11)
.............................
before gc: list nodes free: 543033

after gc: idd nodes used:3481695, unused:60518305; list nodes free:296224504
...........................................................
EG iterations: 86
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-07b-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 7m 6.943sec

checking: [AG [[[EX [[p93<=0 & 0<=p93]] | E [[p44<=0 & 0<=p44] U [[p51<=0 & 0<=p51] | [p181<=1 & 1<=p181]]]] & EX [AX [[[p74<=0 & 0<=p74] | [p10<=1 & 1<=p10]]]]]] | EX [[EX [0<=0] & [AX [[p85<=1 & 1<=p85]] & AX [EX [[p162<=0 & 0<=p162]]]]]]]
normalized: [EX [[[~ [EX [~ [[p85<=1 & 1<=p85]]]] & ~ [EX [~ [EX [[p162<=0 & 0<=p162]]]]]] & EX [0<=0]]] | ~ [E [true U ~ [[EX [~ [EX [~ [[[p10<=1 & 1<=p10] | [p74<=0 & 0<=p74]]]]]] & [E [[p44<=0 & 0<=p44] U [[p181<=1 & 1<=p181] | [p51<=0 & 0<=p51]]] | EX [[p93<=0 & 0<=p93]]]]]]]]

abstracting: (0<=p93)
states: 122,073,944,284 (11)
abstracting: (p93<=0)
states: 117,585,309,751 (11)
.abstracting: (0<=p51)
states: 122,073,944,284 (11)
abstracting: (p51<=0)
states: 117,139,257,108 (11)
abstracting: (1<=p181)
states: 16,350,320,676 (10)
abstracting: (p181<=1)
states: 122,073,944,284 (11)
abstracting: (0<=p44)
states: 122,073,944,284 (11)
abstracting: (p44<=0)
states: 116,377,372,252 (11)

before gc: list nodes free: 2645161

after gc: idd nodes used:2734658, unused:61265342; list nodes free:299759947
abstracting: (0<=p74)
states: 122,073,944,284 (11)
abstracting: (p74<=0)
states: 117,688,682,732 (11)
abstracting: (1<=p10)
states: 4,205,769,744 (9)
abstracting: (p10<=1)
states: 122,073,944,284 (11)
..abstracting: (0<=0)
states: 122,073,944,284 (11)
.abstracting: (0<=p162)
states: 122,073,944,284 (11)
abstracting: (p162<=0)
states: 117,674,756,296 (11)
..abstracting: (1<=p85)
states: 5,126,369,904 (9)
abstracting: (p85<=1)
states: 122,073,944,284 (11)
..-> the formula is FALSE

FORMULA DiscoveryGPU-PT-07b-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 5765024 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16099532 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:90371 (422), effective:4453 (20)

initing FirstDep: 0m 0.000sec


iterations count:2355 (11), effective:72 (0)

iterations count:1333 (6), effective:38 (0)

iterations count:1400 (6), effective:38 (0)

iterations count:973 (4), effective:22 (0)

iterations count:5827 (27), effective:249 (1)

iterations count:1417 (6), effective:42 (0)

net_ddint.h:600: Timeout: after 289 sec


iterations count:407 (1), effective:11 (0)

iterations count:1864 (8), effective:42 (0)

iterations count:3838 (17), effective:116 (0)

iterations count:870 (4), effective:50 (0)

sat_reach.icc:155: Timeout: after 266 sec


sat_reach.icc:155: Timeout: after 233 sec


iterations count:399 (1), effective:6 (0)

net_ddint.h:600: Timeout: after 224 sec


iterations count:950 (4), effective:26 (0)

iterations count:1130 (5), effective:32 (0)

iterations count:950 (4), effective:26 (0)

iterations count:1130 (5), effective:32 (0)

iterations count:3000 (14), effective:80 (0)

iterations count:950 (4), effective:26 (0)

iterations count:1130 (5), effective:32 (0)

net_ddint.h:600: Timeout: after 192 sec


iterations count:236 (1), effective:3 (0)

iterations count:1111 (5), effective:34 (0)

iterations count:1308 (6), effective:34 (0)

net_ddint.h:600: Timeout: after 164 sec


iterations count:1718 (8), effective:55 (0)

net_ddint.h:600: Timeout: after 141 sec


iterations count:870 (4), effective:50 (0)

iterations count:12849 (60), effective:459 (2)

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="DiscoveryGPU-PT-07b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is DiscoveryGPU-PT-07b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r138-smll-167819420200305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-07b.tgz
mv DiscoveryGPU-PT-07b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;