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.r234-tall-167856420300450.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 LeafsetExtension-PT-S08C2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420300450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 647K 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 LeafsetExtension-PT-S08C2-CTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679504253910

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=LeafsetExtension-PT-S08C2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:57:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 16:57:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:57:35] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-22 16:57:35] [INFO ] Transformed 462 places.
[2023-03-22 16:57:35] [INFO ] Transformed 409 transitions.
[2023-03-22 16:57:35] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 124 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 377 transition count 409
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 138 place count 324 transition count 356
Iterating global reduction 1 with 53 rules applied. Total rules applied 191 place count 324 transition count 356
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 215 place count 300 transition count 332
Iterating global reduction 1 with 24 rules applied. Total rules applied 239 place count 300 transition count 332
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 259 place count 280 transition count 312
Iterating global reduction 1 with 20 rules applied. Total rules applied 279 place count 280 transition count 312
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 281 place count 278 transition count 312
Applied a total of 281 rules in 67 ms. Remains 278 /462 variables (removed 184) and now considering 312/409 (removed 97) transitions.
// Phase 1: matrix 312 rows 278 cols
[2023-03-22 16:57:35] [INFO ] Computed 28 place invariants in 26 ms
[2023-03-22 16:57:36] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-22 16:57:36] [INFO ] Invariant cache hit.
[2023-03-22 16:57:36] [INFO ] Implicit Places using invariants and state equation in 223 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 663 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 277/462 places, 312/409 transitions.
Applied a total of 0 rules in 4 ms. Remains 277 /277 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 734 ms. Remains : 277/462 places, 312/409 transitions.
Support contains 124 out of 277 places after structural reductions.
[2023-03-22 16:57:36] [INFO ] Flatten gal took : 46 ms
[2023-03-22 16:57:36] [INFO ] Flatten gal took : 25 ms
[2023-03-22 16:57:36] [INFO ] Input system was already deterministic with 312 transitions.
Incomplete random walk after 10000 steps, including 542 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 86) seen :77
Incomplete Best-First random walk after 10000 steps, including 136 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 312 rows 277 cols
[2023-03-22 16:57:37] [INFO ] Computed 27 place invariants in 11 ms
[2023-03-22 16:57:37] [INFO ] [Real]Absence check using 0 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-22 16:57:37] [INFO ] After 108ms SMT Verify possible using state equation in real domain returned unsat :2 sat :3
[2023-03-22 16:57:37] [INFO ] After 191ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-22 16:57:37] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 3 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 312/312 transitions.
Graph (complete) has 589 edges and 277 vertex of which 32 are kept as prefixes of interest. Removing 245 places using SCC suffix rule.2 ms
Discarding 245 places :
Also discarding 182 output transitions
Drop transitions removed 182 transitions
Drop transitions removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 27 transition count 35
Reduce places removed 5 places and 0 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 1 with 6 rules applied. Total rules applied 107 place count 22 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 108 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 20 transition count 33
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 18 transition count 31
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 18 transition count 31
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 16 transition count 29
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 16 transition count 24
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 128 place count 11 transition count 24
Applied a total of 128 rules in 12 ms. Remains 11 /277 variables (removed 266) and now considering 24/312 (removed 288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 11/277 places, 24/312 transitions.
Finished random walk after 216 steps, including 58 resets, run visited all 1 properties in 2 ms. (steps per millisecond=108 )
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-22 16:57:37] [INFO ] Flatten gal took : 14 ms
[2023-03-22 16:57:37] [INFO ] Flatten gal took : 16 ms
[2023-03-22 16:57:37] [INFO ] Input system was already deterministic with 312 transitions.
Computed a total of 277 stabilizing places and 312 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 277 transition count 312
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA LeafsetExtension-PT-S08C2-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 244 transition count 279
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 244 transition count 279
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 95 place count 215 transition count 250
Iterating global reduction 0 with 29 rules applied. Total rules applied 124 place count 215 transition count 250
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 126 place count 213 transition count 250
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 145 place count 194 transition count 231
Iterating global reduction 1 with 19 rules applied. Total rules applied 164 place count 194 transition count 231
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 177 place count 181 transition count 231
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 192 place count 166 transition count 216
Iterating global reduction 2 with 15 rules applied. Total rules applied 207 place count 166 transition count 216
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 222 place count 151 transition count 201
Iterating global reduction 2 with 15 rules applied. Total rules applied 237 place count 151 transition count 201
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 252 place count 136 transition count 186
Iterating global reduction 2 with 15 rules applied. Total rules applied 267 place count 136 transition count 186
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 285 place count 118 transition count 168
Iterating global reduction 2 with 18 rules applied. Total rules applied 303 place count 118 transition count 168
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 348 place count 73 transition count 123
Iterating global reduction 2 with 45 rules applied. Total rules applied 393 place count 73 transition count 123
Applied a total of 393 rules in 22 ms. Remains 73 /277 variables (removed 204) and now considering 123/312 (removed 189) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 73/277 places, 123/312 transitions.
[2023-03-22 16:57:37] [INFO ] Flatten gal took : 6 ms
[2023-03-22 16:57:37] [INFO ] Flatten gal took : 6 ms
[2023-03-22 16:57:37] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 245 transition count 280
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 245 transition count 280
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 92 place count 217 transition count 252
Iterating global reduction 0 with 28 rules applied. Total rules applied 120 place count 217 transition count 252
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 122 place count 215 transition count 252
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 141 place count 196 transition count 233
Iterating global reduction 1 with 19 rules applied. Total rules applied 160 place count 196 transition count 233
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 172 place count 184 transition count 233
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 186 place count 170 transition count 219
Iterating global reduction 2 with 14 rules applied. Total rules applied 200 place count 170 transition count 219
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 214 place count 156 transition count 205
Iterating global reduction 2 with 14 rules applied. Total rules applied 228 place count 156 transition count 205
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 242 place count 142 transition count 191
Iterating global reduction 2 with 14 rules applied. Total rules applied 256 place count 142 transition count 191
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 273 place count 125 transition count 174
Iterating global reduction 2 with 17 rules applied. Total rules applied 290 place count 125 transition count 174
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 333 place count 82 transition count 131
Iterating global reduction 2 with 43 rules applied. Total rules applied 376 place count 82 transition count 131
Applied a total of 376 rules in 20 ms. Remains 82 /277 variables (removed 195) and now considering 131/312 (removed 181) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 82/277 places, 131/312 transitions.
[2023-03-22 16:57:37] [INFO ] Flatten gal took : 5 ms
[2023-03-22 16:57:37] [INFO ] Flatten gal took : 5 ms
[2023-03-22 16:57:37] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 249 transition count 284
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 249 transition count 284
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 82 place count 223 transition count 258
Iterating global reduction 0 with 26 rules applied. Total rules applied 108 place count 223 transition count 258
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 110 place count 221 transition count 258
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 127 place count 204 transition count 241
Iterating global reduction 1 with 17 rules applied. Total rules applied 144 place count 204 transition count 241
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 1 with 9 rules applied. Total rules applied 153 place count 195 transition count 241
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 164 place count 184 transition count 230
Iterating global reduction 2 with 11 rules applied. Total rules applied 175 place count 184 transition count 230
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 185 place count 174 transition count 220
Iterating global reduction 2 with 10 rules applied. Total rules applied 195 place count 174 transition count 220
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 205 place count 164 transition count 210
Iterating global reduction 2 with 10 rules applied. Total rules applied 215 place count 164 transition count 210
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 228 place count 151 transition count 197
Iterating global reduction 2 with 13 rules applied. Total rules applied 241 place count 151 transition count 197
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 269 place count 123 transition count 169
Iterating global reduction 2 with 28 rules applied. Total rules applied 297 place count 123 transition count 169
Applied a total of 297 rules in 25 ms. Remains 123 /277 variables (removed 154) and now considering 169/312 (removed 143) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 123/277 places, 169/312 transitions.
[2023-03-22 16:57:37] [INFO ] Flatten gal took : 7 ms
[2023-03-22 16:57:37] [INFO ] Flatten gal took : 6 ms
[2023-03-22 16:57:37] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 246 transition count 281
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 246 transition count 281
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 89 place count 219 transition count 254
Iterating global reduction 0 with 27 rules applied. Total rules applied 116 place count 219 transition count 254
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 217 transition count 254
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 135 place count 200 transition count 237
Iterating global reduction 1 with 17 rules applied. Total rules applied 152 place count 200 transition count 237
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 162 place count 190 transition count 237
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 174 place count 178 transition count 225
Iterating global reduction 2 with 12 rules applied. Total rules applied 186 place count 178 transition count 225
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 198 place count 166 transition count 213
Iterating global reduction 2 with 12 rules applied. Total rules applied 210 place count 166 transition count 213
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 222 place count 154 transition count 201
Iterating global reduction 2 with 12 rules applied. Total rules applied 234 place count 154 transition count 201
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 249 place count 139 transition count 186
Iterating global reduction 2 with 15 rules applied. Total rules applied 264 place count 139 transition count 186
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 299 place count 104 transition count 151
Iterating global reduction 2 with 35 rules applied. Total rules applied 334 place count 104 transition count 151
Applied a total of 334 rules in 28 ms. Remains 104 /277 variables (removed 173) and now considering 151/312 (removed 161) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 104/277 places, 151/312 transitions.
[2023-03-22 16:57:37] [INFO ] Flatten gal took : 6 ms
[2023-03-22 16:57:37] [INFO ] Flatten gal took : 6 ms
[2023-03-22 16:57:37] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 246 transition count 281
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 246 transition count 281
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 89 place count 219 transition count 254
Iterating global reduction 0 with 27 rules applied. Total rules applied 116 place count 219 transition count 254
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 117 place count 218 transition count 254
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 135 place count 200 transition count 236
Iterating global reduction 1 with 18 rules applied. Total rules applied 153 place count 200 transition count 236
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 165 place count 188 transition count 236
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 178 place count 175 transition count 223
Iterating global reduction 2 with 13 rules applied. Total rules applied 191 place count 175 transition count 223
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 204 place count 162 transition count 210
Iterating global reduction 2 with 13 rules applied. Total rules applied 217 place count 162 transition count 210
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 230 place count 149 transition count 197
Iterating global reduction 2 with 13 rules applied. Total rules applied 243 place count 149 transition count 197
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 259 place count 133 transition count 181
Iterating global reduction 2 with 16 rules applied. Total rules applied 275 place count 133 transition count 181
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 314 place count 94 transition count 142
Iterating global reduction 2 with 39 rules applied. Total rules applied 353 place count 94 transition count 142
Applied a total of 353 rules in 21 ms. Remains 94 /277 variables (removed 183) and now considering 142/312 (removed 170) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 94/277 places, 142/312 transitions.
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 5 ms
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 5 ms
[2023-03-22 16:57:38] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 243 transition count 278
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 243 transition count 278
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 98 place count 213 transition count 248
Iterating global reduction 0 with 30 rules applied. Total rules applied 128 place count 213 transition count 248
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 130 place count 211 transition count 248
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 149 place count 192 transition count 229
Iterating global reduction 1 with 19 rules applied. Total rules applied 168 place count 192 transition count 229
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 181 place count 179 transition count 229
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 196 place count 164 transition count 214
Iterating global reduction 2 with 15 rules applied. Total rules applied 211 place count 164 transition count 214
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 226 place count 149 transition count 199
Iterating global reduction 2 with 15 rules applied. Total rules applied 241 place count 149 transition count 199
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 256 place count 134 transition count 184
Iterating global reduction 2 with 15 rules applied. Total rules applied 271 place count 134 transition count 184
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 288 place count 117 transition count 167
Iterating global reduction 2 with 17 rules applied. Total rules applied 305 place count 117 transition count 167
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 350 place count 72 transition count 122
Iterating global reduction 2 with 45 rules applied. Total rules applied 395 place count 72 transition count 122
Applied a total of 395 rules in 19 ms. Remains 72 /277 variables (removed 205) and now considering 122/312 (removed 190) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 72/277 places, 122/312 transitions.
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 4 ms
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 5 ms
[2023-03-22 16:57:38] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 243 transition count 278
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 243 transition count 278
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 98 place count 213 transition count 248
Iterating global reduction 0 with 30 rules applied. Total rules applied 128 place count 213 transition count 248
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 130 place count 211 transition count 248
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 150 place count 191 transition count 228
Iterating global reduction 1 with 20 rules applied. Total rules applied 170 place count 191 transition count 228
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 1 with 14 rules applied. Total rules applied 184 place count 177 transition count 228
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 200 place count 161 transition count 212
Iterating global reduction 2 with 16 rules applied. Total rules applied 216 place count 161 transition count 212
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 232 place count 145 transition count 196
Iterating global reduction 2 with 16 rules applied. Total rules applied 248 place count 145 transition count 196
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 264 place count 129 transition count 180
Iterating global reduction 2 with 16 rules applied. Total rules applied 280 place count 129 transition count 180
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 299 place count 110 transition count 161
Iterating global reduction 2 with 19 rules applied. Total rules applied 318 place count 110 transition count 161
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 369 place count 59 transition count 110
Iterating global reduction 2 with 51 rules applied. Total rules applied 420 place count 59 transition count 110
Applied a total of 420 rules in 20 ms. Remains 59 /277 variables (removed 218) and now considering 110/312 (removed 202) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 59/277 places, 110/312 transitions.
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 4 ms
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 4 ms
[2023-03-22 16:57:38] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 246 transition count 281
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 246 transition count 281
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 88 place count 220 transition count 255
Iterating global reduction 0 with 26 rules applied. Total rules applied 114 place count 220 transition count 255
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 116 place count 218 transition count 255
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 132 place count 202 transition count 239
Iterating global reduction 1 with 16 rules applied. Total rules applied 148 place count 202 transition count 239
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 158 place count 192 transition count 239
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 170 place count 180 transition count 227
Iterating global reduction 2 with 12 rules applied. Total rules applied 182 place count 180 transition count 227
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 194 place count 168 transition count 215
Iterating global reduction 2 with 12 rules applied. Total rules applied 206 place count 168 transition count 215
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 218 place count 156 transition count 203
Iterating global reduction 2 with 12 rules applied. Total rules applied 230 place count 156 transition count 203
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 244 place count 142 transition count 189
Iterating global reduction 2 with 14 rules applied. Total rules applied 258 place count 142 transition count 189
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 293 place count 107 transition count 154
Iterating global reduction 2 with 35 rules applied. Total rules applied 328 place count 107 transition count 154
Applied a total of 328 rules in 21 ms. Remains 107 /277 variables (removed 170) and now considering 154/312 (removed 158) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 107/277 places, 154/312 transitions.
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 6 ms
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 6 ms
[2023-03-22 16:57:38] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 247 transition count 282
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 247 transition count 282
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 86 place count 221 transition count 256
Iterating global reduction 0 with 26 rules applied. Total rules applied 112 place count 221 transition count 256
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 219 transition count 256
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 132 place count 201 transition count 238
Iterating global reduction 1 with 18 rules applied. Total rules applied 150 place count 201 transition count 238
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 161 place count 190 transition count 238
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 174 place count 177 transition count 225
Iterating global reduction 2 with 13 rules applied. Total rules applied 187 place count 177 transition count 225
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 200 place count 164 transition count 212
Iterating global reduction 2 with 13 rules applied. Total rules applied 213 place count 164 transition count 212
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 226 place count 151 transition count 199
Iterating global reduction 2 with 13 rules applied. Total rules applied 239 place count 151 transition count 199
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 255 place count 135 transition count 183
Iterating global reduction 2 with 16 rules applied. Total rules applied 271 place count 135 transition count 183
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 310 place count 96 transition count 144
Iterating global reduction 2 with 39 rules applied. Total rules applied 349 place count 96 transition count 144
Applied a total of 349 rules in 20 ms. Remains 96 /277 variables (removed 181) and now considering 144/312 (removed 168) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 96/277 places, 144/312 transitions.
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 5 ms
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 5 ms
[2023-03-22 16:57:38] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 247 transition count 282
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 247 transition count 282
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 85 place count 222 transition count 257
Iterating global reduction 0 with 25 rules applied. Total rules applied 110 place count 222 transition count 257
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 112 place count 220 transition count 257
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 128 place count 204 transition count 241
Iterating global reduction 1 with 16 rules applied. Total rules applied 144 place count 204 transition count 241
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 1 with 9 rules applied. Total rules applied 153 place count 195 transition count 241
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 164 place count 184 transition count 230
Iterating global reduction 2 with 11 rules applied. Total rules applied 175 place count 184 transition count 230
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 185 place count 174 transition count 220
Iterating global reduction 2 with 10 rules applied. Total rules applied 195 place count 174 transition count 220
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 203 place count 166 transition count 212
Iterating global reduction 2 with 8 rules applied. Total rules applied 211 place count 166 transition count 212
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 222 place count 155 transition count 201
Iterating global reduction 2 with 11 rules applied. Total rules applied 233 place count 155 transition count 201
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 255 place count 133 transition count 179
Iterating global reduction 2 with 22 rules applied. Total rules applied 277 place count 133 transition count 179
Applied a total of 277 rules in 16 ms. Remains 133 /277 variables (removed 144) and now considering 179/312 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 133/277 places, 179/312 transitions.
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 5 ms
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 6 ms
[2023-03-22 16:57:38] [INFO ] Input system was already deterministic with 179 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Graph (complete) has 690 edges and 277 vertex of which 276 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 276 transition count 255
Reduce places removed 56 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 61 rules applied. Total rules applied 118 place count 220 transition count 250
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 123 place count 215 transition count 250
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 123 place count 215 transition count 232
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 159 place count 197 transition count 232
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 175 place count 181 transition count 216
Iterating global reduction 3 with 16 rules applied. Total rules applied 191 place count 181 transition count 216
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
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 217 place count 168 transition count 203
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 231 place count 154 transition count 189
Iterating global reduction 3 with 14 rules applied. Total rules applied 245 place count 154 transition count 189
Applied a total of 245 rules in 35 ms. Remains 154 /277 variables (removed 123) and now considering 189/312 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 154/277 places, 189/312 transitions.
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 6 ms
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 6 ms
[2023-03-22 16:57:38] [INFO ] Input system was already deterministic with 189 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 248 transition count 283
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 248 transition count 283
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 85 place count 221 transition count 256
Iterating global reduction 0 with 27 rules applied. Total rules applied 112 place count 221 transition count 256
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 219 transition count 256
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 133 place count 200 transition count 237
Iterating global reduction 1 with 19 rules applied. Total rules applied 152 place count 200 transition count 237
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 1 with 9 rules applied. Total rules applied 161 place count 191 transition count 237
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 172 place count 180 transition count 226
Iterating global reduction 2 with 11 rules applied. Total rules applied 183 place count 180 transition count 226
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 194 place count 169 transition count 215
Iterating global reduction 2 with 11 rules applied. Total rules applied 205 place count 169 transition count 215
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 216 place count 158 transition count 204
Iterating global reduction 2 with 11 rules applied. Total rules applied 227 place count 158 transition count 204
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 241 place count 144 transition count 190
Iterating global reduction 2 with 14 rules applied. Total rules applied 255 place count 144 transition count 190
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 286 place count 113 transition count 159
Iterating global reduction 2 with 31 rules applied. Total rules applied 317 place count 113 transition count 159
Applied a total of 317 rules in 16 ms. Remains 113 /277 variables (removed 164) and now considering 159/312 (removed 153) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 113/277 places, 159/312 transitions.
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 4 ms
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 5 ms
[2023-03-22 16:57:38] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Graph (complete) has 690 edges and 277 vertex of which 276 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 276 transition count 267
Reduce places removed 44 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 56 rules applied. Total rules applied 101 place count 232 transition count 255
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 113 place count 220 transition count 255
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 113 place count 220 transition count 240
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 143 place count 205 transition count 240
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 155 place count 193 transition count 228
Iterating global reduction 3 with 12 rules applied. Total rules applied 167 place count 193 transition count 228
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 193 place count 180 transition count 215
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 207 place count 166 transition count 201
Iterating global reduction 3 with 14 rules applied. Total rules applied 221 place count 166 transition count 201
Applied a total of 221 rules in 26 ms. Remains 166 /277 variables (removed 111) and now considering 201/312 (removed 111) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 166/277 places, 201/312 transitions.
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 10 ms
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 7 ms
[2023-03-22 16:57:38] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 312/312 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 244 transition count 279
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 244 transition count 279
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 95 place count 215 transition count 250
Iterating global reduction 0 with 29 rules applied. Total rules applied 124 place count 215 transition count 250
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 126 place count 213 transition count 250
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 145 place count 194 transition count 231
Iterating global reduction 1 with 19 rules applied. Total rules applied 164 place count 194 transition count 231
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 176 place count 182 transition count 231
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 190 place count 168 transition count 217
Iterating global reduction 2 with 14 rules applied. Total rules applied 204 place count 168 transition count 217
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 218 place count 154 transition count 203
Iterating global reduction 2 with 14 rules applied. Total rules applied 232 place count 154 transition count 203
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 246 place count 140 transition count 189
Iterating global reduction 2 with 14 rules applied. Total rules applied 260 place count 140 transition count 189
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 275 place count 125 transition count 174
Iterating global reduction 2 with 15 rules applied. Total rules applied 290 place count 125 transition count 174
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 333 place count 82 transition count 131
Iterating global reduction 2 with 43 rules applied. Total rules applied 376 place count 82 transition count 131
Applied a total of 376 rules in 20 ms. Remains 82 /277 variables (removed 195) and now considering 131/312 (removed 181) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 82/277 places, 131/312 transitions.
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 5 ms
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 4 ms
[2023-03-22 16:57:38] [INFO ] Input system was already deterministic with 131 transitions.
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 10 ms
[2023-03-22 16:57:38] [INFO ] Flatten gal took : 11 ms
[2023-03-22 16:57:38] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-22 16:57:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 312 transitions and 995 arcs took 3 ms.
Total runtime 3182 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: 277 NrTr: 312 NrArc: 995)

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

