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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:50 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 110K 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-04b-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678699338852

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-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:22:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:22:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:22:23] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-13 09:22:23] [INFO ] Transformed 221 places.
[2023-03-13 09:22:23] [INFO ] Transformed 368 transitions.
[2023-03-13 09:22:23] [INFO ] Found NUPN structural information;
[2023-03-13 09:22:23] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 328 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 9 ms.
Support contains 60 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 202 transition count 349
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 202 transition count 349
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 102 place count 202 transition count 285
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 200 transition count 283
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 200 transition count 283
Applied a total of 106 rules in 65 ms. Remains 200 /221 variables (removed 21) and now considering 283/368 (removed 85) transitions.
// Phase 1: matrix 283 rows 200 cols
[2023-03-13 09:22:23] [INFO ] Computed 9 place invariants in 14 ms
[2023-03-13 09:22:24] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-13 09:22:24] [INFO ] Invariant cache hit.
[2023-03-13 09:22:25] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1422 ms to find 0 implicit places.
[2023-03-13 09:22:25] [INFO ] Invariant cache hit.
[2023-03-13 09:22:25] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 200/221 places, 283/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2160 ms. Remains : 200/221 places, 283/368 transitions.
Support contains 60 out of 200 places after structural reductions.
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 76 ms
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 22 ms
[2023-03-13 09:22:26] [INFO ] Input system was already deterministic with 283 transitions.
Support contains 59 out of 200 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 45) seen :24
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-13 09:22:26] [INFO ] Invariant cache hit.
[2023-03-13 09:22:27] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-13 09:22:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 09:22:27] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-13 09:22:28] [INFO ] Deduced a trap composed of 18 places in 647 ms of which 11 ms to minimize.
[2023-03-13 09:22:28] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 1 ms to minimize.
[2023-03-13 09:22:29] [INFO ] Deduced a trap composed of 9 places in 630 ms of which 10 ms to minimize.
[2023-03-13 09:22:29] [INFO ] Deduced a trap composed of 6 places in 372 ms of which 4 ms to minimize.
[2023-03-13 09:22:29] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 2 ms to minimize.
[2023-03-13 09:22:30] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 1 ms to minimize.
[2023-03-13 09:22:30] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2023-03-13 09:22:30] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 0 ms to minimize.
[2023-03-13 09:22:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2836 ms
[2023-03-13 09:22:30] [INFO ] Deduced a trap composed of 44 places in 263 ms of which 1 ms to minimize.
[2023-03-13 09:22:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2023-03-13 09:22:31] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 1 ms to minimize.
[2023-03-13 09:22:31] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2023-03-13 09:22:31] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 1 ms to minimize.
[2023-03-13 09:22:31] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2023-03-13 09:22:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 646 ms
[2023-03-13 09:22:31] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 0 ms to minimize.
[2023-03-13 09:22:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-03-13 09:22:31] [INFO ] After 4587ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-13 09:22:32] [INFO ] After 5121ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :10
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 19 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 283/283 transitions.
Graph (trivial) has 162 edges and 200 vertex of which 2 / 200 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 543 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 198 transition count 217
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 82 rules applied. Total rules applied 148 place count 134 transition count 199
Reduce places removed 10 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 17 rules applied. Total rules applied 165 place count 124 transition count 192
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 172 place count 117 transition count 192
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 172 place count 117 transition count 184
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 188 place count 109 transition count 184
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 195 place count 102 transition count 177
Iterating global reduction 4 with 7 rules applied. Total rules applied 202 place count 102 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 202 place count 102 transition count 176
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 204 place count 101 transition count 176
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 205 place count 100 transition count 172
Iterating global reduction 4 with 1 rules applied. Total rules applied 206 place count 100 transition count 172
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 266 place count 70 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 267 place count 70 transition count 141
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 271 place count 66 transition count 122
Iterating global reduction 5 with 4 rules applied. Total rules applied 275 place count 66 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 276 place count 66 transition count 121
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 278 place count 65 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 280 place count 64 transition count 133
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 283 place count 64 transition count 130
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 288 place count 64 transition count 125
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 293 place count 59 transition count 125
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 294 place count 59 transition count 124
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 295 place count 59 transition count 124
Applied a total of 295 rules in 100 ms. Remains 59 /200 variables (removed 141) and now considering 124/283 (removed 159) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 59/200 places, 124/283 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10000 steps, including 138 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :2
Running SMT prover for 3 properties.
// Phase 1: matrix 124 rows 59 cols
[2023-03-13 09:22:33] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-13 09:22:33] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 09:22:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 53 ms returned sat
[2023-03-13 09:22:33] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 09:22:33] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-13 09:22:33] [INFO ] After 36ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 09:22:33] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-13 09:22:33] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 10 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 124/124 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 59 transition count 118
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 53 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 52 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 52 transition count 116
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 51 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 50 transition count 115
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 50 transition count 115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 26 place count 46 transition count 111
Applied a total of 26 rules in 19 ms. Remains 46 /59 variables (removed 13) and now considering 111/124 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 46/59 places, 111/124 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Probably explored full state space saw : 76476 states, properties seen :2
Probabilistic random walk after 413338 steps, saw 76476 distinct states, run finished after 686 ms. (steps per millisecond=602 ) properties seen :2
Explored full state space saw : 76476 states, properties seen :0
Exhaustive walk after 413338 steps, saw 76476 distinct states, run finished after 355 ms. (steps per millisecond=1164 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-04b-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:22:34] [INFO ] Flatten gal took : 42 ms
[2023-03-13 09:22:34] [INFO ] Flatten gal took : 28 ms
[2023-03-13 09:22:34] [INFO ] Input system was already deterministic with 283 transitions.
Computed a total of 41 stabilizing places and 42 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 186 transition count 269
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 186 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 183 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 183 transition count 266
Applied a total of 34 rules in 14 ms. Remains 183 /200 variables (removed 17) and now considering 266/283 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 183/200 places, 266/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Graph (trivial) has 188 edges and 200 vertex of which 4 / 200 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 197 transition count 201
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 106 rules applied. Total rules applied 186 place count 118 transition count 174
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 203 place count 102 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 204 place count 101 transition count 173
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 204 place count 101 transition count 165
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 220 place count 93 transition count 165
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 231 place count 82 transition count 154
Iterating global reduction 4 with 11 rules applied. Total rules applied 242 place count 82 transition count 154
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 82 transition count 153
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 244 place count 81 transition count 153
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 247 place count 78 transition count 144
Iterating global reduction 4 with 3 rules applied. Total rules applied 250 place count 78 transition count 144
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 254 place count 78 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 256 place count 76 transition count 140
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 306 place count 51 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 307 place count 51 transition count 114
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 313 place count 45 transition count 86
Iterating global reduction 7 with 6 rules applied. Total rules applied 319 place count 45 transition count 86
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 7 with 4 rules applied. Total rules applied 323 place count 45 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 325 place count 43 transition count 82
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 327 place count 42 transition count 81
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 328 place count 42 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 330 place count 40 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 331 place count 39 transition count 78
Applied a total of 331 rules in 67 ms. Remains 39 /200 variables (removed 161) and now considering 78/283 (removed 205) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 39/200 places, 78/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 184 transition count 267
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 184 transition count 267
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 181 transition count 264
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 181 transition count 264
Applied a total of 38 rules in 20 ms. Remains 181 /200 variables (removed 19) and now considering 264/283 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 181/200 places, 264/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 27 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 264 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 185 transition count 268
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 185 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 181 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 180 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 180 transition count 263
Applied a total of 40 rules in 10 ms. Remains 180 /200 variables (removed 20) and now considering 263/283 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 180/200 places, 263/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 185 transition count 268
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 185 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 181 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 180 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 180 transition count 263
Applied a total of 40 rules in 9 ms. Remains 180 /200 variables (removed 20) and now considering 263/283 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 180/200 places, 263/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Graph (trivial) has 187 edges and 200 vertex of which 4 / 200 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 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 197 transition count 200
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 107 rules applied. Total rules applied 188 place count 117 transition count 173
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 205 place count 101 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 206 place count 100 transition count 172
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 206 place count 100 transition count 165
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 220 place count 93 transition count 165
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 230 place count 83 transition count 155
Iterating global reduction 4 with 10 rules applied. Total rules applied 240 place count 83 transition count 155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 240 place count 83 transition count 154
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 242 place count 82 transition count 154
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 245 place count 79 transition count 145
Iterating global reduction 4 with 3 rules applied. Total rules applied 248 place count 79 transition count 145
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 252 place count 79 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 254 place count 77 transition count 141
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 306 place count 51 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 307 place count 51 transition count 114
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 312 place count 46 transition count 90
Iterating global reduction 7 with 5 rules applied. Total rules applied 317 place count 46 transition count 90
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 319 place count 46 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 320 place count 45 transition count 88
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 322 place count 44 transition count 87
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 323 place count 44 transition count 86
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 324 place count 44 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 326 place count 42 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 327 place count 41 transition count 84
Applied a total of 327 rules in 26 ms. Remains 41 /200 variables (removed 159) and now considering 84/283 (removed 199) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 41/200 places, 84/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 185 transition count 268
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 185 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 181 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 180 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 180 transition count 263
Applied a total of 40 rules in 9 ms. Remains 180 /200 variables (removed 20) and now considering 263/283 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 180/200 places, 263/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 184 transition count 267
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 184 transition count 267
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 180 transition count 263
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 179 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 179 transition count 262
Applied a total of 42 rules in 21 ms. Remains 179 /200 variables (removed 21) and now considering 262/283 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 179/200 places, 262/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 29 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 185 transition count 268
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 185 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 181 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 180 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 180 transition count 263
Applied a total of 40 rules in 9 ms. Remains 180 /200 variables (removed 20) and now considering 263/283 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 180/200 places, 263/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 191 transition count 274
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 191 transition count 274
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 187 transition count 270
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 187 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 186 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 186 transition count 269
Applied a total of 28 rules in 7 ms. Remains 186 /200 variables (removed 14) and now considering 269/283 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 186/200 places, 269/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 184 transition count 267
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 184 transition count 267
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 181 transition count 264
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 180 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 180 transition count 263
Applied a total of 40 rules in 9 ms. Remains 180 /200 variables (removed 20) and now considering 263/283 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 180/200 places, 263/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 27 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 184 transition count 267
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 184 transition count 267
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 181 transition count 264
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 180 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 180 transition count 263
Applied a total of 40 rules in 9 ms. Remains 180 /200 variables (removed 20) and now considering 263/283 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 180/200 places, 263/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Graph (trivial) has 183 edges and 200 vertex of which 4 / 200 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 197 transition count 203
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 104 rules applied. Total rules applied 182 place count 120 transition count 176
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 18 rules applied. Total rules applied 200 place count 104 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 202 place count 102 transition count 174
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 202 place count 102 transition count 168
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 214 place count 96 transition count 168
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 225 place count 85 transition count 157
Iterating global reduction 4 with 11 rules applied. Total rules applied 236 place count 85 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 236 place count 85 transition count 156
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 238 place count 84 transition count 156
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 241 place count 81 transition count 147
Iterating global reduction 4 with 3 rules applied. Total rules applied 244 place count 81 transition count 147
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 248 place count 81 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 250 place count 79 transition count 143
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 300 place count 54 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 301 place count 54 transition count 117
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 305 place count 50 transition count 99
Iterating global reduction 7 with 4 rules applied. Total rules applied 309 place count 50 transition count 99
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 7 with 4 rules applied. Total rules applied 313 place count 50 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 315 place count 48 transition count 95
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 317 place count 47 transition count 94
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 318 place count 47 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 320 place count 45 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 321 place count 44 transition count 91
Applied a total of 321 rules in 21 ms. Remains 44 /200 variables (removed 156) and now considering 91/283 (removed 192) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 44/200 places, 91/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 184 transition count 267
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 184 transition count 267
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 180 transition count 263
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 179 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 179 transition count 262
Applied a total of 42 rules in 8 ms. Remains 179 /200 variables (removed 21) and now considering 262/283 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 179/200 places, 262/283 transitions.
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:35] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:22:35] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 283/283 transitions.
Graph (trivial) has 183 edges and 200 vertex of which 4 / 200 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 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 197 transition count 206
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 98 rules applied. Total rules applied 173 place count 123 transition count 182
Reduce places removed 14 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 17 rules applied. Total rules applied 190 place count 109 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 193 place count 106 transition count 179
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 193 place count 106 transition count 170
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 211 place count 97 transition count 170
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 221 place count 87 transition count 160
Iterating global reduction 4 with 10 rules applied. Total rules applied 231 place count 87 transition count 160
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 231 place count 87 transition count 159
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 233 place count 86 transition count 159
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 236 place count 83 transition count 150
Iterating global reduction 4 with 3 rules applied. Total rules applied 239 place count 83 transition count 150
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 4 with 2 rules applied. Total rules applied 241 place count 83 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 82 transition count 148
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 292 place count 57 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 293 place count 57 transition count 122
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 299 place count 51 transition count 94
Iterating global reduction 7 with 6 rules applied. Total rules applied 305 place count 51 transition count 94
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 7 with 4 rules applied. Total rules applied 309 place count 51 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 311 place count 49 transition count 90
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 313 place count 48 transition count 89
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 315 place count 48 transition count 87
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 316 place count 48 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 317 place count 47 transition count 86
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 318 place count 47 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 319 place count 46 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 320 place count 45 transition count 85
Applied a total of 320 rules in 26 ms. Remains 45 /200 variables (removed 155) and now considering 85/283 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 45/200 places, 85/283 transitions.
[2023-03-13 09:22:36] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:22:36] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:22:36] [INFO ] Input system was already deterministic with 85 transitions.
[2023-03-13 09:22:36] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:36] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:36] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 09:22:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 283 transitions and 1104 arcs took 1 ms.
Total runtime 12930 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: 200 NrTr: 283 NrArc: 1104)

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

