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

About the Execution of Marcie+red for AutoFlight-PT-12a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10247.163 3600000.00 3668279.00 95.50 F?FF?T?TT?TFFT?? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r010-oct2-167813599100466.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-12a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599100466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 18:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 18:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 85K 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 AutoFlight-PT-12a-CTLFireability-00
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-01
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-02
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-03
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-04
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-05
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-06
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-07
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-08
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-09
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-10
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-11
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-12
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-13
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-14
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678691870783

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=AutoFlight-PT-12a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 07:17:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 07:17:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:17:53] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-13 07:17:53] [INFO ] Transformed 307 places.
[2023-03-13 07:17:53] [INFO ] Transformed 305 transitions.
[2023-03-13 07:17:53] [INFO ] Found NUPN structural information;
[2023-03-13 07:17:53] [INFO ] Parsed PT model containing 307 places and 305 transitions and 980 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
Support contains 156 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 245/245 transitions.
Applied a total of 0 rules in 18 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2023-03-13 07:17:53] [INFO ] Computed 76 place invariants in 21 ms
[2023-03-13 07:17:54] [INFO ] Implicit Places using invariants in 574 ms returned [87, 99, 114, 117, 120, 182, 232, 256, 268, 280, 292, 298, 304]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 606 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 294/307 places, 245/245 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 289 transition count 240
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 289 transition count 240
Applied a total of 10 rules in 35 ms. Remains 289 /294 variables (removed 5) and now considering 240/245 (removed 5) transitions.
// Phase 1: matrix 240 rows 289 cols
[2023-03-13 07:17:54] [INFO ] Computed 63 place invariants in 5 ms
[2023-03-13 07:17:54] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-13 07:17:54] [INFO ] Invariant cache hit.
[2023-03-13 07:17:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-13 07:17:55] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 289/307 places, 240/245 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1635 ms. Remains : 289/307 places, 240/245 transitions.
Support contains 156 out of 289 places after structural reductions.
[2023-03-13 07:17:55] [INFO ] Flatten gal took : 74 ms
[2023-03-13 07:17:55] [INFO ] Flatten gal took : 37 ms
[2023-03-13 07:17:55] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 150 out of 289 places (down from 156) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 95) seen :72
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-13 07:17:56] [INFO ] Invariant cache hit.
[2023-03-13 07:17:56] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-13 07:17:56] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:21
[2023-03-13 07:17:57] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-13 07:17:58] [INFO ] After 761ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :16
[2023-03-13 07:17:58] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-13 07:17:58] [INFO ] After 610ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :7 sat :16
[2023-03-13 07:17:59] [INFO ] Deduced a trap composed of 115 places in 489 ms of which 6 ms to minimize.
[2023-03-13 07:17:59] [INFO ] Deduced a trap composed of 114 places in 89 ms of which 0 ms to minimize.
[2023-03-13 07:17:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 636 ms
[2023-03-13 07:17:59] [INFO ] Deduced a trap composed of 113 places in 284 ms of which 48 ms to minimize.
[2023-03-13 07:17:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-13 07:18:00] [INFO ] After 2406ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :14
Attempting to minimize the solution found.
Minimization took 527 ms.
[2023-03-13 07:18:00] [INFO ] After 4274ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :14
Fused 23 Parikh solutions to 14 different solutions.
Parikh walk visited 11 properties in 88 ms.
Support contains 12 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 240/240 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 289 transition count 206
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 255 transition count 206
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 68 place count 255 transition count 189
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 102 place count 238 transition count 189
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 236 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 236 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 235 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 235 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 234 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 234 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 233 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 233 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 232 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 232 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 231 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 231 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 230 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 230 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 229 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 229 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 228 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 228 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 227 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 227 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 226 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 226 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 225 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 225 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 224 transition count 175
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 224 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 223 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 223 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 222 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 222 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 221 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 221 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 220 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 220 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 219 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 219 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 218 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 218 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 217 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 217 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 216 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 216 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 215 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 215 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 214 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 214 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 213 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 213 transition count 164
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 196 place count 191 transition count 142
Free-agglomeration rule applied 21 times.
Iterating global reduction 2 with 21 rules applied. Total rules applied 217 place count 191 transition count 121
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 238 place count 170 transition count 121
Applied a total of 238 rules in 157 ms. Remains 170 /289 variables (removed 119) and now considering 121/240 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 170/289 places, 121/240 transitions.
Incomplete random walk after 10000 steps, including 181 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :2
Finished Best-First random walk after 291 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=145 )
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2023-03-13 07:18:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 07:18:01] [INFO ] Flatten gal took : 15 ms
FORMULA AutoFlight-PT-12a-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 07:18:01] [INFO ] Flatten gal took : 13 ms
[2023-03-13 07:18:01] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 118 out of 289 places (down from 127) after GAL structural reductions.
Computed a total of 20 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 289 transition count 209
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 258 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 257 transition count 208
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 64 place count 257 transition count 189
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 102 place count 238 transition count 189
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 105 place count 235 transition count 186
Iterating global reduction 3 with 3 rules applied. Total rules applied 108 place count 235 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 234 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 234 transition count 185
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 150 place count 214 transition count 165
Applied a total of 150 rules in 41 ms. Remains 214 /289 variables (removed 75) and now considering 165/240 (removed 75) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 214/289 places, 165/240 transitions.
[2023-03-13 07:18:01] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:18:01] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:18:01] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 289 transition count 206
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 255 transition count 206
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 68 place count 255 transition count 188
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 104 place count 237 transition count 188
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 234 transition count 185
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 234 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 233 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 233 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 232 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 232 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 231 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 231 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 230 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 230 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 229 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 229 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 228 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 228 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 227 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 227 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 226 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 226 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 225 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 225 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 224 transition count 175
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 224 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 223 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 223 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 222 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 222 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 221 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 221 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 220 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 220 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 219 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 219 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 218 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 218 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 217 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 217 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 216 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 216 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 215 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 215 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 214 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 214 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 213 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 213 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 212 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 212 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 211 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 211 transition count 162
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 198 place count 190 transition count 141
Applied a total of 198 rules in 128 ms. Remains 190 /289 variables (removed 99) and now considering 141/240 (removed 99) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 128 ms. Remains : 190/289 places, 141/240 transitions.
[2023-03-13 07:18:01] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:18:01] [INFO ] Flatten gal took : 19 ms
[2023-03-13 07:18:01] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 289 transition count 206
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 255 transition count 206
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 68 place count 255 transition count 187
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 106 place count 236 transition count 187
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 233 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 233 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 232 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 232 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 231 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 231 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 230 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 230 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 229 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 229 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 228 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 228 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 227 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 227 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 226 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 226 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 225 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 225 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 224 transition count 175
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 224 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 223 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 223 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 222 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 222 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 221 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 221 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 220 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 220 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 219 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 219 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 218 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 218 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 217 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 217 transition count 168
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 192 place count 193 transition count 144
Applied a total of 192 rules in 106 ms. Remains 193 /289 variables (removed 96) and now considering 144/240 (removed 96) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 116 ms. Remains : 193/289 places, 144/240 transitions.
[2023-03-13 07:18:01] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:18:01] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:18:01] [INFO ] Input system was already deterministic with 144 transitions.
Finished random walk after 472 steps, including 11 resets, run visited all 1 properties in 3 ms. (steps per millisecond=157 )
FORMULA AutoFlight-PT-12a-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 273 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 273 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 272 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 272 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 271 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 271 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 270 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 270 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 269 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 269 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 267 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 267 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 266 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 266 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 265 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 265 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 264 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 264 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 263 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 263 transition count 214
Applied a total of 52 rules in 73 ms. Remains 263 /289 variables (removed 26) and now considering 214/240 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 263/289 places, 214/240 transitions.
[2023-03-13 07:18:01] [INFO ] Flatten gal took : 9 ms
[2023-03-13 07:18:01] [INFO ] Flatten gal took : 10 ms
[2023-03-13 07:18:01] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Applied a total of 12 rules in 29 ms. Remains 283 /289 variables (removed 6) and now considering 234/240 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 283/289 places, 234/240 transitions.
[2023-03-13 07:18:01] [INFO ] Flatten gal took : 9 ms
[2023-03-13 07:18:01] [INFO ] Flatten gal took : 10 ms
[2023-03-13 07:18:01] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 273 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 273 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 272 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 272 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 271 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 271 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 270 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 270 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 269 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 269 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 267 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 267 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 266 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 266 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 265 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 265 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 264 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 264 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 263 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 263 transition count 214
Applied a total of 52 rules in 65 ms. Remains 263 /289 variables (removed 26) and now considering 214/240 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 263/289 places, 214/240 transitions.
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 9 ms
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 10 ms
[2023-03-13 07:18:02] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Applied a total of 8 rules in 8 ms. Remains 285 /289 variables (removed 4) and now considering 236/240 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 285/289 places, 236/240 transitions.
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 14 ms
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 9 ms
[2023-03-13 07:18:02] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 273 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 273 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 272 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 272 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 271 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 271 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 270 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 270 transition count 221
Applied a total of 38 rules in 40 ms. Remains 270 /289 variables (removed 19) and now considering 221/240 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 270/289 places, 221/240 transitions.
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:18:02] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 287 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 287 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 286 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Applied a total of 12 rules in 15 ms. Remains 283 /289 variables (removed 6) and now considering 234/240 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 283/289 places, 234/240 transitions.
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 9 ms
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 9 ms
[2023-03-13 07:18:02] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 273 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 273 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 272 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 272 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 271 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 271 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 270 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 270 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 269 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 269 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 267 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 267 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 266 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 266 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 265 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 265 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 264 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 264 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 263 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 263 transition count 214
Applied a total of 52 rules in 56 ms. Remains 263 /289 variables (removed 26) and now considering 214/240 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 263/289 places, 214/240 transitions.
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:18:02] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Applied a total of 12 rules in 12 ms. Remains 283 /289 variables (removed 6) and now considering 234/240 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 283/289 places, 234/240 transitions.
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:18:02] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 273 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 273 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 272 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 272 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 271 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 271 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 270 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 270 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 269 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 269 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 267 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 267 transition count 218
Applied a total of 44 rules in 46 ms. Remains 267 /289 variables (removed 22) and now considering 218/240 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 267/289 places, 218/240 transitions.
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:18:02] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 273 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 273 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 272 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 272 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 271 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 271 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 270 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 270 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 269 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 269 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 267 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 267 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 266 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 266 transition count 217
Applied a total of 46 rules in 75 ms. Remains 266 /289 variables (removed 23) and now considering 217/240 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 266/289 places, 217/240 transitions.
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:18:02] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 287 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 287 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 286 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Applied a total of 30 rules in 43 ms. Remains 274 /289 variables (removed 15) and now considering 225/240 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 274/289 places, 225/240 transitions.
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:18:02] [INFO ] Input system was already deterministic with 225 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 289 transition count 212
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 261 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 259 transition count 210
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 60 place count 259 transition count 192
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 96 place count 241 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 240 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 240 transition count 191
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 136 place count 221 transition count 172
Applied a total of 136 rules in 14 ms. Remains 221 /289 variables (removed 68) and now considering 172/240 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 221/289 places, 172/240 transitions.
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:18:02] [INFO ] Input system was already deterministic with 172 transitions.
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:18:02] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:18:02] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 07:18:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 289 places, 240 transitions and 806 arcs took 2 ms.
Total runtime 9393 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: 289 NrTr: 240 NrArc: 806)

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