net check time: 0m 0.000sec

init dd package: 0m 2.777sec


RS generation: 0m10.384sec


-> reachability set: #nodes 131711 (1.3e+05) #states 89,043 (4)



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

checking: EX [EG [[p67<=0 | p119<=0]]]
normalized: EX [EG [[p67<=0 | p119<=0]]]

abstracting: (p119<=0)
states: 88,632 (4)
abstracting: (p67<=0)
states: 17,806 (4)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.811sec

checking: EG [AG [AX [[p196<=0 & [p156<=0 | p167<=0]]]]]
normalized: EG [~ [E [true U EX [~ [[p196<=0 & [p156<=0 | p167<=0]]]]]]]

abstracting: (p167<=0)
states: 87,483 (4)
abstracting: (p156<=0)
states: 87,831 (4)
abstracting: (p196<=0)
states: 88,640 (4)
..
EG iterations: 1
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.157sec

checking: EG [AF [[EF [EG [[p202<=0 | p213<=0]]] | [1<=p65 & 1<=p67]]]]
normalized: EG [~ [EG [~ [[[1<=p65 & 1<=p67] | E [true U EG [[p202<=0 | p213<=0]]]]]]]]

abstracting: (p213<=0)
states: 88,636 (4)
abstracting: (p202<=0)
states: 85,384 (4)
.
EG iterations: 1
abstracting: (1<=p67)
states: 71,237 (4)
abstracting: (1<=p65)
states: 410
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.173sec