net check time: 0m 0.012sec

init dd package: 0m 2.978sec


RS generation: 0m 5.040sec


-> reachability set: #nodes 40292 (4.0e+04) #states 2,278,894,128 (9)



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

checking: AG [EF [[p19<=1 & 1<=p19]]]
normalized: ~ [E [true U ~ [E [true U [p19<=1 & 1<=p19]]]]]

abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 2,278,894,128 (9)
-> the formula is FALSE

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

MC time: 0m 1.731sec

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

abstracting: (0<=p137)
states: 2,278,894,128 (9)
abstracting: (p137<=0)
states: 2,189,245,852 (9)
...
EG iterations: 2
-> the formula is FALSE

FORMULA AutonomousCar-PT-04b-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.862sec

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

abstracting: (0<=p4)
states: 2,278,894,128 (9)
abstracting: (p4<=0)
states: 1,900,762,352 (9)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.-> the formula is FALSE

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

MC time: 0m 5.569sec

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

abstracting: (0<=p140)
states: 2,278,894,128 (9)
abstracting: (p140<=0)
states: 2,278,852,728 (9)
.................................
EG iterations: 33
.
EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 3.700sec

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

abstracting: (1<=p79)
states: 125,997,076 (8)
abstracting: (p79<=1)
states: 2,278,894,128 (9)
...........................................................
EG iterations: 59
.-> the formula is FALSE

