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

About the Execution of Marcie+red for GPUForwardProgress-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10092.407 1019391.00 1038418.00 3461.50 FTFTFFTFTTFTTFTF 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.r202-smll-167840348100025.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is GPUForwardProgress-PT-08b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348100025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 14:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 14:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 14:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 14:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 14:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 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 46K 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 GPUForwardProgress-PT-08b-CTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-08b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678517243879

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-08b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 06:47:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 06:47:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:47:27] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-11 06:47:27] [INFO ] Transformed 188 places.
[2023-03-11 06:47:27] [INFO ] Transformed 197 transitions.
[2023-03-11 06:47:27] [INFO ] Found NUPN structural information;
[2023-03-11 06:47:27] [INFO ] Parsed PT model containing 188 places and 197 transitions and 477 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
FORMULA GPUForwardProgress-PT-08b-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 90 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 197/197 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 197
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 180 transition count 190
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 180 transition count 190
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 179 transition count 189
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 179 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 179 transition count 188
Applied a total of 18 rules in 70 ms. Remains 179 /188 variables (removed 9) and now considering 188/197 (removed 9) transitions.
// Phase 1: matrix 188 rows 179 cols
[2023-03-11 06:47:27] [INFO ] Computed 9 place invariants in 16 ms
[2023-03-11 06:47:27] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-11 06:47:27] [INFO ] Invariant cache hit.
[2023-03-11 06:47:28] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2023-03-11 06:47:28] [INFO ] Invariant cache hit.
[2023-03-11 06:47:28] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/188 places, 188/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1087 ms. Remains : 179/188 places, 188/197 transitions.
Support contains 90 out of 179 places after structural reductions.
[2023-03-11 06:47:29] [INFO ] Flatten gal took : 83 ms
[2023-03-11 06:47:29] [INFO ] Flatten gal took : 39 ms
[2023-03-11 06:47:29] [INFO ] Input system was already deterministic with 188 transitions.
Support contains 87 out of 179 places (down from 90) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 661 ms. (steps per millisecond=15 ) properties (out of 69) seen :56
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 06:47:30] [INFO ] Invariant cache hit.
[2023-03-11 06:47:30] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 06:47:30] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-11 06:47:31] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 06:47:31] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-11 06:47:31] [INFO ] After 809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 99 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=24 )
Parikh walk visited 4 properties in 6 ms.
[2023-03-11 06:47:31] [INFO ] Flatten gal took : 22 ms
[2023-03-11 06:47:31] [INFO ] Flatten gal took : 23 ms
[2023-03-11 06:47:31] [INFO ] Input system was already deterministic with 188 transitions.
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 269 edges and 179 vertex of which 167 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 162 transition count 171
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 162 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 162 transition count 169
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 156 transition count 163
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 156 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 53 place count 156 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 155 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 155 transition count 157
Applied a total of 55 rules in 62 ms. Remains 155 /179 variables (removed 24) and now considering 157/188 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 155/179 places, 157/188 transitions.
[2023-03-11 06:47:31] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:47:31] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:47:31] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 162 transition count 171
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 162 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 162 transition count 169
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 156 transition count 163
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 156 transition count 163
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 52 place count 156 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 155 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 155 transition count 158
Applied a total of 54 rules in 28 ms. Remains 155 /179 variables (removed 24) and now considering 158/188 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 155/179 places, 158/188 transitions.
[2023-03-11 06:47:31] [INFO ] Flatten gal took : 15 ms
[2023-03-11 06:47:31] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:47:31] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Graph (trivial) has 157 edges and 179 vertex of which 7 / 179 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 262 edges and 173 vertex of which 161 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 160 transition count 91
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 97 rules applied. Total rules applied 185 place count 74 transition count 80
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 189 place count 71 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 190 place count 70 transition count 79
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 190 place count 70 transition count 61
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 226 place count 52 transition count 61
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 234 place count 44 transition count 53
Iterating global reduction 4 with 8 rules applied. Total rules applied 242 place count 44 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 242 place count 44 transition count 52
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 244 place count 43 transition count 52
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 272 place count 29 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 274 place count 28 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 275 place count 27 transition count 36
Applied a total of 275 rules in 49 ms. Remains 27 /179 variables (removed 152) and now considering 36/188 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 27/179 places, 36/188 transitions.
[2023-03-11 06:47:31] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:47:31] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:47:31] [INFO ] Input system was already deterministic with 36 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Graph (trivial) has 146 edges and 179 vertex of which 7 / 179 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 262 edges and 173 vertex of which 161 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 160 transition count 98
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 86 rules applied. Total rules applied 167 place count 81 transition count 91
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 173 place count 79 transition count 87
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 179 place count 75 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 180 place count 74 transition count 85
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 180 place count 74 transition count 70
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 210 place count 59 transition count 70
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 219 place count 50 transition count 61
Iterating global reduction 5 with 9 rules applied. Total rules applied 228 place count 50 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 229 place count 50 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 229 place count 50 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 231 place count 49 transition count 59
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 261 place count 34 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 263 place count 33 transition count 43
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 264 place count 33 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 265 place count 32 transition count 42
Applied a total of 265 rules in 37 ms. Remains 32 /179 variables (removed 147) and now considering 42/188 (removed 146) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 32/179 places, 42/188 transitions.
[2023-03-11 06:47:31] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:47:31] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:47:31] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 163 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 163 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 163 transition count 170
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 156 transition count 163
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 156 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 53 place count 156 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 155 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 155 transition count 157
Applied a total of 55 rules in 19 ms. Remains 155 /179 variables (removed 24) and now considering 157/188 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 155/179 places, 157/188 transitions.
[2023-03-11 06:47:31] [INFO ] Flatten gal took : 12 ms
[2023-03-11 06:47:31] [INFO ] Flatten gal took : 13 ms
[2023-03-11 06:47:32] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 162 transition count 171
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 162 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 162 transition count 169
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 158 transition count 165
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 158 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 48 place count 158 transition count 161
Applied a total of 48 rules in 16 ms. Remains 158 /179 variables (removed 21) and now considering 161/188 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 158/179 places, 161/188 transitions.
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 13 ms
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 13 ms
[2023-03-11 06:47:32] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 162 transition count 171
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 162 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 162 transition count 169
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 156 transition count 163
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 156 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 53 place count 156 transition count 158
Applied a total of 53 rules in 15 ms. Remains 156 /179 variables (removed 23) and now considering 158/188 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 156/179 places, 158/188 transitions.
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 13 ms
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 13 ms
[2023-03-11 06:47:32] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Graph (complete) has 269 edges and 179 vertex of which 168 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 167 transition count 99
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 98 rules applied. Total rules applied 185 place count 81 transition count 87
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 192 place count 77 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 195 place count 74 transition count 84
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 195 place count 74 transition count 68
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 227 place count 58 transition count 68
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 236 place count 49 transition count 59
Iterating global reduction 4 with 9 rules applied. Total rules applied 245 place count 49 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 245 place count 49 transition count 58
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 247 place count 48 transition count 58
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 281 place count 31 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 30 transition count 40
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 30 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 285 place count 29 transition count 39
Applied a total of 285 rules in 29 ms. Remains 29 /179 variables (removed 150) and now considering 39/188 (removed 149) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 29/179 places, 39/188 transitions.
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:47:32] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 161 transition count 170
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 161 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 161 transition count 168
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 155 transition count 162
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 155 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 155 transition count 158
Applied a total of 54 rules in 14 ms. Remains 155 /179 variables (removed 24) and now considering 158/188 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 155/179 places, 158/188 transitions.
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 12 ms
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 12 ms
[2023-03-11 06:47:32] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Graph (trivial) has 153 edges and 179 vertex of which 7 / 179 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 262 edges and 173 vertex of which 164 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 163 transition count 95
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 95 rules applied. Total rules applied 181 place count 79 transition count 84
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 186 place count 76 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 188 place count 74 transition count 82
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 188 place count 74 transition count 64
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 224 place count 56 transition count 64
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 233 place count 47 transition count 55
Iterating global reduction 4 with 9 rules applied. Total rules applied 242 place count 47 transition count 55
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 274 place count 31 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 276 place count 30 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 277 place count 29 transition count 37
Applied a total of 277 rules in 34 ms. Remains 29 /179 variables (removed 150) and now considering 37/188 (removed 151) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 29/179 places, 37/188 transitions.
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:47:32] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Graph (trivial) has 154 edges and 179 vertex of which 7 / 179 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 262 edges and 173 vertex of which 161 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 161 transition count 94
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 93 rules applied. Total rules applied 179 place count 77 transition count 85
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 185 place count 75 transition count 81
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 189 place count 71 transition count 81
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 189 place count 71 transition count 66
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 219 place count 56 transition count 66
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 228 place count 47 transition count 57
Iterating global reduction 4 with 9 rules applied. Total rules applied 237 place count 47 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 237 place count 47 transition count 56
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 46 transition count 56
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 275 place count 28 transition count 38
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 276 place count 28 transition count 38
Applied a total of 276 rules in 22 ms. Remains 28 /179 variables (removed 151) and now considering 38/188 (removed 150) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 28/179 places, 38/188 transitions.
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:47:32] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Graph (trivial) has 154 edges and 179 vertex of which 7 / 179 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 172 transition count 95
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 94 rules applied. Total rules applied 180 place count 87 transition count 86
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 185 place count 85 transition count 83
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 190 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 191 place count 81 transition count 81
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 18 Pre rules applied. Total rules applied 191 place count 81 transition count 63
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 227 place count 63 transition count 63
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 228 place count 62 transition count 62
Iterating global reduction 5 with 1 rules applied. Total rules applied 229 place count 62 transition count 62
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 263 place count 45 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 265 place count 44 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 266 place count 44 transition count 44
Applied a total of 266 rules in 24 ms. Remains 44 /179 variables (removed 135) and now considering 44/188 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 44/179 places, 44/188 transitions.
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:47:32] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 164 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 164 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 164 transition count 171
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 158 transition count 165
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 158 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 49 place count 158 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 157 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 157 transition count 159
Applied a total of 51 rules in 19 ms. Remains 157 /179 variables (removed 22) and now considering 159/188 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 157/179 places, 159/188 transitions.
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 11 ms
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 11 ms
[2023-03-11 06:47:32] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 179 transition count 118
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 145 place count 109 transition count 113
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 153 place count 108 transition count 106
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 160 place count 101 transition count 106
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 160 place count 101 transition count 90
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 192 place count 85 transition count 90
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 196 place count 81 transition count 86
Iterating global reduction 4 with 4 rules applied. Total rules applied 200 place count 81 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 81 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 201 place count 81 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 205 place count 79 transition count 83
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 235 place count 64 transition count 68
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 239 place count 64 transition count 68
Applied a total of 239 rules in 23 ms. Remains 64 /179 variables (removed 115) and now considering 68/188 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 64/179 places, 68/188 transitions.
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:47:32] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 179/179 places, 188/188 transitions.
Graph (trivial) has 153 edges and 179 vertex of which 7 / 179 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 173 transition count 96
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 93 rules applied. Total rules applied 179 place count 88 transition count 88
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 182 place count 86 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 183 place count 85 transition count 87
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 183 place count 85 transition count 69
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 219 place count 67 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 220 place count 66 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 221 place count 66 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 221 place count 66 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 65 transition count 67
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 259 place count 47 transition count 49
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 260 place count 47 transition count 49
Applied a total of 260 rules in 18 ms. Remains 47 /179 variables (removed 132) and now considering 49/188 (removed 139) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 47/179 places, 49/188 transitions.
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:47:32] [INFO ] Input system was already deterministic with 49 transitions.
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 15 ms
[2023-03-11 06:47:32] [INFO ] Flatten gal took : 14 ms
[2023-03-11 06:47:32] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-11 06:47:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 179 places, 188 transitions and 457 arcs took 2 ms.
Total runtime 5705 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 179 NrTr: 188 NrArc: 457)

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