checking: EF [[[EG [[1<=p13 & 1<=p141]] & AX [[p216<=0 | [p220<=0 | p42<=0]]]] & [1<=p153 & 1<=p167]]]
normalized: E [true U [[1<=p153 & 1<=p167] & [~ [EX [~ [[p216<=0 | [p220<=0 | p42<=0]]]]] & EG [[1<=p13 & 1<=p141]]]]]

abstracting: (1<=p141)
states: 5,463 (3)
abstracting: (1<=p13)
states: 728
............
EG iterations: 12
abstracting: (p42<=0)
states: 88,640 (4)
abstracting: (p220<=0)
states: 87,158 (4)
abstracting: (p216<=0)
states: 87,849 (4)
.abstracting: (1<=p167)
states: 1,560 (3)
abstracting: (1<=p153)
states: 1,083 (3)
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.013sec

checking: AG [E [EX [[1<=p182 | A [[1<=p83 & 1<=p91] U [1<=p140 & 1<=p170]]]] U ~ [[~ [E [1<=p107 U [1<=p55 & 1<=p64]]] & 1<=p44]]]]
normalized: ~ [E [true U ~ [E [EX [[1<=p182 | [~ [EG [~ [[1<=p140 & 1<=p170]]]] & ~ [E [~ [[1<=p140 & 1<=p170]] U [~ [[1<=p83 & 1<=p91]] & ~ [[1<=p140 & 1<=p170]]]]]]]] U ~ [[1<=p44 & ~ [E [1<=p107 U [1<=p55 & 1<=p64]]]]]]]]]