FORMULA AutonomousCar-PT-04b-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.703sec

checking: EG [[[p184<=0 & 0<=p184] | [p30<=1 & 1<=p30]]]
normalized: EG [[[p30<=1 & 1<=p30] | [p184<=0 & 0<=p184]]]

abstracting: (0<=p184)
states: 2,278,894,128 (9)
abstracting: (p184<=0)
states: 2,207,769,456 (9)
abstracting: (1<=p30)
states: 52,387,720 (7)
abstracting: (p30<=1)
states: 2,278,894,128 (9)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 2.144sec

checking: EX [AF [[[p84<=0 & 0<=p84] & [p18<=1 & 1<=p18]]]]
normalized: EX [~ [EG [~ [[[p18<=1 & 1<=p18] & [p84<=0 & 0<=p84]]]]]]

abstracting: (0<=p84)
states: 2,278,894,128 (9)
abstracting: (p84<=0)
states: 2,194,540,514 (9)
abstracting: (1<=p18)
states: 600
abstracting: (p18<=1)
states: 2,278,894,128 (9)
..............................
EG iterations: 30
.-> the formula is TRUE

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

MC time: 0m 1.934sec

checking: EF [~ [E [[p81<=1 & 1<=p81] U AF [AX [[p174<=1 & 1<=p174]]]]]]
normalized: E [true U ~ [E [[p81<=1 & 1<=p81] U ~ [EG [EX [~ [[p174<=1 & 1<=p174]]]]]]]]

