Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872900434.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutonomousCar-PT-02b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872900434
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.2K Jun 7 15:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 7 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 3 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Jun 7 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 49K Jun 3 16:02 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-02b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1654898167348

Running Version 202205111006
[2022-06-10 21:56:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 21:56:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 21:56:10] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2022-06-10 21:56:10] [INFO ] Transformed 155 places.
[2022-06-10 21:56:10] [INFO ] Transformed 194 transitions.
[2022-06-10 21:56:10] [INFO ] Found NUPN structural information;
[2022-06-10 21:56:10] [INFO ] Parsed PT model containing 155 places and 194 transitions in 311 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 85 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 144 transition count 183
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 144 transition count 183
Applied a total of 22 rules in 50 ms. Remains 144 /155 variables (removed 11) and now considering 183/194 (removed 11) transitions.
// Phase 1: matrix 183 rows 144 cols
[2022-06-10 21:56:10] [INFO ] Computed 7 place invariants in 30 ms
[2022-06-10 21:56:10] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 183 rows 144 cols
[2022-06-10 21:56:10] [INFO ] Computed 7 place invariants in 11 ms
[2022-06-10 21:56:10] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
// Phase 1: matrix 183 rows 144 cols
[2022-06-10 21:56:10] [INFO ] Computed 7 place invariants in 6 ms
[2022-06-10 21:56:11] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/155 places, 183/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/155 places, 183/194 transitions.
Support contains 85 out of 144 places after structural reductions.
[2022-06-10 21:56:11] [INFO ] Flatten gal took : 73 ms
[2022-06-10 21:56:11] [INFO ] Flatten gal took : 29 ms
[2022-06-10 21:56:11] [INFO ] Input system was already deterministic with 183 transitions.
Support contains 79 out of 144 places (down from 85) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 979 ms. (steps per millisecond=10 ) properties (out of 71) seen :52
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :4
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 7) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 183 rows 144 cols
[2022-06-10 21:56:12] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-10 21:56:13] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-06-10 21:56:13] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2022-06-10 21:56:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-06-10 21:56:13] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2022-06-10 21:56:13] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 10 ms to minimize.
[2022-06-10 21:56:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-06-10 21:56:13] [INFO ] After 404ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-06-10 21:56:13] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 144/144 places, 183/183 transitions.
Graph (trivial) has 125 edges and 144 vertex of which 4 / 144 are part of one of the 2 SCC in 15 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 295 edges and 142 vertex of which 136 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 136 transition count 116
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 73 rules applied. Total rules applied 134 place count 79 transition count 100
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 145 place count 70 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 147 place count 68 transition count 98
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 147 place count 68 transition count 91
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 161 place count 61 transition count 91
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 168 place count 54 transition count 84
Iterating global reduction 4 with 7 rules applied. Total rules applied 175 place count 54 transition count 84
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 191 place count 54 transition count 68
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 227 place count 36 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 36 transition count 49
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 231 place count 33 transition count 43
Iterating global reduction 6 with 3 rules applied. Total rules applied 234 place count 33 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 33 transition count 42
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 7 with 2 rules applied. Total rules applied 237 place count 32 transition count 41
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 7 with 2 rules applied. Total rules applied 239 place count 31 transition count 42
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 240 place count 31 transition count 41
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 241 place count 31 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 242 place count 30 transition count 40
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 244 place count 30 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 245 place count 29 transition count 39
Applied a total of 245 rules in 76 ms. Remains 29 /144 variables (removed 115) and now considering 39/183 (removed 144) transitions.
Finished structural reductions, in 1 iterations. Remains : 29/144 places, 39/183 transitions.
Incomplete random walk after 10000 steps, including 524 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 258 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 29 cols
[2022-06-10 21:56:14] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-10 21:56:14] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-06-10 21:56:14] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:56:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-06-10 21:56:14] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 21:56:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-10 21:56:14] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 21:56:14] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-10 21:56:14] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 29/29 places, 39/39 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 28 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 27 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 27 transition count 42
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 26 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 25 transition count 39
Applied a total of 9 rules in 14 ms. Remains 25 /29 variables (removed 4) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/29 places, 39/39 transitions.
Finished random walk after 9423 steps, including 688 resets, run visited all 1 properties in 23 ms. (steps per millisecond=409 )
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2022-06-10 21:56:14] [INFO ] Flatten gal took : 19 ms
[2022-06-10 21:56:14] [INFO ] Flatten gal took : 21 ms
[2022-06-10 21:56:14] [INFO ] Input system was already deterministic with 183 transitions.
Computed a total of 35 stabilizing places and 36 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Graph (trivial) has 125 edges and 144 vertex of which 4 / 144 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 141 transition count 124
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 72 rules applied. Total rules applied 129 place count 85 transition count 108
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 12 rules applied. Total rules applied 141 place count 76 transition count 105
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 144 place count 73 transition count 105
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 144 place count 73 transition count 98
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 158 place count 66 transition count 98
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 167 place count 57 transition count 89
Iterating global reduction 4 with 9 rules applied. Total rules applied 176 place count 57 transition count 89
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 192 place count 57 transition count 73
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 193 place count 56 transition count 71
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 56 transition count 71
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 196 place count 56 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 197 place count 55 transition count 69
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 227 place count 40 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 228 place count 40 transition count 53
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 230 place count 38 transition count 49
Iterating global reduction 8 with 2 rules applied. Total rules applied 232 place count 38 transition count 49
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 8 with 2 rules applied. Total rules applied 234 place count 37 transition count 48
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 235 place count 37 transition count 47
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 237 place count 37 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 239 place count 35 transition count 45
Applied a total of 239 rules in 43 ms. Remains 35 /144 variables (removed 109) and now considering 45/183 (removed 138) transitions.
// Phase 1: matrix 45 rows 35 cols
[2022-06-10 21:56:14] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 21:56:14] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 45 rows 35 cols
[2022-06-10 21:56:14] [INFO ] Computed 6 place invariants in 10 ms
[2022-06-10 21:56:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:56:14] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [28, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 132 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 33/144 places, 45/183 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 44
Applied a total of 2 rules in 6 ms. Remains 32 /33 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 32 cols
[2022-06-10 21:56:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:56:14] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 44 rows 32 cols
[2022-06-10 21:56:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:56:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:56:14] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 32/144 places, 44/183 transitions.
Finished structural reductions, in 2 iterations. Remains : 32/144 places, 44/183 transitions.
[2022-06-10 21:56:14] [INFO ] Flatten gal took : 6 ms
[2022-06-10 21:56:14] [INFO ] Flatten gal took : 5 ms
[2022-06-10 21:56:14] [INFO ] Input system was already deterministic with 44 transitions.
[2022-06-10 21:56:14] [INFO ] Flatten gal took : 5 ms
[2022-06-10 21:56:14] [INFO ] Flatten gal took : 5 ms
[2022-06-10 21:56:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6646520661755259264.gal : 2 ms
[2022-06-10 21:56:14] [INFO ] Time to serialize properties into /tmp/CTLFireability11879891240526945807.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6646520661755259264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11879891240526945807.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3962,0.04439,5304,2,308,5,2280,6,0,169,2381,0


Converting to forward existential form...Done !
original formula: EG(AG(((EG((p102==0)) * !(E((p50==1) U (p79==1)))) * !(A((((p6==1)&&(p14==1))&&((p72==1)&&(p112==1))) U (p20==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((EG((p102==0)) * !(E((p50==1) U (p79==1)))) * !(!((E(!((p20==1)) U (!((((p6==1)&&(p14==...235
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t5, t7, t10, t12, t16, t22, t25, t26, t27, t38, Intersection with reachable at e...220
(forward)formula 0,0,0.774473,20916,1,0,533,90050,132,246,1378,106222,626
FORMULA AutonomousCar-PT-02b-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 130 transition count 169
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 130 transition count 169
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 44 place count 130 transition count 153
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 127 transition count 150
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 127 transition count 150
Applied a total of 50 rules in 26 ms. Remains 127 /144 variables (removed 17) and now considering 150/183 (removed 33) transitions.
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:56:15] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 21:56:15] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:56:15] [INFO ] Computed 7 place invariants in 9 ms
[2022-06-10 21:56:15] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:56:15] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:56:16] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/144 places, 150/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/144 places, 150/183 transitions.
[2022-06-10 21:56:16] [INFO ] Flatten gal took : 11 ms
[2022-06-10 21:56:16] [INFO ] Flatten gal took : 11 ms
[2022-06-10 21:56:16] [INFO ] Input system was already deterministic with 150 transitions.
[2022-06-10 21:56:16] [INFO ] Flatten gal took : 12 ms
[2022-06-10 21:56:16] [INFO ] Flatten gal took : 10 ms
[2022-06-10 21:56:16] [INFO ] Time to serialize gal into /tmp/CTLFireability10203865057352430799.gal : 4 ms
[2022-06-10 21:56:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14018332745126653265.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10203865057352430799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14018332745126653265.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.72657e+06,0.207482,10488,2,2486,5,23379,6,0,660,26891,0


Converting to forward existential form...Done !
original formula: AF(EX((p53==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((p53==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t36, t37, t38, t62, t63, t66, t67, t69, t82, t89, t90, t93, t94, t96...305
(forward)formula 0,1,3.16591,85064,1,0,458,381542,320,209,4053,400524,500
FORMULA AutonomousCar-PT-02b-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 168
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 168
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 46 place count 129 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 127 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 127 transition count 150
Applied a total of 50 rules in 12 ms. Remains 127 /144 variables (removed 17) and now considering 150/183 (removed 33) transitions.
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:56:19] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:56:19] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:56:19] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 21:56:19] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:56:19] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 21:56:19] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/144 places, 150/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/144 places, 150/183 transitions.
[2022-06-10 21:56:19] [INFO ] Flatten gal took : 15 ms
[2022-06-10 21:56:19] [INFO ] Flatten gal took : 16 ms
[2022-06-10 21:56:19] [INFO ] Input system was already deterministic with 150 transitions.
[2022-06-10 21:56:19] [INFO ] Flatten gal took : 15 ms
[2022-06-10 21:56:19] [INFO ] Flatten gal took : 15 ms
[2022-06-10 21:56:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13556800621370585667.gal : 6 ms
[2022-06-10 21:56:19] [INFO ] Time to serialize properties into /tmp/CTLFireability14891802656057383775.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13556800621370585667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14891802656057383775.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.77244e+06,0.321071,10808,2,2589,5,23691,6,0,660,26845,0


Converting to forward existential form...Done !
original formula: E((A(!(A((p86==1) U (p33==1))) U E((p103==1) U (p154==1))) * !(EF(AG((p100==1))))) U A((EG((AX((p107==1)) + E((p143==1) U (p79==1)))) * !...236
=> equivalent forward existential formula: [((FwdU(Init,(!((E(!(E((p103==1) U (p154==1))) U (!(!(!((E(!((p33==1)) U (!((p86==1)) * !((p33==1)))) + EG(!((p3...512
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t34, t38, t39, t63, t64, t67, t68, t70, t83, t88, t89, t92, t93, t95, t10...300
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2022-06-10 21:56:49] [INFO ] Flatten gal took : 11 ms
[2022-06-10 21:56:49] [INFO ] Applying decomposition
[2022-06-10 21:56:49] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15479887204521737274.txt' '-o' '/tmp/graph15479887204521737274.bin' '-w' '/tmp/graph15479887204521737274.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15479887204521737274.bin' '-l' '-1' '-v' '-w' '/tmp/graph15479887204521737274.weights' '-q' '0' '-e' '0.001'
[2022-06-10 21:56:50] [INFO ] Decomposing Gal with order
[2022-06-10 21:56:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 21:56:50] [INFO ] Removed a total of 52 redundant transitions.
[2022-06-10 21:56:50] [INFO ] Flatten gal took : 72 ms
[2022-06-10 21:56:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 8 ms.
[2022-06-10 21:56:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15349730832408248106.gal : 5 ms
[2022-06-10 21:56:50] [INFO ] Time to serialize properties into /tmp/CTLFireability11302989653927672752.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15349730832408248106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11302989653927672752.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.77244e+06,0.044238,5608,294,74,1489,330,343,1710,67,716,0


Converting to forward existential form...Done !
original formula: E((A(!(A((i8.u34.p86==1) U (i2.u10.p33==1))) U E((i7.i1.u31.p103==1) U (i11.i1.u40.p154==1))) * !(EF(AG((i7.i1.u30.p100==1))))) U A((EG((...348
=> equivalent forward existential formula: [((FwdU(Init,(!((E(!(E((i7.i1.u31.p103==1) U (i11.i1.u40.p154==1))) U (!(!(!((E(!((i2.u10.p33==1)) U (!((i8.u34....714
Reverse transition relation is NOT exact ! Due to transitions t120, t130, t147, i0.t117, i0.t115, i3.t108, i3.u8.t88, i3.u14.t92, i3.u14.t93, i3.u14.t95, i...427
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,2.68895,83136,1,0,177524,1006,2317,233492,368,3540,211348
FORMULA AutonomousCar-PT-02b-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Graph (trivial) has 134 edges and 144 vertex of which 4 / 144 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 141 transition count 118
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 78 rules applied. Total rules applied 141 place count 79 transition count 102
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 151 place count 70 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 69 transition count 101
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 152 place count 69 transition count 96
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 162 place count 64 transition count 96
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 170 place count 56 transition count 88
Iterating global reduction 4 with 8 rules applied. Total rules applied 178 place count 56 transition count 88
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 194 place count 56 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 194 place count 56 transition count 71
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 196 place count 55 transition count 71
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 197 place count 54 transition count 69
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 54 transition count 69
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 200 place count 54 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 201 place count 53 transition count 67
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 235 place count 36 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 236 place count 36 transition count 49
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 240 place count 32 transition count 40
Iterating global reduction 8 with 4 rules applied. Total rules applied 244 place count 32 transition count 40
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 246 place count 32 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 247 place count 31 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 249 place count 30 transition count 37
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 250 place count 30 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 252 place count 28 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 253 place count 27 transition count 34
Applied a total of 253 rules in 28 ms. Remains 27 /144 variables (removed 117) and now considering 34/183 (removed 149) transitions.
// Phase 1: matrix 34 rows 27 cols
[2022-06-10 21:56:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:56:52] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 34 rows 27 cols
[2022-06-10 21:56:52] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-10 21:56:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:56:52] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 98 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 26/144 places, 34/183 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 26/144 places, 34/183 transitions.
[2022-06-10 21:56:52] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:56:53] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:56:53] [INFO ] Input system was already deterministic with 34 transitions.
[2022-06-10 21:56:53] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:56:53] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:56:53] [INFO ] Time to serialize gal into /tmp/CTLFireability3162274496586159380.gal : 0 ms
[2022-06-10 21:56:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10890589337770250027.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3162274496586159380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10890589337770250027.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1557,0.011064,4584,2,143,5,838,6,0,135,921,0


Converting to forward existential form...Done !
original formula: EG((p131==0))
=> equivalent forward existential formula: [FwdG(Init,(p131==0))] != FALSE
Hit Full ! (commute/partial/dont) 32/0/2
(forward)formula 0,1,0.033885,5664,1,0,28,4722,19,3,748,4364,26
FORMULA AutonomousCar-PT-02b-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Graph (trivial) has 132 edges and 144 vertex of which 4 / 144 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 141 transition count 117
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 77 rules applied. Total rules applied 141 place count 78 transition count 103
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 150 place count 70 transition count 102
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 153 place count 69 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 154 place count 68 transition count 100
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 154 place count 68 transition count 94
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 166 place count 62 transition count 94
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 175 place count 53 transition count 85
Iterating global reduction 5 with 9 rules applied. Total rules applied 184 place count 53 transition count 85
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 200 place count 53 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 200 place count 53 transition count 68
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 202 place count 52 transition count 68
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 203 place count 51 transition count 66
Iterating global reduction 6 with 1 rules applied. Total rules applied 204 place count 51 transition count 66
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 6 with 2 rules applied. Total rules applied 206 place count 51 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 207 place count 50 transition count 64
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 239 place count 34 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 240 place count 34 transition count 47
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 244 place count 30 transition count 38
Iterating global reduction 9 with 4 rules applied. Total rules applied 248 place count 30 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 249 place count 30 transition count 37
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 251 place count 29 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 252 place count 29 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 254 place count 27 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 255 place count 26 transition count 33
Applied a total of 255 rules in 29 ms. Remains 26 /144 variables (removed 118) and now considering 33/183 (removed 150) transitions.
// Phase 1: matrix 33 rows 26 cols
[2022-06-10 21:56:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:56:53] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 33 rows 26 cols
[2022-06-10 21:56:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:56:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:56:53] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [19, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 104 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 24/144 places, 33/183 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 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 32
Applied a total of 2 rules in 4 ms. Remains 23 /24 variables (removed 1) and now considering 32/33 (removed 1) transitions.
// Phase 1: matrix 32 rows 23 cols
[2022-06-10 21:56:53] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:56:53] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 32 rows 23 cols
[2022-06-10 21:56:53] [INFO ] Computed 3 place invariants in 12 ms
[2022-06-10 21:56:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:56:53] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 23/144 places, 32/183 transitions.
Finished structural reductions, in 2 iterations. Remains : 23/144 places, 32/183 transitions.
[2022-06-10 21:56:53] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:56:53] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:56:53] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 18 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
FORMULA AutonomousCar-PT-02b-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 133 transition count 172
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 133 transition count 172
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 130 transition count 169
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 130 transition count 169
Applied a total of 28 rules in 8 ms. Remains 130 /144 variables (removed 14) and now considering 169/183 (removed 14) transitions.
// Phase 1: matrix 169 rows 130 cols
[2022-06-10 21:56:53] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:56:53] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 169 rows 130 cols
[2022-06-10 21:56:53] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:56:53] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 169 rows 130 cols
[2022-06-10 21:56:53] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:56:53] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/144 places, 169/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/144 places, 169/183 transitions.
[2022-06-10 21:56:53] [INFO ] Flatten gal took : 9 ms
[2022-06-10 21:56:53] [INFO ] Flatten gal took : 10 ms
[2022-06-10 21:56:53] [INFO ] Input system was already deterministic with 169 transitions.
[2022-06-10 21:56:53] [INFO ] Flatten gal took : 10 ms
[2022-06-10 21:56:53] [INFO ] Flatten gal took : 9 ms
[2022-06-10 21:56:53] [INFO ] Time to serialize gal into /tmp/CTLFireability4981630381251848499.gal : 1 ms
[2022-06-10 21:56:53] [INFO ] Time to serialize properties into /tmp/CTLFireability14730605100857366160.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4981630381251848499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14730605100857366160.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.26711e+06,0.278262,11976,2,2779,5,28091,6,0,691,33322,0


Converting to forward existential form...Done !
original formula: EG((((EX(((((p133==1)&&(p6==1))&&((p14==1)&&(p48==1)))&&(p112==1))) + EX((p132==1))) + ((p3==0) + ((((p40==1) * AG(AF((p15==1)))) * ((EG(...421
=> equivalent forward existential formula: [FwdG(Init,(((EX(((((p133==1)&&(p6==1))&&((p14==1)&&(p48==1)))&&(p112==1))) + EX((p132==1))) + ((p3==0) + ((((p4...611
Reverse transition relation is NOT exact ! Due to transitions t11, t18, t19, t26, t34, t37, t38, t39, t63, t64, t67, t69, t70, t71, t84, t89, t90, t93, t94...321
Detected timeout of ITS tools.
[2022-06-10 21:57:23] [INFO ] Flatten gal took : 10 ms
[2022-06-10 21:57:23] [INFO ] Applying decomposition
[2022-06-10 21:57:23] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12266820830055841657.txt' '-o' '/tmp/graph12266820830055841657.bin' '-w' '/tmp/graph12266820830055841657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12266820830055841657.bin' '-l' '-1' '-v' '-w' '/tmp/graph12266820830055841657.weights' '-q' '0' '-e' '0.001'
[2022-06-10 21:57:23] [INFO ] Decomposing Gal with order
[2022-06-10 21:57:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 21:57:23] [INFO ] Removed a total of 86 redundant transitions.
[2022-06-10 21:57:23] [INFO ] Flatten gal took : 24 ms
[2022-06-10 21:57:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2022-06-10 21:57:23] [INFO ] Time to serialize gal into /tmp/CTLFireability10517844179776822921.gal : 3 ms
[2022-06-10 21:57:23] [INFO ] Time to serialize properties into /tmp/CTLFireability11620295859353475324.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10517844179776822921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11620295859353475324.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.26711e+06,0.048788,5572,312,77,1800,492,370,2471,79,949,0


Converting to forward existential form...Done !
original formula: EG((((EX(((((i11.i0.u39.p133==1)&&(i0.u2.p6==1))&&((i0.u2.p14==1)&&(i4.u13.p48==1)))&&(i0.u2.p112==1))) + EX((i9.i1.u46.p132==1))) + ((i0...643
=> equivalent forward existential formula: [FwdG(Init,(((EX(((((i11.i0.u39.p133==1)&&(i0.u2.p6==1))&&((i0.u2.p14==1)&&(i4.u13.p48==1)))&&(i0.u2.p112==1))) ...889
Reverse transition relation is NOT exact ! Due to transitions t142, t166, u33.t34, u33.t37, u33.t38, u33.t39, i0.t119, i0.t117, i0.u2.t121, i3.t110, i3.u7....474
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,2.50583,90812,1,0,188497,2278,2250,266800,427,16105,234686
FORMULA AutonomousCar-PT-02b-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Graph (trivial) has 129 edges and 144 vertex of which 4 / 144 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 141 transition count 123
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 73 rules applied. Total rules applied 131 place count 84 transition count 107
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 141 place count 75 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 74 transition count 106
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 142 place count 74 transition count 99
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 156 place count 67 transition count 99
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 163 place count 60 transition count 92
Iterating global reduction 4 with 7 rules applied. Total rules applied 170 place count 60 transition count 92
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 186 place count 60 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 186 place count 60 transition count 75
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 188 place count 59 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 189 place count 58 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 58 transition count 73
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 192 place count 58 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 193 place count 57 transition count 71
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 225 place count 41 transition count 55
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 228 place count 38 transition count 49
Iterating global reduction 7 with 3 rules applied. Total rules applied 231 place count 38 transition count 49
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 233 place count 38 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 234 place count 37 transition count 47
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 235 place count 37 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 237 place count 35 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 238 place count 34 transition count 44
Applied a total of 238 rules in 18 ms. Remains 34 /144 variables (removed 110) and now considering 44/183 (removed 139) transitions.
// Phase 1: matrix 44 rows 34 cols
[2022-06-10 21:57:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:57:26] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 44 rows 34 cols
[2022-06-10 21:57:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:57:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:57:26] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 113 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 33/144 places, 44/183 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 33/144 places, 44/183 transitions.
[2022-06-10 21:57:26] [INFO ] Flatten gal took : 17 ms
[2022-06-10 21:57:26] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:57:26] [INFO ] Input system was already deterministic with 44 transitions.
[2022-06-10 21:57:26] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:57:26] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:57:26] [INFO ] Time to serialize gal into /tmp/CTLFireability9893516464851483934.gal : 1 ms
[2022-06-10 21:57:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17235971381807014626.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9893516464851483934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17235971381807014626.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3788,0.028036,4844,2,270,5,1411,6,0,174,1593,0


Converting to forward existential form...Done !
original formula: AF(AG((((p118==0) * !(E((p130==1) U (p106==1)))) * EF((p44==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p118==0) * !(E((p130==1) U (p106==1)))) * E(TRUE U (p44==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t6, t7, t9, t11, t13, t15, t16, t20, t27, t32, t35, t36, t37, t38, t39, t40, ...253
(forward)formula 0,0,0.440996,13060,1,0,315,40771,119,164,1250,59803,289
FORMULA AutonomousCar-PT-02b-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 130 transition count 169
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 130 transition count 169
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 44 place count 130 transition count 153
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 126 transition count 149
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 126 transition count 149
Applied a total of 52 rules in 8 ms. Remains 126 /144 variables (removed 18) and now considering 149/183 (removed 34) transitions.
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:57:27] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:57:27] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:57:27] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 21:57:27] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:57:27] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:57:27] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/144 places, 149/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/144 places, 149/183 transitions.
[2022-06-10 21:57:27] [INFO ] Flatten gal took : 10 ms
[2022-06-10 21:57:27] [INFO ] Flatten gal took : 9 ms
[2022-06-10 21:57:27] [INFO ] Input system was already deterministic with 149 transitions.
[2022-06-10 21:57:27] [INFO ] Flatten gal took : 9 ms
[2022-06-10 21:57:27] [INFO ] Flatten gal took : 9 ms
[2022-06-10 21:57:27] [INFO ] Time to serialize gal into /tmp/CTLFireability6788425156542278431.gal : 2 ms
[2022-06-10 21:57:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5836127861652259870.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6788425156542278431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5836127861652259870.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.72657e+06,0.339027,11204,2,2514,5,25734,6,0,655,30004,0


Converting to forward existential form...Done !
original formula: (EG(((AF((EX((p8==1)) + AF((p8==1)))) + (p59==1)) + (p127==1))) * EX(EX((EX((((p6==0)||(p14==0))||((p48==0)||(p112==0)))) + (((p6==1)&&(p...190
=> equivalent forward existential formula: ([(EY(EY(EY((Init * EG(((!(EG(!((EX((p8==1)) + !(EG(!((p8==1)))))))) + (p59==1)) + (p127==1))))))) * (((p6==0)||...354
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t36, t37, t38, t63, t64, t67, t68, t70, t82, t83, t88, t89, t92, t93...310
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,27.5813,659356,1,0,1790,4.53692e+06,332,964,4242,3.72048e+06,2032
FORMULA AutonomousCar-PT-02b-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 130 transition count 169
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 130 transition count 169
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 44 place count 130 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 128 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 128 transition count 151
Applied a total of 48 rules in 12 ms. Remains 128 /144 variables (removed 16) and now considering 151/183 (removed 32) transitions.
// Phase 1: matrix 151 rows 128 cols
[2022-06-10 21:57:55] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:57:55] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 151 rows 128 cols
[2022-06-10 21:57:55] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 21:57:55] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
// Phase 1: matrix 151 rows 128 cols
[2022-06-10 21:57:55] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 21:57:55] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/144 places, 151/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/144 places, 151/183 transitions.
[2022-06-10 21:57:55] [INFO ] Flatten gal took : 11 ms
[2022-06-10 21:57:55] [INFO ] Flatten gal took : 6 ms
[2022-06-10 21:57:55] [INFO ] Input system was already deterministic with 151 transitions.
[2022-06-10 21:57:55] [INFO ] Flatten gal took : 5 ms
[2022-06-10 21:57:55] [INFO ] Flatten gal took : 5 ms
[2022-06-10 21:57:55] [INFO ] Time to serialize gal into /tmp/CTLFireability15859622492923807248.gal : 1 ms
[2022-06-10 21:57:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17376209547209313629.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15859622492923807248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17376209547209313629.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.8183e+06,0.205702,10844,2,2604,5,24579,6,0,665,27641,0


Converting to forward existential form...Done !
original formula: EG(((EG(AX(FALSE)) + EX((((AG((p99==0)) * (p6==1)) * ((p14==1)&&(p79==1))) * (p112==1)))) + ((EX((p107==0)) * (p17==0)) * ((p22==0)||((p1...176
=> equivalent forward existential formula: [FwdG(Init,((EG(!(EX(!(FALSE)))) + EX((((!(E(TRUE U !((p99==0)))) * (p6==1)) * ((p14==1)&&(p79==1))) * (p112==1)...237
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t34, t38, t39, t64, t65, t68, t69, t71, t84, t89, t90, t93, t94, t96, t10...300
Using saturation style SCC detection
(forward)formula 0,0,4.44406,121956,1,0,495,646299,340,223,4461,569431,562
FORMULA AutonomousCar-PT-02b-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 131 transition count 170
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 131 transition count 170
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 42 place count 131 transition count 154
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 129 transition count 152
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 129 transition count 152
Applied a total of 46 rules in 5 ms. Remains 129 /144 variables (removed 15) and now considering 152/183 (removed 31) transitions.
// Phase 1: matrix 152 rows 129 cols
[2022-06-10 21:58:00] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:00] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 152 rows 129 cols
[2022-06-10 21:58:00] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:00] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
// Phase 1: matrix 152 rows 129 cols
[2022-06-10 21:58:00] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:00] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/144 places, 152/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/144 places, 152/183 transitions.
[2022-06-10 21:58:00] [INFO ] Flatten gal took : 5 ms
[2022-06-10 21:58:00] [INFO ] Flatten gal took : 6 ms
[2022-06-10 21:58:00] [INFO ] Input system was already deterministic with 152 transitions.
[2022-06-10 21:58:00] [INFO ] Flatten gal took : 5 ms
[2022-06-10 21:58:00] [INFO ] Flatten gal took : 5 ms
[2022-06-10 21:58:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17649189385205554543.gal : 2 ms
[2022-06-10 21:58:00] [INFO ] Time to serialize properties into /tmp/CTLFireability14944475947067297823.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17649189385205554543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14944475947067297823.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.87853e+06,0.245888,11304,2,2694,5,26574,6,0,670,29593,0


Converting to forward existential form...Done !
original formula: ((EG(AF(((((EF((p96==1)) + (p49==1)) + (p115==1)) * AG((((p6==1)&&(p14==1))&&((p48==1)&&(p112==1))))) * AF(AG((p44==1)))))) * EF((p15==0)...195
=> equivalent forward existential formula: (([(Init * !(EG(!(EG(!(((((E(TRUE U (p96==1)) + (p49==1)) + (p115==1)) * !(E(TRUE U !((((p6==1)&&(p14==1))&&((p4...360
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t26, t35, t39, t40, t64, t65, t68, t69, t71, t84, t89, t90, t93, t95, t96, t97...293
Using saturation style SCC detection
(forward)formula 0,0,22.2834,485840,1,0,1470,3.22417e+06,335,733,4241,2.8588e+06,1695
FORMULA AutonomousCar-PT-02b-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Graph (trivial) has 131 edges and 144 vertex of which 4 / 144 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.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 142 transition count 121
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 73 rules applied. Total rules applied 134 place count 82 transition count 108
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 143 place count 75 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 145 place count 73 transition count 106
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 145 place count 73 transition count 100
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 157 place count 67 transition count 100
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 166 place count 58 transition count 91
Iterating global reduction 4 with 9 rules applied. Total rules applied 175 place count 58 transition count 91
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 191 place count 58 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 191 place count 58 transition count 74
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 193 place count 57 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 56 transition count 72
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 56 transition count 72
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 197 place count 56 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 198 place count 55 transition count 70
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 232 place count 38 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 233 place count 38 transition count 52
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 237 place count 34 transition count 43
Iterating global reduction 8 with 4 rules applied. Total rules applied 241 place count 34 transition count 43
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 243 place count 34 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 244 place count 33 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 246 place count 32 transition count 40
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 247 place count 32 transition count 39
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 248 place count 32 transition count 39
Applied a total of 248 rules in 29 ms. Remains 32 /144 variables (removed 112) and now considering 39/183 (removed 144) transitions.
// Phase 1: matrix 39 rows 32 cols
[2022-06-10 21:58:23] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:58:23] [INFO ] Implicit Places using invariants in 52 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 31/144 places, 39/183 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/144 places, 39/183 transitions.
[2022-06-10 21:58:23] [INFO ] Flatten gal took : 4 ms
[2022-06-10 21:58:23] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:58:23] [INFO ] Input system was already deterministic with 39 transitions.
Finished random walk after 23 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
FORMULA AutonomousCar-PT-02b-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 168
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 168
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 46 place count 129 transition count 152
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 125 transition count 148
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 125 transition count 148
Applied a total of 54 rules in 6 ms. Remains 125 /144 variables (removed 19) and now considering 148/183 (removed 35) transitions.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:23] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:23] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:23] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:23] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:23] [INFO ] Computed 7 place invariants in 9 ms
[2022-06-10 21:58:23] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/144 places, 148/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/144 places, 148/183 transitions.
[2022-06-10 21:58:23] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:58:23] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:58:23] [INFO ] Input system was already deterministic with 148 transitions.
[2022-06-10 21:58:23] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:58:23] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:58:23] [INFO ] Time to serialize gal into /tmp/CTLFireability15468328971839931461.gal : 8 ms
[2022-06-10 21:58:23] [INFO ] Time to serialize properties into /tmp/CTLFireability4572382985050810576.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15468328971839931461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4572382985050810576.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.72657e+06,0.296019,10892,2,2467,5,23834,6,0,650,27462,0


Converting to forward existential form...Done !
original formula: E(EF(AX(A((p121!=1) U !((((p6==1)&&(p9==1))&&((p60==1)&&(p112==1))))))) U AX((p35==1)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(EX(!(!((E(!(!((((p6==1)&&(p9==1))&&((p60==1)&&(p112==1))))) U (!((p121!=1)) * !(!((((p6==...290
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t36, t37, t38, t62, t63, t66, t67, t69, t82, t87, t88, t91, t92, t94...305
(forward)formula 0,1,4.69288,100192,1,0,540,488302,328,219,4408,477166,644
FORMULA AutonomousCar-PT-02b-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Graph (trivial) has 130 edges and 144 vertex of which 4 / 144 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 141 transition count 118
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 78 rules applied. Total rules applied 141 place count 79 transition count 102
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 150 place count 70 transition count 102
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 150 place count 70 transition count 96
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 162 place count 64 transition count 96
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 171 place count 55 transition count 87
Iterating global reduction 3 with 9 rules applied. Total rules applied 180 place count 55 transition count 87
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 196 place count 55 transition count 71
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 226 place count 40 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 227 place count 40 transition count 55
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 230 place count 37 transition count 47
Iterating global reduction 5 with 3 rules applied. Total rules applied 233 place count 37 transition count 47
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 235 place count 37 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 236 place count 36 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 238 place count 35 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 239 place count 35 transition count 43
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 240 place count 35 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 242 place count 33 transition count 41
Applied a total of 242 rules in 21 ms. Remains 33 /144 variables (removed 111) and now considering 41/183 (removed 142) transitions.
// Phase 1: matrix 41 rows 33 cols
[2022-06-10 21:58:28] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 21:58:28] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 41 rows 33 cols
[2022-06-10 21:58:28] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:58:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:58:28] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 119 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/144 places, 41/183 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 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 40
Applied a total of 2 rules in 4 ms. Remains 31 /32 variables (removed 1) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 31 cols
[2022-06-10 21:58:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:58:28] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 40 rows 31 cols
[2022-06-10 21:58:28] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 21:58:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:58:28] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 31/144 places, 40/183 transitions.
Finished structural reductions, in 2 iterations. Remains : 31/144 places, 40/183 transitions.
[2022-06-10 21:58:28] [INFO ] Flatten gal took : 4 ms
[2022-06-10 21:58:28] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:58:28] [INFO ] Input system was already deterministic with 40 transitions.
[2022-06-10 21:58:28] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:58:28] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:58:28] [INFO ] Time to serialize gal into /tmp/CTLFireability7154773535208743737.gal : 1 ms
[2022-06-10 21:58:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3706790226988388799.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7154773535208743737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3706790226988388799.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4592,0.019907,4708,2,215,5,1540,6,0,163,1526,0


Converting to forward existential form...Done !
original formula: AF(((((p6==1)&&(p14==1))&&((p41==1)&&(p112==1)))&&((p140!=1)&&(p80!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((((p6==1)&&(p14==1))&&((p41==1)&&(p112==1)))&&((p140!=1)&&(p80!=1)))))] = FALSE
Hit Full ! (commute/partial/dont) 19/0/21
(forward)formula 0,0,0.114571,7644,1,0,32,14306,20,4,967,14522,30
FORMULA AutonomousCar-PT-02b-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 130 transition count 169
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 130 transition count 169
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 44 place count 130 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 128 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 128 transition count 151
Applied a total of 48 rules in 5 ms. Remains 128 /144 variables (removed 16) and now considering 151/183 (removed 32) transitions.
// Phase 1: matrix 151 rows 128 cols
[2022-06-10 21:58:28] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-10 21:58:28] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 151 rows 128 cols
[2022-06-10 21:58:28] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:29] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
// Phase 1: matrix 151 rows 128 cols
[2022-06-10 21:58:29] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:29] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/144 places, 151/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/144 places, 151/183 transitions.
[2022-06-10 21:58:29] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:58:29] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:58:29] [INFO ] Input system was already deterministic with 151 transitions.
[2022-06-10 21:58:29] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:58:29] [INFO ] Flatten gal took : 17 ms
[2022-06-10 21:58:29] [INFO ] Time to serialize gal into /tmp/CTLFireability929668249321244546.gal : 2 ms
[2022-06-10 21:58:29] [INFO ] Time to serialize properties into /tmp/CTLFireability17185160330391215363.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability929668249321244546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17185160330391215363.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.80595e+06,0.350491,11024,2,2624,5,24817,6,0,665,27837,0


Converting to forward existential form...Done !
original formula: AX(((!(A(A((p65==1) U (p32==1)) U ((p129==1)||(p28==1)))) * EF(((EF((p47==0)) + EX((((p6==0)||(p14==0))||((p76==0)||(p112==0))))) * A((p1...201
=> equivalent forward existential formula: (([((EY(Init) * !(EG(!(((p129==1)||(p28==1)))))) * !(E(!(((p129==1)||(p28==1))) U (!(!((E(!((p32==1)) U (!((p65=...470
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t36, t37, t38, t62, t63, t66, t67, t69, t82, t88, t89, t92, t94, t95...304
Detected timeout of ITS tools.
[2022-06-10 21:58:59] [INFO ] Flatten gal took : 6 ms
[2022-06-10 21:58:59] [INFO ] Applying decomposition
[2022-06-10 21:58:59] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17914747331208837070.txt' '-o' '/tmp/graph17914747331208837070.bin' '-w' '/tmp/graph17914747331208837070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17914747331208837070.bin' '-l' '-1' '-v' '-w' '/tmp/graph17914747331208837070.weights' '-q' '0' '-e' '0.001'
[2022-06-10 21:58:59] [INFO ] Decomposing Gal with order
[2022-06-10 21:58:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 21:58:59] [INFO ] Removed a total of 52 redundant transitions.
[2022-06-10 21:58:59] [INFO ] Flatten gal took : 13 ms
[2022-06-10 21:58:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 22 ms.
[2022-06-10 21:58:59] [INFO ] Time to serialize gal into /tmp/CTLFireability5158478526116599278.gal : 2 ms
[2022-06-10 21:58:59] [INFO ] Time to serialize properties into /tmp/CTLFireability1427641947106172455.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5158478526116599278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1427641947106172455.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.80595e+06,0.047222,5936,326,67,1913,331,390,2480,70,743,0


Converting to forward existential form...Done !
original formula: AX(((!(A(A((i5.u22.p65==1) U (i3.i0.u11.p32==1)) U ((i9.u40.p129==1)||(i4.i0.u9.p28==1)))) * EF(((EF((i4.i1.u16.p47==0)) + EX((((i0.u1.p6...309
=> equivalent forward existential formula: (([((EY(Init) * !(EG(!(((i9.u40.p129==1)||(i4.i0.u9.p28==1)))))) * !(E(!(((i9.u40.p129==1)||(i4.i0.u9.p28==1))) ...650
Reverse transition relation is NOT exact ! Due to transitions t120, t148, u34.t33, u34.t36, u34.t37, u34.t38, i0.t118, i0.t116, i4.t109, i4.i0.t88, i4.i0.u...467
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,2.61783,74488,1,0,156114,1060,2418,198119,353,3989,208009
FORMULA AutonomousCar-PT-02b-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Graph (trivial) has 125 edges and 144 vertex of which 4 / 144 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 141 transition count 122
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 74 rules applied. Total rules applied 133 place count 83 transition count 106
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 144 place count 74 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 146 place count 72 transition count 104
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 146 place count 72 transition count 97
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 160 place count 65 transition count 97
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 169 place count 56 transition count 88
Iterating global reduction 4 with 9 rules applied. Total rules applied 178 place count 56 transition count 88
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 194 place count 56 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 195 place count 55 transition count 70
Iterating global reduction 5 with 1 rules applied. Total rules applied 196 place count 55 transition count 70
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 198 place count 55 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 199 place count 54 transition count 68
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 227 place count 40 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 228 place count 40 transition count 53
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 230 place count 38 transition count 49
Iterating global reduction 8 with 2 rules applied. Total rules applied 232 place count 38 transition count 49
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 8 with 2 rules applied. Total rules applied 234 place count 37 transition count 48
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 235 place count 37 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 236 place count 36 transition count 46
Applied a total of 236 rules in 34 ms. Remains 36 /144 variables (removed 108) and now considering 46/183 (removed 137) transitions.
// Phase 1: matrix 46 rows 36 cols
[2022-06-10 21:59:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:59:02] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 46 rows 36 cols
[2022-06-10 21:59:02] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:59:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:59:02] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [29, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 175 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 34/144 places, 46/183 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 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 33 transition count 45
Applied a total of 2 rules in 1 ms. Remains 33 /34 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 33 cols
[2022-06-10 21:59:02] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:59:02] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 45 rows 33 cols
[2022-06-10 21:59:02] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 21:59:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:59:02] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 33/144 places, 45/183 transitions.
Finished structural reductions, in 2 iterations. Remains : 33/144 places, 45/183 transitions.
[2022-06-10 21:59:02] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:59:02] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:59:02] [INFO ] Input system was already deterministic with 45 transitions.
[2022-06-10 21:59:02] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:59:02] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:59:02] [INFO ] Time to serialize gal into /tmp/CTLFireability14170157325847691416.gal : 1 ms
[2022-06-10 21:59:02] [INFO ] Time to serialize properties into /tmp/CTLFireability11026257374058930195.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14170157325847691416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11026257374058930195.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5636,0.045166,5040,2,406,5,3144,6,0,173,3638,0


Converting to forward existential form...Done !
original formula: AG((E((((p6==1)&&(p14==1))&&((p60==1)&&(p112==1))) U ((((p6==1)&&(p9==1))&&((p48==1)&&(p112==1)))||(p147!=1))) * EF((p23==0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E((((p6==1)&&(p14==1))&&((p60==1)&&(p112==1))) U ((((p6==1)&&(p9==1))&&((p48==1)&&(p112==...238
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t7, t9, t14, t16, t21, t25, t27, t28, t29, t30, t35, Intersection with r...233
(forward)formula 0,0,0.195331,8120,1,0,111,17010,114,52,1331,17730,115
FORMULA AutonomousCar-PT-02b-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 183/183 transitions.
Graph (trivial) has 130 edges and 144 vertex of which 4 / 144 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 141 transition count 119
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 76 rules applied. Total rules applied 138 place count 80 transition count 104
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 147 place count 72 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 148 place count 71 transition count 103
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 148 place count 71 transition count 96
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 162 place count 64 transition count 96
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 171 place count 55 transition count 87
Iterating global reduction 4 with 9 rules applied. Total rules applied 180 place count 55 transition count 87
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 196 place count 55 transition count 71
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 197 place count 54 transition count 69
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 54 transition count 69
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 200 place count 54 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 201 place count 53 transition count 67
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 231 place count 38 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 232 place count 38 transition count 51
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 235 place count 35 transition count 44
Iterating global reduction 8 with 3 rules applied. Total rules applied 238 place count 35 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 240 place count 34 transition count 43
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 241 place count 34 transition count 42
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 242 place count 34 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 243 place count 33 transition count 41
Applied a total of 243 rules in 14 ms. Remains 33 /144 variables (removed 111) and now considering 41/183 (removed 142) transitions.
// Phase 1: matrix 41 rows 33 cols
[2022-06-10 21:59:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:59:02] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 41 rows 33 cols
[2022-06-10 21:59:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:59:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:59:02] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [26, 32]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 121 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 31/144 places, 41/183 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 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 40
Applied a total of 2 rules in 3 ms. Remains 30 /31 variables (removed 1) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 30 cols
[2022-06-10 21:59:02] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:59:02] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 40 rows 30 cols
[2022-06-10 21:59:03] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:59:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:59:03] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 30/144 places, 40/183 transitions.
Finished structural reductions, in 2 iterations. Remains : 30/144 places, 40/183 transitions.
[2022-06-10 21:59:03] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:59:03] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:59:03] [INFO ] Input system was already deterministic with 40 transitions.
[2022-06-10 21:59:03] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:59:03] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:59:03] [INFO ] Time to serialize gal into /tmp/CTLFireability2567170649012207369.gal : 1 ms
[2022-06-10 21:59:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14195412244351504495.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2567170649012207369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14195412244351504495.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4636,0.038114,5016,2,343,5,2397,6,0,157,2882,0


Converting to forward existential form...Done !
original formula: EF((AG(((((p6!=1)||(p9!=1))||((p72!=1)||(p112!=1)))&&(((p6!=1)||(p14!=1))||((p72!=1)||(p112!=1))))) * (p67==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p67==1)) * !(E(TRUE U !(((((p6!=1)||(p9!=1))||((p72!=1)||(p112!=1)))&&(((p6!=1)||(p14!=1))...194
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t6, t8, t12, t14, t18, t19, t20, t23, t25, t26, Intersection with reacha...228
(forward)formula 0,1,0.3022,10268,1,0,127,28516,101,58,1211,27775,127
FORMULA AutonomousCar-PT-02b-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2022-06-10 21:59:03] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:59:03] [INFO ] Flatten gal took : 8 ms
Total runtime 173711 ms.

BK_STOP 1654898343555

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-02b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-02b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872900434"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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