abstracting: (1<=p64)
states: 1,593 (3)
abstracting: (1<=p55)
states: 1,212 (3)
abstracting: (1<=p107)
states: 404
abstracting: (1<=p44)
states: 406
abstracting: (1<=p170)
states: 71,411 (4)
abstracting: (1<=p140)
states: 369
abstracting: (1<=p91)
states: 1,589 (3)
abstracting: (1<=p83)
states: 1,206 (3)
abstracting: (1<=p170)
states: 71,411 (4)
abstracting: (1<=p140)
states: 369
abstracting: (1<=p170)
states: 71,411 (4)
abstracting: (1<=p140)
states: 369
.
EG iterations: 1
abstracting: (1<=p182)
states: 406
.-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.410sec

checking: E [[~ [[[~ [A [[1<=p169 & 1<=p77] U 1<=p247]] & 1<=p0] & [1<=p142 & [1<=p37 & 1<=p95]]]] | [1<=p119 & 1<=p203]] U EX [~ [EF [~ [[1<=p93 & 1<=p231]]]]]]
normalized: E [[[1<=p119 & 1<=p203] | ~ [[[1<=p142 & [1<=p37 & 1<=p95]] & [1<=p0 & ~ [[~ [EG [~ [1<=p247]]] & ~ [E [~ [1<=p247] U [~ [[1<=p169 & 1<=p77]] & ~ [1<=p247]]]]]]]]]] U EX [~ [E [true U ~ [[1<=p93 & 1<=p231]]]]]]