abstracting: (1<=p174)
states: 500,412,231 (8)
abstracting: (p174<=1)
states: 2,278,894,128 (9)
.........................
before gc: list nodes free: 967683

after gc: idd nodes used:535742, unused:63464258; list nodes free:289137001
..............................................................................................................
before gc: list nodes free: 1021319

after gc: idd nodes used:281543, unused:63718457; list nodes free:294460098
..............................
EG iterations: 164
abstracting: (1<=p81)
states: 38,400 (4)
abstracting: (p81<=1)
states: 2,278,894,128 (9)
-> the formula is TRUE

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

MC time: 3m33.348sec

checking: ~ [E [EF [[[p60<=0 & 0<=p60] | [p61<=1 & 1<=p61]]] U ~ [EX [[p44<=0 & 0<=p44]]]]]
normalized: ~ [E [E [true U [[p61<=1 & 1<=p61] | [p60<=0 & 0<=p60]]] U ~ [EX [[p44<=0 & 0<=p44]]]]]

abstracting: (0<=p44)
states: 2,278,894,128 (9)
abstracting: (p44<=0)
states: 2,230,581,248 (9)
.abstracting: (0<=p60)
states: 2,278,894,128 (9)
abstracting: (p60<=0)
states: 2,186,855,772 (9)
abstracting: (1<=p61)
states: 92,038,356 (7)
abstracting: (p61<=1)
states: 2,278,894,128 (9)
-> the formula is FALSE