net check time: 0m 0.000sec

init dd package: 0m 3.001sec


RS generation: 0m 0.421sec


-> reachability set: #nodes 2600 (2.6e+03) #states 74,732,664,246,239,233 (16)



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

checking: AX [AF [[[p197<=1 & 1<=p197] & EF [[~ [[p237<=1 & 1<=p237]] | ~ [[p288<=1 & 1<=p288]]]]]]]
normalized: ~ [EX [EG [~ [[E [true U [~ [[p288<=1 & 1<=p288]] | ~ [[p237<=1 & 1<=p237]]]] & [p197<=1 & 1<=p197]]]]]]

abstracting: (1<=p197)
states: 8,916,100,448,256 (12)
abstracting: (p197<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p237)
states: 1,156,831,381,426,176 (15)
abstracting: (p237<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p288)
states: 73,575,832,864,813,056 (16)
abstracting: (p288<=1)
states: 74,732,664,246,239,233 (16)
....................................................................................................
EG iterations: 100
.-> the formula is FALSE

FORMULA AutoFlight-PT-12a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.126sec

checking: E [~ [AX [[[p56<=1 & 1<=p56] & [p160<=1 & 1<=p160]]]] U EG [~ [[~ [EF [[[p242<=1 & 1<=p242] & [p287<=1 & 1<=p287]]]] & EX [[p198<=1 & 1<=p198]]]]]]
normalized: E [EX [~ [[[p160<=1 & 1<=p160] & [p56<=1 & 1<=p56]]]] U EG [~ [[EX [[p198<=1 & 1<=p198]] & ~ [E [true U [[p287<=1 & 1<=p287] & [p242<=1 & 1<=p242]]]]]]]]

abstracting: (1<=p242)
states: 68,948,507,339,108,352 (16)
abstracting: (p242<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p287)
states: 1,156,831,381,426,176 (15)
abstracting: (p287<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p198)
states: 8,916,100,448,256 (12)
abstracting: (p198<=1)
states: 74,732,664,246,239,233 (16)
.
EG iterations: 0
abstracting: (1<=p56)
states: 74,732,664,246,239,232 (16)
abstracting: (p56<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p160)
states: 8,916,100,448,256 (12)
abstracting: (p160<=1)
states: 74,732,664,246,239,233 (16)
.-> the formula is TRUE

FORMULA AutoFlight-PT-12a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.584sec