abstracting: (1<=p231)
states: 405
abstracting: (1<=p93)
states: 3,652 (3)
.abstracting: (1<=p247)
states: 405
abstracting: (1<=p77)
states: 404
abstracting: (1<=p169)
states: 3,640 (3)
abstracting: (1<=p247)
states: 405
abstracting: (1<=p247)
states: 405
..............
EG iterations: 14
abstracting: (1<=p0)
states: 456
abstracting: (1<=p95)
states: 404
abstracting: (1<=p37)
states: 3,631 (3)
abstracting: (1<=p142)
states: 70,325 (4)
abstracting: (1<=p203)
states: 70,623 (4)
abstracting: (1<=p119)
states: 411
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.569sec

checking: AX [EF [[[EX [[1<=p120 & 1<=p150]] & [1<=p66 & 1<=p175]] & [1<=p203 & [1<=p252 & [AF [1<=p172] | [[1<=p46 & 1<=p120] & [1<=p103 & 1<=p141]]]]]]]]
normalized: ~ [EX [~ [E [true U [[1<=p203 & [1<=p252 & [[[1<=p103 & 1<=p141] & [1<=p46 & 1<=p120]] | ~ [EG [~ [1<=p172]]]]]] & [[1<=p66 & 1<=p175] & EX [[1<=p120 & 1<=p150]]]]]]]]

abstracting: (1<=p150)
states: 405
abstracting: (1<=p120)
states: 3,657 (3)
.abstracting: (1<=p175)
states: 405
abstracting: (1<=p66)
states: 3,643 (3)
abstracting: (1<=p172)
states: 404
............
EG iterations: 12
abstracting: (1<=p120)
states: 3,657 (3)
abstracting: (1<=p46)
states: 405
abstracting: (1<=p141)
states: 5,463 (3)
abstracting: (1<=p103)
states: 364
abstracting: (1<=p252)
states: 408
abstracting: (1<=p203)
states: 70,623 (4)
.-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.515sec

checking: AG [[[EX [[1<=p15 & 1<=p33]] | ~ [E [EF [[1<=p56 & 1<=p222]] U ~ [[1<=p93 & 1<=p178]]]]] | [A [AF [1<=p227] U AF [[1<=p60 | 1<=p20]]] | [1<=p37 & 1<=p143]]]]
normalized: ~ [E [true U ~ [[[[1<=p37 & 1<=p143] | [~ [EG [EG [~ [[1<=p60 | 1<=p20]]]]] & ~ [E [EG [~ [[1<=p60 | 1<=p20]]] U [EG [~ [1<=p227]] & EG [~ [[1<=p60 | 1<=p20]]]]]]]] | [~ [E [E [true U [1<=p56 & 1<=p222]] U ~ [[1<=p93 & 1<=p178]]]] | EX [[1<=p15 & 1<=p33]]]]]]]

abstracting: (1<=p33)
states: 1,917 (3)
abstracting: (1<=p15)
states: 2,166 (3)
.abstracting: (1<=p178)
states: 406
abstracting: (1<=p93)
states: 3,652 (3)
abstracting: (1<=p222)
states: 3,645 (3)
abstracting: (1<=p56)
states: 405
abstracting: (1<=p20)
states: 404
abstracting: (1<=p60)
states: 403
..............
EG iterations: 14
abstracting: (1<=p227)
states: 403
..............
EG iterations: 14
abstracting: (1<=p20)
states: 404
abstracting: (1<=p60)
states: 403
..............
EG iterations: 14
abstracting: (1<=p20)
states: 404
abstracting: (1<=p60)
states: 403
..............
EG iterations: 14
.
EG iterations: 1
abstracting: (1<=p143)
states: 403
abstracting: (1<=p37)
states: 3,631 (3)
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.420sec

checking: AG [[A [[[EF [1<=p87] & ~ [[1<=p86 & 1<=p91]]] | EG [[1<=p189 & 1<=p200]]] U ~ [AG [[1<=p38 & 1<=p140]]]] | [AG [[p110<=0 | p118<=0]] | AX [[EF [[1<=p86 & 1<=p91]] & 1<=p196]]]]]
normalized: ~ [E [true U ~ [[[~ [EX [~ [[1<=p196 & E [true U [1<=p86 & 1<=p91]]]]]] | ~ [E [true U ~ [[p110<=0 | p118<=0]]]]] | [~ [EG [~ [E [true U ~ [[1<=p38 & 1<=p140]]]]]] & ~ [E [~ [E [true U ~ [[1<=p38 & 1<=p140]]]] U [~ [[EG [[1<=p189 & 1<=p200]] | [~ [[1<=p86 & 1<=p91]] & E [true U 1<=p87]]]] & ~ [E [true U ~ [[1<=p38 & 1<=p140]]]]]]]]]]]]

abstracting: (1<=p140)
states: 369
abstracting: (1<=p38)
states: 70,779 (4)
abstracting: (1<=p87)
states: 403
abstracting: (1<=p91)
states: 1,589 (3)
abstracting: (1<=p86)
states: 1,200 (3)
abstracting: (1<=p200)
states: 1,913 (3)
abstracting: (1<=p189)
states: 1,200 (3)
............
EG iterations: 12
abstracting: (1<=p140)
states: 369
abstracting: (1<=p38)
states: 70,779 (4)
abstracting: (1<=p140)
states: 369
abstracting: (1<=p38)
states: 70,779 (4)
.
EG iterations: 1
abstracting: (p118<=0)
states: 87,450 (4)
abstracting: (p110<=0)
states: 87,831 (4)
abstracting: (1<=p91)
states: 1,589 (3)
abstracting: (1<=p86)
states: 1,200 (3)
abstracting: (1<=p196)
states: 403
.-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.682sec