FORMULA AutonomousCar-PT-04b-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.070sec

checking: AX [EG [EF [[[[p137<=1 & 1<=p137] | [p84<=0 & 0<=p84]] | [[p180<=0 & 0<=p180] | [p2<=1 & 1<=p2]]]]]]
normalized: ~ [EX [~ [EG [E [true U [[[p2<=1 & 1<=p2] | [p180<=0 & 0<=p180]] | [[p84<=0 & 0<=p84] | [p137<=1 & 1<=p137]]]]]]]]

abstracting: (1<=p137)
states: 89,648,276 (7)
abstracting: (p137<=1)
states: 2,278,894,128 (9)
abstracting: (0<=p84)
states: 2,278,894,128 (9)
abstracting: (p84<=0)
states: 2,194,540,514 (9)
abstracting: (0<=p180)
states: 2,278,894,128 (9)
abstracting: (p180<=0)
states: 2,207,769,456 (9)
abstracting: (1<=p2)
states: 6,146,251 (6)
abstracting: (p2<=1)
states: 2,278,894,128 (9)

EG iterations: 0
.-> the formula is TRUE

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

MC time: 0m 0.916sec

checking: E [[[p33<=0 & 0<=p33] | [[p39<=1 & 1<=p39] | [p155<=0 & 0<=p155]]] U EX [EF [~ [[p159<=0 & 0<=p159]]]]]
normalized: E [[[[p155<=0 & 0<=p155] | [p39<=1 & 1<=p39]] | [p33<=0 & 0<=p33]] U EX [E [true U ~ [[p159<=0 & 0<=p159]]]]]

abstracting: (0<=p159)
states: 2,278,894,128 (9)
abstracting: (p159<=0)
states: 2,089,556,328 (9)
.abstracting: (0<=p33)
states: 2,278,894,128 (9)
abstracting: (p33<=0)
states: 2,189,051,812 (9)
abstracting: (1<=p39)
states: 89,842,316 (7)
abstracting: (p39<=1)
states: 2,278,894,128 (9)
abstracting: (0<=p155)
states: 2,278,894,128 (9)
abstracting: (p155<=0)
states: 2,245,587,184 (9)
-> the formula is TRUE

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

MC time: 0m 6.196sec