checking: AG [AX [[~ [A [E [[[p77<=1 & 1<=p77] & [p211<=1 & 1<=p211]] U [p17<=1 & 1<=p17]] U AX [[p54<=1 & 1<=p54]]]] | [[p95<=1 & 1<=p95] & [p247<=1 & 1<=p247]]]]]
normalized: ~ [E [true U EX [~ [[[[p247<=1 & 1<=p247] & [p95<=1 & 1<=p95]] | ~ [[~ [EG [EX [~ [[p54<=1 & 1<=p54]]]]] & ~ [E [EX [~ [[p54<=1 & 1<=p54]]] U [~ [E [[[p211<=1 & 1<=p211] & [p77<=1 & 1<=p77]] U [p17<=1 & 1<=p17]]] & EX [~ [[p54<=1 & 1<=p54]]]]]]]]]]]]]

abstracting: (1<=p54)
states: 24,660,471,042,146,304 (16)
abstracting: (p54<=1)
states: 74,732,664,246,239,233 (16)
.abstracting: (1<=p17)
states: 24,987,789,448,445,952 (16)
abstracting: (p17<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p77)
states: 74,732,664,246,239,232 (16)
abstracting: (p77<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p211)
states: 8,916,100,448,256 (12)
abstracting: (p211<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p54)
states: 24,660,471,042,146,304 (16)
abstracting: (p54<=1)
states: 74,732,664,246,239,233 (16)
.abstracting: (1<=p54)
states: 24,660,471,042,146,304 (16)
abstracting: (p54<=1)
states: 74,732,664,246,239,233 (16)
.............
before gc: list nodes free: 675865

after gc: idd nodes used:1832456, unused:62167544; list nodes free:295144686
.
before gc: list nodes free: 1727205

after gc: idd nodes used:2099351, unused:61900649; list nodes free:296227652
.
before gc: list nodes free: 1484473

after gc: idd nodes used:2867869, unused:61132131; list nodes free:292610535

before gc: list nodes free: 1832297

after gc: idd nodes used:3811617, unused:60188383; list nodes free:288027769
.MC time: 5m 0.834sec

checking: EF [EG [[E [[[p89<=1 & 1<=p89] & [p235<=1 & 1<=p235]] U [p97<=1 & 1<=p97]] | [[p58<=1 & 1<=p58] | [[p73<=1 & 1<=p73] & [[p6<=1 & 1<=p6] & [p227<=1 & 1<=p227]]]]]]]
normalized: E [true U EG [[[[[[p227<=1 & 1<=p227] & [p6<=1 & 1<=p6]] & [p73<=1 & 1<=p73]] | [p58<=1 & 1<=p58]] | E [[[p235<=1 & 1<=p235] & [p89<=1 & 1<=p89]] U [p97<=1 & 1<=p97]]]]]

abstracting: (1<=p97)
states: 37,366,332,123,119,616 (16)
abstracting: (p97<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p89)
states: 74,732,664,246,239,232 (16)
abstracting: (p89<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p235)
states: 1,156,831,381,426,176 (15)
abstracting: (p235<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p58)
states: 24,548,636,672,851,968 (16)
abstracting: (p58<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p73)
states: 25,234,832,475,758,592 (16)
abstracting: (p73<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p6)
states: 24,964,384,684,769,280 (16)
abstracting: (p6<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p227)
states: 1,156,831,381,426,176 (15)
abstracting: (p227<=1)
states: 74,732,664,246,239,233 (16)
...........
before gc: list nodes free: 3505424

after gc: idd nodes used:1319577, unused:62680423; list nodes free:299953555
.
before gc: list nodes free: 2286164

after gc: idd nodes used:1987128, unused:62012872; list nodes free:296806505
.
before gc: list nodes free: 2154138

after gc: idd nodes used:2895622, unused:61104378; list nodes free:292513301
MC time: 4m35.508sec

checking: EG [[~ [E [EF [[p3<=1 & 1<=p3]] U [[[p36<=1 & 1<=p36] & [p170<=1 & 1<=p170]] | [p58<=1 & 1<=p58]]]] | [AX [EX [[p68<=0 & 0<=p68]]] | [[p61<=0 & 0<=p61] & AX [[p94<=0 & 0<=p94]]]]]]
normalized: EG [[[[~ [EX [~ [[p94<=0 & 0<=p94]]]] & [p61<=0 & 0<=p61]] | ~ [EX [~ [EX [[p68<=0 & 0<=p68]]]]]] | ~ [E [E [true U [p3<=1 & 1<=p3]] U [[p58<=1 & 1<=p58] | [[p170<=1 & 1<=p170] & [p36<=1 & 1<=p36]]]]]]]