checking: [A [[1<=p177 & 1<=p198] U EX [A [p16<=0 U [AX [[1<=p67 & 1<=p168]] & AF [[1<=p36 & 1<=p203]]]]]] & [EG [[EX [EG [[1<=p74 & 1<=p89]]] | AX [[p184<=0 & p75<=0]]]] | AF [[1<=p161 & 1<=p253]]]]
normalized: [[~ [EG [~ [[1<=p161 & 1<=p253]]]] | EG [[~ [EX [~ [[p184<=0 & p75<=0]]]] | EX [EG [[1<=p74 & 1<=p89]]]]]] & [~ [EG [~ [EX [[~ [EG [~ [[~ [EG [~ [[1<=p36 & 1<=p203]]]] & ~ [EX [~ [[1<=p67 & 1<=p168]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p36 & 1<=p203]]]] & ~ [EX [~ [[1<=p67 & 1<=p168]]]]]] U [~ [p16<=0] & ~ [[~ [EG [~ [[1<=p36 & 1<=p203]]]] & ~ [EX [~ [[1<=p67 & 1<=p168]]]]]]]]]]]]]] & ~ [E [~ [EX [[~ [EG [~ [[~ [EG [~ [[1<=p36 & 1<=p203]]]] & ~ [EX [~ [[1<=p67 & 1<=p168]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p36 & 1<=p203]]]] & ~ [EX [~ [[1<=p67 & 1<=p168]]]]]] U [~ [p16<=0] & ~ [[~ [EG [~ [[1<=p36 & 1<=p203]]]] & ~ [EX [~ [[1<=p67 & 1<=p168]]]]]]]]]]]] U [~ [[1<=p177 & 1<=p198]] & ~ [EX [[~ [EG [~ [[~ [EG [~ [[1<=p36 & 1<=p203]]]] & ~ [EX [~ [[1<=p67 & 1<=p168]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p36 & 1<=p203]]]] & ~ [EX [~ [[1<=p67 & 1<=p168]]]]]] U [~ [p16<=0] & ~ [[~ [EG [~ [[1<=p36 & 1<=p203]]]] & ~ [EX [~ [[1<=p67 & 1<=p168]]]]]]]]]]]]]]]]]

abstracting: (1<=p168)
states: 409
abstracting: (1<=p67)
states: 71,237 (4)
.abstracting: (1<=p203)
states: 70,623 (4)
abstracting: (1<=p36)
states: 409
.
EG iterations: 1
abstracting: (p16<=0)
states: 88,315 (4)
abstracting: (1<=p168)
states: 409
abstracting: (1<=p67)
states: 71,237 (4)
.abstracting: (1<=p203)
states: 70,623 (4)
abstracting: (1<=p36)
states: 409
.
EG iterations: 1
abstracting: (1<=p168)
states: 409
abstracting: (1<=p67)
states: 71,237 (4)
.abstracting: (1<=p203)
states: 70,623 (4)
abstracting: (1<=p36)
states: 409
.
EG iterations: 1

EG iterations: 0
.abstracting: (1<=p198)
states: 1,586 (3)
abstracting: (1<=p177)
states: 1,206 (3)
abstracting: (1<=p168)
states: 409
abstracting: (1<=p67)
states: 71,237 (4)
.abstracting: (1<=p203)
states: 70,623 (4)
abstracting: (1<=p36)
states: 409
.
EG iterations: 1
abstracting: (p16<=0)
states: 88,315 (4)
abstracting: (1<=p168)
states: 409
abstracting: (1<=p67)
states: 71,237 (4)
.abstracting: (1<=p203)
states: 70,623 (4)
abstracting: (1<=p36)
states: 409
.
EG iterations: 1
abstracting: (1<=p168)
states: 409
abstracting: (1<=p67)
states: 71,237 (4)
.abstracting: (1<=p203)
states: 70,623 (4)
abstracting: (1<=p36)
states: 409
.
EG iterations: 1

EG iterations: 0
.abstracting: (1<=p168)
states: 409
abstracting: (1<=p67)
states: 71,237 (4)
.abstracting: (1<=p203)
states: 70,623 (4)
abstracting: (1<=p36)
states: 409
.
EG iterations: 1
abstracting: (p16<=0)
states: 88,315 (4)
abstracting: (1<=p168)
states: 409
abstracting: (1<=p67)
states: 71,237 (4)
.abstracting: (1<=p203)
states: 70,623 (4)
abstracting: (1<=p36)
states: 409
.
EG iterations: 1
abstracting: (1<=p168)
states: 409
abstracting: (1<=p67)
states: 71,237 (4)
.abstracting: (1<=p203)
states: 70,623 (4)
abstracting: (1<=p36)
states: 409
.
EG iterations: 1

EG iterations: 0
.
EG iterations: 0
abstracting: (1<=p89)
states: 1,882 (3)
abstracting: (1<=p74)
states: 1,206 (3)
............
EG iterations: 12
.abstracting: (p75<=0)
states: 88,637 (4)
abstracting: (p184<=0)
states: 88,315 (4)
..............
EG iterations: 13
abstracting: (1<=p253)
states: 3,624 (3)
abstracting: (1<=p161)
states: 402
.
EG iterations: 1
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.877sec

checking: E [E [1<=p3 U AX [[~ [[[1<=p169 & 1<=p212] | [1<=p243 & 1<=p251]]] | [~ [[1<=p53 & 1<=p202]] & EG [~ [[p94<=0 | p168<=0]]]]]]] U EF [AG [AX [[[1<=p146 & 1<=p66] | [1<=p135 & 1<=p253]]]]]]
normalized: E [E [1<=p3 U ~ [EX [~ [[[EG [~ [[p94<=0 | p168<=0]]] & ~ [[1<=p53 & 1<=p202]]] | ~ [[[1<=p243 & 1<=p251] | [1<=p169 & 1<=p212]]]]]]]] U E [true U ~ [E [true U EX [~ [[[1<=p146 & 1<=p66] | [1<=p135 & 1<=p253]]]]]]]]

abstracting: (1<=p253)
states: 3,624 (3)
abstracting: (1<=p135)
states: 398
abstracting: (1<=p66)
states: 3,643 (3)
abstracting: (1<=p146)
states: 405
.abstracting: (1<=p212)
states: 403
abstracting: (1<=p169)
states: 3,640 (3)
abstracting: (1<=p251)
states: 1,916 (3)
abstracting: (1<=p243)
states: 1,206 (3)
abstracting: (1<=p202)
states: 3,659 (3)
abstracting: (1<=p53)
states: 407
abstracting: (p168<=0)
states: 88,634 (4)
abstracting: (p94<=0)
states: 17,803 (4)
............
EG iterations: 12
.abstracting: (1<=p3)
states: 404
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.609sec