checking: EG [AF [[AF [~ [E [[p10<=1 & 1<=p10] U [p189<=1 & 1<=p189]]]] & EG [[[p106<=0 & 0<=p106] | [p75<=1 & 1<=p75]]]]]]
normalized: EG [~ [EG [~ [[EG [[[p75<=1 & 1<=p75] | [p106<=0 & 0<=p106]]] & ~ [EG [E [[p10<=1 & 1<=p10] U [p189<=1 & 1<=p189]]]]]]]]]

abstracting: (1<=p189)
states: 71,124,672 (7)
abstracting: (p189<=1)
states: 2,278,894,128 (9)
abstracting: (1<=p10)
states: 189,065,888 (8)
abstracting: (p10<=1)
states: 2,278,894,128 (9)
..............................................................................................................................................................................................
EG iterations: 190
abstracting: (0<=p106)
states: 2,278,894,128 (9)
abstracting: (p106<=0)
states: 2,194,540,514 (9)
abstracting: (1<=p75)
states: 92,038,356 (7)
abstracting: (p75<=1)
states: 2,278,894,128 (9)
........
before gc: list nodes free: 2658336

after gc: idd nodes used:405130, unused:63594870; list nodes free:293869851
.........................................................
EG iterations: 65
..................................................................
EG iterations: 66
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 3m41.673sec

checking: EF [AG [~ [E [E [[p92<=1 & 1<=p92] U [p165<=0 & 0<=p165]] U AF [[[p163<=0 & 0<=p163] | [p80<=1 & 1<=p80]]]]]]]
normalized: E [true U ~ [E [true U E [E [[p92<=1 & 1<=p92] U [p165<=0 & 0<=p165]] U ~ [EG [~ [[[p163<=0 & 0<=p163] | [p80<=1 & 1<=p80]]]]]]]]]

abstracting: (1<=p80)
states: 38,400 (4)
abstracting: (p80<=1)
states: 2,278,894,128 (9)
abstracting: (0<=p163)
states: 2,278,894,128 (9)
abstracting: (p163<=0)
states: 2,260,829,077 (9)
....................................................
before gc: list nodes free: 4253500

after gc: idd nodes used:356803, unused:63643197; list nodes free:294114788
.......................................................................................................................
EG iterations: 171
abstracting: (0<=p165)
states: 2,278,894,128 (9)
abstracting: (p165<=0)
states: 2,260,829,077 (9)
abstracting: (1<=p92)
states: 84,353,614 (7)
abstracting: (p92<=1)
states: 2,278,894,128 (9)
-> the formula is FALSE

FORMULA AutonomousCar-PT-04b-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 9.674sec

checking: [[AG [[EX [[E [[[p146<=0 & 0<=p146] | [p163<=1 & 1<=p163]] U [p23<=1 & 1<=p23]] | [p24<=1 & 1<=p24]]] & [p99<=0 & 0<=p99]]] & EG [[[[p183<=0 & 0<=p183] | [p187<=1 & 1<=p187]] & EX [0<=0]]]] & EG [[[p172<=0 & 0<=p172] | [p15<=1 & 1<=p15]]]]
normalized: [EG [[[p15<=1 & 1<=p15] | [p172<=0 & 0<=p172]]] & [EG [[EX [0<=0] & [[p187<=1 & 1<=p187] | [p183<=0 & 0<=p183]]]] & ~ [E [true U ~ [[[p99<=0 & 0<=p99] & EX [[[p24<=1 & 1<=p24] | E [[[p163<=1 & 1<=p163] | [p146<=0 & 0<=p146]] U [p23<=1 & 1<=p23]]]]]]]]]]

abstracting: (1<=p23)
states: 600
abstracting: (p23<=1)
states: 2,278,894,128 (9)
abstracting: (0<=p146)
states: 2,278,894,128 (9)
abstracting: (p146<=0)
states: 2,245,587,184 (9)
abstracting: (1<=p163)
states: 18,065,051 (7)
abstracting: (p163<=1)
states: 2,278,894,128 (9)
abstracting: (1<=p24)
states: 2,400 (3)
abstracting: (p24<=1)
states: 2,278,894,128 (9)
.abstracting: (0<=p99)
states: 2,278,894,128 (9)
abstracting: (p99<=0)
states: 2,194,540,514 (9)
abstracting: (0<=p183)
states: 2,278,894,128 (9)
abstracting: (p183<=0)
states: 2,207,769,456 (9)
abstracting: (1<=p187)
states: 71,124,672 (7)
abstracting: (p187<=1)
states: 2,278,894,128 (9)
abstracting: (0<=0)
states: 2,278,894,128 (9)
................................
before gc: list nodes free: 3936423