net check time: 0m 0.000sec

init dd package: 0m 3.597sec


RS generation: 0m17.101sec


-> reachability set: #nodes 92290 (9.2e+04) #states 595,380,218,772 (11)



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

checking: AF [EG [~ [E [[p32<=1 & 1<=p32] U [[p77<=0 & 0<=p77] | [p145<=1 & 1<=p145]]]]]]
normalized: ~ [EG [~ [EG [~ [E [[p32<=1 & 1<=p32] U [[p145<=1 & 1<=p145] | [p77<=0 & 0<=p77]]]]]]]]

abstracting: (0<=p77)
states: 595,380,218,772 (11)
abstracting: (p77<=0)
states: 562,716,644,046 (11)
abstracting: (1<=p145)
states: 32,663,596,538 (10)
abstracting: (p145<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p32)
states: 32,511,718,544 (10)
abstracting: (p32<=1)
states: 595,380,218,772 (11)
.....................................................................
EG iterations: 69
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m47.846sec

checking: EG [A [[EX [[0<=p12 & p12<=0]] | [p26<=1 & 1<=p26]] U A [[p115<=0 & 0<=p115] U [p177<=1 & 1<=p177]]]]
normalized: EG [[~ [EG [~ [[~ [EG [~ [[p177<=1 & 1<=p177]]]] & ~ [E [~ [[p177<=1 & 1<=p177]] U [~ [[p115<=0 & 0<=p115]] & ~ [[p177<=1 & 1<=p177]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p177<=1 & 1<=p177]]]] & ~ [E [~ [[p177<=1 & 1<=p177]] U [~ [[p115<=0 & 0<=p115]] & ~ [[p177<=1 & 1<=p177]]]]]]] U [~ [[[p26<=1 & 1<=p26] | EX [[0<=p12 & p12<=0]]]] & ~ [[~ [EG [~ [[p177<=1 & 1<=p177]]]] & ~ [E [~ [[p177<=1 & 1<=p177]] U [~ [[p115<=0 & 0<=p115]] & ~ [[p177<=1 & 1<=p177]]]]]]]]]]]]