checking: E [[AG [A [[1<=p236 & 1<=p251] U ~ [[1<=p189 & 1<=p200]]]] | [A [~ [[[1<=p66 & 1<=p228] | [1<=p170 & 1<=p252]]] U AF [[1<=p31 & [1<=p148 & 1<=p165]]]] | ~ [AG [AF [[1<=p93 & 1<=p126]]]]]] U AF [1<=p58]]
normalized: E [[[E [true U EG [~ [[1<=p93 & 1<=p126]]]] | [~ [EG [EG [~ [[1<=p31 & [1<=p148 & 1<=p165]]]]]] & ~ [E [EG [~ [[1<=p31 & [1<=p148 & 1<=p165]]]] U [[[1<=p170 & 1<=p252] | [1<=p66 & 1<=p228]] & EG [~ [[1<=p31 & [1<=p148 & 1<=p165]]]]]]]]] | ~ [E [true U ~ [[~ [EG [[1<=p189 & 1<=p200]]] & ~ [E [[1<=p189 & 1<=p200] U [~ [[1<=p236 & 1<=p251]] & [1<=p189 & 1<=p200]]]]]]]]] U ~ [EG [~ [1<=p58]]]]

abstracting: (1<=p58)
states: 403
............
EG iterations: 12
abstracting: (1<=p200)
states: 1,913 (3)
abstracting: (1<=p189)
states: 1,200 (3)
abstracting: (1<=p251)
states: 1,916 (3)
abstracting: (1<=p236)
states: 2,166 (3)
abstracting: (1<=p200)
states: 1,913 (3)
abstracting: (1<=p189)
states: 1,200 (3)
abstracting: (1<=p200)
states: 1,913 (3)
abstracting: (1<=p189)
states: 1,200 (3)
............
EG iterations: 12
abstracting: (1<=p165)
states: 1,560 (3)
abstracting: (1<=p148)
states: 1,206 (3)
abstracting: (1<=p31)
states: 402
.
EG iterations: 1
abstracting: (1<=p228)
states: 404
abstracting: (1<=p66)
states: 3,643 (3)
abstracting: (1<=p252)
states: 408
abstracting: (1<=p170)
states: 71,411 (4)
abstracting: (1<=p165)
states: 1,560 (3)
abstracting: (1<=p148)
states: 1,206 (3)
abstracting: (1<=p31)
states: 402
.
EG iterations: 1
abstracting: (1<=p165)
states: 1,560 (3)
abstracting: (1<=p148)
states: 1,206 (3)
abstracting: (1<=p31)
states: 402
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p126)
states: 401
abstracting: (1<=p93)
states: 3,652 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.547sec

checking: [AF [1<=p266] | AG [[[EG [[1<=p21 & 1<=p202]] | [[E [[p174<=0 | E [1<=p5 U [1<=p94 & 1<=p140]]] U AX [[1<=p12 & 1<=p33]]] & E [A [[1<=p17 & 1<=p169] U 1<=p129] U [1<=p232 & p47<=0]]] | p140<=0]] | [[p203<=0 | p38<=0] | [p119<=0 | [1<=p114 & 1<=p253]]]]]]
normalized: [~ [E [true U ~ [[[[p119<=0 | [1<=p114 & 1<=p253]] | [p203<=0 | p38<=0]] | [[p140<=0 | [E [[~ [EG [~ [1<=p129]]] & ~ [E [~ [1<=p129] U [~ [[1<=p17 & 1<=p169]] & ~ [1<=p129]]]]] U [1<=p232 & p47<=0]] & E [[p174<=0 | E [1<=p5 U [1<=p94 & 1<=p140]]] U ~ [EX [~ [[1<=p12 & 1<=p33]]]]]]] | EG [[1<=p21 & 1<=p202]]]]]]] | ~ [EG [~ [1<=p266]]]]

abstracting: (1<=p266)
states: 1,599 (3)
............
EG iterations: 12
abstracting: (1<=p202)
states: 3,659 (3)
abstracting: (1<=p21)
states: 406
............
EG iterations: 12
abstracting: (1<=p33)
states: 1,917 (3)
abstracting: (1<=p12)
states: 1,206 (3)
.abstracting: (1<=p140)
states: 369
abstracting: (1<=p94)
states: 71,240 (4)
abstracting: (1<=p5)
states: 404
abstracting: (p174<=0)
states: 88,639 (4)
abstracting: (p47<=0)
states: 88,638 (4)
abstracting: (1<=p232)
states: 405
abstracting: (1<=p129)
states: 401
abstracting: (1<=p169)
states: 3,640 (3)
abstracting: (1<=p17)
states: 404
abstracting: (1<=p129)
states: 401
abstracting: (1<=p129)
states: 401
..............
EG iterations: 14
abstracting: (p140<=0)
states: 88,674 (4)
abstracting: (p38<=0)
states: 18,264 (4)
abstracting: (p203<=0)
states: 18,420 (4)
abstracting: (1<=p253)
states: 3,624 (3)
abstracting: (1<=p114)
states: 403
abstracting: (p119<=0)
states: 88,632 (4)
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.262sec

checking: E [A [[[1<=p239 & 1<=p251] | [EX [[1<=p219 & 1<=p265]] & [[E [[1<=p120 & 1<=p181] U [1<=p141 & 1<=p234]] | [1<=p119 & 1<=p121]] | [[1<=p23 & 1<=p35] | [1<=p248 & 1<=p255]]]]] U EX [1<=p75]] U A [~ [AG [[[[1<=p83 & 1<=p91] | [1<=p1 & 1<=p140]] & ~ [[1<=p50 & 1<=p169]]]]] U ~ [E [[[[1<=p199 & 1<=p265] & [1<=p63 & 1<=p265]] | EF [[1<=p193 & 1<=p253]]] U [[1<=p194 & 1<=p247] | EF [[1<=p0 & 1<=p38]]]]]]]
normalized: E [[~ [EG [~ [EX [1<=p75]]]] & ~ [E [~ [EX [1<=p75]] U [~ [[[[[[1<=p248 & 1<=p255] | [1<=p23 & 1<=p35]] | [[1<=p119 & 1<=p121] | E [[1<=p120 & 1<=p181] U [1<=p141 & 1<=p234]]]] & EX [[1<=p219 & 1<=p265]]] | [1<=p239 & 1<=p251]]] & ~ [EX [1<=p75]]]]]] U [~ [EG [E [[E [true U [1<=p193 & 1<=p253]] | [[1<=p63 & 1<=p265] & [1<=p199 & 1<=p265]]] U [E [true U [1<=p0 & 1<=p38]] | [1<=p194 & 1<=p247]]]]] & ~ [E [E [[E [true U [1<=p193 & 1<=p253]] | [[1<=p63 & 1<=p265] & [1<=p199 & 1<=p265]]] U [E [true U [1<=p0 & 1<=p38]] | [1<=p194 & 1<=p247]]] U [~ [E [true U ~ [[~ [[1<=p50 & 1<=p169]] & [[1<=p1 & 1<=p140] | [1<=p83 & 1<=p91]]]]]] & E [[E [true U [1<=p193 & 1<=p253]] | [[1<=p63 & 1<=p265] & [1<=p199 & 1<=p265]]] U [E [true U [1<=p0 & 1<=p38]] | [1<=p194 & 1<=p247]]]]]]]]