after gc: idd nodes used:826408, unused:63173592; list nodes free:292035831
......................................................................................................................
before gc: list nodes free: 811555

after gc: idd nodes used:443234, unused:63556766; list nodes free:293732025
.................
EG iterations: 166
abstracting: (0<=p172)
states: 2,278,894,128 (9)
abstracting: (p172<=0)
states: 2,184,061,232 (9)
abstracting: (1<=p15)
states: 5
abstracting: (p15<=1)
states: 2,278,894,128 (9)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 4m53.795sec

checking: [EF [[[AX [A [[[p67<=0 & 0<=p67] | [p170<=1 & 1<=p170]] U [p28<=1 & 1<=p28]]] | EG [[[p125<=1 & 1<=p125] | [p83<=1 & 1<=p83]]]] & [EG [[[p82<=0 & 0<=p82] & [[p39<=0 & 0<=p39] & [p74<=1 & 1<=p74]]]] | [[p165<=0 & 0<=p165] | [p194<=1 & 1<=p194]]]]] & [EF [EX [EG [A [[[p110<=0 & 0<=p110] | [p1<=1 & 1<=p1]] U [[p70<=0 & 0<=p70] | [p102<=1 & 1<=p102]]]]]] | AX [[[p14<=0 & 0<=p14] & [AX [[p97<=1 & 1<=p97]] | [[p8<=1 & 1<=p8] | [p130<=0 & 0<=p130]]]]]]]
normalized: [[~ [EX [~ [[[[[p130<=0 & 0<=p130] | [p8<=1 & 1<=p8]] | ~ [EX [~ [[p97<=1 & 1<=p97]]]]] & [p14<=0 & 0<=p14]]]]] | E [true U EX [EG [[~ [EG [~ [[[p102<=1 & 1<=p102] | [p70<=0 & 0<=p70]]]]] & ~ [E [~ [[[p102<=1 & 1<=p102] | [p70<=0 & 0<=p70]]] U [~ [[[p1<=1 & 1<=p1] | [p110<=0 & 0<=p110]]] & ~ [[[p102<=1 & 1<=p102] | [p70<=0 & 0<=p70]]]]]]]]]]] & E [true U [[[[p194<=1 & 1<=p194] | [p165<=0 & 0<=p165]] | EG [[[[p74<=1 & 1<=p74] & [p39<=0 & 0<=p39]] & [p82<=0 & 0<=p82]]]] & [EG [[[p83<=1 & 1<=p83] | [p125<=1 & 1<=p125]]] | ~ [EX [~ [[~ [EG [~ [[p28<=1 & 1<=p28]]]] & ~ [E [~ [[p28<=1 & 1<=p28]] U [~ [[[p170<=1 & 1<=p170] | [p67<=0 & 0<=p67]]] & ~ [[p28<=1 & 1<=p28]]]]]]]]]]]]]