abstracting: (1<=p36)
states: 25,011,612,154,331,136 (16)
abstracting: (p36<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p170)
states: 101,559,956,668,416 (14)
abstracting: (p170<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p58)
states: 24,548,636,672,851,968 (16)
abstracting: (p58<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p3)
states: 24,982,216,885,665,792 (16)
abstracting: (p3<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (0<=p68)
states: 74,732,664,246,239,233 (16)
abstracting: (p68<=0)
states: 50,262,618,122,846,209 (16)
..abstracting: (0<=p61)
states: 74,732,664,246,239,233 (16)
abstracting: (p61<=0)
states: 50,148,363,171,594,241 (16)
abstracting: (0<=p94)
states: 74,732,664,246,239,233 (16)
abstracting: (p94<=0)
states: 37,366,332,123,119,617 (16)
.
EG iterations: 0
-> the formula is TRUE

FORMULA AutoFlight-PT-12a-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.037sec

checking: AF [[AX [1<=0] | [AF [[[EF [[p197<=1 & 1<=p197]] | [[[p21<=1 & 1<=p21] & [p179<=1 & 1<=p179]] | [[p34<=1 & 1<=p34] & [p250<=1 & 1<=p250]]]] & [[p62<=0 & 0<=p62] | [p270<=0 & 0<=p270]]]] & EG [[p97<=1 & 1<=p97]]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [[[[p270<=0 & 0<=p270] | [p62<=0 & 0<=p62]] & [[[[p250<=1 & 1<=p250] & [p34<=1 & 1<=p34]] | [[p179<=1 & 1<=p179] & [p21<=1 & 1<=p21]]] | E [true U [p197<=1 & 1<=p197]]]]]]] & EG [[p97<=1 & 1<=p97]]] | ~ [EX [~ [1<=0]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p97)
states: 37,366,332,123,119,616 (16)
abstracting: (p97<=1)
states: 74,732,664,246,239,233 (16)
..........
before gc: list nodes free: 3969016

after gc: idd nodes used:427888, unused:63572112; list nodes free:304170854
....
before gc: list nodes free: 2221577

after gc: idd nodes used:2109805, unused:61890195; list nodes free:296219552
.
before gc: list nodes free: 2083314

after gc: idd nodes used:1447983, unused:62552017; list nodes free:299342469

before gc: list nodes free: 3606555

after gc: idd nodes used:2878056, unused:61121944; list nodes free:292582697
MC time: 4m34.181sec

checking: [AF [[[p106<=1 & 1<=p106] & [p267<=1 & 1<=p267]]] | AX [[[[p236<=0 & 0<=p236] | [[p287<=0 & 0<=p287] | [[[p263<=0 & 0<=p263] | [p287<=0 & 0<=p287]] & [p65<=0 & 0<=p65]]]] & [EF [[p45<=0 & 0<=p45]] & EF [EG [[p149<=0 & 0<=p149]]]]]]]
normalized: [~ [EX [~ [[[E [true U EG [[p149<=0 & 0<=p149]]] & E [true U [p45<=0 & 0<=p45]]] & [[[[p65<=0 & 0<=p65] & [[p287<=0 & 0<=p287] | [p263<=0 & 0<=p263]]] | [p287<=0 & 0<=p287]] | [p236<=0 & 0<=p236]]]]]] | ~ [EG [~ [[[p267<=1 & 1<=p267] & [p106<=1 & 1<=p106]]]]]]

abstracting: (1<=p106)
states: 74,732,664,246,239,232 (16)
abstracting: (p106<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p267)
states: 1,156,831,381,426,176 (15)
abstracting: (p267<=1)
states: 74,732,664,246,239,233 (16)
.
EG iterations: 1
abstracting: (0<=p236)
states: 74,732,664,246,239,233 (16)
abstracting: (p236<=0)
states: 5,784,156,907,130,881 (15)
abstracting: (0<=p287)
states: 74,732,664,246,239,233 (16)
abstracting: (p287<=0)
states: 73,575,832,864,813,057 (16)
abstracting: (0<=p263)
states: 74,732,664,246,239,233 (16)
abstracting: (p263<=0)
states: 5,784,156,907,130,881 (15)
abstracting: (0<=p287)
states: 74,732,664,246,239,233 (16)
abstracting: (p287<=0)
states: 73,575,832,864,813,057 (16)
abstracting: (0<=p65)
states: 74,732,664,246,239,233 (16)
abstracting: (p65<=0)
states: 50,298,282,524,639,233 (16)
abstracting: (0<=p45)
states: 74,732,664,246,239,233 (16)
abstracting: (p45<=0)
states: 49,704,125,432,463,361 (16)
abstracting: (0<=p149)
states: 74,732,664,246,239,233 (16)
abstracting: (p149<=0)
states: 74,723,748,145,790,977 (16)
....................................................................................................
EG iterations: 100
.-> the formula is FALSE

FORMULA AutoFlight-PT-12a-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.969sec

checking: EF [[EX [E [[[p8<=1 & 1<=p8] & [p166<=1 & 1<=p166]] U [p91<=1 & 1<=p91]]] & E [[~ [[[p42<=1 & 1<=p42] & [p206<=1 & 1<=p206]]] & [[p84<=1 & 1<=p84] & [p188<=1 & 1<=p188]]] U EX [[[p35<=1 & 1<=p35] & [p121<=1 & 1<=p121]]]]]]
normalized: E [true U [E [[[[p188<=1 & 1<=p188] & [p84<=1 & 1<=p84]] & ~ [[[p206<=1 & 1<=p206] & [p42<=1 & 1<=p42]]]] U EX [[[p121<=1 & 1<=p121] & [p35<=1 & 1<=p35]]]] & EX [E [[[p166<=1 & 1<=p166] & [p8<=1 & 1<=p8]] U [p91<=1 & 1<=p91]]]]]

abstracting: (1<=p91)
states: 37,366,332,123,119,616 (16)
abstracting: (p91<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p8)
states: 24,984,445,910,777,856 (16)
abstracting: (p8<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p166)
states: 20,061,226,008,576 (13)
abstracting: (p166<=1)
states: 74,732,664,246,239,233 (16)
.abstracting: (1<=p35)
states: 74,732,664,246,239,232 (16)
abstracting: (p35<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p121)
states: 8,916,100,448,256 (12)
abstracting: (p121<=1)
states: 74,732,664,246,239,233 (16)
.abstracting: (1<=p42)
states: 74,732,664,246,239,232 (16)
abstracting: (p42<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p206)
states: 8,916,100,448,256 (12)
abstracting: (p206<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p84)
states: 74,732,664,246,239,232 (16)
abstracting: (p84<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p188)
states: 8,916,100,448,256 (12)
abstracting: (p188<=1)
states: 74,732,664,246,239,233 (16)
-> the formula is TRUE

FORMULA AutoFlight-PT-12a-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.690sec

checking: A [EX [~ [EG [[p136<=1 & 1<=p136]]]] U [AX [[EX [[p61<=1 & 1<=p61]] & [~ [AG [[[p35<=1 & 1<=p35] & [p181<=1 & 1<=p181]]]] & [EG [[[p8<=1 & 1<=p8] & [p166<=1 & 1<=p166]]] | [[p68<=1 & 1<=p68] | [p34<=1 & 1<=p34]]]]]] & [EF [~ [EF [[p111<=1 & 1<=p111]]]] & EF [~ [[[p102<=1 & 1<=p102] & [[p15<=1 & 1<=p15] & [p167<=1 & 1<=p167]]]]]]]]
normalized: [~ [EG [~ [[[E [true U ~ [[[[p167<=1 & 1<=p167] & [p15<=1 & 1<=p15]] & [p102<=1 & 1<=p102]]]] & E [true U ~ [E [true U [p111<=1 & 1<=p111]]]]] & ~ [EX [~ [[[[[[p34<=1 & 1<=p34] | [p68<=1 & 1<=p68]] | EG [[[p166<=1 & 1<=p166] & [p8<=1 & 1<=p8]]]] & E [true U ~ [[[p181<=1 & 1<=p181] & [p35<=1 & 1<=p35]]]]] & EX [[p61<=1 & 1<=p61]]]]]]]]]] & ~ [E [~ [[[E [true U ~ [[[[p167<=1 & 1<=p167] & [p15<=1 & 1<=p15]] & [p102<=1 & 1<=p102]]]] & E [true U ~ [E [true U [p111<=1 & 1<=p111]]]]] & ~ [EX [~ [[[[[[p34<=1 & 1<=p34] | [p68<=1 & 1<=p68]] | EG [[[p166<=1 & 1<=p166] & [p8<=1 & 1<=p8]]]] & E [true U ~ [[[p181<=1 & 1<=p181] & [p35<=1 & 1<=p35]]]]] & EX [[p61<=1 & 1<=p61]]]]]]]] U [~ [EX [~ [EG [[p136<=1 & 1<=p136]]]]] & ~ [[[E [true U ~ [[[[p167<=1 & 1<=p167] & [p15<=1 & 1<=p15]] & [p102<=1 & 1<=p102]]]] & E [true U ~ [E [true U [p111<=1 & 1<=p111]]]]] & ~ [EX [~ [[[[[[p34<=1 & 1<=p34] | [p68<=1 & 1<=p68]] | EG [[[p166<=1 & 1<=p166] & [p8<=1 & 1<=p8]]]] & E [true U ~ [[[p181<=1 & 1<=p181] & [p35<=1 & 1<=p35]]]]] & EX [[p61<=1 & 1<=p61]]]]]]]]]]]]

abstracting: (1<=p61)
states: 24,584,301,074,644,992 (16)
abstracting: (p61<=1)
states: 74,732,664,246,239,233 (16)
.abstracting: (1<=p35)
states: 74,732,664,246,239,232 (16)
abstracting: (p35<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p181)
states: 8,916,100,448,256 (12)
abstracting: (p181<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p8)
states: 24,984,445,910,777,856 (16)
abstracting: (p8<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p166)
states: 20,061,226,008,576 (13)
abstracting: (p166<=1)
states: 74,732,664,246,239,233 (16)
..................................................
EG iterations: 50
abstracting: (1<=p68)
states: 24,470,046,123,393,024 (16)
abstracting: (p68<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p34)
states: 24,982,495,513,804,800 (16)
abstracting: (p34<=1)
states: 74,732,664,246,239,233 (16)
.abstracting: (1<=p111)
states: 37,366,332,123,119,616 (16)
abstracting: (p111<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p102)
states: 37,366,332,123,119,616 (16)
abstracting: (p102<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p15)
states: 24,987,789,448,445,952 (16)
abstracting: (p15<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p167)
states: 30,091,839,012,864 (13)
abstracting: (p167<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p136)
states: 8,916,100,448,256 (12)
abstracting: (p136<=1)
states: 74,732,664,246,239,233 (16)
..................................................
EG iterations: 50
.abstracting: (1<=p61)
states: 24,584,301,074,644,992 (16)
abstracting: (p61<=1)
states: 74,732,664,246,239,233 (16)
.abstracting: (1<=p35)
states: 74,732,664,246,239,232 (16)
abstracting: (p35<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p181)
states: 8,916,100,448,256 (12)
abstracting: (p181<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p8)
states: 24,984,445,910,777,856 (16)
abstracting: (p8<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p166)
states: 20,061,226,008,576 (13)
abstracting: (p166<=1)
states: 74,732,664,246,239,233 (16)
..................................................
EG iterations: 50
abstracting: (1<=p68)
states: 24,470,046,123,393,024 (16)
abstracting: (p68<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p34)
states: 24,982,495,513,804,800 (16)
abstracting: (p34<=1)
states: 74,732,664,246,239,233 (16)
.abstracting: (1<=p111)
states: 37,366,332,123,119,616 (16)
abstracting: (p111<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p102)
states: 37,366,332,123,119,616 (16)
abstracting: (p102<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p15)
states: 24,987,789,448,445,952 (16)
abstracting: (p15<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p167)
states: 30,091,839,012,864 (13)
abstracting: (p167<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p61)
states: 24,584,301,074,644,992 (16)
abstracting: (p61<=1)
states: 74,732,664,246,239,233 (16)
.abstracting: (1<=p35)
states: 74,732,664,246,239,232 (16)
abstracting: (p35<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p181)
states: 8,916,100,448,256 (12)
abstracting: (p181<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p8)
states: 24,984,445,910,777,856 (16)
abstracting: (p8<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p166)
states: 20,061,226,008,576 (13)
abstracting: (p166<=1)
states: 74,732,664,246,239,233 (16)
..................................................
EG iterations: 50
abstracting: (1<=p68)
states: 24,470,046,123,393,024 (16)
abstracting: (p68<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p34)
states: 24,982,495,513,804,800 (16)
abstracting: (p34<=1)
states: 74,732,664,246,239,233 (16)
.abstracting: (1<=p111)
states: 37,366,332,123,119,616 (16)
abstracting: (p111<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p102)
states: 37,366,332,123,119,616 (16)
abstracting: (p102<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p15)
states: 24,987,789,448,445,952 (16)
abstracting: (p15<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p167)
states: 30,091,839,012,864 (13)
abstracting: (p167<=1)
states: 74,732,664,246,239,233 (16)
............
before gc: list nodes free: 3414904

after gc: idd nodes used:1556349, unused:62443651; list nodes free:298806115
.
before gc: list nodes free: 2595872

after gc: idd nodes used:2208353, unused:61791647; list nodes free:295737549
.
before gc: list nodes free: 2243600

after gc: idd nodes used:1520020, unused:62479980; list nodes free:298983512
MC time: 5m 1.058sec

checking: EF [[[p40<=0 & 0<=p40] & [[[EG [[[p273<=1 & 1<=p273] & [p287<=1 & 1<=p287]]] | EX [[p79<=1 & 1<=p79]]] | [[p101<=0 & 0<=p101] | [p261<=0 & 0<=p261]]] & [EX [[[p47<=1 & 1<=p47] & [[p114<=1 & 1<=p114] & [p285<=1 & 1<=p285]]]] | ~ [A [[[p149<=1 & 1<=p149] | ~ [[p134<=1 & 1<=p134]]] U ~ [[[p90<=1 & 1<=p90] & [p240<=1 & 1<=p240]]]]]]]]]
normalized: E [true U [[[~ [[~ [EG [[[p240<=1 & 1<=p240] & [p90<=1 & 1<=p90]]]] & ~ [E [[[p240<=1 & 1<=p240] & [p90<=1 & 1<=p90]] U [~ [[~ [[p134<=1 & 1<=p134]] | [p149<=1 & 1<=p149]]] & [[p240<=1 & 1<=p240] & [p90<=1 & 1<=p90]]]]]]] | EX [[[[p285<=1 & 1<=p285] & [p114<=1 & 1<=p114]] & [p47<=1 & 1<=p47]]]] & [[[p261<=0 & 0<=p261] | [p101<=0 & 0<=p101]] | [EX [[p79<=1 & 1<=p79]] | EG [[[p287<=1 & 1<=p287] & [p273<=1 & 1<=p273]]]]]] & [p40<=0 & 0<=p40]]]

abstracting: (0<=p40)
states: 74,732,664,246,239,233 (16)
abstracting: (p40<=0)
states: 49,987,559,906,869,249 (16)
abstracting: (1<=p273)
states: 68,948,507,339,108,352 (16)
abstracting: (p273<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p287)
states: 1,156,831,381,426,176 (15)
abstracting: (p287<=1)
states: 74,732,664,246,239,233 (16)
..............................................................
EG iterations: 62
abstracting: (1<=p79)
states: 24,005,925,654,405,120 (16)
abstracting: (p79<=1)
states: 74,732,664,246,239,233 (16)
.abstracting: (0<=p101)
states: 74,732,664,246,239,233 (16)
abstracting: (p101<=0)
states: 37,366,332,123,119,617 (16)
abstracting: (0<=p261)
states: 74,732,664,246,239,233 (16)
abstracting: (p261<=0)
states: 73,575,832,864,813,057 (16)
abstracting: (1<=p47)
states: 24,711,251,020,480,512 (16)
abstracting: (p47<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p114)
states: 37,366,332,123,119,616 (16)
abstracting: (p114<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p285)
states: 1,156,831,381,426,176 (15)
abstracting: (p285<=1)
states: 74,732,664,246,239,233 (16)
.abstracting: (1<=p90)
states: 37,366,332,123,119,616 (16)
abstracting: (p90<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p240)
states: 1,156,831,381,426,176 (15)
abstracting: (p240<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p149)
states: 8,916,100,448,256 (12)
abstracting: (p149<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p134)
states: 8,916,100,448,256 (12)
abstracting: (p134<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p90)
states: 37,366,332,123,119,616 (16)
abstracting: (p90<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p240)
states: 1,156,831,381,426,176 (15)
abstracting: (p240<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p90)
states: 37,366,332,123,119,616 (16)
abstracting: (p90<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p240)
states: 1,156,831,381,426,176 (15)
abstracting: (p240<=1)
states: 74,732,664,246,239,233 (16)
.............................................................
EG iterations: 61
-> the formula is TRUE

FORMULA AutoFlight-PT-12a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.117sec

checking: [E [[[[[p58<=1 & 1<=p58] & AX [[[[p243<=1 & 1<=p243] & [p288<=1 & 1<=p288]] | [p51<=1 & 1<=p51]]]] | [p26<=1 & 1<=p26]] & ~ [[[p3<=1 & 1<=p3] & [p226<=1 & 1<=p226]]]] U EF [[p23<=1 & 1<=p23]]] | AF [[[[p42<=0 & 0<=p42] | [p122<=0 & 0<=p122]] & ~ [E [[[p27<=1 & 1<=p27] & [p245<=1 & 1<=p245]] U ~ [[[p15<=1 & 1<=p15] & [p167<=1 & 1<=p167]]]]]]]]
normalized: [~ [EG [~ [[~ [E [[[p245<=1 & 1<=p245] & [p27<=1 & 1<=p27]] U ~ [[[p167<=1 & 1<=p167] & [p15<=1 & 1<=p15]]]]] & [[p122<=0 & 0<=p122] | [p42<=0 & 0<=p42]]]]]] | E [[~ [[[p226<=1 & 1<=p226] & [p3<=1 & 1<=p3]]] & [[p26<=1 & 1<=p26] | [~ [EX [~ [[[p51<=1 & 1<=p51] | [[p288<=1 & 1<=p288] & [p243<=1 & 1<=p243]]]]]] & [p58<=1 & 1<=p58]]]] U E [true U [p23<=1 & 1<=p23]]]]

abstracting: (1<=p23)
states: 24,747,054,736,343,040 (16)
abstracting: (p23<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p58)
states: 24,548,636,672,851,968 (16)
abstracting: (p58<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p243)
states: 1,156,831,381,426,176 (15)
abstracting: (p243<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p288)
states: 73,575,832,864,813,056 (16)
abstracting: (p288<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p51)
states: 24,624,806,640,353,280 (16)
abstracting: (p51<=1)
states: 74,732,664,246,239,233 (16)
.abstracting: (1<=p26)
states: 24,782,719,138,136,064 (16)
abstracting: (p26<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p3)
states: 24,982,216,885,665,792 (16)
abstracting: (p3<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p226)
states: 1,156,831,381,426,176 (15)
abstracting: (p226<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (0<=p42)
states: 74,732,664,246,239,233 (16)
abstracting: (p42<=0)
states: 1
abstracting: (0<=p122)
states: 74,732,664,246,239,233 (16)
abstracting: (p122<=0)
states: 74,723,748,145,790,977 (16)
abstracting: (1<=p15)
states: 24,987,789,448,445,952 (16)
abstracting: (p15<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p167)
states: 30,091,839,012,864 (13)
abstracting: (p167<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p27)
states: 24,974,972,554,051,584 (16)
abstracting: (p27<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p245)
states: 1,156,831,381,426,176 (15)
abstracting: (p245<=1)
states: 74,732,664,246,239,233 (16)
...............................................................................
EG iterations: 79
-> the formula is TRUE

FORMULA AutoFlight-PT-12a-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.804sec

checking: [AF [~ [E [AF [[[p268<=1 & 1<=p268] & [p288<=1 & 1<=p288]]] U ~ [[[p230<=1 & 1<=p230] & [p287<=1 & 1<=p287]]]]]] | [EX [AF [[[[p131<=0 & 0<=p131] | [p54<=0 & 0<=p54]] & [p113<=0 & 0<=p113]]]] | AX [[A [[p37<=1 & 1<=p37] U [[p17<=1 & 1<=p17] & [p238<=1 & 1<=p238]]] & AG [[[[p63<=0 & 0<=p63] | [p209<=0 & 0<=p209]] & [[p282<=0 & 0<=p282] | [p288<=0 & 0<=p288]]]]]]]]
normalized: [[~ [EX [~ [[~ [E [true U ~ [[[[p288<=0 & 0<=p288] | [p282<=0 & 0<=p282]] & [[p209<=0 & 0<=p209] | [p63<=0 & 0<=p63]]]]]] & [~ [EG [~ [[[p238<=1 & 1<=p238] & [p17<=1 & 1<=p17]]]]] & ~ [E [~ [[[p238<=1 & 1<=p238] & [p17<=1 & 1<=p17]]] U [~ [[p37<=1 & 1<=p37]] & ~ [[[p238<=1 & 1<=p238] & [p17<=1 & 1<=p17]]]]]]]]]]] | EX [~ [EG [~ [[[p113<=0 & 0<=p113] & [[p54<=0 & 0<=p54] | [p131<=0 & 0<=p131]]]]]]]] | ~ [EG [E [~ [EG [~ [[[p288<=1 & 1<=p288] & [p268<=1 & 1<=p268]]]]] U ~ [[[p287<=1 & 1<=p287] & [p230<=1 & 1<=p230]]]]]]]

abstracting: (1<=p230)
states: 68,948,507,339,108,352 (16)
abstracting: (p230<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p287)
states: 1,156,831,381,426,176 (15)
abstracting: (p287<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p268)
states: 1,156,831,381,426,176 (15)
abstracting: (p268<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p288)
states: 73,575,832,864,813,056 (16)
abstracting: (p288<=1)
states: 74,732,664,246,239,233 (16)
.
EG iterations: 1
......................................................................................................................................
EG iterations: 134
abstracting: (0<=p131)
states: 74,732,664,246,239,233 (16)
abstracting: (p131<=0)
states: 74,723,748,145,790,977 (16)
abstracting: (0<=p54)
states: 74,732,664,246,239,233 (16)
abstracting: (p54<=0)
states: 50,072,193,204,092,929 (16)
abstracting: (0<=p113)
states: 74,732,664,246,239,233 (16)
abstracting: (p113<=0)
states: 37,366,332,123,119,617 (16)
..........
before gc: list nodes free: 4313770

after gc: idd nodes used:372711, unused:63627289; list nodes free:304433096
......
before gc: list nodes free: 2884905

after gc: idd nodes used:1891673, unused:62108327; list nodes free:297241418

before gc: list nodes free: 2891194

after gc: idd nodes used:2538967, unused:61461033; list nodes free:294090969
MC time: 5m38.052sec

checking: [AF [[EG [E [[[p39<=1 & 1<=p39] & [p218<=1 & 1<=p218]] U [[p49<=1 & 1<=p49] & [p123<=1 & 1<=p123]]]] & [EG [[[p258<=1 & 1<=p258] & [p288<=1 & 1<=p288]]] | [A [[[p55<=1 & 1<=p55] & [p265<=1 & 1<=p265]] U [[p35<=1 & 1<=p35] & [p157<=1 & 1<=p157]]] | [E [[[p8<=1 & 1<=p8] & [p166<=1 & 1<=p166]] U [[p4<=1 & 1<=p4] & [p213<=1 & 1<=p213]]] & AF [[[p22<=1 & 1<=p22] & [p168<=1 & 1<=p168]]]]]]]] & [EG [AF [[[p21<=1 & 1<=p21] & [p119<=1 & 1<=p119]]]] | A [~ [[p45<=1 & 1<=p45]] U EF [[AG [[p5<=1 & 1<=p5]] & [[[p44<=1 & 1<=p44] | [p83<=1 & 1<=p83]] & ~ [[p193<=1 & 1<=p193]]]]]]]]
normalized: [[[~ [EG [~ [E [true U [[~ [[p193<=1 & 1<=p193]] & [[p83<=1 & 1<=p83] | [p44<=1 & 1<=p44]]] & ~ [E [true U ~ [[p5<=1 & 1<=p5]]]]]]]]] & ~ [E [~ [E [true U [[~ [[p193<=1 & 1<=p193]] & [[p83<=1 & 1<=p83] | [p44<=1 & 1<=p44]]] & ~ [E [true U ~ [[p5<=1 & 1<=p5]]]]]]] U [[p45<=1 & 1<=p45] & ~ [E [true U [[~ [[p193<=1 & 1<=p193]] & [[p83<=1 & 1<=p83] | [p44<=1 & 1<=p44]]] & ~ [E [true U ~ [[p5<=1 & 1<=p5]]]]]]]]]]] | EG [~ [EG [~ [[[p119<=1 & 1<=p119] & [p21<=1 & 1<=p21]]]]]]] & ~ [EG [~ [[[[[~ [EG [~ [[[p168<=1 & 1<=p168] & [p22<=1 & 1<=p22]]]]] & E [[[p166<=1 & 1<=p166] & [p8<=1 & 1<=p8]] U [[p213<=1 & 1<=p213] & [p4<=1 & 1<=p4]]]] | [~ [EG [~ [[[p157<=1 & 1<=p157] & [p35<=1 & 1<=p35]]]]] & ~ [E [~ [[[p157<=1 & 1<=p157] & [p35<=1 & 1<=p35]]] U [~ [[[p265<=1 & 1<=p265] & [p55<=1 & 1<=p55]]] & ~ [[[p157<=1 & 1<=p157] & [p35<=1 & 1<=p35]]]]]]]] | EG [[[p288<=1 & 1<=p288] & [p258<=1 & 1<=p258]]]] & EG [E [[[p218<=1 & 1<=p218] & [p39<=1 & 1<=p39]] U [[p123<=1 & 1<=p123] & [p49<=1 & 1<=p49]]]]]]]]]

abstracting: (1<=p49)
states: 74,732,664,246,239,232 (16)
abstracting: (p49<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p123)
states: 8,916,100,448,256 (12)
abstracting: (p123<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p39)
states: 24,993,779,953,434,624 (16)
abstracting: (p39<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p218)
states: 101,559,956,668,416 (14)
abstracting: (p218<=1)
states: 74,732,664,246,239,233 (16)
..................................................
EG iterations: 50
abstracting: (1<=p258)
states: 1,156,831,381,426,176 (15)
abstracting: (p258<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p288)
states: 73,575,832,864,813,056 (16)
abstracting: (p288<=1)
states: 74,732,664,246,239,233 (16)
..............................................................
EG iterations: 62
abstracting: (1<=p35)
states: 74,732,664,246,239,232 (16)
abstracting: (p35<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p157)
states: 8,916,100,448,256 (12)
abstracting: (p157<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p55)
states: 25,036,096,602,046,464 (16)
abstracting: (p55<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p265)
states: 1,156,831,381,426,176 (15)
abstracting: (p265<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p35)
states: 74,732,664,246,239,232 (16)
abstracting: (p35<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p157)
states: 8,916,100,448,256 (12)
abstracting: (p157<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p35)
states: 74,732,664,246,239,232 (16)
abstracting: (p35<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p157)
states: 8,916,100,448,256 (12)
abstracting: (p157<=1)
states: 74,732,664,246,239,233 (16)
............................................................................................
EG iterations: 92
abstracting: (1<=p4)
states: 24,964,384,684,769,280 (16)
abstracting: (p4<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p213)
states: 13,374,150,672,384 (13)
abstracting: (p213<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p8)
states: 24,984,445,910,777,856 (16)
abstracting: (p8<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p166)
states: 20,061,226,008,576 (13)
abstracting: (p166<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p22)
states: 24,992,804,754,948,096 (16)
abstracting: (p22<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p168)
states: 45,137,758,519,296 (13)
abstracting: (p168<=1)
states: 74,732,664,246,239,233 (16)
.............................................................................
EG iterations: 77

EG iterations: 0
abstracting: (1<=p21)
states: 74,732,664,246,239,232 (16)
abstracting: (p21<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p119)
states: 8,916,100,448,256 (12)
abstracting: (p119<=1)
states: 74,732,664,246,239,233 (16)
..................................................................................................................................
EG iterations: 130
...................................................................................................................................
EG iterations: 131
abstracting: (1<=p5)
states: 24,803,894,876,700,672 (16)
abstracting: (p5<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p44)
states: 24,675,586,618,687,488 (16)
abstracting: (p44<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p83)
states: 25,345,537,095,020,544 (16)
abstracting: (p83<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p193)
states: 8,916,100,448,256 (12)
abstracting: (p193<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p45)
states: 25,028,538,813,775,872 (16)
abstracting: (p45<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p5)
states: 24,803,894,876,700,672 (16)
abstracting: (p5<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p44)
states: 24,675,586,618,687,488 (16)
abstracting: (p44<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p83)
states: 25,345,537,095,020,544 (16)
abstracting: (p83<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p193)
states: 8,916,100,448,256 (12)
abstracting: (p193<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p5)
states: 24,803,894,876,700,672 (16)
abstracting: (p5<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p44)
states: 24,675,586,618,687,488 (16)
abstracting: (p44<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p83)
states: 25,345,537,095,020,544 (16)
abstracting: (p83<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p193)
states: 8,916,100,448,256 (12)
abstracting: (p193<=1)
states: 74,732,664,246,239,233 (16)

EG iterations: 0
-> the formula is FALSE

FORMULA AutoFlight-PT-12a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.113sec

checking: E [AF [[[[E [[[p27<=1 & 1<=p27] & [p245<=1 & 1<=p245]] U [p193<=1 & 1<=p193]] | AG [[[1<=p49 & p49<=1] & [p159<=1 & 1<=p159]]]] | [[[p70<=1 & 1<=p70] & [p126<=1 & 1<=p126]] | [[[p60<=1 & 1<=p60] & [p221<=1 & 1<=p221]] & [[p253<=1 & 1<=p253] & [p287<=1 & 1<=p287]]]]] & [[AG [[p75<=1 & 1<=p75]] | ~ [A [[p48<=1 & 1<=p48] U [p6<=1 & 1<=p6]]]] | [~ [[[p282<=1 & 1<=p282] & [p288<=1 & 1<=p288]]] | [[[[p236<=1 & 1<=p236] & [p287<=1 & 1<=p287]] | [[p46<=1 & 1<=p46] & [p219<=1 & 1<=p219]]] & [[p59<=1 & 1<=p59] | [p99<=1 & 1<=p99]]]]]]] U EG [~ [[[[p36<=1 & 1<=p36] & [p170<=1 & 1<=p170]] | [~ [A [[[p7<=1 & 1<=p7] & [p117<=1 & 1<=p117]] U [[p70<=1 & 1<=p70] & [p162<=1 & 1<=p162]]]] | EF [[[p196<=1 & 1<=p196] | [[p100<=1 & 1<=p100] & [p257<=1 & 1<=p257]]]]]]]]]
normalized: E [~ [EG [~ [[[[[[[p99<=1 & 1<=p99] | [p59<=1 & 1<=p59]] & [[[p219<=1 & 1<=p219] & [p46<=1 & 1<=p46]] | [[p287<=1 & 1<=p287] & [p236<=1 & 1<=p236]]]] | ~ [[[p288<=1 & 1<=p288] & [p282<=1 & 1<=p282]]]] | [~ [[~ [EG [~ [[p6<=1 & 1<=p6]]]] & ~ [E [~ [[p6<=1 & 1<=p6]] U [~ [[p48<=1 & 1<=p48]] & ~ [[p6<=1 & 1<=p6]]]]]]] | ~ [E [true U ~ [[p75<=1 & 1<=p75]]]]]] & [[[[[p287<=1 & 1<=p287] & [p253<=1 & 1<=p253]] & [[p221<=1 & 1<=p221] & [p60<=1 & 1<=p60]]] | [[p126<=1 & 1<=p126] & [p70<=1 & 1<=p70]]] | [~ [E [true U ~ [[[p159<=1 & 1<=p159] & [1<=p49 & p49<=1]]]]] | E [[[p245<=1 & 1<=p245] & [p27<=1 & 1<=p27]] U [p193<=1 & 1<=p193]]]]]]]] U EG [~ [[[E [true U [[[p257<=1 & 1<=p257] & [p100<=1 & 1<=p100]] | [p196<=1 & 1<=p196]]] | ~ [[~ [EG [~ [[[p162<=1 & 1<=p162] & [p70<=1 & 1<=p70]]]]] & ~ [E [~ [[[p162<=1 & 1<=p162] & [p70<=1 & 1<=p70]]] U [~ [[[p117<=1 & 1<=p117] & [p7<=1 & 1<=p7]]] & ~ [[[p162<=1 & 1<=p162] & [p70<=1 & 1<=p70]]]]]]]]] | [[p170<=1 & 1<=p170] & [p36<=1 & 1<=p36]]]]]]

abstracting: (1<=p36)
states: 25,011,612,154,331,136 (16)
abstracting: (p36<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p170)
states: 101,559,956,668,416 (14)
abstracting: (p170<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p70)
states: 74,732,664,246,239,232 (16)
abstracting: (p70<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p162)
states: 8,916,100,448,256 (12)
abstracting: (p162<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p7)
states: 74,732,664,246,239,232 (16)
abstracting: (p7<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p117)
states: 8,916,100,448,256 (12)
abstracting: (p117<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p70)
states: 74,732,664,246,239,232 (16)
abstracting: (p70<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p162)
states: 8,916,100,448,256 (12)
abstracting: (p162<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p70)
states: 74,732,664,246,239,232 (16)
abstracting: (p70<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p162)
states: 8,916,100,448,256 (12)
abstracting: (p162<=1)
states: 74,732,664,246,239,233 (16)
.......................................................................................
EG iterations: 87
abstracting: (1<=p196)
states: 8,916,100,448,256 (12)
abstracting: (p196<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p100)
states: 74,732,664,246,239,232 (16)
abstracting: (p100<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p257)
states: 1,156,831,381,426,176 (15)
abstracting: (p257<=1)
states: 74,732,664,246,239,233 (16)
.
EG iterations: 1
abstracting: (1<=p193)
states: 8,916,100,448,256 (12)
abstracting: (p193<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p27)
states: 24,974,972,554,051,584 (16)
abstracting: (p27<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p245)
states: 1,156,831,381,426,176 (15)
abstracting: (p245<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (p49<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p49)
states: 74,732,664,246,239,232 (16)
abstracting: (1<=p159)
states: 8,916,100,448,256 (12)
abstracting: (p159<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p70)
states: 74,732,664,246,239,232 (16)
abstracting: (p70<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p126)
states: 8,916,100,448,256 (12)
abstracting: (p126<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p60)
states: 25,074,181,585,797,120 (16)
abstracting: (p60<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p221)
states: 342,764,853,755,904 (14)
abstracting: (p221<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p253)
states: 68,948,507,339,108,352 (16)
abstracting: (p253<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p287)
states: 1,156,831,381,426,176 (15)
abstracting: (p287<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p75)
states: 24,298,663,696,515,072 (16)
abstracting: (p75<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p6)
states: 24,964,384,684,769,280 (16)
abstracting: (p6<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p48)
states: 25,010,706,612,879,360 (16)
abstracting: (p48<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p6)
states: 24,964,384,684,769,280 (16)
abstracting: (p6<=1)
states: 74,732,664,246,239,233 (16)
abstracting: (1<=p6)
states: 24,964,384,684,769,280 (16)
abstracting: (p6<=1)
states: 74,732,664,246,239,233 (16)
.............
before gc: list nodes free: 1022948

after gc: idd nodes used:1532368, unused:62467632; list nodes free:298951792
.
before gc: list nodes free: 538137

after gc: idd nodes used:2157836, unused:61842164; list nodes free:295994200

before gc: list nodes free: 129642

after gc: idd nodes used:3402921, unused:60597079; list nodes free:289638436
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5900096 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16100504 kB

BK_TIME_CONFINEMENT_REACHED

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

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


iterations count:11694 (48), effective:1200 (5)

initing FirstDep: 0m 0.000sec


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

iterations count:2994 (12), effective:250 (1)

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

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

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

net_ddint.h:600: Timeout: after 299 sec


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

net_ddint.h:600: Timeout: after 274 sec


iterations count:2992 (12), effective:243 (1)

iterations count:3740 (15), effective:323 (1)

net_ddint.h:600: Timeout: after 273 sec


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

iterations count:828 (3), effective:52 (0)

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

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

iterations count:7769 (32), effective:718 (2)

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

iterations count:3003 (12), effective:250 (1)

iterations count:2306 (9), effective:201 (0)

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

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

iterations count:3003 (12), effective:250 (1)

iterations count:2306 (9), effective:201 (0)

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

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

iterations count:3003 (12), effective:250 (1)

iterations count:2306 (9), effective:201 (0)

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

net_ddint.h:600: Timeout: after 300 sec


iterations count:7425 (30), effective:694 (2)

iterations count:6955 (28), effective:619 (2)

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

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

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

net_ddint.h:600: Timeout: after 337 sec


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

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

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

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

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

iterations count:2895 (12), effective:243 (1)

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

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

iterations count:2998 (12), effective:249 (1)

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

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

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

iterations count:743 (3), effective:53 (0)

net_ddint.h:600: Timeout: after 334 sec

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-12a"
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 AutoFlight-PT-12a, 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 r010-oct2-167813599100466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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