abstracting: (1<=p247)
states: 405
abstracting: (1<=p194)
states: 403
abstracting: (1<=p38)
states: 70,779 (4)
abstracting: (1<=p0)
states: 456
abstracting: (1<=p265)
states: 86,778 (4)
abstracting: (1<=p199)
states: 1,913 (3)
abstracting: (1<=p265)
states: 86,778 (4)
abstracting: (1<=p63)
states: 1,593 (3)
abstracting: (1<=p253)
states: 3,624 (3)
abstracting: (1<=p193)
states: 403
abstracting: (1<=p91)
states: 1,589 (3)
abstracting: (1<=p83)
states: 1,206 (3)
abstracting: (1<=p140)
states: 369
abstracting: (1<=p1)
states: 70,525 (4)
abstracting: (1<=p169)
states: 3,640 (3)
abstracting: (1<=p50)
states: 404
abstracting: (1<=p247)
states: 405
abstracting: (1<=p194)
states: 403
abstracting: (1<=p38)
states: 70,779 (4)
abstracting: (1<=p0)
states: 456
abstracting: (1<=p265)
states: 86,778 (4)
abstracting: (1<=p199)
states: 1,913 (3)
abstracting: (1<=p265)
states: 86,778 (4)
abstracting: (1<=p63)
states: 1,593 (3)
abstracting: (1<=p253)
states: 3,624 (3)
abstracting: (1<=p193)
states: 403
abstracting: (1<=p247)
states: 405
abstracting: (1<=p194)
states: 403
abstracting: (1<=p38)
states: 70,779 (4)
abstracting: (1<=p0)
states: 456
abstracting: (1<=p265)
states: 86,778 (4)
abstracting: (1<=p199)
states: 1,913 (3)
abstracting: (1<=p265)
states: 86,778 (4)
abstracting: (1<=p63)
states: 1,593 (3)
abstracting: (1<=p253)
states: 3,624 (3)
abstracting: (1<=p193)
states: 403
............
EG iterations: 12
abstracting: (1<=p75)
states: 406
.abstracting: (1<=p251)
states: 1,916 (3)
abstracting: (1<=p239)
states: 1,200 (3)
abstracting: (1<=p265)
states: 86,778 (4)
abstracting: (1<=p219)
states: 1,885 (3)
.abstracting: (1<=p234)
states: 728
abstracting: (1<=p141)
states: 5,463 (3)
abstracting: (1<=p181)
states: 406
abstracting: (1<=p120)
states: 3,657 (3)
abstracting: (1<=p121)
states: 57,724 (4)
abstracting: (1<=p119)
states: 411
abstracting: (1<=p35)
states: 1,599 (3)
abstracting: (1<=p23)
states: 1,209 (3)
abstracting: (1<=p255)
states: 86,828 (4)
abstracting: (1<=p248)
states: 1,564 (3)
abstracting: (1<=p75)
states: 406
.abstracting: (1<=p75)
states: 406
..............
EG iterations: 13
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C2-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.682sec

totally nodes used: 37193828 (3.7e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 68852792 279623089 348475881
used/not used/entry size/cache size: 66277835 831029 16 1024MB
basic ops cache: hits/miss/sum: 3477658 24083518 27561176
used/not used/entry size/cache size: 14855711 1921505 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 115353 849590 964943
used/not used/entry size/cache size: 808157 7580451 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 39335940
1 20255264
2 5941184
3 1301702
4 233520
5 35580
6 4814
7 619
8 77
9 14
>= 10 150

Total processing time: 2m 0.396sec


BK_STOP 1679504380075

--------------------
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 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.000sec


iterations count:70357 (225), effective:1410 (4)

initing FirstDep: 0m 0.000sec


iterations count:3218 (10), effective:35 (0)

iterations count:412 (1), effective:1 (0)

iterations count:634 (2), effective:6 (0)

iterations count:986 (3), effective:8 (0)

iterations count:314 (1), effective:1 (0)

iterations count:772 (2), effective:9 (0)

iterations count:448 (1), effective:1 (0)

iterations count:370 (1), effective:1 (0)

iterations count:415 (1), effective:2 (0)

iterations count:406 (1), effective:1 (0)

iterations count:664 (2), effective:6 (0)

iterations count:2709 (8), effective:32 (0)

iterations count:365 (1), effective:2 (0)

iterations count:1574 (5), effective:20 (0)

iterations count:365 (1), effective:2 (0)

iterations count:365 (1), effective:2 (0)

iterations count:1451 (4), effective:13 (0)

iterations count:1376 (4), effective:19 (0)

iterations count:1050 (3), effective:21 (0)

iterations count:1050 (3), effective:21 (0)

iterations count:980 (3), effective:9 (0)

iterations count:1050 (3), effective:21 (0)

iterations count:350 (1), effective:1 (0)

iterations count:42625 (136), effective:676 (2)

iterations count:592 (1), effective:4 (0)

iterations count:312 (1), effective:0 (0)

iterations count:444 (1), effective:1 (0)

iterations count:1674 (5), effective:20 (0)

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

iterations count:325 (1), effective:1 (0)

iterations count:432 (1), effective:2 (0)

iterations count:353 (1), effective:1 (0)

iterations count:43278 (138), effective:698 (2)

iterations count:350 (1), effective:1 (0)

iterations count:312 (1), effective:0 (0)

iterations count:503 (1), effective:2 (0)

iterations count:312 (1), effective:0 (0)

iterations count:497 (1), effective:2 (0)

iterations count:881 (2), effective:7 (0)

iterations count:1078 (3), effective:10 (0)

iterations count:312 (1), effective:0 (0)

iterations count:497 (1), effective:2 (0)

iterations count:881 (2), effective:7 (0)

iterations count:312 (1), effective:0 (0)

iterations count:497 (1), effective:2 (0)

iterations count:881 (2), effective:7 (0)

iterations count:446 (1), effective:2 (0)

iterations count:1442 (4), effective:16 (0)

iterations count:312 (1), effective:0 (0)

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="LeafsetExtension-PT-S08C2"
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 LeafsetExtension-PT-S08C2, 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 r234-tall-167856420300450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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