abstracting: (1<=p177)
states: 85,384,046 (7)
abstracting: (p177<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p115)
states: 595,380,218,772 (11)
abstracting: (p115<=0)
states: 560,875,658,576 (11)
abstracting: (1<=p177)
states: 85,384,046 (7)
abstracting: (p177<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p177)
states: 85,384,046 (7)
abstracting: (p177<=1)
states: 595,380,218,772 (11)
........................................................................
EG iterations: 72
abstracting: (p12<=0)
states: 562,868,500,228 (11)
abstracting: (0<=p12)
states: 595,380,218,772 (11)
.abstracting: (1<=p26)
states: 32,559,371,460 (10)
abstracting: (p26<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p177)
states: 85,384,046 (7)
abstracting: (p177<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p115)
states: 595,380,218,772 (11)
abstracting: (p115<=0)
states: 560,875,658,576 (11)
abstracting: (1<=p177)
states: 85,384,046 (7)
abstracting: (p177<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p177)
states: 85,384,046 (7)
abstracting: (p177<=1)
states: 595,380,218,772 (11)
........................................................................
EG iterations: 72
abstracting: (1<=p177)
states: 85,384,046 (7)
abstracting: (p177<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p115)
states: 595,380,218,772 (11)
abstracting: (p115<=0)
states: 560,875,658,576 (11)
abstracting: (1<=p177)
states: 85,384,046 (7)
abstracting: (p177<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p177)
states: 85,384,046 (7)
abstracting: (p177<=1)
states: 595,380,218,772 (11)
........................................................................
EG iterations: 72
.
EG iterations: 1
.........................................................................
EG iterations: 73
-> the formula is FALSE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.128sec

checking: E [[AF [[p148<=1 & 1<=p148]] | [p161<=0 & 0<=p161]] U EG [AF [~ [[[p26<=0 & 0<=p26] | [p92<=1 & 1<=p92]]]]]]
normalized: E [[[p161<=0 & 0<=p161] | ~ [EG [~ [[p148<=1 & 1<=p148]]]]] U EG [~ [EG [[[p92<=1 & 1<=p92] | [p26<=0 & 0<=p26]]]]]]

abstracting: (0<=p26)
states: 595,380,218,772 (11)
abstracting: (p26<=0)
states: 562,820,847,312 (11)
abstracting: (1<=p92)
states: 32,664,204,852 (10)
abstracting: (p92<=1)
states: 595,380,218,772 (11)
.................................................................
EG iterations: 65
..................
before gc: list nodes free: 1796377

after gc: idd nodes used:745001, unused:63254999; list nodes free:290261246
...................................................
EG iterations: 69
abstracting: (1<=p148)
states: 61,409,991,234 (10)
abstracting: (p148<=1)
states: 595,380,218,772 (11)
.......................................................................
EG iterations: 71
abstracting: (0<=p161)
states: 595,380,218,772 (11)
abstracting: (p161<=0)
states: 595,294,834,727 (11)
-> the formula is TRUE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m57.455sec

checking: [AF [[p1<=0 & 0<=p1]] & AF [AG [[[p75<=1 & 1<=p75] | A [[p104<=1 & 1<=p104] U [p52<=1 & 1<=p52]]]]]]
normalized: [~ [EG [E [true U ~ [[[~ [EG [~ [[p52<=1 & 1<=p52]]]] & ~ [E [~ [[p52<=1 & 1<=p52]] U [~ [[p104<=1 & 1<=p104]] & ~ [[p52<=1 & 1<=p52]]]]]] | [p75<=1 & 1<=p75]]]]]] & ~ [EG [~ [[p1<=0 & 0<=p1]]]]]

abstracting: (0<=p1)
states: 595,380,218,772 (11)
abstracting: (p1<=0)
states: 595,380,218,767 (11)
......
EG iterations: 6
abstracting: (1<=p75)
states: 39,073,667,920 (10)
abstracting: (p75<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p52)
states: 34,498,195,880 (10)
abstracting: (p52<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p104)
states: 34,504,558,980 (10)
abstracting: (p104<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p52)
states: 34,498,195,880 (10)
abstracting: (p52<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p52)
states: 34,498,195,880 (10)
abstracting: (p52<=1)
states: 595,380,218,772 (11)
.......................................................................
EG iterations: 71

EG iterations: 0
-> the formula is FALSE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m41.593sec

