Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 75K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2023-12
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2023-13
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2023-14
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716321061053

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 19:51:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:51:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:51:03] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-05-21 19:51:03] [INFO ] Transformed 190 places.
[2024-05-21 19:51:03] [INFO ] Transformed 273 transitions.
[2024-05-21 19:51:03] [INFO ] Found NUPN structural information;
[2024-05-21 19:51:03] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Support contains 108 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 183 transition count 266
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 183 transition count 266
Applied a total of 14 rules in 52 ms. Remains 183 /190 variables (removed 7) and now considering 266/273 (removed 7) transitions.
// Phase 1: matrix 266 rows 183 cols
[2024-05-21 19:51:04] [INFO ] Computed 8 invariants in 34 ms
[2024-05-21 19:51:04] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-21 19:51:04] [INFO ] Invariant cache hit.
[2024-05-21 19:51:04] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2024-05-21 19:51:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-21 19:51:08] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 33 ms to minimize.
[2024-05-21 19:51:08] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 2 ms to minimize.
[2024-05-21 19:51:09] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 2 ms to minimize.
[2024-05-21 19:51:09] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 3 ms to minimize.
[2024-05-21 19:51:09] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-05-21 19:51:09] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-21 19:51:09] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:51:09] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-21 19:51:09] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-21 19:51:10] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-21 19:51:10] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:51:10] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-21 19:51:10] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
[2024-05-21 19:51:10] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 3 ms to minimize.
[2024-05-21 19:51:10] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 5 ms to minimize.
[2024-05-21 19:51:10] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:51:11] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:51:11] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 3 ms to minimize.
[2024-05-21 19:51:11] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:51:11] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-21 19:51:12] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 3 ms to minimize.
[2024-05-21 19:51:12] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-05-21 19:51:12] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 3 ms to minimize.
[2024-05-21 19:51:13] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:51:13] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 3 ms to minimize.
[2024-05-21 19:51:13] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 2 ms to minimize.
[2024-05-21 19:51:13] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-05-21 19:51:13] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:51:13] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-21 19:51:16] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 4 ms to minimize.
[2024-05-21 19:51:18] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 3 ms to minimize.
[2024-05-21 19:51:18] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-21 19:51:20] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 4 ms to minimize.
[2024-05-21 19:51:20] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-21 19:51:22] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 3 ms to minimize.
[2024-05-21 19:51:23] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 8 (OVERLAPS) 266/449 variables, 183/227 constraints. Problems are: Problem set: 2 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/227 constraints. Problems are: Problem set: 2 solved, 263 unsolved
[2024-05-21 19:51:35] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 2 ms to minimize.
SMT process timed out in 30705ms, After SMT, problems are : Problem set: 2 solved, 263 unsolved
Search for dead transitions found 2 dead transitions in 30732ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 183/190 places, 264/273 transitions.
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 0 rules in 9 ms. Remains 183 /183 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31620 ms. Remains : 183/190 places, 264/273 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Support contains 107 out of 182 places after structural reductions.
[2024-05-21 19:51:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 19:51:35] [INFO ] Flatten gal took : 110 ms
[2024-05-21 19:51:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-03b-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:51:36] [INFO ] Flatten gal took : 49 ms
[2024-05-21 19:51:36] [INFO ] Input system was already deterministic with 264 transitions.
Support contains 97 out of 182 places (down from 107) after GAL structural reductions.
RANDOM walk for 40000 steps (36 resets) in 3170 ms. (12 steps per ms) remains 6/68 properties
BEST_FIRST walk for 40000 steps (23 resets) in 530 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (40 resets) in 158 ms. (251 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40000 steps (19 resets) in 137 ms. (289 steps per ms) remains 2/4 properties
// Phase 1: matrix 264 rows 182 cols
[2024-05-21 19:51:37] [INFO ] Computed 8 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 93/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 19:51:37] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
Problem AtomicPropp25 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 83/182 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 19:51:37] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 3 ms to minimize.
[2024-05-21 19:51:37] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 3 ms to minimize.
[2024-05-21 19:51:38] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 3 ms to minimize.
[2024-05-21 19:51:38] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-05-21 19:51:38] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 3 ms to minimize.
[2024-05-21 19:51:38] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 6/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 264/446 variables, 182/197 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 19:51:38] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 2 ms to minimize.
[2024-05-21 19:51:38] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 2/199 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/446 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 199 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1456 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/69 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/182 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 9/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 19:51:39] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 264/446 variables, 182/200 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 1/201 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 19:51:39] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/446 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 202 constraints, problems are : Problem set: 1 solved, 1 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 2103ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 3800 steps, including 45 resets, run visited all 1 properties in 21 ms. (steps per millisecond=180 )
Parikh walk visited 1 properties in 29 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-21 19:51:39] [INFO ] Flatten gal took : 31 ms
[2024-05-21 19:51:39] [INFO ] Flatten gal took : 37 ms
[2024-05-21 19:51:39] [INFO ] Input system was already deterministic with 264 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Graph (trivial) has 144 edges and 182 vertex of which 4 / 182 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 180 transition count 197
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 78 rules applied. Total rules applied 144 place count 115 transition count 184
Reduce places removed 6 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 12 rules applied. Total rules applied 156 place count 109 transition count 178
Reduce places removed 6 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 8 rules applied. Total rules applied 164 place count 103 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 102 transition count 176
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 165 place count 102 transition count 169
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 179 place count 95 transition count 169
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 191 place count 83 transition count 157
Iterating global reduction 5 with 12 rules applied. Total rules applied 203 place count 83 transition count 157
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 5 with 37 rules applied. Total rules applied 240 place count 83 transition count 120
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 240 place count 83 transition count 118
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 244 place count 81 transition count 118
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 246 place count 79 transition count 112
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 79 transition count 112
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 286 place count 60 transition count 93
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 290 place count 56 transition count 78
Iterating global reduction 6 with 4 rules applied. Total rules applied 294 place count 56 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 296 place count 56 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 297 place count 55 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 298 place count 55 transition count 75
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 299 place count 55 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 300 place count 54 transition count 74
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 305 place count 54 transition count 74
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 306 place count 53 transition count 73
Iterating global reduction 10 with 1 rules applied. Total rules applied 307 place count 53 transition count 73
Applied a total of 307 rules in 83 ms. Remains 53 /182 variables (removed 129) and now considering 73/264 (removed 191) transitions.
// Phase 1: matrix 73 rows 53 cols
[2024-05-21 19:51:39] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:51:39] [INFO ] Implicit Places using invariants in 70 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 52/182 places, 73/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 159 ms. Remains : 52/182 places, 73/264 transitions.
[2024-05-21 19:51:40] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:51:40] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:51:40] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-21 19:51:40] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:51:40] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:51:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality13479791583053857411.gal : 3 ms
[2024-05-21 19:51:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality7979840802686447541.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13479791583053857411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7979840802686447541.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,150969,0.050368,4428,2,601,5,4018,6,0,280,4255,0


Converting to forward existential form...Done !
original formula: !(E(!(((A(!(((p100==0)||(p126==1))) U (p158==1)) * AG(((p183==0)||(p70==1)))) * ((!(((p138==0)||(p72==1))&&((p0==0)||(p118==1))))&&(!(((p...223
=> equivalent forward existential formula: [(FwdU(Init,!(((!((E(!((p158==1)) U (!(!(((p100==0)||(p126==1)))) * !((p158==1)))) + EG(!((p158==1))))) * !(E(TR...336
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t6, t8, t11, t14, t16, t23, t25, t27, t33, t37, t39, t46, t47, t48, t49, t50, t51, t5...321
(forward)formula 0,0,2.2097,70212,1,0,744,380517,181,297,2322,408453,828
FORMULA AutonomousCar-PT-03b-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 162 transition count 244
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 162 transition count 244
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 76 place count 162 transition count 208
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 159 transition count 205
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 159 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 158 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 158 transition count 204
Applied a total of 84 rules in 34 ms. Remains 158 /182 variables (removed 24) and now considering 204/264 (removed 60) transitions.
// Phase 1: matrix 204 rows 158 cols
[2024-05-21 19:51:42] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 19:51:42] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 19:51:42] [INFO ] Invariant cache hit.
[2024-05-21 19:51:42] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-21 19:51:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-21 19:51:45] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 4 ms to minimize.
[2024-05-21 19:51:45] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
[2024-05-21 19:51:45] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 4 ms to minimize.
[2024-05-21 19:51:45] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-21 19:51:45] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:51:46] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-21 19:51:46] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-21 19:51:46] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:51:46] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 20 ms to minimize.
[2024-05-21 19:51:46] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-21 19:51:46] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:51:46] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:51:46] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:51:46] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 3 ms to minimize.
[2024-05-21 19:51:46] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 3 ms to minimize.
[2024-05-21 19:51:47] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 4 ms to minimize.
[2024-05-21 19:51:47] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-05-21 19:51:47] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 3 ms to minimize.
[2024-05-21 19:51:47] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:51:48] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-21 19:51:48] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-05-21 19:51:48] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 3 ms to minimize.
[2024-05-21 19:51:48] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-21 19:51:49] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:51:49] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 4 ms to minimize.
[2024-05-21 19:51:49] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 3 ms to minimize.
[2024-05-21 19:51:49] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-21 19:51:49] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:51:49] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2024-05-21 19:51:50] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-21 19:51:52] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-21 19:51:52] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 3 ms to minimize.
[2024-05-21 19:51:52] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-05-21 19:51:52] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 3 ms to minimize.
[2024-05-21 19:51:53] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-21 19:51:53] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-21 19:51:54] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-21 19:51:54] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 204/362 variables, 158/204 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-21 19:51:59] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 205 constraints, problems are : Problem set: 0 solved, 203 unsolved in 23689 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/362 variables, 158/205 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 203/408 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-21 19:52:11] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 409 constraints, problems are : Problem set: 0 solved, 203 unsolved in 17018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 40/40 constraints]
After SMT, in 40819ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 40830ms
Starting structural reductions in LTL mode, iteration 1 : 158/182 places, 204/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41142 ms. Remains : 158/182 places, 204/264 transitions.
[2024-05-21 19:52:23] [INFO ] Flatten gal took : 16 ms
[2024-05-21 19:52:23] [INFO ] Flatten gal took : 14 ms
[2024-05-21 19:52:23] [INFO ] Input system was already deterministic with 204 transitions.
[2024-05-21 19:52:23] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:52:23] [INFO ] Flatten gal took : 17 ms
[2024-05-21 19:52:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality5265313978862376236.gal : 9 ms
[2024-05-21 19:52:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality8762702651419592263.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5265313978862376236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8762702651419592263.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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,5.44181e+07,2.13812,54268,2,6739,5,196022,6,0,838,260900,0


Converting to forward existential form...Done !
original formula: A(EX(EG(((p10==0)||(p53==1)))) U E(!((AF(AG(((p91==0)||(p135==1)))) + EF((p142==1)))) U E((AF((p151==1)) + AF((p0==1))) U (EG((p134==1)) ...169
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((!(EG(!(!(E(TRUE U !(((p91==0)||(p135==1)))))))) + E(TRUE U (p142==1)))) U E((!(EG(!((p151=...588
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t37, t38, t65, t66, t69, t70, t72, t86, t92, t93, t96, t98, t99, t10...354
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 19:52:53] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:52:53] [INFO ] Applying decomposition
[2024-05-21 19:52:53] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8400308726398639214.txt' '-o' '/tmp/graph8400308726398639214.bin' '-w' '/tmp/graph8400308726398639214.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8400308726398639214.bin' '-l' '-1' '-v' '-w' '/tmp/graph8400308726398639214.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:52:53] [INFO ] Decomposing Gal with order
[2024-05-21 19:52:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:52:54] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-21 19:52:54] [INFO ] Flatten gal took : 77 ms
[2024-05-21 19:52:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 15 ms.
[2024-05-21 19:52:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality6575118677281985344.gal : 7 ms
[2024-05-21 19:52:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality10621860000935261939.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6575118677281985344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10621860000935261939.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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,5.44181e+07,0.0904,5196,322,65,2641,640,409,3844,68,1394,0


Converting to forward existential form...Done !
original formula: A(EX(EG(((i12.u3.p10==0)||(i1.i1.u16.p53==1)))) U E(!((AF(AG(((i8.i0.u33.p91==0)||(i11.i1.u46.p135==1)))) + EF((i10.u49.p142==1)))) U E((...254
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((!(EG(!(!(E(TRUE U !(((i8.i0.u33.p91==0)||(i11.i1.u46.p135==1)))))))) + E(TRUE U (i10.u49.p...809
Reverse transition relation is NOT exact ! Due to transitions t149, t170, t201, i1.i1.t138, i1.i1.u9.t118, i1.i1.u17.t119, i3.u14.t122, i3.u14.t125, i3.u15...542
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 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
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 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,3.61637,106044,1,0,210158,1846,2774,346078,366,12513,271291
FORMULA AutonomousCar-PT-03b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Graph (trivial) has 159 edges and 182 vertex of which 4 / 182 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 (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 179 transition count 187
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 87 rules applied. Total rules applied 162 place count 105 transition count 174
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 11 rules applied. Total rules applied 173 place count 98 transition count 170
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 179 place count 94 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 180 place count 93 transition count 168
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 180 place count 93 transition count 160
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 196 place count 85 transition count 160
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 208 place count 73 transition count 148
Iterating global reduction 5 with 12 rules applied. Total rules applied 220 place count 73 transition count 148
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 5 with 37 rules applied. Total rules applied 257 place count 73 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 257 place count 73 transition count 110
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 259 place count 72 transition count 110
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 262 place count 69 transition count 103
Iterating global reduction 6 with 3 rules applied. Total rules applied 265 place count 69 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 266 place count 69 transition count 102
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 304 place count 50 transition count 83
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 307 place count 47 transition count 72
Iterating global reduction 7 with 3 rules applied. Total rules applied 310 place count 47 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 312 place count 47 transition count 70
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 313 place count 47 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 314 place count 46 transition count 69
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 315 place count 46 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 317 place count 44 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 318 place count 43 transition count 67
Applied a total of 318 rules in 51 ms. Remains 43 /182 variables (removed 139) and now considering 67/264 (removed 197) transitions.
// Phase 1: matrix 67 rows 43 cols
[2024-05-21 19:52:57] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:52:57] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 19:52:57] [INFO ] Invariant cache hit.
[2024-05-21 19:52:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:52:57] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [37, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 156 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 41/182 places, 67/264 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 41 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 40 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 40 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 39 transition count 65
Applied a total of 4 rules in 6 ms. Remains 39 /41 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 39 cols
[2024-05-21 19:52:57] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 19:52:58] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:52:58] [INFO ] Invariant cache hit.
[2024-05-21 19:52:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:52:58] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 39/182 places, 65/264 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 357 ms. Remains : 39/182 places, 65/264 transitions.
[2024-05-21 19:52:58] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:52:58] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:52:58] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-21 19:52:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:52:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:52:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality13731984928323987510.gal : 2 ms
[2024-05-21 19:52:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality4045856923883746141.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13731984928323987510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4045856923883746141.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,25622,0.061901,5272,2,463,5,7465,6,0,219,8512,0


Converting to forward existential form...Done !
original formula: A((((p72==0)||(p146==1))||(p81==1)) U !(E(((p37==0)&&(p119==1)) U AF((p91==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(((p37==0)&&(p119==1)) U !(EG(!((p91==1)))))))))) * !(E(!(!(E(((p37==0)&&(p119==1)) U !(EG(!...278
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t7, t11, t13, t14, t20, t22, t38, t63, Intersection with reachable a...223
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.59209,39824,1,0,541,214864,164,265,1824,216606,593
FORMULA AutonomousCar-PT-03b-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 160 transition count 242
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 160 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 80 place count 160 transition count 206
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 155 transition count 201
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 155 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 154 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 154 transition count 200
Applied a total of 92 rules in 12 ms. Remains 154 /182 variables (removed 28) and now considering 200/264 (removed 64) transitions.
// Phase 1: matrix 200 rows 154 cols
[2024-05-21 19:52:59] [INFO ] Computed 8 invariants in 9 ms
[2024-05-21 19:52:59] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 19:52:59] [INFO ] Invariant cache hit.
[2024-05-21 19:53:00] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-21 19:53:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 19:53:02] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 3 ms to minimize.
[2024-05-21 19:53:02] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 3 ms to minimize.
[2024-05-21 19:53:02] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 3 ms to minimize.
[2024-05-21 19:53:02] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:53:03] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2024-05-21 19:53:03] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 3 ms to minimize.
[2024-05-21 19:53:03] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2024-05-21 19:53:03] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:53:03] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 3 ms to minimize.
[2024-05-21 19:53:03] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-21 19:53:03] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:53:03] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 3 ms to minimize.
[2024-05-21 19:53:04] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-21 19:53:04] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 3 ms to minimize.
[2024-05-21 19:53:04] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 3 ms to minimize.
[2024-05-21 19:53:04] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 3 ms to minimize.
[2024-05-21 19:53:05] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 3 ms to minimize.
[2024-05-21 19:53:05] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-21 19:53:05] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 19:53:06] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 3 ms to minimize.
[2024-05-21 19:53:06] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:53:06] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:53:06] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-21 19:53:06] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-21 19:53:06] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-21 19:53:07] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:53:07] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:53:07] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 19:53:09] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-21 19:53:09] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-05-21 19:53:10] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-05-21 19:53:10] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 3 ms to minimize.
[2024-05-21 19:53:10] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 3 ms to minimize.
[2024-05-21 19:53:10] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 3 ms to minimize.
[2024-05-21 19:53:10] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 200/354 variables, 154/197 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 19:53:15] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 3 ms to minimize.
[2024-05-21 19:53:16] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 199 constraints, problems are : Problem set: 0 solved, 199 unsolved in 22639 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 19:53:24] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/354 variables, 154/200 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 199/399 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 19:53:28] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 400 constraints, problems are : Problem set: 0 solved, 199 unsolved in 19319 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 39/39 constraints]
After SMT, in 42033ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 42036ms
Starting structural reductions in LTL mode, iteration 1 : 154/182 places, 200/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42387 ms. Remains : 154/182 places, 200/264 transitions.
[2024-05-21 19:53:42] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:53:42] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:53:42] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-21 19:53:42] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:53:42] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:53:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality14815688500539502874.gal : 4 ms
[2024-05-21 19:53:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality5130816039691059833.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14815688500539502874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5130816039691059833.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,5.11971e+07,1.81783,50220,2,6141,5,181347,6,0,818,243522,0


Converting to forward existential form...Done !
original formula: AX(EF((!(E(((p163==0)||(p43==1)) U AG(((p127==0)||(p78==1))))) + (p97==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (!(E(((p163==0)||(p43==1)) U !(E(TRUE U !(((p127==0)||(p78==1))))))) + (p97==1)))))] = F...159
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t84, t90, t91, t94, t95, t97...371
Detected timeout of ITS tools.
[2024-05-21 19:54:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:54:12] [INFO ] Applying decomposition
[2024-05-21 19:54:12] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph792844884206601061.txt' '-o' '/tmp/graph792844884206601061.bin' '-w' '/tmp/graph792844884206601061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph792844884206601061.bin' '-l' '-1' '-v' '-w' '/tmp/graph792844884206601061.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:54:12] [INFO ] Decomposing Gal with order
[2024-05-21 19:54:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:54:12] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-21 19:54:12] [INFO ] Flatten gal took : 21 ms
[2024-05-21 19:54:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2024-05-21 19:54:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality4532008669501012277.gal : 5 ms
[2024-05-21 19:54:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality2969438631983069387.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4532008669501012277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2969438631983069387.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,5.11971e+07,0.072412,5652,432,77,3826,490,392,5669,74,1420,0


Converting to forward existential form...Done !
original formula: AX(EF((!(E(((i11.u48.p163==0)||(i4.u12.p43==1)) U AG(((i9.i0.u39.p127==0)||(i6.i0.u23.p78==1))))) + (i8.i0.u31.p97==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (!(E(((i11.u48.p163==0)||(i4.u12.p43==1)) U !(E(TRUE U !(((i9.i0.u39.p127==0)||(i6.i0.u2...204
Reverse transition relation is NOT exact ! Due to transitions t148, t169, t181, t197, i0.t144, i0.t142, i3.u13.t119, i3.u13.t122, i3.u14.t120, i4.t135, i4....546
(forward)formula 0,1,0.586186,25716,1,0,47934,1210,2291,84114,360,4370,85698
FORMULA AutonomousCar-PT-03b-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 162 transition count 244
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 162 transition count 244
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 76 place count 162 transition count 208
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 158 transition count 204
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 158 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 157 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 157 transition count 203
Applied a total of 86 rules in 14 ms. Remains 157 /182 variables (removed 25) and now considering 203/264 (removed 61) transitions.
// Phase 1: matrix 203 rows 157 cols
[2024-05-21 19:54:13] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 19:54:13] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 19:54:13] [INFO ] Invariant cache hit.
[2024-05-21 19:54:13] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-21 19:54:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 19:54:15] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-05-21 19:54:15] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-05-21 19:54:15] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 2 ms to minimize.
[2024-05-21 19:54:15] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 3 ms to minimize.
[2024-05-21 19:54:15] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 3 ms to minimize.
[2024-05-21 19:54:16] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-21 19:54:16] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 5 ms to minimize.
[2024-05-21 19:54:16] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
[2024-05-21 19:54:16] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-05-21 19:54:16] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
[2024-05-21 19:54:16] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-21 19:54:16] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 3 ms to minimize.
[2024-05-21 19:54:17] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-21 19:54:17] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-05-21 19:54:17] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 4 ms to minimize.
[2024-05-21 19:54:17] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-05-21 19:54:18] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 3 ms to minimize.
[2024-05-21 19:54:18] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 19:54:19] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 2 ms to minimize.
[2024-05-21 19:54:19] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 3 ms to minimize.
[2024-05-21 19:54:19] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 3 ms to minimize.
[2024-05-21 19:54:19] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 3 ms to minimize.
[2024-05-21 19:54:19] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-21 19:54:20] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 3 ms to minimize.
[2024-05-21 19:54:20] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 3 ms to minimize.
[2024-05-21 19:54:20] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 3 ms to minimize.
[2024-05-21 19:54:20] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 3 ms to minimize.
[2024-05-21 19:54:20] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:54:21] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-05-21 19:54:21] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-21 19:54:21] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 3 ms to minimize.
[2024-05-21 19:54:21] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-05-21 19:54:21] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 19:54:24] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-05-21 19:54:24] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
[2024-05-21 19:54:24] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-21 19:54:24] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 19:54:25] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-21 19:54:25] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-05-21 19:54:25] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 19:54:27] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 203/360 variables, 157/206 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 19:54:31] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-21 19:54:32] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 3 ms to minimize.
[2024-05-21 19:54:32] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (OVERLAPS) 0/360 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 209 constraints, problems are : Problem set: 0 solved, 202 unsolved in 26245 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 19:54:41] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/360 variables, 157/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 202/412 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/360 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 412 constraints, problems are : Problem set: 0 solved, 202 unsolved in 17155 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 45/45 constraints]
After SMT, in 43515ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 43518ms
Starting structural reductions in LTL mode, iteration 1 : 157/182 places, 203/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43759 ms. Remains : 157/182 places, 203/264 transitions.
[2024-05-21 19:54:56] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:54:56] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:54:56] [INFO ] Input system was already deterministic with 203 transitions.
[2024-05-21 19:54:56] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:54:56] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:54:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality483142356655358949.gal : 2 ms
[2024-05-21 19:54:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality14671199873455822919.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality483142356655358949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14671199873455822919.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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,5.44546e+07,1.48497,42260,2,7337,5,155849,6,0,833,194006,0


Converting to forward existential form...Done !
original formula: EX(E(((AX((p146==1)) + (p114==0)) + ((p73==1)||((((p127==0)||(p141==1))&&((p148==0)||(p161==1)))&&(((p15==0)||(p83==1))||(p5==1))))) U (p...163
=> equivalent forward existential formula: [(FwdU(EY(Init),((!(EX(!((p146==1)))) + (p114==0)) + ((p73==1)||((((p127==0)||(p141==1))&&((p148==0)||(p161==1))...215
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t38, t39, t65, t66, t69, t70, t72, t85, t91, t92, t95, t96, t98, t11...378
Detected timeout of ITS tools.
[2024-05-21 19:55:26] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:55:26] [INFO ] Applying decomposition
[2024-05-21 19:55:26] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9674231162471148760.txt' '-o' '/tmp/graph9674231162471148760.bin' '-w' '/tmp/graph9674231162471148760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9674231162471148760.bin' '-l' '-1' '-v' '-w' '/tmp/graph9674231162471148760.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:55:26] [INFO ] Decomposing Gal with order
[2024-05-21 19:55:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:55:26] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-21 19:55:26] [INFO ] Flatten gal took : 18 ms
[2024-05-21 19:55:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2024-05-21 19:55:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality2025339557081574064.gal : 4 ms
[2024-05-21 19:55:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality2849745262192695612.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2025339557081574064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2849745262192695612.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,5.44546e+07,0.1046,5408,406,104,2957,368,396,4116,72,1047,0


Converting to forward existential form...Done !
original formula: EX(E(((AX((i0.u1.p146==1)) + (i7.u34.p114==0)) + ((i4.i0.u22.p73==1)||((((i9.i0.u39.p127==0)||(i10.u45.p141==1))&&((i10.u45.p148==0)||(i1...251
=> equivalent forward existential formula: [(FwdU(EY(Init),((!(EX(!((i0.u1.p146==1)))) + (i7.u34.p114==0)) + ((i4.i0.u22.p73==1)||((((i9.i0.u39.p127==0)||(...303
Reverse transition relation is NOT exact ! Due to transitions t152, t167, t182, t200, i0.t146, i0.t144, i0.u1.t147, i0.u1.t148, i3.t137, i3.u9.t117, i3.u14...544
(forward)formula 0,1,1.56581,47120,1,0,97734,1227,1850,131197,337,5720,146903
FORMULA AutonomousCar-PT-03b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Graph (trivial) has 158 edges and 182 vertex of which 2 / 182 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 180 transition count 187
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 94 rules applied. Total rules applied 170 place count 105 transition count 168
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 14 rules applied. Total rules applied 184 place count 94 transition count 165
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 187 place count 91 transition count 165
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 187 place count 91 transition count 159
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 199 place count 85 transition count 159
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 213 place count 71 transition count 145
Iterating global reduction 4 with 14 rules applied. Total rules applied 227 place count 71 transition count 145
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 265 place count 71 transition count 107
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 265 place count 71 transition count 105
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 269 place count 69 transition count 105
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 272 place count 66 transition count 98
Iterating global reduction 5 with 3 rules applied. Total rules applied 275 place count 66 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 279 place count 66 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 281 place count 64 transition count 94
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 319 place count 45 transition count 75
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 323 place count 41 transition count 60
Iterating global reduction 7 with 4 rules applied. Total rules applied 327 place count 41 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 329 place count 41 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 330 place count 40 transition count 58
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 332 place count 40 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 334 place count 38 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 335 place count 37 transition count 56
Applied a total of 335 rules in 51 ms. Remains 37 /182 variables (removed 145) and now considering 56/264 (removed 208) transitions.
// Phase 1: matrix 56 rows 37 cols
[2024-05-21 19:55:28] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:55:28] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 19:55:28] [INFO ] Invariant cache hit.
[2024-05-21 19:55:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:55:28] [INFO ] Implicit Places using invariants and state equation in 182 ms returned [27, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 233 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 35/182 places, 56/264 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 35 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 34 transition count 55
Applied a total of 2 rules in 3 ms. Remains 34 /35 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 34 cols
[2024-05-21 19:55:28] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:55:28] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 19:55:28] [INFO ] Invariant cache hit.
[2024-05-21 19:55:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:55:29] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 34/182 places, 55/264 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 413 ms. Remains : 34/182 places, 55/264 transitions.
[2024-05-21 19:55:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:55:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:55:29] [INFO ] Input system was already deterministic with 55 transitions.
[2024-05-21 19:55:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:55:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:55:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality3626855542056361670.gal : 1 ms
[2024-05-21 19:55:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality5145484668314991114.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3626855542056361670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5145484668314991114.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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,17584,0.028336,4192,2,251,5,2847,6,0,190,3053,0


Converting to forward existential form...Done !
original formula: EG(AF((AG(((p143==0)&&(p172==0))) + AF((((p169==0)&&(p148==1))&&(p181==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((!(E(TRUE U !(((p143==0)&&(p172==0))))) + !(EG(!((((p169==0)&&(p148==1))&&(p181==0))))))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t8, t10, t12, t14, t16, t28, t53, Intersection with reachable at each step enabled. ...201
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.613106,17088,1,0,440,66841,149,255,1692,84532,470
FORMULA AutonomousCar-PT-03b-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Graph (trivial) has 166 edges and 182 vertex of which 2 / 182 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 180 transition count 179
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 105 rules applied. Total rules applied 189 place count 97 transition count 157
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 202 place count 85 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 203 place count 84 transition count 156
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 203 place count 84 transition count 151
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 213 place count 79 transition count 151
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 225 place count 67 transition count 139
Iterating global reduction 4 with 12 rules applied. Total rules applied 237 place count 67 transition count 139
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 273 place count 67 transition count 103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 273 place count 67 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 277 place count 65 transition count 101
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 280 place count 62 transition count 94
Iterating global reduction 5 with 3 rules applied. Total rules applied 283 place count 62 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 286 place count 62 transition count 91
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 288 place count 61 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 289 place count 60 transition count 90
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 327 place count 41 transition count 71
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 330 place count 38 transition count 60
Iterating global reduction 8 with 3 rules applied. Total rules applied 333 place count 38 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 335 place count 38 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 336 place count 37 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 337 place count 37 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 339 place count 35 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 340 place count 34 transition count 55
Applied a total of 340 rules in 22 ms. Remains 34 /182 variables (removed 148) and now considering 55/264 (removed 209) transitions.
// Phase 1: matrix 55 rows 34 cols
[2024-05-21 19:55:29] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 19:55:29] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 19:55:29] [INFO ] Invariant cache hit.
[2024-05-21 19:55:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:55:29] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [25, 33]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 101 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/182 places, 55/264 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 54
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 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 31 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 30 transition count 53
Applied a total of 4 rules in 5 ms. Remains 30 /32 variables (removed 2) and now considering 53/55 (removed 2) transitions.
// Phase 1: matrix 53 rows 30 cols
[2024-05-21 19:55:29] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 19:55:29] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 19:55:29] [INFO ] Invariant cache hit.
[2024-05-21 19:55:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:55:29] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 30/182 places, 53/264 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 284 ms. Remains : 30/182 places, 53/264 transitions.
[2024-05-21 19:55:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:55:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:55:29] [INFO ] Input system was already deterministic with 53 transitions.
[2024-05-21 19:55:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:55:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:55:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality9835302495274468806.gal : 1 ms
[2024-05-21 19:55:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality1783822795910879868.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9835302495274468806.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1783822795910879868.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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,7944,0.042668,3876,2,127,5,2273,6,0,172,2847,0


Converting to forward existential form...Done !
original formula: AF((((p117==1) * AG(EF((p169==1)))) * ((p170!=0) * EF(EG((p80==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((((p117==1) * !(E(TRUE U !(E(TRUE U (p169==1)))))) * ((p170!=0) * E(TRUE U EG((p80==0)))))))] = FAL...157
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t7, t8, t10, t12, t14, t37, t51, Intersection with reachable at each step enabled. (...200
(forward)formula 0,0,0.826413,19320,1,0,482,72904,139,281,1579,100999,548
FORMULA AutonomousCar-PT-03b-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 159 transition count 241
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 159 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 82 place count 159 transition count 205
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 154 transition count 200
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 154 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 153 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 153 transition count 199
Applied a total of 94 rules in 5 ms. Remains 153 /182 variables (removed 29) and now considering 199/264 (removed 65) transitions.
// Phase 1: matrix 199 rows 153 cols
[2024-05-21 19:55:30] [INFO ] Computed 8 invariants in 6 ms
[2024-05-21 19:55:30] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 19:55:30] [INFO ] Invariant cache hit.
[2024-05-21 19:55:31] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-21 19:55:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:55:33] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
[2024-05-21 19:55:33] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-05-21 19:55:33] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-05-21 19:55:34] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
[2024-05-21 19:55:34] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 3 ms to minimize.
[2024-05-21 19:55:34] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 3 ms to minimize.
[2024-05-21 19:55:34] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-05-21 19:55:34] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 3 ms to minimize.
[2024-05-21 19:55:34] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-21 19:55:35] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-21 19:55:35] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 3 ms to minimize.
[2024-05-21 19:55:35] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2024-05-21 19:55:35] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:55:35] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-21 19:55:35] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 3 ms to minimize.
[2024-05-21 19:55:36] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-05-21 19:55:36] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2024-05-21 19:55:36] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 3 ms to minimize.
[2024-05-21 19:55:36] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 3 ms to minimize.
[2024-05-21 19:55:36] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:55:37] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 3 ms to minimize.
[2024-05-21 19:55:37] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-21 19:55:37] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-21 19:55:37] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 3 ms to minimize.
[2024-05-21 19:55:37] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 3 ms to minimize.
[2024-05-21 19:55:37] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:55:38] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-05-21 19:55:38] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-05-21 19:55:38] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-21 19:55:38] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:55:38] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:55:38] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:55:40] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 3 ms to minimize.
[2024-05-21 19:55:40] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-21 19:55:40] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:55:41] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:55:41] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/198 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:55:45] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 199 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:55:54] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:55:56] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 198/399 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 19:56:00] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 21594 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 41/41 constraints]
After SMT, in 43682ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 43686ms
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 199/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44027 ms. Remains : 153/182 places, 199/264 transitions.
[2024-05-21 19:56:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:56:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:56:14] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-21 19:56:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:56:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:56:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality8035463188223837785.gal : 2 ms
[2024-05-21 19:56:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality8483475064292645247.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8035463188223837785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8483475064292645247.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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,4.9176e+07,1.5716,42140,2,6282,5,151031,6,0,813,196128,0


Converting to forward existential form...Done !
original formula: EF(EG(AX(((p22==0)||(p70==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!(((p22==0)||(p70==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...371
(forward)formula 0,1,14.0249,346424,1,0,510,1.67299e+06,421,191,5518,1.81846e+06,579
FORMULA AutonomousCar-PT-03b-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 162 transition count 244
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 162 transition count 244
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 76 place count 162 transition count 208
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 158 transition count 204
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 158 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 157 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 157 transition count 203
Applied a total of 86 rules in 6 ms. Remains 157 /182 variables (removed 25) and now considering 203/264 (removed 61) transitions.
// Phase 1: matrix 203 rows 157 cols
[2024-05-21 19:56:29] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 19:56:29] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 19:56:29] [INFO ] Invariant cache hit.
[2024-05-21 19:56:29] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-21 19:56:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 19:56:31] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-21 19:56:31] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 3 ms to minimize.
[2024-05-21 19:56:32] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 3 ms to minimize.
[2024-05-21 19:56:32] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:56:32] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-05-21 19:56:32] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-21 19:56:32] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:56:32] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 3 ms to minimize.
[2024-05-21 19:56:32] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
[2024-05-21 19:56:33] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-05-21 19:56:33] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:56:33] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 3 ms to minimize.
[2024-05-21 19:56:33] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 3 ms to minimize.
[2024-05-21 19:56:33] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-21 19:56:33] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2024-05-21 19:56:33] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:56:34] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
[2024-05-21 19:56:34] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:56:34] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-21 19:56:34] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 19:56:35] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 3 ms to minimize.
[2024-05-21 19:56:35] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 3 ms to minimize.
[2024-05-21 19:56:35] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 5 ms to minimize.
[2024-05-21 19:56:35] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-21 19:56:35] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 3 ms to minimize.
[2024-05-21 19:56:35] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 3 ms to minimize.
[2024-05-21 19:56:35] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-21 19:56:36] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 3 ms to minimize.
[2024-05-21 19:56:36] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:56:36] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-21 19:56:36] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-05-21 19:56:36] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-21 19:56:37] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-05-21 19:56:37] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 4 ms to minimize.
[2024-05-21 19:56:37] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 3 ms to minimize.
[2024-05-21 19:56:37] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 3 ms to minimize.
[2024-05-21 19:56:37] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:56:37] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 3 ms to minimize.
[2024-05-21 19:56:38] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 19:56:40] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-05-21 19:56:40] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-21 19:56:40] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 19:56:42] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 203/360 variables, 157/208 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 19:56:46] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-05-21 19:56:46] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/360 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 210 constraints, problems are : Problem set: 0 solved, 202 unsolved in 25309 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/360 variables, 157/210 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 202/412 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 19:57:02] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/360 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (OVERLAPS) 0/360 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 413 constraints, problems are : Problem set: 0 solved, 202 unsolved in 21884 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 46/46 constraints]
After SMT, in 47263ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 47265ms
Starting structural reductions in LTL mode, iteration 1 : 157/182 places, 203/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47500 ms. Remains : 157/182 places, 203/264 transitions.
[2024-05-21 19:57:16] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:57:16] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:57:16] [INFO ] Input system was already deterministic with 203 transitions.
[2024-05-21 19:57:16] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:57:16] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:57:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality4129816949700618384.gal : 2 ms
[2024-05-21 19:57:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality5558724066775432194.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4129816949700618384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5558724066775432194.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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,5.58295e+07,1.68339,45656,2,6613,5,164207,6,0,833,214242,0


Converting to forward existential form...Done !
original formula: AX(E(A(E(((p95==1)||(p45==1)) U (p105==0)) U (A((p100==0) U (p27==1)) * AF(((p124==0)||(p155==1))))) U A(((EG((p188==0)) + ((p12==0)&&(p2...259
=> equivalent forward existential formula: [(EY(Init) * !(E(!((E(!((!((E(!((p27==1)) U (!((p100==0)) * !((p27==1)))) + EG(!((p27==1))))) * !(EG(!(((p124==0...735
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t37, t39, t65, t66, t69, t70, t72, t86, t92, t93, t96, t97, t99, t11...354
Detected timeout of ITS tools.
[2024-05-21 19:57:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:57:46] [INFO ] Applying decomposition
[2024-05-21 19:57:46] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15592724412086839271.txt' '-o' '/tmp/graph15592724412086839271.bin' '-w' '/tmp/graph15592724412086839271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15592724412086839271.bin' '-l' '-1' '-v' '-w' '/tmp/graph15592724412086839271.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:57:46] [INFO ] Decomposing Gal with order
[2024-05-21 19:57:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:57:46] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-21 19:57:46] [INFO ] Flatten gal took : 16 ms
[2024-05-21 19:57:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 4 ms.
[2024-05-21 19:57:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality11766892989347570948.gal : 2 ms
[2024-05-21 19:57:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality14429194645437326979.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11766892989347570948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14429194645437326979.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,5.58295e+07,0.078243,5728,428,76,3793,522,414,4909,73,1159,0


Converting to forward existential form...Done !
original formula: AX(E(A(E(((i9.i1.u30.p95==1)||(i3.i0.u13.p45==1)) U (i9.i0.u34.p105==0)) U (A((i9.i1.u32.p100==0) U (i1.i0.u4.p27==1)) * AF(((i10.i0.u39....415
=> equivalent forward existential formula: [(EY(Init) * !(E(!((E(!((!((E(!((i1.i0.u4.p27==1)) U (!((i9.i1.u32.p100==0)) * !((i1.i0.u4.p27==1)))) + EG(!((i1...1087
Reverse transition relation is NOT exact ! Due to transitions t151, t184, t200, i0.t147, i0.i1.t145, i3.i1.t138, i3.i1.u8.t117, i3.i1.u17.t118, i4.u14.t123...525
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 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
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 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,8.4222,267352,1,0,537086,2495,2892,743923,395,17161,647025
FORMULA AutonomousCar-PT-03b-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Graph (trivial) has 144 edges and 182 vertex of which 4 / 182 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 (Trivial Post-Agglo cleanup.) 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 179 transition count 201
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 70 rules applied. Total rules applied 131 place count 119 transition count 191
Reduce places removed 5 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 11 rules applied. Total rules applied 142 place count 114 transition count 185
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 148 place count 108 transition count 185
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 148 place count 108 transition count 174
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 170 place count 97 transition count 174
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 181 place count 86 transition count 163
Iterating global reduction 4 with 11 rules applied. Total rules applied 192 place count 86 transition count 163
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 228 place count 86 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 228 place count 86 transition count 126
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 230 place count 85 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 231 place count 84 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 232 place count 84 transition count 123
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 262 place count 69 transition count 108
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 265 place count 66 transition count 97
Iterating global reduction 5 with 3 rules applied. Total rules applied 268 place count 66 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 270 place count 66 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 271 place count 65 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 272 place count 65 transition count 94
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 273 place count 65 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 274 place count 64 transition count 93
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 276 place count 64 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 278 place count 62 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 279 place count 61 transition count 91
Applied a total of 279 rules in 27 ms. Remains 61 /182 variables (removed 121) and now considering 91/264 (removed 173) transitions.
// Phase 1: matrix 91 rows 61 cols
[2024-05-21 19:57:55] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:57:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 19:57:55] [INFO ] Invariant cache hit.
[2024-05-21 19:57:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:57:55] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 128 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 60/182 places, 91/264 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 59 transition count 90
Applied a total of 2 rules in 3 ms. Remains 59 /60 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 59 cols
[2024-05-21 19:57:55] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:57:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 19:57:55] [INFO ] Invariant cache hit.
[2024-05-21 19:57:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:57:55] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 59/182 places, 90/264 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 300 ms. Remains : 59/182 places, 90/264 transitions.
[2024-05-21 19:57:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:57:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:57:55] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-21 19:57:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:57:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:57:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality1778144901164619270.gal : 1 ms
[2024-05-21 19:57:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality7846955659861438235.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1778144901164619270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7846955659861438235.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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,122778,0.047471,4632,2,662,5,4974,6,0,324,5268,0


Converting to forward existential form...Done !
original formula: (EF(AG((((((p185==1)||(p183==0))||(p152==1))&&((p142==0)||(p15==1)))&&((p129==0)||(p23==1))))) * (EF(((p140==0)&&(p100==1))) + AG((((((p2...254
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !((((((p185==1)||(p183==0))||(p152==1))&&((p142==0)||(p15==1)))&&((p129==0)||(p2...569
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t9, t13, t15, t16, t20, t22, t29, t32, t34, t37, t38, t39, t49, t50, t56, t58, t59, t...332
(forward)formula 0,1,1.76768,49212,1,0,431,240521,228,183,2564,253485,459
FORMULA AutonomousCar-PT-03b-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 160 transition count 242
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 160 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 80 place count 160 transition count 206
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 156 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 156 transition count 202
Applied a total of 88 rules in 4 ms. Remains 156 /182 variables (removed 26) and now considering 202/264 (removed 62) transitions.
// Phase 1: matrix 202 rows 156 cols
[2024-05-21 19:57:57] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 19:57:57] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 19:57:57] [INFO ] Invariant cache hit.
[2024-05-21 19:57:57] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 19:57:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:58:00] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 2 ms to minimize.
[2024-05-21 19:58:00] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-05-21 19:58:00] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 3 ms to minimize.
[2024-05-21 19:58:00] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:58:00] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-21 19:58:00] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-05-21 19:58:01] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 3 ms to minimize.
[2024-05-21 19:58:01] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2024-05-21 19:58:01] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-05-21 19:58:01] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-05-21 19:58:01] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-05-21 19:58:01] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 3 ms to minimize.
[2024-05-21 19:58:01] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 2 ms to minimize.
[2024-05-21 19:58:02] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2024-05-21 19:58:02] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-05-21 19:58:02] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-21 19:58:02] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-05-21 19:58:02] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 3 ms to minimize.
[2024-05-21 19:58:02] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
[2024-05-21 19:58:02] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:58:03] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 3 ms to minimize.
[2024-05-21 19:58:03] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 ms to minimize.
[2024-05-21 19:58:03] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-05-21 19:58:03] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:58:04] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2024-05-21 19:58:04] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 3 ms to minimize.
[2024-05-21 19:58:04] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
[2024-05-21 19:58:04] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-21 19:58:04] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:58:04] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 3 ms to minimize.
[2024-05-21 19:58:04] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:58:05] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:58:05] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-21 19:58:05] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:58:05] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:58:05] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:58:05] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:58:07] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:58:07] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 3 ms to minimize.
[2024-05-21 19:58:08] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:58:10] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 202/358 variables, 156/205 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:58:13] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 3 ms to minimize.
[2024-05-21 19:58:14] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:58:17] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/358 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 208 constraints, problems are : Problem set: 0 solved, 201 unsolved in 25752 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 19:58:24] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-21 19:58:24] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:58:24] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/358 variables, 156/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 201/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/358 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 412 constraints, problems are : Problem set: 0 solved, 201 unsolved in 14213 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 47/47 constraints]
After SMT, in 40028ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 40030ms
Starting structural reductions in LTL mode, iteration 1 : 156/182 places, 202/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40277 ms. Remains : 156/182 places, 202/264 transitions.
[2024-05-21 19:58:37] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:58:37] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:58:37] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-21 19:58:37] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:58:37] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:58:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality38038581846251095.gal : 2 ms
[2024-05-21 19:58:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality13864186813375567135.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality38038581846251095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13864186813375567135.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,5.21456e+07,1.78023,45012,2,6748,5,160028,6,0,828,209087,0


Converting to forward existential form...Done !
original formula: AG((A(AX(EX(((p187==0)||(p189==1)))) U AF(((((p19==0)||(p173==1))&&(p127==0))&&(!((p113==0)||(p47==1)))))) + AF(!(E(AF(((p150==0)||(p65==...187
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!((E(!(!(EG(!(((((p19==0)||(p173==1))&&(p127==0))&&(!((p113==0)||(p47==1)))))))) U (!...433
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t34, t38, t39, t65, t66, t69, t71, t72, t73, t86, t92, t93, t96, t97, t99...353
Detected timeout of ITS tools.
[2024-05-21 19:59:07] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:59:07] [INFO ] Applying decomposition
[2024-05-21 19:59:07] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1278310686656849742.txt' '-o' '/tmp/graph1278310686656849742.bin' '-w' '/tmp/graph1278310686656849742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1278310686656849742.bin' '-l' '-1' '-v' '-w' '/tmp/graph1278310686656849742.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:59:07] [INFO ] Decomposing Gal with order
[2024-05-21 19:59:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:59:07] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-21 19:59:07] [INFO ] Flatten gal took : 16 ms
[2024-05-21 19:59:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 6 ms.
[2024-05-21 19:59:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality10365552085473339305.gal : 2 ms
[2024-05-21 19:59:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality15218113105018933705.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10365552085473339305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15218113105018933705.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,5.21456e+07,0.113976,5952,495,76,4516,408,425,6321,76,1180,0


Converting to forward existential form...Done !
original formula: AG((A(AX(EX(((i11.i1.u59.p187==0)||(i11.i1.u52.p189==1)))) U AF(((((i1.u5.p19==0)||(i13.u53.p173==1))&&(i10.u40.p127==0))&&(!((i7.i1.u35....285
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!((E(!(!(EG(!(((((i1.u5.p19==0)||(i13.u53.p173==1))&&(i10.u40.p127==0))&&(!((i7.i1.u3...609
Reverse transition relation is NOT exact ! Due to transitions t146, t171, t180, t199, i0.t144, i3.i1.t137, i3.i1.u9.t117, i3.i1.u18.t118, i4.u15.t121, i4.u...532
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
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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,7.87428,230616,1,0,480053,2311,3209,595741,435,13973,570507
FORMULA AutonomousCar-PT-03b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 162 transition count 244
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 162 transition count 244
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 76 place count 162 transition count 208
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 159 transition count 205
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 159 transition count 205
Applied a total of 82 rules in 4 ms. Remains 159 /182 variables (removed 23) and now considering 205/264 (removed 59) transitions.
// Phase 1: matrix 205 rows 159 cols
[2024-05-21 19:59:15] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 19:59:15] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 19:59:15] [INFO ] Invariant cache hit.
[2024-05-21 19:59:15] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-05-21 19:59:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 19:59:18] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 4 ms to minimize.
[2024-05-21 19:59:18] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
[2024-05-21 19:59:19] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2024-05-21 19:59:19] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2024-05-21 19:59:19] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 3 ms to minimize.
[2024-05-21 19:59:19] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
[2024-05-21 19:59:19] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 3 ms to minimize.
[2024-05-21 19:59:19] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-05-21 19:59:20] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 3 ms to minimize.
[2024-05-21 19:59:20] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-21 19:59:20] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2024-05-21 19:59:20] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 3 ms to minimize.
[2024-05-21 19:59:20] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:59:20] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:59:20] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-21 19:59:20] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:59:20] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 3 ms to minimize.
[2024-05-21 19:59:21] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-05-21 19:59:21] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 3 ms to minimize.
[2024-05-21 19:59:21] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 19:59:21] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:59:22] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 3 ms to minimize.
[2024-05-21 19:59:22] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:59:22] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 3 ms to minimize.
[2024-05-21 19:59:22] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 3 ms to minimize.
[2024-05-21 19:59:22] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:59:22] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-21 19:59:23] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 3 ms to minimize.
[2024-05-21 19:59:23] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 3 ms to minimize.
[2024-05-21 19:59:23] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 3 ms to minimize.
[2024-05-21 19:59:23] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 19:59:26] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-05-21 19:59:26] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:59:26] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 3 ms to minimize.
[2024-05-21 19:59:26] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 205/364 variables, 159/202 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/364 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 202 constraints, problems are : Problem set: 0 solved, 204 unsolved in 19150 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/364 variables, 159/202 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 204/406 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 19:59:39] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:59:39] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:59:40] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-21 19:59:42] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 19:59:49] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/364 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/364 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 411 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 40/40 constraints]
After SMT, in 49250ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 49255ms
Starting structural reductions in LTL mode, iteration 1 : 159/182 places, 205/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49572 ms. Remains : 159/182 places, 205/264 transitions.
[2024-05-21 20:00:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:00:05] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:00:05] [INFO ] Input system was already deterministic with 205 transitions.
[2024-05-21 20:00:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:00:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:00:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality9452949332515489402.gal : 2 ms
[2024-05-21 20:00:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality13328212895684358316.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9452949332515489402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13328212895684358316.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,5.7103e+07,2.85003,62716,2,6827,5,218582,6,0,843,297293,0


Converting to forward existential form...Done !
original formula: (EG((AX(AX(((p116==0)||(p162==1)))) + EG(((p172==1)&&(((p82==0)&&(p86==1))||(p178==1)))))) + ((AG(((p177!=1)&&(p168!=1))) * AF(((p181==0)...292
=> equivalent forward existential formula: (([(FwdU((Init * !(EG((!(EX(!(!(EX(!(((p116==0)||(p162==1)))))))) + EG(((p172==1)&&(((p82==0)&&(p86==1))||(p178=...788
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t18, t26, t34, t37, t38, t39, t65, t66, t69, t71, t72, t73, t86, t93, t94, t97, t99...353
Detected timeout of ITS tools.
[2024-05-21 20:00:35] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:00:35] [INFO ] Applying decomposition
[2024-05-21 20:00:35] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5926059103368047774.txt' '-o' '/tmp/graph5926059103368047774.bin' '-w' '/tmp/graph5926059103368047774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5926059103368047774.bin' '-l' '-1' '-v' '-w' '/tmp/graph5926059103368047774.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:00:35] [INFO ] Decomposing Gal with order
[2024-05-21 20:00:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:00:35] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-21 20:00:35] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:00:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2024-05-21 20:00:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality2746603185982426040.gal : 2 ms
[2024-05-21 20:00:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality4818751364351911041.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2746603185982426040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4818751364351911041.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,5.7103e+07,0.055587,5176,369,72,2747,598,401,3403,69,1130,0


Converting to forward existential form...Done !
original formula: (EG((AX(AX(((i7.u36.p116==0)||(i13.u48.p162==1)))) + EG(((i12.i0.u53.p172==1)&&(((i4.i1.u26.p82==0)&&(i4.i2.u28.p86==1))||(i12.i1.u51.p17...455
=> equivalent forward existential formula: (([(FwdU((Init * !(EG((!(EX(!(!(EX(!(((i7.u36.p116==0)||(i13.u48.p162==1)))))))) + EG(((i12.i0.u53.p172==1)&&(((...1122
Reverse transition relation is NOT exact ! Due to transitions t173, t202, i2.u14.t123, i2.u14.t126, i2.u15.t124, i3.t139, i3.u8.t119, i3.u17.t120, i4.t114,...565
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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,5.59659,181264,1,0,389760,1893,2757,497811,377,9753,457147
FORMULA AutonomousCar-PT-03b-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 165 transition count 247
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 165 transition count 247
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 162 transition count 244
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 162 transition count 244
Applied a total of 40 rules in 4 ms. Remains 162 /182 variables (removed 20) and now considering 244/264 (removed 20) transitions.
// Phase 1: matrix 244 rows 162 cols
[2024-05-21 20:00:41] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 20:00:41] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 20:00:41] [INFO ] Invariant cache hit.
[2024-05-21 20:00:41] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-21 20:00:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 20:00:44] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 4 ms to minimize.
[2024-05-21 20:00:45] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:00:45] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2024-05-21 20:00:45] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-05-21 20:00:45] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-05-21 20:00:45] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 2 ms to minimize.
[2024-05-21 20:00:46] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 3 ms to minimize.
[2024-05-21 20:00:46] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
[2024-05-21 20:00:46] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-05-21 20:00:46] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 3 ms to minimize.
[2024-05-21 20:00:46] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-05-21 20:00:46] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
[2024-05-21 20:00:46] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 3 ms to minimize.
[2024-05-21 20:00:47] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 2 ms to minimize.
[2024-05-21 20:00:47] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-05-21 20:00:47] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
[2024-05-21 20:00:47] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 3 ms to minimize.
[2024-05-21 20:00:47] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:00:47] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 3 ms to minimize.
[2024-05-21 20:00:48] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 20:00:48] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 3 ms to minimize.
[2024-05-21 20:00:48] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 2 ms to minimize.
[2024-05-21 20:00:48] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-21 20:00:49] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-21 20:00:49] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 3 ms to minimize.
[2024-05-21 20:00:49] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-05-21 20:00:50] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-05-21 20:00:50] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 20:00:53] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2024-05-21 20:00:53] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-05-21 20:00:53] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 3 ms to minimize.
[2024-05-21 20:00:54] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 3 ms to minimize.
[2024-05-21 20:00:54] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 20:00:55] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 3 ms to minimize.
[2024-05-21 20:00:55] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:00:56] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 3 ms to minimize.
[2024-05-21 20:00:56] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:00:56] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2024-05-21 20:00:56] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 20:00:58] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-21 20:00:58] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
[2024-05-21 20:00:58] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 3 ms to minimize.
[2024-05-21 20:00:58] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 3 ms to minimize.
[2024-05-21 20:00:59] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-05-21 20:00:59] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 244/406 variables, 162/215 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 20:01:09] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/406 variables, and 216 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 20:01:14] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 20:01:16] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
[2024-05-21 20:01:16] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
[2024-05-21 20:01:16] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 244/406 variables, 162/220 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 243/463 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 20:01:23] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-21 20:01:24] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 0/406 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 465 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 52/52 constraints]
After SMT, in 60250ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Starting structural reductions in LTL mode, iteration 1 : 162/182 places, 244/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60531 ms. Remains : 162/182 places, 244/264 transitions.
[2024-05-21 20:01:41] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:01:41] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:01:41] [INFO ] Input system was already deterministic with 244 transitions.
[2024-05-21 20:01:41] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:01:41] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:01:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality12055684234802661363.gal : 3 ms
[2024-05-21 20:01:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality7307322099027696281.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12055684234802661363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7307322099027696281.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,7.89794e+07,2.12239,48444,2,7622,5,170113,6,0,894,214125,0


Converting to forward existential form...Done !
original formula: E(EG(AF(AX((p28!=1)))) U (EF(((p51==1) + !(((EX(((p30==0)||(p5==1))) + (p136==0)) + (p170==1))))) * ((EF(!(AX(((p13==0)||(p70==1))))) + (...177
=> equivalent forward existential formula: (([(EY(FwdU((FwdU(Init,EG(!(EG(!(!(EX(!((p28!=1))))))))) * E(TRUE U ((p51==1) + !(((EX(((p30==0)||(p5==1))) + (p...530
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t33, t36, t37, t39, t66, t67, t70, t71, t73, t86, t92, t93, t96, t97, t99...413
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 20:02:11] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:02:11] [INFO ] Applying decomposition
[2024-05-21 20:02:11] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8957524794062294289.txt' '-o' '/tmp/graph8957524794062294289.bin' '-w' '/tmp/graph8957524794062294289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8957524794062294289.bin' '-l' '-1' '-v' '-w' '/tmp/graph8957524794062294289.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:02:11] [INFO ] Decomposing Gal with order
[2024-05-21 20:02:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:02:11] [INFO ] Removed a total of 206 redundant transitions.
[2024-05-21 20:02:11] [INFO ] Flatten gal took : 19 ms
[2024-05-21 20:02:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2024-05-21 20:02:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality5034059745130836912.gal : 3 ms
[2024-05-21 20:02:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality13905770608677719372.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5034059745130836912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13905770608677719372.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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,7.89794e+07,0.152418,6556,433,105,4787,545,402,12809,84,1734,0


Converting to forward existential form...Done !
original formula: E(EG(AF(AX((i2.i1.u7.p28!=1)))) U (EF(((i3.u13.p51==1) + !(((EX(((i2.i0.u10.p30==0)||(i6.u46.p5==1))) + (i8.i1.u43.p136==0)) + (i11.i0.u5...262
=> equivalent forward existential formula: (([(EY(FwdU((FwdU(Init,EG(!(EG(!(!(EX(!((i2.i1.u7.p28!=1))))))))) * E(TRUE U ((i3.u13.p51==1) + !(((EX(((i2.i0.u...723
Reverse transition relation is NOT exact ! Due to transitions t146, t148, t212, t241, i1.t36, i1.u36.t33, i1.u36.t37, i1.u44.t39, i2.i1.t139, i2.i1.u7.t117...572
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
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
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
(forward)formula 0,1,4.28309,108724,1,0,206354,3164,3148,431799,490,27043,243763
FORMULA AutonomousCar-PT-03b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 264/264 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 161 transition count 243
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 161 transition count 243
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 78 place count 161 transition count 207
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 157 transition count 203
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 157 transition count 203
Applied a total of 86 rules in 4 ms. Remains 157 /182 variables (removed 25) and now considering 203/264 (removed 61) transitions.
// Phase 1: matrix 203 rows 157 cols
[2024-05-21 20:02:16] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 20:02:16] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 20:02:16] [INFO ] Invariant cache hit.
[2024-05-21 20:02:16] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-21 20:02:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 20:02:18] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 3 ms to minimize.
[2024-05-21 20:02:18] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-05-21 20:02:19] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-05-21 20:02:19] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-21 20:02:19] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 3 ms to minimize.
[2024-05-21 20:02:19] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:02:19] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:02:19] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-05-21 20:02:19] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-21 20:02:20] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 3 ms to minimize.
[2024-05-21 20:02:20] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 3 ms to minimize.
[2024-05-21 20:02:20] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:02:20] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 3 ms to minimize.
[2024-05-21 20:02:20] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 3 ms to minimize.
[2024-05-21 20:02:20] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
[2024-05-21 20:02:20] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-21 20:02:20] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
[2024-05-21 20:02:21] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:02:21] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 3 ms to minimize.
[2024-05-21 20:02:21] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 20:02:21] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 3 ms to minimize.
[2024-05-21 20:02:22] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
[2024-05-21 20:02:22] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:02:22] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:02:22] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-21 20:02:23] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-05-21 20:02:23] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 20:02:25] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:02:25] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:02:25] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 203/360 variables, 157/195 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 20:02:29] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 3 ms to minimize.
[2024-05-21 20:02:29] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 3 ms to minimize.
[2024-05-21 20:02:30] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 3 ms to minimize.
[2024-05-21 20:02:30] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2024-05-21 20:02:30] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 20:02:35] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-21 20:02:35] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/360 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (OVERLAPS) 0/360 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 202 constraints, problems are : Problem set: 0 solved, 202 unsolved in 26053 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 20:02:44] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:02:45] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 3 ms to minimize.
[2024-05-21 20:02:45] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 4 ms to minimize.
[2024-05-21 20:02:45] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/360 variables, 157/206 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 202/408 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-21 20:02:49] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (OVERLAPS) 0/360 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 409 constraints, problems are : Problem set: 0 solved, 202 unsolved in 20173 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 42/42 constraints]
After SMT, in 46319ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 46323ms
Starting structural reductions in LTL mode, iteration 1 : 157/182 places, 203/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46623 ms. Remains : 157/182 places, 203/264 transitions.
[2024-05-21 20:03:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:03:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:03:02] [INFO ] Input system was already deterministic with 203 transitions.
[2024-05-21 20:03:02] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:03:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:03:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality9717248956367542209.gal : 2 ms
[2024-05-21 20:03:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality3064393091299940943.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9717248956367542209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3064393091299940943.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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,5.5956e+07,1.94672,43464,2,6504,5,156669,6,0,833,202544,0


Converting to forward existential form...Done !
original formula: (AG(EF((p77==0))) * (EG((p11==0)) + EX(AX(((p84==1)||(((p106==0)&&(p183==1))&&((p169==0)&&(p22==1))))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (p77==0))))] = FALSE * [((Init * !(EX(!(EX(!(((p84==1)||(((p106==0)&&(p183==1))&...214
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t26, t34, t37, t38, t39, t65, t66, t69, t70, t72, t75, t86, t92, t93, t96, t97...376
Detected timeout of ITS tools.
[2024-05-21 20:03:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:03:32] [INFO ] Applying decomposition
[2024-05-21 20:03:32] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4547913287284652337.txt' '-o' '/tmp/graph4547913287284652337.bin' '-w' '/tmp/graph4547913287284652337.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4547913287284652337.bin' '-l' '-1' '-v' '-w' '/tmp/graph4547913287284652337.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:03:32] [INFO ] Decomposing Gal with order
[2024-05-21 20:03:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:03:32] [INFO ] Removed a total of 121 redundant transitions.
[2024-05-21 20:03:32] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:03:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2024-05-21 20:03:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality4074787672706902933.gal : 7 ms
[2024-05-21 20:03:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality4879629837861825500.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4074787672706902933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4879629837861825500.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,5.5956e+07,0.079994,5968,406,75,4199,562,402,6114,68,1484,0


Converting to forward existential form...Done !
original formula: (AG(EF((i6.u20.p77==0))) * (EG((i0.u3.p11==0)) + EX(AX(((i5.u27.p84==1)||(((i8.u38.p106==0)&&(i13.i2.u58.p183==1))&&((i13.i1.u54.p169==0)...181
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (i6.u20.p77==0))))] = FALSE * [((Init * !(EX(!(EX(!(((i5.u27.p84==1)||(((i8.u38....272
Reverse transition relation is NOT exact ! Due to transitions t148, t169, t181, t200, i0.t146, i0.t144, i1.i0.u45.t34, i1.i0.u45.t37, i1.i0.u45.t38, i1.i0....557
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,3.50673,120808,1,0,274222,1634,2537,305786,344,7835,333579
FORMULA AutonomousCar-PT-03b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-05-21 20:03:36] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:03:36] [INFO ] Flatten gal took : 6 ms
Total runtime 753142 ms.

BK_STOP 1716321816495

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-03b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="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-5568"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-03b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167300257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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