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-167813599200569.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 AutonomousCar-PT-03b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599200569
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 75K 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 AutonomousCar-PT-03b-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678698963917

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=AutonomousCar-PT-03b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:16:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:16:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:16:07] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-13 09:16:07] [INFO ] Transformed 190 places.
[2023-03-13 09:16:07] [INFO ] Transformed 273 transitions.
[2023-03-13 09:16:07] [INFO ] Found NUPN structural information;
[2023-03-13 09:16:07] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
FORMULA AutonomousCar-PT-03b-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 182 transition count 265
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 182 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 181 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 181 transition count 264
Applied a total of 18 rules in 58 ms. Remains 181 /190 variables (removed 9) and now considering 264/273 (removed 9) transitions.
// Phase 1: matrix 264 rows 181 cols
[2023-03-13 09:16:07] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-13 09:16:08] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-13 09:16:08] [INFO ] Invariant cache hit.
[2023-03-13 09:16:08] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2023-03-13 09:16:08] [INFO ] Invariant cache hit.
[2023-03-13 09:16:09] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/190 places, 264/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1360 ms. Remains : 181/190 places, 264/273 transitions.
Support contains 87 out of 181 places after structural reductions.
[2023-03-13 09:16:09] [INFO ] Flatten gal took : 53 ms
[2023-03-13 09:16:09] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA AutonomousCar-PT-03b-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:16:09] [INFO ] Flatten gal took : 25 ms
[2023-03-13 09:16:09] [INFO ] Input system was already deterministic with 264 transitions.
Support contains 71 out of 181 places (down from 87) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 50) seen :44
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 09:16:10] [INFO ] Invariant cache hit.
[2023-03-13 09:16:10] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 09:16:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 09:16:10] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-13 09:16:10] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 4 ms to minimize.
[2023-03-13 09:16:10] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2023-03-13 09:16:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2023-03-13 09:16:10] [INFO ] After 330ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-13 09:16:10] [INFO ] After 487ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 5 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 264/264 transitions.
Graph (trivial) has 158 edges and 181 vertex of which 2 / 181 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 429 edges and 180 vertex of which 177 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 177 transition count 188
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 91 rules applied. Total rules applied 165 place count 106 transition count 168
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 178 place count 95 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 180 place count 93 transition count 166
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 180 place count 93 transition count 159
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 194 place count 86 transition count 159
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 207 place count 73 transition count 146
Iterating global reduction 4 with 13 rules applied. Total rules applied 220 place count 73 transition count 146
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 256 place count 73 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 256 place count 73 transition count 109
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 258 place count 72 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 260 place count 70 transition count 103
Iterating global reduction 5 with 2 rules applied. Total rules applied 262 place count 70 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 with 4 rules applied. Total rules applied 266 place count 70 transition count 99
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 268 place count 68 transition count 99
Performed 25 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 318 place count 43 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 319 place count 43 transition count 72
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 323 place count 39 transition count 60
Iterating global reduction 8 with 4 rules applied. Total rules applied 327 place count 39 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 328 place count 39 transition count 59
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 9 with 2 rules applied. Total rules applied 330 place count 38 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 334 place count 36 transition count 76
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 335 place count 36 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 336 place count 35 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 337 place count 34 transition count 75
Applied a total of 337 rules in 61 ms. Remains 34 /181 variables (removed 147) and now considering 75/264 (removed 189) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 34/181 places, 75/264 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 75 rows 34 cols
[2023-03-13 09:16:11] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-13 09:16:11] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:16:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 09:16:11] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:16:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:16:11] [INFO ] After 41ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:16:11] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-13 09:16:11] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 75/75 transitions.
Graph (trivial) has 5 edges and 34 vertex of which 2 / 34 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 153 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 3 ms. Remains 32 /34 variables (removed 2) and now considering 73/75 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 32/34 places, 73/75 transitions.
Finished random walk after 496 steps, including 36 resets, run visited all 1 properties in 2 ms. (steps per millisecond=248 )
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 30 ms
[2023-03-13 09:16:11] [INFO ] Input system was already deterministic with 264 transitions.
Support contains 69 out of 181 places (down from 70) after GAL structural reductions.
Computed a total of 38 stabilizing places and 39 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Graph (trivial) has 170 edges and 181 vertex of which 4 / 181 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 178 transition count 183
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 98 rules applied. Total rules applied 177 place count 100 transition count 163
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 188 place count 89 transition count 163
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 188 place count 89 transition count 156
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 202 place count 82 transition count 156
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 215 place count 69 transition count 143
Iterating global reduction 3 with 13 rules applied. Total rules applied 228 place count 69 transition count 143
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 264 place count 69 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 264 place count 69 transition count 106
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 266 place count 68 transition count 106
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 268 place count 66 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 270 place count 66 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 4 rules applied. Total rules applied 274 place count 66 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 276 place count 64 transition count 96
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 318 place count 43 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 319 place count 43 transition count 74
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 324 place count 38 transition count 58
Iterating global reduction 7 with 5 rules applied. Total rules applied 329 place count 38 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 331 place count 38 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 332 place count 37 transition count 56
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 9 with 2 rules applied. Total rules applied 334 place count 36 transition count 55
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 335 place count 36 transition count 54
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 337 place count 34 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 338 place count 33 transition count 52
Applied a total of 338 rules in 27 ms. Remains 33 /181 variables (removed 148) and now considering 52/264 (removed 212) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 33/181 places, 52/264 transitions.
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:16:11] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 158 transition count 241
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 158 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 82 place count 158 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 155 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 154 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 154 transition count 201
Applied a total of 90 rules in 19 ms. Remains 154 /181 variables (removed 27) and now considering 201/264 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 154/181 places, 201/264 transitions.
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:16:11] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 160 transition count 243
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 160 transition count 243
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 78 place count 160 transition count 207
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 158 transition count 205
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 158 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 157 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 157 transition count 204
Applied a total of 84 rules in 23 ms. Remains 157 /181 variables (removed 24) and now considering 204/264 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 157/181 places, 204/264 transitions.
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 28 ms
[2023-03-13 09:16:11] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Graph (trivial) has 167 edges and 181 vertex of which 4 / 181 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 80 place count 178 transition count 182
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 99 rules applied. Total rules applied 179 place count 99 transition count 162
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 191 place count 88 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 192 place count 87 transition count 161
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 192 place count 87 transition count 154
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 206 place count 80 transition count 154
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 218 place count 68 transition count 142
Iterating global reduction 4 with 12 rules applied. Total rules applied 230 place count 68 transition count 142
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 266 place count 68 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 266 place count 68 transition count 105
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 268 place count 67 transition count 105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 269 place count 66 transition count 102
Iterating global reduction 5 with 1 rules applied. Total rules applied 270 place count 66 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 272 place count 66 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 273 place count 65 transition count 100
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 313 place count 45 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 314 place count 45 transition count 79
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 319 place count 40 transition count 63
Iterating global reduction 8 with 5 rules applied. Total rules applied 324 place count 40 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 326 place count 40 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 327 place count 39 transition count 61
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 10 with 2 rules applied. Total rules applied 329 place count 38 transition count 60
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 330 place count 38 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 332 place count 36 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 333 place count 35 transition count 57
Applied a total of 333 rules in 27 ms. Remains 35 /181 variables (removed 146) and now considering 57/264 (removed 207) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 35/181 places, 57/264 transitions.
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:16:11] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 158 transition count 241
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 158 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 82 place count 158 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 155 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 154 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 154 transition count 201
Applied a total of 90 rules in 10 ms. Remains 154 /181 variables (removed 27) and now considering 201/264 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 154/181 places, 201/264 transitions.
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:11] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 158 transition count 241
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 158 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 82 place count 158 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 155 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 154 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 154 transition count 201
Applied a total of 90 rules in 10 ms. Remains 154 /181 variables (removed 27) and now considering 201/264 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 154/181 places, 201/264 transitions.
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:11] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 166 transition count 249
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 166 transition count 249
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 164 transition count 247
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 164 transition count 247
Applied a total of 34 rules in 8 ms. Remains 164 /181 variables (removed 17) and now considering 247/264 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 164/181 places, 247/264 transitions.
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:16:11] [INFO ] Input system was already deterministic with 247 transitions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 164 transition count 247
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 164 transition count 247
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 70 place count 164 transition count 211
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 162 transition count 209
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 162 transition count 209
Applied a total of 74 rules in 7 ms. Remains 162 /181 variables (removed 19) and now considering 209/264 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 162/181 places, 209/264 transitions.
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:11] [INFO ] Input system was already deterministic with 209 transitions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 158 transition count 241
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 158 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 82 place count 158 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 155 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 154 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 154 transition count 201
Applied a total of 90 rules in 10 ms. Remains 154 /181 variables (removed 27) and now considering 201/264 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 154/181 places, 201/264 transitions.
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:16:11] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Graph (trivial) has 161 edges and 181 vertex of which 4 / 181 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 178 transition count 186
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 92 rules applied. Total rules applied 168 place count 103 transition count 169
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 180 place count 93 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 182 place count 91 transition count 167
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 182 place count 91 transition count 160
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 196 place count 84 transition count 160
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 208 place count 72 transition count 148
Iterating global reduction 4 with 12 rules applied. Total rules applied 220 place count 72 transition count 148
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 256 place count 72 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 256 place count 72 transition count 111
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 258 place count 71 transition count 111
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 260 place count 69 transition count 105
Iterating global reduction 5 with 2 rules applied. Total rules applied 262 place count 69 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 with 3 rules applied. Total rules applied 265 place count 69 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 266 place count 68 transition count 102
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 308 place count 47 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 309 place count 47 transition count 80
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 314 place count 42 transition count 64
Iterating global reduction 8 with 5 rules applied. Total rules applied 319 place count 42 transition count 64
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 8 with 2 rules applied. Total rules applied 321 place count 42 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 322 place count 41 transition count 62
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 10 with 2 rules applied. Total rules applied 324 place count 40 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 325 place count 40 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 327 place count 38 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 328 place count 37 transition count 58
Applied a total of 328 rules in 26 ms. Remains 37 /181 variables (removed 144) and now considering 58/264 (removed 206) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 37/181 places, 58/264 transitions.
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:16:11] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 162 transition count 245
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 162 transition count 245
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 74 place count 162 transition count 209
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 160 transition count 207
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 160 transition count 207
Applied a total of 78 rules in 6 ms. Remains 160 /181 variables (removed 21) and now considering 207/264 (removed 57) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 160/181 places, 207/264 transitions.
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:16:11] [INFO ] Input system was already deterministic with 207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 164 transition count 247
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 164 transition count 247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 163 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 163 transition count 246
Applied a total of 36 rules in 7 ms. Remains 163 /181 variables (removed 18) and now considering 246/264 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 163/181 places, 246/264 transitions.
[2023-03-13 09:16:11] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:12] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:16:12] [INFO ] Input system was already deterministic with 246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 160 transition count 243
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 160 transition count 243
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 78 place count 160 transition count 207
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 158 transition count 205
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 158 transition count 205
Applied a total of 82 rules in 20 ms. Remains 158 /181 variables (removed 23) and now considering 205/264 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 158/181 places, 205/264 transitions.
[2023-03-13 09:16:12] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:16:12] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:16:12] [INFO ] Input system was already deterministic with 205 transitions.
[2023-03-13 09:16:12] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:16:12] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:16:12] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 09:16:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 181 places, 264 transitions and 1033 arcs took 2 ms.
Total runtime 4820 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: 181 NrTr: 264 NrArc: 1033)

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