checking: AG [[[p15<=0 & 0<=p15] | [[p10<=1 & 1<=p10] | AG [[[p19<=0 & 0<=p19] & [[p158<=1 & 1<=p158] & E [[p167<=1 & 1<=p167] U [p57<=1 & 1<=p57]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [E [true U ~ [[[E [[p167<=1 & 1<=p167] U [p57<=1 & 1<=p57]] & [p158<=1 & 1<=p158]] & [p19<=0 & 0<=p19]]]]] | [p10<=1 & 1<=p10]] | [p15<=0 & 0<=p15]]]]]

abstracting: (0<=p15)
states: 595,380,218,772 (11)
abstracting: (p15<=0)
states: 562,868,500,228 (11)
abstracting: (1<=p10)
states: 32,511,718,544 (10)
abstracting: (p10<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p19)
states: 595,380,218,772 (11)
abstracting: (p19<=0)
states: 562,868,500,228 (11)
abstracting: (1<=p158)
states: 46,569,283,188 (10)
abstracting: (p158<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p57)
states: 34,547,184,040 (10)
abstracting: (p57<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p167)
states: 14,772,360,805 (10)
abstracting: (p167<=1)
states: 595,380,218,772 (11)
-> the formula is FALSE

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

MC time: 0m 6.919sec

checking: AF [EG [[[[~ [[p135<=0 & 0<=p135]] & ~ [[p14<=1 & 1<=p14]]] | [~ [[p85<=0 & 0<=p85]] & ~ [[p163<=1 & 1<=p163]]]] & [[p116<=1 & 1<=p116] | [p170<=1 & 1<=p170]]]]]
normalized: ~ [EG [~ [EG [[[[p170<=1 & 1<=p170] | [p116<=1 & 1<=p116]] & [[~ [[p163<=1 & 1<=p163]] & ~ [[p85<=0 & 0<=p85]]] | [~ [[p14<=1 & 1<=p14]] & ~ [[p135<=0 & 0<=p135]]]]]]]]]

abstracting: (0<=p135)
states: 595,380,218,772 (11)
abstracting: (p135<=0)
states: 562,765,086,850 (11)
abstracting: (1<=p14)
states: 32,511,718,544 (10)
abstracting: (p14<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p85)
states: 595,380,218,772 (11)
abstracting: (p85<=0)
states: 562,765,108,064 (11)
abstracting: (1<=p163)
states: 85,384,046 (7)
abstracting: (p163<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p116)
states: 42,916,381,488 (10)
abstracting: (p116<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p170)
states: 85,377,019,178 (10)
abstracting: (p170<=1)
states: 595,380,218,772 (11)
.......................
before gc: list nodes free: 240072

after gc: idd nodes used:1097060, unused:62902940; list nodes free:288676571
..............................................
EG iterations: 69
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m14.918sec

checking: EF [[~ [A [E [[[p32<=0 & 0<=p32] | [p102<=1 & 1<=p102]] U [p160<=0 & 0<=p160]] U ~ [[[p77<=0 & 0<=p77] | [p137<=1 & 1<=p137]]]]] | [[p54<=0 & 0<=p54] & [p48<=1 & 1<=p48]]]]
normalized: E [true U [[[p48<=1 & 1<=p48] & [p54<=0 & 0<=p54]] | ~ [[~ [EG [[[p137<=1 & 1<=p137] | [p77<=0 & 0<=p77]]]] & ~ [E [[[p137<=1 & 1<=p137] | [p77<=0 & 0<=p77]] U [~ [E [[[p102<=1 & 1<=p102] | [p32<=0 & 0<=p32]] U [p160<=0 & 0<=p160]]] & [[p137<=1 & 1<=p137] | [p77<=0 & 0<=p77]]]]]]]]]

abstracting: (0<=p77)
states: 595,380,218,772 (11)
abstracting: (p77<=0)
states: 562,716,644,046 (11)
abstracting: (1<=p137)
states: 32,615,131,922 (10)
abstracting: (p137<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p160)
states: 595,380,218,772 (11)
abstracting: (p160<=0)
states: 533,970,227,538 (11)
abstracting: (0<=p32)
states: 595,380,218,772 (11)
abstracting: (p32<=0)
states: 562,868,500,228 (11)
abstracting: (1<=p102)
states: 34,504,558,980 (10)
abstracting: (p102<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p77)
states: 595,380,218,772 (11)
abstracting: (p77<=0)
states: 562,716,644,046 (11)
abstracting: (1<=p137)
states: 32,615,131,922 (10)
abstracting: (p137<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p77)
states: 595,380,218,772 (11)
abstracting: (p77<=0)
states: 562,716,644,046 (11)
abstracting: (1<=p137)
states: 32,615,131,922 (10)
abstracting: (p137<=1)
states: 595,380,218,772 (11)
.................................
EG iterations: 33
abstracting: (0<=p54)
states: 595,380,218,772 (11)
abstracting: (p54<=0)
states: 560,882,022,892 (11)
abstracting: (1<=p48)
states: 34,498,195,880 (10)
abstracting: (p48<=1)
states: 595,380,218,772 (11)
-> the formula is TRUE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.088sec

checking: AG [[[AG [[p150<=0 & 0<=p150]] | EX [[[p155<=0 & 0<=p155] & [p176<=1 & 1<=p176]]]] | [EF [[p162<=1 & 1<=p162]] | [[p55<=1 & 1<=p55] & [[p29<=0 & 0<=p29] | [p19<=1 & 1<=p19]]]]]]
normalized: ~ [E [true U ~ [[[[[[p19<=1 & 1<=p19] | [p29<=0 & 0<=p29]] & [p55<=1 & 1<=p55]] | E [true U [p162<=1 & 1<=p162]]] | [EX [[[p176<=1 & 1<=p176] & [p155<=0 & 0<=p155]]] | ~ [E [true U ~ [[p150<=0 & 0<=p150]]]]]]]]]

abstracting: (0<=p150)
states: 595,380,218,772 (11)
abstracting: (p150<=0)
states: 577,653,385,806 (11)
abstracting: (0<=p155)
states: 595,380,218,772 (11)
abstracting: (p155<=0)
states: 548,810,935,584 (11)
abstracting: (1<=p176)
states: 85,384,046 (7)
abstracting: (p176<=1)
states: 595,380,218,772 (11)
.abstracting: (1<=p162)
states: 85,384,045 (7)
abstracting: (p162<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p55)
states: 34,547,184,040 (10)
abstracting: (p55<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p29)
states: 595,380,218,772 (11)
abstracting: (p29<=0)
states: 562,868,500,228 (11)
abstracting: (1<=p19)
states: 32,511,718,544 (10)
abstracting: (p19<=1)
states: 595,380,218,772 (11)
-> the formula is FALSE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.937sec

checking: E [AX [AG [~ [[EF [[[p104<=0 & 0<=p104] | [p40<=1 & 1<=p40]]] & [p175<=0 & 0<=p175]]]]] U [EG [EF [[p26<=1 & 1<=p26]]] & AF [[[p151<=1 & 1<=p151] | [[p164<=0 & 0<=p164] | [p107<=1 & 1<=p107]]]]]]
normalized: E [~ [EX [E [true U [[p175<=0 & 0<=p175] & E [true U [[p40<=1 & 1<=p40] | [p104<=0 & 0<=p104]]]]]]] U [~ [EG [~ [[[[p107<=1 & 1<=p107] | [p164<=0 & 0<=p164]] | [p151<=1 & 1<=p151]]]]] & EG [E [true U [p26<=1 & 1<=p26]]]]]

abstracting: (1<=p26)
states: 32,559,371,460 (10)
abstracting: (p26<=1)
states: 595,380,218,772 (11)
......................................................................
EG iterations: 70
abstracting: (1<=p151)
states: 17,726,832,966 (10)
abstracting: (p151<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p164)
states: 595,380,218,772 (11)
abstracting: (p164<=0)
states: 580,607,857,967 (11)
abstracting: (1<=p107)
states: 34,553,654,596 (10)
abstracting: (p107<=1)
states: 595,380,218,772 (11)
....................................................................
EG iterations: 68
abstracting: (0<=p104)
states: 595,380,218,772 (11)
abstracting: (p104<=0)
states: 560,875,659,792 (11)
abstracting: (1<=p40)
states: 32,559,953,040 (10)
abstracting: (p40<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p175)
states: 595,380,218,772 (11)
abstracting: (p175<=0)
states: 504,042,908,262 (11)
.-> the formula is TRUE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m17.000sec

checking: EG [[[p66<=0 & 0<=p66] | [[p81<=1 & 1<=p81] | [AF [[p118<=1 & 1<=p118]] & ~ [E [AF [[[p147<=0 & 0<=p147] | [p145<=1 & 1<=p145]]] U [~ [[p49<=1 & 1<=p49]] | EF [[p121<=0 & 0<=p121]]]]]]]]]
normalized: EG [[[[~ [E [~ [EG [~ [[[p145<=1 & 1<=p145] | [p147<=0 & 0<=p147]]]]] U [E [true U [p121<=0 & 0<=p121]] | ~ [[p49<=1 & 1<=p49]]]]] & ~ [EG [~ [[p118<=1 & 1<=p118]]]]] | [p81<=1 & 1<=p81]] | [p66<=0 & 0<=p66]]]

abstracting: (0<=p66)
states: 595,380,218,772 (11)
abstracting: (p66<=0)
states: 546,742,395,012 (11)
abstracting: (1<=p81)
states: 40,532,075,316 (10)
abstracting: (p81<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p118)
states: 34,504,560,196 (10)
abstracting: (p118<=1)
states: 595,380,218,772 (11)
.
EG iterations: 1
abstracting: (1<=p49)
states: 42,908,080,104 (10)
abstracting: (p49<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p121)
states: 595,380,218,772 (11)
abstracting: (p121<=0)
states: 560,875,658,576 (11)
abstracting: (0<=p147)
states: 595,380,218,772 (11)
abstracting: (p147<=0)
states: 595,294,834,727 (11)
abstracting: (1<=p145)
states: 32,663,596,538 (10)
abstracting: (p145<=1)
states: 595,380,218,772 (11)
.................................................................
EG iterations: 65
.
EG iterations: 1
-> the formula is TRUE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.369sec

checking: [EG [~ [A [AF [[[p21<=1 & 1<=p21] & [[p77<=0 & 0<=p77] | [p35<=1 & 1<=p35]]]] U [~ [EF [[[p31<=0 & 0<=p31] | [p93<=1 & 1<=p93]]]] | AF [[p121<=1 & 1<=p121]]]]]] & EF [[EF [AX [[p71<=0 & 0<=p71]]] | [p142<=1 & 1<=p142]]]]
normalized: [E [true U [[p142<=1 & 1<=p142] | E [true U ~ [EX [~ [[p71<=0 & 0<=p71]]]]]]] & EG [~ [[~ [EG [~ [[~ [EG [~ [[p121<=1 & 1<=p121]]]] | ~ [E [true U [[p93<=1 & 1<=p93] | [p31<=0 & 0<=p31]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p121<=1 & 1<=p121]]]] | ~ [E [true U [[p93<=1 & 1<=p93] | [p31<=0 & 0<=p31]]]]]] U [EG [~ [[[[p35<=1 & 1<=p35] | [p77<=0 & 0<=p77]] & [p21<=1 & 1<=p21]]]] & ~ [[~ [EG [~ [[p121<=1 & 1<=p121]]]] | ~ [E [true U [[p93<=1 & 1<=p93] | [p31<=0 & 0<=p31]]]]]]]]]]]]]

abstracting: (0<=p31)
states: 595,380,218,772 (11)
abstracting: (p31<=0)
states: 554,980,610,820 (11)
abstracting: (1<=p93)
states: 32,663,574,726 (10)
abstracting: (p93<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p121)
states: 34,504,560,196 (10)
abstracting: (p121<=1)
states: 595,380,218,772 (11)
.
EG iterations: 1
abstracting: (1<=p21)
states: 32,559,953,040 (10)
abstracting: (p21<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p77)
states: 595,380,218,772 (11)
abstracting: (p77<=0)
states: 562,716,644,046 (11)
abstracting: (1<=p35)
states: 32,511,718,544 (10)
abstracting: (p35<=1)
states: 595,380,218,772 (11)
.................
before gc: list nodes free: 2219216

after gc: idd nodes used:1336117, unused:62663883; list nodes free:287535528
.........................................................
EG iterations: 74
abstracting: (0<=p31)
states: 595,380,218,772 (11)
abstracting: (p31<=0)
states: 554,980,610,820 (11)
abstracting: (1<=p93)
states: 32,663,574,726 (10)
abstracting: (p93<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p121)
states: 34,504,560,196 (10)
abstracting: (p121<=1)
states: 595,380,218,772 (11)
.
EG iterations: 1
abstracting: (0<=p31)
states: 595,380,218,772 (11)
abstracting: (p31<=0)
states: 554,980,610,820 (11)
abstracting: (1<=p93)
states: 32,663,574,726 (10)
abstracting: (p93<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p121)
states: 34,504,560,196 (10)
abstracting: (p121<=1)
states: 595,380,218,772 (11)
.
EG iterations: 1
...............................................................
EG iterations: 63
...............................................................
EG iterations: 63
abstracting: (0<=p71)
states: 595,380,218,772 (11)
abstracting: (p71<=0)
states: 556,306,550,852 (11)
.abstracting: (1<=p142)
states: 32,664,227,745 (10)
abstracting: (p142<=1)
states: 595,380,218,772 (11)
-> the formula is TRUE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 6.199sec

checking: EX [A [E [[[p154<=1 & 1<=p154] | [[p51<=1 & 1<=p51] | A [[[p106<=0 & 0<=p106] | [p68<=1 & 1<=p68]] U [p129<=0 & 0<=p129]]]] U ~ [[[[p31<=0 & 0<=p31] | [p54<=1 & 1<=p54]] & [p80<=1 & 1<=p80]]]] U ~ [[~ [[p41<=1 & 1<=p41]] | EF [[[p145<=1 & 1<=p145] & [p59<=1 & 1<=p59]]]]]]]
normalized: EX [[~ [EG [[E [true U [[p59<=1 & 1<=p59] & [p145<=1 & 1<=p145]]] | ~ [[p41<=1 & 1<=p41]]]]] & ~ [E [[E [true U [[p59<=1 & 1<=p59] & [p145<=1 & 1<=p145]]] | ~ [[p41<=1 & 1<=p41]]] U [~ [E [[[[~ [EG [~ [[p129<=0 & 0<=p129]]]] & ~ [E [~ [[p129<=0 & 0<=p129]] U [~ [[[p68<=1 & 1<=p68] | [p106<=0 & 0<=p106]]] & ~ [[p129<=0 & 0<=p129]]]]]] | [p51<=1 & 1<=p51]] | [p154<=1 & 1<=p154]] U ~ [[[p80<=1 & 1<=p80] & [[p54<=1 & 1<=p54] | [p31<=0 & 0<=p31]]]]]] & [E [true U [[p59<=1 & 1<=p59] & [p145<=1 & 1<=p145]]] | ~ [[p41<=1 & 1<=p41]]]]]]]]

abstracting: (1<=p41)
states: 32,559,953,040 (10)
abstracting: (p41<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p145)
states: 32,663,596,538 (10)
abstracting: (p145<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p59)
states: 34,547,184,040 (10)
abstracting: (p59<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p31)
states: 595,380,218,772 (11)
abstracting: (p31<=0)
states: 554,980,610,820 (11)
abstracting: (1<=p54)
states: 34,498,195,880 (10)
abstracting: (p54<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p80)
states: 32,615,110,708 (10)
abstracting: (p80<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p154)
states: 46,569,283,188 (10)
abstracting: (p154<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p51)
states: 34,498,195,880 (10)
abstracting: (p51<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p129)
states: 595,380,218,772 (11)
abstracting: (p129<=0)
states: 562,716,622,234 (11)
abstracting: (0<=p106)
states: 595,380,218,772 (11)
abstracting: (p106<=0)
states: 560,826,564,176 (11)
abstracting: (1<=p68)
states: 39,024,585,552 (10)
abstracting: (p68<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p129)
states: 595,380,218,772 (11)
abstracting: (p129<=0)
states: 562,716,622,234 (11)
abstracting: (0<=p129)
states: 595,380,218,772 (11)
abstracting: (p129<=0)
states: 562,716,622,234 (11)
.....................................................................
EG iterations: 69

before gc: list nodes free: 154960

after gc: idd nodes used:1185871, unused:62814129; list nodes free:290253212
abstracting: (1<=p41)
states: 32,559,953,040 (10)
abstracting: (p41<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p145)
states: 32,663,596,538 (10)
abstracting: (p145<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p59)
states: 34,547,184,040 (10)
abstracting: (p59<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p41)
states: 32,559,953,040 (10)
abstracting: (p41<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p145)
states: 32,663,596,538 (10)
abstracting: (p145<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p59)
states: 34,547,184,040 (10)
abstracting: (p59<=1)
states: 595,380,218,772 (11)
........................................................................
EG iterations: 72
.-> the formula is FALSE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m51.203sec

checking: EX [[E [~ [AF [~ [[p171<=1 & 1<=p171]]]] U ~ [AF [~ [[[p33<=0 & 0<=p33] | [p135<=1 & 1<=p135]]]]]] & [[[p156<=0 & 0<=p156] | [p133<=1 & 1<=p133]] & [A [AX [[[p61<=0 & 0<=p61] | [p143<=1 & 1<=p143]]] U EG [[[p83<=0 & 0<=p83] | [p77<=1 & 1<=p77]]]] | EG [AG [[[p155<=0 & 0<=p155] | [p147<=1 & 1<=p147]]]]]]]]
normalized: EX [[[[EG [~ [E [true U ~ [[[p147<=1 & 1<=p147] | [p155<=0 & 0<=p155]]]]]] | [~ [EG [~ [EG [[[p77<=1 & 1<=p77] | [p83<=0 & 0<=p83]]]]]] & ~ [E [~ [EG [[[p77<=1 & 1<=p77] | [p83<=0 & 0<=p83]]]] U [EX [~ [[[p143<=1 & 1<=p143] | [p61<=0 & 0<=p61]]]] & ~ [EG [[[p77<=1 & 1<=p77] | [p83<=0 & 0<=p83]]]]]]]]] & [[p133<=1 & 1<=p133] | [p156<=0 & 0<=p156]]] & E [EG [[p171<=1 & 1<=p171]] U EG [[[p135<=1 & 1<=p135] | [p33<=0 & 0<=p33]]]]]]

abstracting: (0<=p33)
states: 595,380,218,772 (11)
abstracting: (p33<=0)
states: 562,868,500,228 (11)
abstracting: (1<=p135)
states: 32,615,131,922 (10)
abstracting: (p135<=1)
states: 595,380,218,772 (11)
.
EG iterations: 1
abstracting: (1<=p171)
states: 85,377,019,178 (10)
abstracting: (p171<=1)
states: 595,380,218,772 (11)
............................................................................
EG iterations: 76
abstracting: (0<=p156)
states: 595,380,218,772 (11)
abstracting: (p156<=0)
states: 548,810,935,584 (11)
abstracting: (1<=p133)
states: 40,532,103,103 (10)
abstracting: (p133<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p83)
states: 595,380,218,772 (11)
abstracting: (p83<=0)
states: 562,765,108,064 (11)
abstracting: (1<=p77)
states: 32,663,574,726 (10)
abstracting: (p77<=1)
states: 595,380,218,772 (11)
.
EG iterations: 1
abstracting: (0<=p61)
states: 595,380,218,772 (11)
abstracting: (p61<=0)
states: 560,833,652,708 (11)
abstracting: (1<=p143)
states: 32,664,227,745 (10)
abstracting: (p143<=1)
states: 595,380,218,772 (11)
.abstracting: (0<=p83)
states: 595,380,218,772 (11)
abstracting: (p83<=0)
states: 562,765,108,064 (11)
abstracting: (1<=p77)
states: 32,663,574,726 (10)
abstracting: (p77<=1)
states: 595,380,218,772 (11)
.
EG iterations: 1
abstracting: (0<=p83)
states: 595,380,218,772 (11)
abstracting: (p83<=0)
states: 562,765,108,064 (11)
abstracting: (1<=p77)
states: 32,663,574,726 (10)
abstracting: (p77<=1)
states: 595,380,218,772 (11)
.
EG iterations: 1
...............
before gc: list nodes free: 3556022

after gc: idd nodes used:1430773, unused:62569227; list nodes free:289161088
......................................................
EG iterations: 69
abstracting: (0<=p155)
states: 595,380,218,772 (11)
abstracting: (p155<=0)
states: 548,810,935,584 (11)
abstracting: (1<=p147)
states: 85,384,045 (7)
abstracting: (p147<=1)
states: 595,380,218,772 (11)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 8.691sec

checking: A [AX [E [[p58<=1 & 1<=p58] U [[[p6<=0 & 0<=p6] | [p110<=1 & 1<=p110]] | [~ [[p177<=1 & 1<=p177]] | ~ [[[p12<=1 & 1<=p12] | [[p127<=0 & 0<=p127] | [p2<=1 & 1<=p2]]]]]]]] U ~ [[EX [0<=0] & [~ [[AF [[p80<=1 & 1<=p80]] & EX [[[p91<=0 & 0<=p91] | [p93<=1 & 1<=p93]]]]] | [[p122<=0 & 0<=p122] | [p159<=1 & 1<=p159]]]]]]
normalized: [~ [EG [[[[[p159<=1 & 1<=p159] | [p122<=0 & 0<=p122]] | ~ [[EX [[[p93<=1 & 1<=p93] | [p91<=0 & 0<=p91]]] & ~ [EG [~ [[p80<=1 & 1<=p80]]]]]]] & EX [0<=0]]]] & ~ [E [[[[[p159<=1 & 1<=p159] | [p122<=0 & 0<=p122]] | ~ [[EX [[[p93<=1 & 1<=p93] | [p91<=0 & 0<=p91]]] & ~ [EG [~ [[p80<=1 & 1<=p80]]]]]]] & EX [0<=0]] U [EX [~ [E [[p58<=1 & 1<=p58] U [[~ [[[[p2<=1 & 1<=p2] | [p127<=0 & 0<=p127]] | [p12<=1 & 1<=p12]]] | ~ [[p177<=1 & 1<=p177]]] | [[p110<=1 & 1<=p110] | [p6<=0 & 0<=p6]]]]]] & [[[[p159<=1 & 1<=p159] | [p122<=0 & 0<=p122]] | ~ [[EX [[[p93<=1 & 1<=p93] | [p91<=0 & 0<=p91]]] & ~ [EG [~ [[p80<=1 & 1<=p80]]]]]]] & EX [0<=0]]]]]]

abstracting: (0<=0)
states: 595,380,218,772 (11)
.abstracting: (1<=p80)
states: 32,615,110,708 (10)
abstracting: (p80<=1)
states: 595,380,218,772 (11)
.
EG iterations: 1
abstracting: (0<=p91)
states: 595,380,218,772 (11)
abstracting: (p91<=0)
states: 562,716,013,920 (11)
abstracting: (1<=p93)
states: 32,663,574,726 (10)
abstracting: (p93<=1)
states: 595,380,218,772 (11)
.abstracting: (0<=p122)
states: 595,380,218,772 (11)
abstracting: (p122<=0)
states: 560,826,562,776 (11)
abstracting: (1<=p159)
states: 46,569,283,188 (10)
abstracting: (p159<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p6)
states: 595,380,218,772 (11)
abstracting: (p6<=0)
states: 595,373,406,482 (11)
abstracting: (1<=p110)
states: 34,553,654,596 (10)
abstracting: (p110<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p177)
states: 85,384,046 (7)
abstracting: (p177<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p12)
states: 32,511,718,544 (10)
abstracting: (p12<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p127)
states: 595,380,218,772 (11)
abstracting: (p127<=0)
states: 560,827,193,919 (11)
abstracting: (1<=p2)
states: 25
abstracting: (p2<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p58)
states: 34,547,184,040 (10)
abstracting: (p58<=1)
states: 595,380,218,772 (11)
.abstracting: (0<=0)
states: 595,380,218,772 (11)
.abstracting: (1<=p80)
states: 32,615,110,708 (10)
abstracting: (p80<=1)
states: 595,380,218,772 (11)
.
EG iterations: 1
abstracting: (0<=p91)
states: 595,380,218,772 (11)
abstracting: (p91<=0)
states: 562,716,013,920 (11)
abstracting: (1<=p93)
states: 32,663,574,726 (10)
abstracting: (p93<=1)
states: 595,380,218,772 (11)
.abstracting: (0<=p122)
states: 595,380,218,772 (11)
abstracting: (p122<=0)
states: 560,826,562,776 (11)
abstracting: (1<=p159)
states: 46,569,283,188 (10)
abstracting: (p159<=1)
states: 595,380,218,772 (11)
abstracting: (0<=0)
states: 595,380,218,772 (11)
.abstracting: (1<=p80)
states: 32,615,110,708 (10)
abstracting: (p80<=1)
states: 595,380,218,772 (11)
.
EG iterations: 1
abstracting: (0<=p91)
states: 595,380,218,772 (11)
abstracting: (p91<=0)
states: 562,716,013,920 (11)
abstracting: (1<=p93)
states: 32,663,574,726 (10)
abstracting: (p93<=1)
states: 595,380,218,772 (11)
.abstracting: (0<=p122)
states: 595,380,218,772 (11)
abstracting: (p122<=0)
states: 560,826,562,776 (11)
abstracting: (1<=p159)
states: 46,569,283,188 (10)
abstracting: (p159<=1)
states: 595,380,218,772 (11)
.............................................................................
EG iterations: 77
-> the formula is FALSE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m43.964sec

checking: EF [[EF [[p15<=1 & 1<=p15]] & [AG [[A [[p44<=1 & 1<=p44] U [[p79<=0 & 0<=p79] | [p0<=1 & 1<=p0]]] & [[p47<=1 & 1<=p47] & EG [[p120<=1 & 1<=p120]]]]] | [[[p128<=0 & 0<=p128] & [p116<=1 & 1<=p116]] & [[~ [E [[p91<=1 & 1<=p91] U [p156<=0 & 0<=p156]]] | ~ [E [[p34<=1 & 1<=p34] U [[p86<=0 & 0<=p86] | [p141<=1 & 1<=p141]]]]] & [~ [A [[p6<=1 & 1<=p6] U [[p154<=0 & 0<=p154] | [p141<=1 & 1<=p141]]]] | EF [[p56<=0 & 0<=p56]]]]]]]]
normalized: E [true U [[[[[E [true U [p56<=0 & 0<=p56]] | ~ [[~ [EG [~ [[[p141<=1 & 1<=p141] | [p154<=0 & 0<=p154]]]]] & ~ [E [~ [[[p141<=1 & 1<=p141] | [p154<=0 & 0<=p154]]] U [~ [[p6<=1 & 1<=p6]] & ~ [[[p141<=1 & 1<=p141] | [p154<=0 & 0<=p154]]]]]]]]] & [~ [E [[p34<=1 & 1<=p34] U [[p141<=1 & 1<=p141] | [p86<=0 & 0<=p86]]]] | ~ [E [[p91<=1 & 1<=p91] U [p156<=0 & 0<=p156]]]]] & [[p116<=1 & 1<=p116] & [p128<=0 & 0<=p128]]] | ~ [E [true U ~ [[[EG [[p120<=1 & 1<=p120]] & [p47<=1 & 1<=p47]] & [~ [EG [~ [[[p0<=1 & 1<=p0] | [p79<=0 & 0<=p79]]]]] & ~ [E [~ [[[p0<=1 & 1<=p0] | [p79<=0 & 0<=p79]]] U [~ [[p44<=1 & 1<=p44]] & ~ [[[p0<=1 & 1<=p0] | [p79<=0 & 0<=p79]]]]]]]]]]]] & E [true U [p15<=1 & 1<=p15]]]]

abstracting: (1<=p15)
states: 32,511,718,544 (10)
abstracting: (p15<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p79)
states: 595,380,218,772 (11)
abstracting: (p79<=0)
states: 562,765,108,064 (11)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p44)
states: 32,559,371,460 (10)
abstracting: (p44<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p79)
states: 595,380,218,772 (11)
abstracting: (p79<=0)
states: 562,765,108,064 (11)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p79)
states: 595,380,218,772 (11)
abstracting: (p79<=0)
states: 562,765,108,064 (11)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 595,380,218,772 (11)
.....................................................................
EG iterations: 69
abstracting: (1<=p47)
states: 34,498,195,880 (10)
abstracting: (p47<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p120)
states: 34,504,560,196 (10)
abstracting: (p120<=1)
states: 595,380,218,772 (11)
.....................................................................
EG iterations: 69
abstracting: (0<=p128)
states: 595,380,218,772 (11)
abstracting: (p128<=0)
states: 560,827,193,919 (11)
abstracting: (1<=p116)
states: 42,916,381,488 (10)
abstracting: (p116<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p156)
states: 595,380,218,772 (11)
abstracting: (p156<=0)
states: 548,810,935,584 (11)
abstracting: (1<=p91)
states: 32,664,204,852 (10)
abstracting: (p91<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p86)
states: 595,380,218,772 (11)
abstracting: (p86<=0)
states: 562,765,108,064 (11)
abstracting: (1<=p141)
states: 32,664,227,745 (10)
abstracting: (p141<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p34)
states: 32,511,718,544 (10)
abstracting: (p34<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p154)
states: 595,380,218,772 (11)
abstracting: (p154<=0)
states: 548,810,935,584 (11)
abstracting: (1<=p141)
states: 32,664,227,745 (10)
abstracting: (p141<=1)
states: 595,380,218,772 (11)
abstracting: (1<=p6)
states: 6,812,290 (6)
abstracting: (p6<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p154)
states: 595,380,218,772 (11)
abstracting: (p154<=0)
states: 548,810,935,584 (11)
abstracting: (1<=p141)
states: 32,664,227,745 (10)
abstracting: (p141<=1)
states: 595,380,218,772 (11)
abstracting: (0<=p154)
states: 595,380,218,772 (11)
abstracting: (p154<=0)
states: 548,810,935,584 (11)
abstracting: (1<=p141)
states: 32,664,227,745 (10)
abstracting: (p141<=1)
states: 595,380,218,772 (11)
............................................................................
EG iterations: 76
abstracting: (0<=p56)
states: 595,380,218,772 (11)
abstracting: (p56<=0)
states: 560,833,034,732 (11)
-> the formula is TRUE