abstracting: (1<=p28)
states: 89,842,316 (7)
abstracting: (p28<=1)
states: 2,278,894,128 (9)
abstracting: (0<=p67)
states: 2,278,894,128 (9)
abstracting: (p67<=0)
states: 2,186,855,772 (9)
abstracting: (1<=p170)
states: 384,616,960 (8)
abstracting: (p170<=1)
states: 2,278,894,128 (9)
abstracting: (1<=p28)
states: 89,842,316 (7)
abstracting: (p28<=1)
states: 2,278,894,128 (9)
abstracting: (1<=p28)
states: 89,842,316 (7)
abstracting: (p28<=1)
states: 2,278,894,128 (9)
.
EG iterations: 1
.abstracting: (1<=p125)
states: 89,648,276 (7)
abstracting: (p125<=1)
states: 2,278,894,128 (9)
abstracting: (1<=p83)
states: 84,353,614 (7)
abstracting: (p83<=1)
states: 2,278,894,128 (9)
.................................................................
EG iterations: 65
abstracting: (0<=p82)
states: 2,278,894,128 (9)
abstracting: (p82<=0)
states: 2,278,853,328 (9)
abstracting: (0<=p39)
states: 2,278,894,128 (9)
abstracting: (p39<=0)
states: 2,189,051,812 (9)
abstracting: (1<=p74)
states: 125,958,676 (8)
abstracting: (p74<=1)
states: 2,278,894,128 (9)
......................................................
EG iterations: 54
abstracting: (0<=p165)
states: 2,278,894,128 (9)
abstracting: (p165<=0)
states: 2,260,829,077 (9)
abstracting: (1<=p194)
states: 222,182,976 (8)
abstracting: (p194<=1)
states: 2,278,894,128 (9)
abstracting: (0<=p70)
states: 2,278,894,128 (9)
abstracting: (p70<=0)
states: 2,186,855,772 (9)
abstracting: (1<=p102)
states: 46,212,320 (7)
abstracting: (p102<=1)
states: 2,278,894,128 (9)
abstracting: (0<=p110)
states: 2,278,894,128 (9)
abstracting: (p110<=0)
states: 2,162,282,214 (9)
abstracting: (1<=p1)
states: 6,146,251 (6)
abstracting: (p1<=1)
states: 2,278,894,128 (9)
abstracting: (0<=p70)
states: 2,278,894,128 (9)
abstracting: (p70<=0)
states: 2,186,855,772 (9)
abstracting: (1<=p102)
states: 46,212,320 (7)
abstracting: (p102<=1)
states: 2,278,894,128 (9)
abstracting: (0<=p70)
states: 2,278,894,128 (9)
abstracting: (p70<=0)
states: 2,186,855,772 (9)
abstracting: (1<=p102)
states: 46,212,320 (7)
abstracting: (p102<=1)
states: 2,278,894,128 (9)
.................................................................
EG iterations: 65

before gc: list nodes free: 6060123

after gc: idd nodes used:553901, unused:63446099; list nodes free:293223965
.
EG iterations: 1
.abstracting: (0<=p14)
states: 2,278,894,128 (9)
abstracting: (p14<=0)
states: 1,923,690,968 (9)
abstracting: (1<=p97)
states: 84,353,614 (7)
abstracting: (p97<=1)
states: 2,278,894,128 (9)
.abstracting: (1<=p8)
states: 189,065,888 (8)
abstracting: (p8<=1)
states: 2,278,894,128 (9)
abstracting: (0<=p130)
states: 2,278,894,128 (9)
abstracting: (p130<=0)
states: 2,226,506,408 (9)
.-> the formula is TRUE

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

MC time: 2m11.236sec

totally nodes used: 448446754 (4.5e+08)
number of garbage collections: 7
fire ops cache: hits/miss/sum: 705261265 1797875601 2503136866
used/not used/entry size/cache size: 14826246 52282618 16 1024MB
basic ops cache: hits/miss/sum: 30625442 67725904 98351346
used/not used/entry size/cache size: 1021645 15755571 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: 251537 728376 979913
used/not used/entry size/cache size: 52822 8335786 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 63678161
1 3073335
2 303948
3 46315
4 6274
5 749
6 76
7 6
8 0
9 0
>= 10 0

Total processing time: 16m45.041sec


BK_STOP 1678700361474

--------------------
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:
++ 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
++ sed s/.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.012sec

34473 42203
iterations count:212600 (751), effective:8210 (29)

initing FirstDep: 0m 0.000sec


iterations count:302 (1), effective:8 (0)

iterations count:304 (1), effective:9 (0)

iterations count:31455 (111), effective:1503 (5)

iterations count:42710 (150), effective:1949 (6)

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

iterations count:19565 (69), effective:707 (2)

iterations count:331 (1), effective:9 (0)

iterations count:41667 (147), effective:1711 (6)

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

iterations count:31455 (111), effective:1503 (5)

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

iterations count:41821 (147), effective:1947 (6)

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

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

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

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

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

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

iterations count:304 (1), effective:8 (0)

iterations count:19573 (69), effective:695 (2)

iterations count:29497 (104), effective:1304 (4)

iterations count:2715 (9), effective:84 (0)

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-04b"
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-04b, 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-167813599300585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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