net check time: 0m 0.000sec

init dd package: 0m 2.988sec


RS generation: 0m 2.169sec


-> reachability set: #nodes 18861 (1.9e+04) #states 121,636,650 (8)



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

checking: AF [AX [1<=0]]
normalized: ~ [EG [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
............................................................................................................................
EG iterations: 123
-> the formula is FALSE

FORMULA AutonomousCar-PT-03b-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m41.903sec

checking: EG [[p80<=0 & 0<=p80]]
normalized: EG [[p80<=0 & 0<=p80]]

abstracting: (0<=p80)
states: 121,636,650 (8)
abstracting: (p80<=0)
states: 117,081,717 (8)
.....................................................
EG iterations: 53
-> the formula is TRUE

FORMULA AutonomousCar-PT-03b-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.520sec

checking: AX [AF [EG [[p153<=0 & 0<=p153]]]]
normalized: ~ [EX [EG [~ [EG [[p153<=0 & 0<=p153]]]]]]

abstracting: (0<=p153)
states: 121,636,650 (8)
abstracting: (p153<=0)
states: 117,889,284 (8)
.
EG iterations: 1
............................................................................................................................
EG iterations: 124
.-> the formula is TRUE

FORMULA AutonomousCar-PT-03b-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.326sec

checking: EF [EG [A [AX [[p115<=1 & 1<=p115]] U EX [[p106<=0 & 0<=p106]]]]]
normalized: E [true U EG [[~ [EG [~ [EX [[p106<=0 & 0<=p106]]]]] & ~ [E [~ [EX [[p106<=0 & 0<=p106]]] U [EX [~ [[p115<=1 & 1<=p115]]] & ~ [EX [[p106<=0 & 0<=p106]]]]]]]]]

abstracting: (0<=p106)
states: 121,636,650 (8)
abstracting: (p106<=0)
states: 114,595,908 (8)
.abstracting: (1<=p115)
states: 11,550 (4)
abstracting: (p115<=1)
states: 121,636,650 (8)
.abstracting: (0<=p106)
states: 121,636,650 (8)
abstracting: (p106<=0)
states: 114,595,908 (8)
.abstracting: (0<=p106)
states: 121,636,650 (8)
abstracting: (p106<=0)
states: 114,595,908 (8)
.........................................
EG iterations: 40
..............................
before gc: list nodes free: 876766

after gc: idd nodes used:228613, unused:63771387; list nodes free:294674197
.............................................................................................
EG iterations: 123
-> the formula is TRUE

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

MC time: 1m 8.445sec

checking: AF [[EF [[p175<=1 & 1<=p175]] & [[p174<=0 & 0<=p174] | [p100<=1 & 1<=p100]]]]
normalized: ~ [EG [~ [[[[p100<=1 & 1<=p100] | [p174<=0 & 0<=p174]] & E [true U [p175<=1 & 1<=p175]]]]]]

abstracting: (1<=p175)
states: 18,542,352 (7)
abstracting: (p175<=1)
states: 121,636,650 (8)
abstracting: (0<=p174)
states: 121,636,650 (8)
abstracting: (p174<=0)
states: 117,889,284 (8)
abstracting: (1<=p100)
states: 3,530,142 (6)
abstracting: (p100<=1)
states: 121,636,650 (8)
...............................................................
EG iterations: 63
-> the formula is TRUE

FORMULA AutonomousCar-PT-03b-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.567sec

checking: AG [[[p18<=0 & 0<=p18] | [[p38<=1 & 1<=p38] | [AX [[p153<=0 & 0<=p153]] & AF [[[p38<=0 & 0<=p38] | [p63<=1 & 1<=p63]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [EG [~ [[[p63<=1 & 1<=p63] | [p38<=0 & 0<=p38]]]]] & ~ [EX [~ [[p153<=0 & 0<=p153]]]]] | [p38<=1 & 1<=p38]] | [p18<=0 & 0<=p18]]]]]

abstracting: (0<=p18)
states: 121,636,650 (8)
abstracting: (p18<=0)
states: 121,636,050 (8)
abstracting: (1<=p38)
states: 4,252,431 (6)
abstracting: (p38<=1)
states: 121,636,650 (8)
abstracting: (0<=p153)
states: 121,636,650 (8)
abstracting: (p153<=0)
states: 117,889,284 (8)
.abstracting: (0<=p38)
states: 121,636,650 (8)
abstracting: (p38<=0)
states: 117,384,219 (8)
abstracting: (1<=p63)
states: 4,554,933 (6)
abstracting: (p63<=1)
states: 121,636,650 (8)
...................................................
EG iterations: 51
-> the formula is TRUE

FORMULA AutonomousCar-PT-03b-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.118sec

checking: AG [A [~ [E [[[p117<=0 & 0<=p117] | [p82<=1 & 1<=p82]] U [[p152<=0 & 0<=p152] | [p28<=1 & 1<=p28]]]] U AF [~ [[p45<=1 & 1<=p45]]]]]
normalized: ~ [E [true U ~ [[~ [EG [EG [[p45<=1 & 1<=p45]]]] & ~ [E [EG [[p45<=1 & 1<=p45]] U [E [[[p82<=1 & 1<=p82] | [p117<=0 & 0<=p117]] U [[p28<=1 & 1<=p28] | [p152<=0 & 0<=p152]]] & EG [[p45<=1 & 1<=p45]]]]]]]]]

abstracting: (1<=p45)
states: 4,252,431 (6)
abstracting: (p45<=1)
states: 121,636,650 (8)
.....................................................
EG iterations: 53
abstracting: (0<=p152)
states: 121,636,650 (8)
abstracting: (p152<=0)
states: 117,889,284 (8)
abstracting: (1<=p28)
states: 4,252,431 (6)
abstracting: (p28<=1)
states: 121,636,650 (8)
abstracting: (0<=p117)
states: 121,636,650 (8)
abstracting: (p117<=0)
states: 116,560,458 (8)
abstracting: (1<=p82)
states: 4,554,933 (6)
abstracting: (p82<=1)
states: 121,636,650 (8)
abstracting: (1<=p45)
states: 4,252,431 (6)
abstracting: (p45<=1)
states: 121,636,650 (8)
.....................................................
EG iterations: 53
abstracting: (1<=p45)
states: 4,252,431 (6)
abstracting: (p45<=1)
states: 121,636,650 (8)
.....................................................
EG iterations: 53
.
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-03b-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.168sec

checking: [AG [EF [[p73<=0 & 0<=p73]]] & [EG [[p10<=0 & 0<=p10]] | EX [AX [[[p80<=1 & 1<=p80] | [[[p100<=0 & 0<=p100] & [p175<=1 & 1<=p175]] & [[p161<=0 & 0<=p161] & [p21<=1 & 1<=p21]]]]]]]]
normalized: [[EX [~ [EX [~ [[[[[p21<=1 & 1<=p21] & [p161<=0 & 0<=p161]] & [[p175<=1 & 1<=p175] & [p100<=0 & 0<=p100]]] | [p80<=1 & 1<=p80]]]]]] | EG [[p10<=0 & 0<=p10]]] & ~ [E [true U ~ [E [true U [p73<=0 & 0<=p73]]]]]]

abstracting: (0<=p73)
states: 121,636,650 (8)
abstracting: (p73<=0)
states: 117,081,717 (8)
abstracting: (0<=p10)
states: 121,636,650 (8)
abstracting: (p10<=0)
states: 112,486,146 (8)
..................................................
EG iterations: 50
abstracting: (1<=p80)
states: 4,554,933 (6)
abstracting: (p80<=1)
states: 121,636,650 (8)
abstracting: (0<=p100)
states: 121,636,650 (8)
abstracting: (p100<=0)
states: 118,106,508 (8)
abstracting: (1<=p175)
states: 18,542,352 (7)
abstracting: (p175<=1)
states: 121,636,650 (8)
abstracting: (0<=p161)
states: 121,636,650 (8)
abstracting: (p161<=0)
states: 117,889,284 (8)
abstracting: (1<=p21)
states: 600
abstracting: (p21<=1)
states: 121,636,650 (8)
..-> the formula is TRUE

FORMULA AutonomousCar-PT-03b-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.200sec

checking: E [EG [AF [AX [~ [[p27<=1 & 1<=p27]]]]] U [EF [[[p50<=1 & 1<=p50] | ~ [[EX [[[p29<=0 & 0<=p29] | [p5<=1 & 1<=p5]]] | [[p130<=0 & 0<=p130] | [p162<=1 & 1<=p162]]]]]] & [EF [~ [AX [[[p12<=0 & 0<=p12] | [p67<=1 & 1<=p67]]]]] | [[p134<=0 & 0<=p134] | [p4<=1 & 1<=p4]]]]]
normalized: E [EG [~ [EG [EX [[p27<=1 & 1<=p27]]]]] U [[[[p4<=1 & 1<=p4] | [p134<=0 & 0<=p134]] | E [true U EX [~ [[[p67<=1 & 1<=p67] | [p12<=0 & 0<=p12]]]]]] & E [true U [~ [[[[p162<=1 & 1<=p162] | [p130<=0 & 0<=p130]] | EX [[[p5<=1 & 1<=p5] | [p29<=0 & 0<=p29]]]]] | [p50<=1 & 1<=p50]]]]]

abstracting: (1<=p50)
states: 6,766,428 (6)
abstracting: (p50<=1)
states: 121,636,650 (8)
abstracting: (0<=p29)
states: 121,636,650 (8)
abstracting: (p29<=0)
states: 117,384,219 (8)
abstracting: (1<=p5)
states: 18,301,008 (7)
abstracting: (p5<=1)
states: 121,636,650 (8)
.abstracting: (0<=p130)
states: 121,636,650 (8)
abstracting: (p130<=0)
states: 120,300,810 (8)
abstracting: (1<=p162)
states: 3,747,366 (6)
abstracting: (p162<=1)
states: 121,636,650 (8)
abstracting: (0<=p12)
states: 121,636,650 (8)
abstracting: (p12<=0)
states: 93,159,984 (7)
abstracting: (1<=p67)
states: 4,554,933 (6)
abstracting: (p67<=1)
states: 121,636,650 (8)
.abstracting: (0<=p134)
states: 121,636,650 (8)
abstracting: (p134<=0)
states: 113,323,692 (8)
abstracting: (1<=p4)
states: 27,844,326 (7)
abstracting: (p4<=1)
states: 121,636,650 (8)
abstracting: (1<=p27)
states: 9,600 (3)
abstracting: (p27<=1)
states: 121,636,650 (8)
.............................
EG iterations: 28

EG iterations: 0
-> the formula is TRUE

FORMULA AutonomousCar-PT-03b-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.105sec

checking: [AF [EX [E [EG [[p145<=0 & 0<=p145]] U AF [[p9<=1 & 1<=p9]]]]] & [EF [[AG [[p40<=0 & 0<=p40]] | AF [[[p46<=0 & 0<=p46] | [p43<=1 & 1<=p43]]]]] | AG [EX [[~ [A [[[p89<=0 & 0<=p89] | [p62<=1 & 1<=p62]] U [[p158<=0 & 0<=p158] | [p69<=1 & 1<=p69]]]] & [[[p171<=0 & 0<=p171] & [p111<=1 & 1<=p111]] | [p169<=0 & 0<=p169]]]]]]]
normalized: [[~ [E [true U ~ [EX [[[[p169<=0 & 0<=p169] | [[p111<=1 & 1<=p111] & [p171<=0 & 0<=p171]]] & ~ [[~ [EG [~ [[[p69<=1 & 1<=p69] | [p158<=0 & 0<=p158]]]]] & ~ [E [~ [[[p69<=1 & 1<=p69] | [p158<=0 & 0<=p158]]] U [~ [[[p62<=1 & 1<=p62] | [p89<=0 & 0<=p89]]] & ~ [[[p69<=1 & 1<=p69] | [p158<=0 & 0<=p158]]]]]]]]]]]]] | E [true U [~ [EG [~ [[[p43<=1 & 1<=p43] | [p46<=0 & 0<=p46]]]]] | ~ [E [true U ~ [[p40<=0 & 0<=p40]]]]]]] & ~ [EG [~ [EX [E [EG [[p145<=0 & 0<=p145]] U ~ [EG [~ [[p9<=1 & 1<=p9]]]]]]]]]]

abstracting: (1<=p9)
states: 9,150,504 (6)
abstracting: (p9<=1)
states: 121,636,650 (8)
...................................................
EG iterations: 51
abstracting: (0<=p145)
states: 121,636,650 (8)
abstracting: (p145<=0)
states: 120,667,875 (8)
........................................................................................................................
before gc: list nodes free: 1457459

after gc: idd nodes used:159458, unused:63840542; list nodes free:294978878
.........................
EG iterations: 145
................................................................
EG iterations: 63
abstracting: (0<=p40)
states: 121,636,650 (8)
abstracting: (p40<=0)
states: 117,384,219 (8)
abstracting: (0<=p46)
states: 121,636,650 (8)
abstracting: (p46<=0)
states: 118,260,732 (8)
abstracting: (1<=p43)
states: 3,375,918 (6)
abstracting: (p43<=1)
states: 121,636,650 (8)
..............................................
EG iterations: 46
abstracting: (0<=p158)
states: 121,636,650 (8)
abstracting: (p158<=0)
states: 113,942,983 (8)
abstracting: (1<=p69)
states: 4,554,933 (6)
abstracting: (p69<=1)
states: 121,636,650 (8)
abstracting: (0<=p89)
states: 121,636,650 (8)
abstracting: (p89<=0)
states: 118,106,508 (8)
abstracting: (1<=p62)
states: 4,554,933 (6)
abstracting: (p62<=1)
states: 121,636,650 (8)
abstracting: (0<=p158)
states: 121,636,650 (8)
abstracting: (p158<=0)
states: 113,942,983 (8)
abstracting: (1<=p69)
states: 4,554,933 (6)
abstracting: (p69<=1)
states: 121,636,650 (8)
abstracting: (0<=p158)
states: 121,636,650 (8)
abstracting: (p158<=0)
states: 113,942,983 (8)
abstracting: (1<=p69)
states: 4,554,933 (6)
abstracting: (p69<=1)
states: 121,636,650 (8)
..................................................
EG iterations: 50
abstracting: (0<=p171)
states: 121,636,650 (8)
abstracting: (p171<=0)
states: 117,889,284 (8)
abstracting: (1<=p111)
states: 4,393,662 (6)
abstracting: (p111<=1)
states: 121,636,650 (8)
abstracting: (0<=p169)
states: 121,636,650 (8)
abstracting: (p169<=0)
states: 117,889,284 (8)
.-> the formula is FALSE

FORMULA AutonomousCar-PT-03b-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m59.608sec

checking: AF [[[[p162<=0 & 0<=p162] | [p78<=1 & 1<=p78]] & [EX [EF [[p14<=1 & 1<=p14]]] | [[p148<=1 & 1<=p148] | [[AG [[p79<=0 & 0<=p79]] & [p107<=0 & 0<=p107]] & [[p149<=0 & 0<=p149] & [[p78<=1 & 1<=p78] & [[p5<=0 & 0<=p5] | [[p155<=1 & 1<=p155] | [[[p132<=0 & 0<=p132] & [p117<=1 & 1<=p117]] & [[p43<=0 & 0<=p43] & [[p112<=0 & 0<=p112] | [p143<=1 & 1<=p143]]]]]]]]]]]]]
normalized: ~ [EG [~ [[[[[[[[[[[[[p143<=1 & 1<=p143] | [p112<=0 & 0<=p112]] & [p43<=0 & 0<=p43]] & [[p117<=1 & 1<=p117] & [p132<=0 & 0<=p132]]] | [p155<=1 & 1<=p155]] | [p5<=0 & 0<=p5]] & [p78<=1 & 1<=p78]] & [p149<=0 & 0<=p149]] & [[p107<=0 & 0<=p107] & ~ [E [true U ~ [[p79<=0 & 0<=p79]]]]]] | [p148<=1 & 1<=p148]] | EX [E [true U [p14<=1 & 1<=p14]]]] & [[p78<=1 & 1<=p78] | [p162<=0 & 0<=p162]]]]]]

abstracting: (0<=p162)
states: 121,636,650 (8)
abstracting: (p162<=0)
states: 117,889,284 (8)
abstracting: (1<=p78)
states: 7,202,013 (6)
abstracting: (p78<=1)
states: 121,636,650 (8)
abstracting: (1<=p14)
states: 26,579,646 (7)
abstracting: (p14<=1)
states: 121,636,650 (8)
.abstracting: (1<=p148)
states: 7,693,667 (6)
abstracting: (p148<=1)
states: 121,636,650 (8)
abstracting: (0<=p79)
states: 121,636,650 (8)
abstracting: (p79<=0)
states: 117,081,717 (8)
abstracting: (0<=p107)
states: 121,636,650 (8)
abstracting: (p107<=0)
states: 114,595,908 (8)
abstracting: (0<=p149)
states: 121,636,650 (8)
abstracting: (p149<=0)
states: 117,889,284 (8)
abstracting: (1<=p78)
states: 7,202,013 (6)
abstracting: (p78<=1)
states: 121,636,650 (8)
abstracting: (0<=p5)
states: 121,636,650 (8)
abstracting: (p5<=0)
states: 103,335,642 (8)
abstracting: (1<=p155)
states: 26,606,271 (7)
abstracting: (p155<=1)
states: 121,636,650 (8)
abstracting: (0<=p132)
states: 121,636,650 (8)
abstracting: (p132<=0)
states: 120,300,810 (8)
abstracting: (1<=p117)
states: 5,076,192 (6)
abstracting: (p117<=1)
states: 121,636,650 (8)
abstracting: (0<=p43)
states: 121,636,650 (8)
abstracting: (p43<=0)
states: 118,260,732 (8)
abstracting: (0<=p112)
states: 121,636,650 (8)
abstracting: (p112<=0)
states: 114,585,708 (8)
abstracting: (1<=p143)
states: 968,775 (5)
abstracting: (p143<=1)
states: 121,636,650 (8)
....................................................
EG iterations: 52
-> the formula is TRUE

FORMULA AutonomousCar-PT-03b-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.074sec

checking: A [A [E [AX [~ [[[p14<=0 & 0<=p14] | [p80<=1 & 1<=p80]]]] U ~ [[p171<=0 & 0<=p171]]] U AG [EX [EF [[p107<=1 & 1<=p107]]]]] U EX [[[AG [AX [[p40<=0 & 0<=p40]]] & AF [~ [[[p167<=0 & 0<=p167] | [p40<=1 & 1<=p40]]]]] & [[[[p4<=0 & 0<=p4] | [p86<=1 & 1<=p86]] | [[p78<=1 & 1<=p78] | [[p163<=0 & 0<=p163] | [p116<=1 & 1<=p116]]]] & [~ [[p90<=1 & 1<=p90]] | [[p56<=1 & 1<=p56] & [[p173<=0 & 0<=p173] | [p36<=1 & 1<=p36]]]]]]]]
normalized: [~ [EG [~ [EX [[[[[[[p36<=1 & 1<=p36] | [p173<=0 & 0<=p173]] & [p56<=1 & 1<=p56]] | ~ [[p90<=1 & 1<=p90]]] & [[[[p116<=1 & 1<=p116] | [p163<=0 & 0<=p163]] | [p78<=1 & 1<=p78]] | [[p86<=1 & 1<=p86] | [p4<=0 & 0<=p4]]]] & [~ [EG [[[p40<=1 & 1<=p40] | [p167<=0 & 0<=p167]]]] & ~ [E [true U EX [~ [[p40<=0 & 0<=p40]]]]]]]]]]] & ~ [E [~ [EX [[[[[[[p36<=1 & 1<=p36] | [p173<=0 & 0<=p173]] & [p56<=1 & 1<=p56]] | ~ [[p90<=1 & 1<=p90]]] & [[[[p116<=1 & 1<=p116] | [p163<=0 & 0<=p163]] | [p78<=1 & 1<=p78]] | [[p86<=1 & 1<=p86] | [p4<=0 & 0<=p4]]]] & [~ [EG [[[p40<=1 & 1<=p40] | [p167<=0 & 0<=p167]]]] & ~ [E [true U EX [~ [[p40<=0 & 0<=p40]]]]]]]]] U [~ [[~ [EG [E [true U ~ [EX [E [true U [p107<=1 & 1<=p107]]]]]]] & ~ [E [E [true U ~ [EX [E [true U [p107<=1 & 1<=p107]]]]] U [~ [E [~ [EX [[[p80<=1 & 1<=p80] | [p14<=0 & 0<=p14]]]] U ~ [[p171<=0 & 0<=p171]]]] & E [true U ~ [EX [E [true U [p107<=1 & 1<=p107]]]]]]]]]] & ~ [EX [[[[[[[p36<=1 & 1<=p36] | [p173<=0 & 0<=p173]] & [p56<=1 & 1<=p56]] | ~ [[p90<=1 & 1<=p90]]] & [[[[p116<=1 & 1<=p116] | [p163<=0 & 0<=p163]] | [p78<=1 & 1<=p78]] | [[p86<=1 & 1<=p86] | [p4<=0 & 0<=p4]]]] & [~ [EG [[[p40<=1 & 1<=p40] | [p167<=0 & 0<=p167]]]] & ~ [E [true U EX [~ [[p40<=0 & 0<=p40]]]]]]]]]]]]]

abstracting: (0<=p40)
states: 121,636,650 (8)
abstracting: (p40<=0)
states: 117,384,219 (8)
.abstracting: (0<=p167)
states: 121,636,650 (8)
abstracting: (p167<=0)
states: 111,116,352 (8)
abstracting: (1<=p40)
states: 4,252,431 (6)
abstracting: (p40<=1)
states: 121,636,650 (8)
.........................................................
EG iterations: 57
abstracting: (0<=p4)
states: 121,636,650 (8)
abstracting: (p4<=0)
states: 93,792,324 (7)
abstracting: (1<=p86)
states: 4,393,662 (6)
abstracting: (p86<=1)
states: 121,636,650 (8)
abstracting: (1<=p78)
states: 7,202,013 (6)
abstracting: (p78<=1)
states: 121,636,650 (8)
abstracting: (0<=p163)
states: 121,636,650 (8)
abstracting: (p163<=0)
states: 117,889,284 (8)
abstracting: (1<=p116)
states: 1,335,840 (6)
abstracting: (p116<=1)
states: 121,636,650 (8)
abstracting: (1<=p90)
states: 4,393,662 (6)
abstracting: (p90<=1)
states: 121,636,650 (8)
abstracting: (1<=p56)
states: 9,600 (3)
abstracting: (p56<=1)
states: 121,636,650 (8)
abstracting: (0<=p173)
states: 121,636,650 (8)
abstracting: (p173<=0)
states: 117,889,284 (8)
abstracting: (1<=p36)
states: 4,252,431 (6)
abstracting: (p36<=1)
states: 121,636,650 (8)
.abstracting: (1<=p107)
states: 7,040,742 (6)
abstracting: (p107<=1)
states: 121,636,650 (8)
.abstracting: (0<=p171)
states: 121,636,650 (8)
abstracting: (p171<=0)
states: 117,889,284 (8)
abstracting: (0<=p14)
states: 121,636,650 (8)
abstracting: (p14<=0)
states: 95,057,004 (7)
abstracting: (1<=p80)
states: 4,554,933 (6)
abstracting: (p80<=1)
states: 121,636,650 (8)
.abstracting: (1<=p107)
states: 7,040,742 (6)
abstracting: (p107<=1)
states: 121,636,650 (8)
.abstracting: (1<=p107)
states: 7,040,742 (6)
abstracting: (p107<=1)
states: 121,636,650 (8)
.
EG iterations: 0
abstracting: (0<=p40)
states: 121,636,650 (8)
abstracting: (p40<=0)
states: 117,384,219 (8)
.abstracting: (0<=p167)
states: 121,636,650 (8)
abstracting: (p167<=0)
states: 111,116,352 (8)
abstracting: (1<=p40)
states: 4,252,431 (6)
abstracting: (p40<=1)
states: 121,636,650 (8)
.........................................................
EG iterations: 57
abstracting: (0<=p4)
states: 121,636,650 (8)
abstracting: (p4<=0)
states: 93,792,324 (7)
abstracting: (1<=p86)
states: 4,393,662 (6)
abstracting: (p86<=1)
states: 121,636,650 (8)
abstracting: (1<=p78)
states: 7,202,013 (6)
abstracting: (p78<=1)
states: 121,636,650 (8)
abstracting: (0<=p163)
states: 121,636,650 (8)
abstracting: (p163<=0)
states: 117,889,284 (8)
abstracting: (1<=p116)
states: 1,335,840 (6)
abstracting: (p116<=1)
states: 121,636,650 (8)
abstracting: (1<=p90)
states: 4,393,662 (6)
abstracting: (p90<=1)
states: 121,636,650 (8)
abstracting: (1<=p56)
states: 9,600 (3)
abstracting: (p56<=1)
states: 121,636,650 (8)
abstracting: (0<=p173)
states: 121,636,650 (8)
abstracting: (p173<=0)
states: 117,889,284 (8)
abstracting: (1<=p36)
states: 4,252,431 (6)
abstracting: (p36<=1)
states: 121,636,650 (8)
.abstracting: (0<=p40)
states: 121,636,650 (8)
abstracting: (p40<=0)
states: 117,384,219 (8)
.abstracting: (0<=p167)
states: 121,636,650 (8)
abstracting: (p167<=0)
states: 111,116,352 (8)
abstracting: (1<=p40)
states: 4,252,431 (6)
abstracting: (p40<=1)
states: 121,636,650 (8)
.........................................................
EG iterations: 57
abstracting: (0<=p4)
states: 121,636,650 (8)
abstracting: (p4<=0)
states: 93,792,324 (7)
abstracting: (1<=p86)
states: 4,393,662 (6)
abstracting: (p86<=1)
states: 121,636,650 (8)
abstracting: (1<=p78)
states: 7,202,013 (6)
abstracting: (p78<=1)
states: 121,636,650 (8)
abstracting: (0<=p163)
states: 121,636,650 (8)
abstracting: (p163<=0)
states: 117,889,284 (8)
abstracting: (1<=p116)
states: 1,335,840 (6)
abstracting: (p116<=1)
states: 121,636,650 (8)
abstracting: (1<=p90)
states: 4,393,662 (6)
abstracting: (p90<=1)
states: 121,636,650 (8)
abstracting: (1<=p56)
states: 9,600 (3)
abstracting: (p56<=1)
states: 121,636,650 (8)
abstracting: (0<=p173)
states: 121,636,650 (8)
abstracting: (p173<=0)
states: 117,889,284 (8)
abstracting: (1<=p36)
states: 4,252,431 (6)
abstracting: (p36<=1)
states: 121,636,650 (8)
..............................................
EG iterations: 45
-> the formula is FALSE

FORMULA AutonomousCar-PT-03b-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.541sec

checking: [EG [[AX [AX [[[p110<=0 & 0<=p110] | [p154<=1 & 1<=p154]]]] | EG [[[p164<=1 & 1<=p164] & [[[p78<=0 & 0<=p78] & [p82<=1 & 1<=p82]] | [p170<=1 & 1<=p170]]]]]] | [[AG [[~ [[p169<=1 & 1<=p169]] & ~ [[p160<=1 & 1<=p160]]]] & AF [[[p173<=0 & 0<=p173] & [E [[p158<=1 & 1<=p158] U [p39<=1 & 1<=p39]] | AG [[p54<=0 & 0<=p54]]]]]] & [EF [[[p124<=0 & 0<=p124] & [p132<=1 & 1<=p132]]] & EF [[AG [~ [[p61<=1 & 1<=p61]]] & [[~ [[p107<=0 & 0<=p107]] & ~ [[p10<=1 & 1<=p10]]] | ~ [[p140<=1 & 1<=p140]]]]]]]]
normalized: [[[E [true U [[~ [[p140<=1 & 1<=p140]] | [~ [[p10<=1 & 1<=p10]] & ~ [[p107<=0 & 0<=p107]]]] & ~ [E [true U [p61<=1 & 1<=p61]]]]] & E [true U [[p132<=1 & 1<=p132] & [p124<=0 & 0<=p124]]]] & [~ [EG [~ [[[~ [E [true U ~ [[p54<=0 & 0<=p54]]]] | E [[p158<=1 & 1<=p158] U [p39<=1 & 1<=p39]]] & [p173<=0 & 0<=p173]]]]] & ~ [E [true U ~ [[~ [[p160<=1 & 1<=p160]] & ~ [[p169<=1 & 1<=p169]]]]]]]] | EG [[EG [[[[p170<=1 & 1<=p170] | [[p82<=1 & 1<=p82] & [p78<=0 & 0<=p78]]] & [p164<=1 & 1<=p164]]] | ~ [EX [EX [~ [[[p154<=1 & 1<=p154] | [p110<=0 & 0<=p110]]]]]]]]]

abstracting: (0<=p110)
states: 121,636,650 (8)
abstracting: (p110<=0)
states: 117,242,988 (8)
abstracting: (1<=p154)
states: 3,747,366 (6)
abstracting: (p154<=1)
states: 121,636,650 (8)
..abstracting: (1<=p164)
states: 3,747,366 (6)
abstracting: (p164<=1)
states: 121,636,650 (8)
abstracting: (0<=p78)
states: 121,636,650 (8)
abstracting: (p78<=0)
states: 114,434,637 (8)
abstracting: (1<=p82)
states: 4,554,933 (6)
abstracting: (p82<=1)
states: 121,636,650 (8)
abstracting: (1<=p170)
states: 3,747,366 (6)
abstracting: (p170<=1)
states: 121,636,650 (8)
..........................................
EG iterations: 42
...........................................
EG iterations: 43
abstracting: (1<=p169)
states: 3,747,366 (6)
abstracting: (p169<=1)
states: 121,636,650 (8)
abstracting: (1<=p160)
states: 3,747,366 (6)
abstracting: (p160<=1)
states: 121,636,650 (8)
abstracting: (0<=p173)
states: 121,636,650 (8)
abstracting: (p173<=0)
states: 117,889,284 (8)
abstracting: (1<=p39)
states: 4,252,431 (6)
abstracting: (p39<=1)
states: 121,636,650 (8)
abstracting: (1<=p158)
states: 7,693,667 (6)
abstracting: (p158<=1)
states: 121,636,650 (8)
abstracting: (0<=p54)
states: 121,636,650 (8)
abstracting: (p54<=0)
states: 117,384,219 (8)
................
before gc: list nodes free: 1518827

after gc: idd nodes used:557584, unused:63442416; list nodes free:293196342
....................................................................................................
EG iterations: 116
abstracting: (0<=p124)
states: 121,636,650 (8)
abstracting: (p124<=0)
states: 120,300,810 (8)
abstracting: (1<=p132)
states: 1,335,840 (6)
abstracting: (p132<=1)
states: 121,636,650 (8)
abstracting: (1<=p61)
states: 3,530,142 (6)
abstracting: (p61<=1)
states: 121,636,650 (8)
abstracting: (0<=p107)
states: 121,636,650 (8)
abstracting: (p107<=0)
states: 114,595,908 (8)
abstracting: (1<=p10)
states: 9,150,504 (6)
abstracting: (p10<=1)
states: 121,636,650 (8)
abstracting: (1<=p140)
states: 8,312,958 (6)
abstracting: (p140<=1)
states: 121,636,650 (8)
-> the formula is FALSE

FORMULA AutonomousCar-PT-03b-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 6.754sec

totally nodes used: 209652368 (2.1e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 331653893 805145561 1136799454
used/not used/entry size/cache size: 50149959 16958905 16 1024MB
basic ops cache: hits/miss/sum: 15147769 31931639 47079408
used/not used/entry size/cache size: 6023230 10753986 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: 144013 409078 553091
used/not used/entry size/cache size: 26295 8362313 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 51978968
1 12255092
2 2368868
3 429552
4 66590
5 8700
6 984
7 105
8 5
9 0
>= 10 0

Total processing time: 5m50.790sec


BK_STOP 1678699323345

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

19815
iterations count:139318 (527), effective:5621 (21)

initing FirstDep: 0m 0.000sec


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

iterations count:8667 (32), effective:277 (1)

iterations count:26046 (98), effective:1000 (3)

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

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

iterations count:17664 (66), effective:621 (2)

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

iterations count:12994 (49), effective:458 (1)

iterations count:20370 (77), effective:812 (3)

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

iterations count:24952 (94), effective:1127 (4)

iterations count:12901 (48), effective:443 (1)

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

iterations count:10835 (41), effective:330 (1)

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

iterations count:22366 (84), effective:990 (3)

iterations count:12878 (48), effective:458 (1)

iterations count:12903 (48), effective:444 (1)

iterations count:12497 (47), effective:460 (1)

iterations count:13051 (49), effective:506 (1)

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

iterations count:12497 (47), effective:460 (1)

iterations count:13051 (49), effective:506 (1)

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

iterations count:12497 (47), effective:460 (1)

iterations count:13051 (49), effective:506 (1)

iterations count:12903 (48), effective:444 (1)

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

iterations count:12903 (48), effective:444 (1)

iterations count:26146 (99), effective:1020 (3)

iterations count:10426 (39), effective:300 (1)

iterations count:12915 (48), effective:453 (1)

iterations count:26550 (100), effective:1133 (4)

iterations count:25873 (98), effective:964 (3)

iterations count:12903 (48), effective:459 (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="AutonomousCar-PT-03b"
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 AutonomousCar-PT-03b, 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 r010-oct2-167813599200569"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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