FORMULA GPUForwardProgress-PT-08b-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m11.818sec

totally nodes used: 373820424 (3.7e+08)
number of garbage collections: 5
fire ops cache: hits/miss/sum: 547187541 1413277345 1960464886
used/not used/entry size/cache size: 66187451 921413 16 1024MB
basic ops cache: hits/miss/sum: 31721568 79491451 111213019
used/not used/entry size/cache size: 12391069 4386147 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1078192 2523073 3601265
used/not used/entry size/cache size: 531325 7857283 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 27898426
1 24162062
2 10822324
3 3295964
4 762207
5 141944
6 22110
7 3132
8 461
9 124
>= 10 110

Total processing time: 16m49.420sec


BK_STOP 1678518263270

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

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


initing FirstDep: 0m 0.000sec


iterations count:19576 (104), effective:1971 (10)

initing FirstDep: 0m 0.000sec


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

iterations count:964 (5), effective:39 (0)

iterations count:964 (5), effective:39 (0)

iterations count:2094 (11), effective:153 (0)

iterations count:964 (5), effective:39 (0)

iterations count:323 (1), effective:21 (0)

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

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

iterations count:273 (1), effective:16 (0)

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

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

iterations count:2661 (14), effective:238 (1)

iterations count:1756 (9), effective:93 (0)

iterations count:205 (1), effective:5 (0)

iterations count:3084 (16), effective:256 (1)

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

iterations count:936 (4), effective:49 (0)

iterations count:222 (1), effective:10 (0)

iterations count:364 (1), effective:27 (0)

iterations count:2203 (11), effective:152 (0)

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

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

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

iterations count:10412 (55), effective:881 (4)

iterations count:10412 (55), effective:881 (4)

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

iterations count:10412 (55), effective:881 (4)

iterations count:1969 (10), effective:143 (0)

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

iterations count:802 (4), effective:49 (0)

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

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

iterations count:802 (4), effective:49 (0)

iterations count:1295 (6), effective:87 (0)

iterations count:802 (4), effective:49 (0)

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

iterations count:204 (1), effective:5 (0)

iterations count:2137 (11), effective:172 (0)

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

iterations count:226 (1), effective:13 (0)

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

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

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

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

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

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

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

iterations count:3804 (20), effective:272 (1)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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