Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729800705.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is AutonomousCar-PT-07b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729800705
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 334K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748651556163

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-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-31 00:32:37] [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]
[2025-05-31 00:32:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:32:37] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-05-31 00:32:37] [INFO ] Transformed 323 places.
[2025-05-31 00:32:37] [INFO ] Transformed 846 transitions.
[2025-05-31 00:32:37] [INFO ] Found NUPN structural information;
[2025-05-31 00:32:37] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
FORMULA AutonomousCar-PT-07b-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 89 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 291 transition count 814
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 291 transition count 814
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 260 place count 291 transition count 618
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 265 place count 286 transition count 613
Iterating global reduction 1 with 5 rules applied. Total rules applied 270 place count 286 transition count 613
Applied a total of 270 rules in 76 ms. Remains 286 /323 variables (removed 37) and now considering 613/846 (removed 233) transitions.
// Phase 1: matrix 613 rows 286 cols
[2025-05-31 00:32:37] [INFO ] Computed 12 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:32:38] [INFO ] Implicit Places using invariants in 330 ms returned []
[2025-05-31 00:32:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:32:38] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Running 612 sub problems to find dead transitions.
[2025-05-31 00:32:38] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:47] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:48] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:48] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:48] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:48] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:49] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:49] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:49] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:49] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:49] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:50] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:50] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:50] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:50] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:50] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:51] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:51] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:51] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:51] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:51] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:52] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:52] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:52] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:53] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:53] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:53] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:53] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:53] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:53] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:54] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:54] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:54] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:54] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:54] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:55] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:55] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:55] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:55] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:56] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:56] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:59] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:00] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:00] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:00] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:00] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:00] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:00] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:01] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:01] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:01] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:01] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:01] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:01] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:01] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:02] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:02] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:02] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:02] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:02] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:02] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:04] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:04] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:04] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:04] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:05] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:05] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:05] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:05] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:05] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:06] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:06] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:06] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:06] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:06] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:06] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:07] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:07] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:07] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:07] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:07] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:08] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:08] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:09] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:09] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:09] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:09] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 17 ms to minimize.
SMT process timed out in 31054ms, After SMT, problems are : Problem set: 0 solved, 612 unsolved
Search for dead transitions found 0 dead transitions in 31070ms
Starting structural reductions in LTL mode, iteration 1 : 286/323 places, 613/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31916 ms. Remains : 286/323 places, 613/846 transitions.
Support contains 89 out of 286 places after structural reductions.
[2025-05-31 00:33:09] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-05-31 00:33:09] [INFO ] Flatten gal took : 92 ms
[2025-05-31 00:33:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-07b-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 00:33:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-07b-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 00:33:09] [INFO ] Flatten gal took : 54 ms
[2025-05-31 00:33:09] [INFO ] Input system was already deterministic with 613 transitions.
Support contains 62 out of 286 places (down from 89) after GAL structural reductions.
RANDOM walk for 40000 steps (341 resets) in 1115 ms. (35 steps per ms) remains 0/41 properties
[2025-05-31 00:33:10] [INFO ] Flatten gal took : 36 ms
[2025-05-31 00:33:10] [INFO ] Flatten gal took : 35 ms
[2025-05-31 00:33:10] [INFO ] Input system was already deterministic with 613 transitions.
Computed a total of 48 stabilizing places and 49 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 613/613 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 272 transition count 599
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 272 transition count 599
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 270 transition count 597
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 270 transition count 597
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 269 transition count 596
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 269 transition count 596
Applied a total of 34 rules in 28 ms. Remains 269 /286 variables (removed 17) and now considering 596/613 (removed 17) transitions.
// Phase 1: matrix 596 rows 269 cols
[2025-05-31 00:33:10] [INFO ] Computed 12 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:10] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-05-31 00:33:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:10] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 595 sub problems to find dead transitions.
[2025-05-31 00:33:10] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:19] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:19] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:19] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:19] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:19] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:19] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:20] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:20] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:20] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:20] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:20] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:21] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:21] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:21] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:21] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:21] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:21] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:22] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:22] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:22] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:22] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:23] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:23] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:23] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:23] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:23] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:23] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:24] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:24] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:24] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:24] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:24] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:24] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:25] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:25] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:25] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:25] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:25] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:25] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:25] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:28] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:29] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:29] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:30] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:30] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:30] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:30] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:30] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:30] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:30] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:30] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:30] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:31] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:31] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:31] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:31] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:31] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:31] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:31] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:31] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:32] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:33] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:33] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:33] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:34] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:34] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:34] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:34] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:34] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:34] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:34] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:34] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:35] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:35] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:35] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 15/87 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:38] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:39] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/865 variables, and 89 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/269 constraints, PredecessorRefiner: 595/397 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 595 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:45] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:45] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:46] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:46] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:46] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:46] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:47] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:47] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:47] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:47] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:48] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:48] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:48] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:48] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 5 (OVERLAPS) 596/865 variables, 269/372 constraints. Problems are: Problem set: 2 solved, 593 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 395/767 constraints. Problems are: Problem set: 2 solved, 593 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:07] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:08] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:08] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:08] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:09] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 865/865 variables, and 772 constraints, problems are : Problem set: 2 solved, 593 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 593/397 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60742ms problems are : Problem set: 2 solved, 593 unsolved
Search for dead transitions found 2 dead transitions in 60745ms
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 : 269/286 places, 594/613 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 268 transition count 594
Applied a total of 1 rules in 9 ms. Remains 268 /269 variables (removed 1) and now considering 594/594 (removed 0) transitions.
// Phase 1: matrix 594 rows 268 cols
[2025-05-31 00:34:11] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:34:11] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-31 00:34:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:34:12] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 268/286 places, 594/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61715 ms. Remains : 268/286 places, 594/613 transitions.
[2025-05-31 00:34:12] [INFO ] Flatten gal took : 29 ms
[2025-05-31 00:34:12] [INFO ] Flatten gal took : 28 ms
[2025-05-31 00:34:12] [INFO ] Input system was already deterministic with 594 transitions.
[2025-05-31 00:34:12] [INFO ] Flatten gal took : 26 ms
[2025-05-31 00:34:12] [INFO ] Flatten gal took : 26 ms
[2025-05-31 00:34:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality8346301015543129470.gal : 21 ms
[2025-05-31 00:34:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality15102447369946794041.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8346301015543129470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15102447369946794041.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 00:34:42] [INFO ] Flatten gal took : 27 ms
[2025-05-31 00:34:42] [INFO ] Applying decomposition
[2025-05-31 00:34:42] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15401966282449413299.txt' '-o' '/tmp/graph15401966282449413299.bin' '-w' '/tmp/graph15401966282449413299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15401966282449413299.bin' '-l' '-1' '-v' '-w' '/tmp/graph15401966282449413299.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:34:42] [INFO ] Decomposing Gal with order
[2025-05-31 00:34:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:34:42] [INFO ] Removed a total of 1619 redundant transitions.
[2025-05-31 00:34:42] [INFO ] Flatten gal took : 109 ms
[2025-05-31 00:34:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 16 ms.
[2025-05-31 00:34:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality1650716943294335824.gal : 6 ms
[2025-05-31 00:34:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality1086666271428774022.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1650716943294335824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1086666271428774022.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 613/613 transitions.
Graph (trivial) has 271 edges and 286 vertex of which 4 / 286 are part of one of the 2 SCC in 2 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 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 283 transition count 493
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 157 rules applied. Total rules applied 275 place count 166 transition count 453
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 298 place count 143 transition count 453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 298 place count 143 transition count 446
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 312 place count 136 transition count 446
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 321 place count 127 transition count 437
Iterating global reduction 3 with 9 rules applied. Total rules applied 330 place count 127 transition count 437
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 330 place count 127 transition count 436
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 126 transition count 436
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 334 place count 124 transition count 428
Iterating global reduction 3 with 2 rules applied. Total rules applied 336 place count 124 transition count 428
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 3 with 2 rules applied. Total rules applied 338 place count 124 transition count 426
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 123 transition count 426
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 425 place count 80 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 426 place count 80 transition count 382
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 438 place count 68 transition count 291
Iterating global reduction 6 with 12 rules applied. Total rules applied 450 place count 68 transition count 291
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 6 with 10 rules applied. Total rules applied 460 place count 68 transition count 281
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 465 place count 63 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 467 place count 62 transition count 280
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 468 place count 62 transition count 279
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 469 place count 62 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 471 place count 60 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 472 place count 59 transition count 277
Applied a total of 472 rules in 157 ms. Remains 59 /286 variables (removed 227) and now considering 277/613 (removed 336) transitions.
// Phase 1: matrix 277 rows 59 cols
[2025-05-31 00:35:13] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:13] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-31 00:35:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:35:13] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [52, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 221 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/286 places, 277/613 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 57 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 276
Applied a total of 2 rules in 18 ms. Remains 56 /57 variables (removed 1) and now considering 276/277 (removed 1) transitions.
// Phase 1: matrix 276 rows 56 cols
[2025-05-31 00:35:13] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:13] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-31 00:35:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:35:13] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 56/286 places, 276/613 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 591 ms. Remains : 56/286 places, 276/613 transitions.
[2025-05-31 00:35:13] [INFO ] Flatten gal took : 26 ms
[2025-05-31 00:35:13] [INFO ] Flatten gal took : 21 ms
[2025-05-31 00:35:13] [INFO ] Input system was already deterministic with 276 transitions.
[2025-05-31 00:35:13] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:35:13] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:35:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality186052271845371126.gal : 3 ms
[2025-05-31 00:35:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality12686350024672982239.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality186052271845371126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12686350024672982239.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.21808e+07,1.56673,57328,2,3699,5,118487,6,0,497,144691,0


Converting to forward existential form...Done !
original formula: EG(AF((AG((p192==1)) + (p209==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((!(E(TRUE U !((p192==1)))) + (p209==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t6, t8, t10, t12, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t36, ...962
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,24.7237,656772,1,0,1375,1.64498e+06,585,675,12201,2.6512e+06,1095
FORMULA AutonomousCar-PT-07b-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 613/613 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 267 transition count 594
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 267 transition count 594
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 265 transition count 592
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 264 transition count 591
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 264 transition count 591
Applied a total of 44 rules in 21 ms. Remains 264 /286 variables (removed 22) and now considering 591/613 (removed 22) transitions.
// Phase 1: matrix 591 rows 264 cols
[2025-05-31 00:35:38] [INFO ] Computed 12 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:38] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-31 00:35:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:39] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2025-05-31 00:35:39] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:47] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:47] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:47] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:47] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:47] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:48] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:48] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:48] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:48] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:49] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:49] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:49] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:49] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:49] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:49] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:50] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:50] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:50] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:50] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:50] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:51] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:51] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:51] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:51] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:52] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:52] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:52] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:52] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:53] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:53] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:53] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:53] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:53] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:53] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:54] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:54] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:54] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:54] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:54] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:54] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:58] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:58] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:58] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:59] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:59] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:59] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:59] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:59] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:59] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:00] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:00] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:00] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:00] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:00] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:01] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:01] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:01] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:01] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:02] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:02] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:03] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:03] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:03] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:03] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:03] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:03] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:03] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:04] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:04] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:04] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:04] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:04] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:04] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:04] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:04] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:05] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:05] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:05] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:05] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:05] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:06] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:06] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:06] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:07] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:07] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:07] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:07] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:08] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:08] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:08] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:09] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:09] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 104 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/392 constraints, Known Traps: 92/92 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 92/104 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:13] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:13] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:14] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:14] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:14] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:14] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:14] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:15] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:15] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:15] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:15] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:15] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:18] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:18] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 14/118 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD452 is UNSAT
At refinement iteration 5 (OVERLAPS) 591/855 variables, 264/382 constraints. Problems are: Problem set: 2 solved, 588 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 390/772 constraints. Problems are: Problem set: 2 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 855/855 variables, and 772 constraints, problems are : Problem set: 2 solved, 588 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 588/392 constraints, Known Traps: 106/106 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60661ms problems are : Problem set: 2 solved, 588 unsolved
Search for dead transitions found 2 dead transitions in 60664ms
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 : 264/286 places, 589/613 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 263 transition count 589
Applied a total of 1 rules in 6 ms. Remains 263 /264 variables (removed 1) and now considering 589/589 (removed 0) transitions.
// Phase 1: matrix 589 rows 263 cols
[2025-05-31 00:36:39] [INFO ] Computed 12 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:36:39] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-31 00:36:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:36:40] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/286 places, 589/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61615 ms. Remains : 263/286 places, 589/613 transitions.
[2025-05-31 00:36:40] [INFO ] Flatten gal took : 22 ms
[2025-05-31 00:36:40] [INFO ] Flatten gal took : 22 ms
[2025-05-31 00:36:40] [INFO ] Input system was already deterministic with 589 transitions.
[2025-05-31 00:36:40] [INFO ] Flatten gal took : 22 ms
[2025-05-31 00:36:40] [INFO ] Flatten gal took : 21 ms
[2025-05-31 00:36:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality1164605525876889381.gal : 5 ms
[2025-05-31 00:36:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality13253494403719503770.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1164605525876889381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13253494403719503770.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 00:37:10] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:37:10] [INFO ] Applying decomposition
[2025-05-31 00:37:10] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1503314334333037514.txt' '-o' '/tmp/graph1503314334333037514.bin' '-w' '/tmp/graph1503314334333037514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1503314334333037514.bin' '-l' '-1' '-v' '-w' '/tmp/graph1503314334333037514.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:37:10] [INFO ] Decomposing Gal with order
[2025-05-31 00:37:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:37:10] [INFO ] Removed a total of 1617 redundant transitions.
[2025-05-31 00:37:10] [INFO ] Flatten gal took : 48 ms
[2025-05-31 00:37:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 10 ms.
[2025-05-31 00:37:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality12880905245349384687.gal : 3 ms
[2025-05-31 00:37:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality3183004939778487933.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12880905245349384687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3183004939778487933.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 613/613 transitions.
Graph (trivial) has 270 edges and 286 vertex of which 4 / 286 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 283 transition count 493
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 157 rules applied. Total rules applied 275 place count 166 transition count 453
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 298 place count 143 transition count 453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 298 place count 143 transition count 446
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 312 place count 136 transition count 446
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 321 place count 127 transition count 437
Iterating global reduction 3 with 9 rules applied. Total rules applied 330 place count 127 transition count 437
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 330 place count 127 transition count 436
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 126 transition count 436
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 333 place count 125 transition count 435
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 125 transition count 435
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 422 place count 81 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 423 place count 81 transition count 390
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 436 place count 68 transition count 292
Iterating global reduction 4 with 13 rules applied. Total rules applied 449 place count 68 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 with 12 rules applied. Total rules applied 461 place count 68 transition count 280
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 467 place count 62 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 469 place count 61 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 470 place count 61 transition count 278
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 471 place count 61 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 473 place count 59 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 474 place count 58 transition count 276
Applied a total of 474 rules in 90 ms. Remains 58 /286 variables (removed 228) and now considering 276/613 (removed 337) transitions.
// Phase 1: matrix 276 rows 58 cols
[2025-05-31 00:37:40] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:37:40] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-31 00:37:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:37:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:37:41] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [51, 57]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 197 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 56/286 places, 276/613 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 56 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 55 transition count 275
Applied a total of 2 rules in 15 ms. Remains 55 /56 variables (removed 1) and now considering 275/276 (removed 1) transitions.
// Phase 1: matrix 275 rows 55 cols
[2025-05-31 00:37:41] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:37:41] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-05-31 00:37:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:37:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:37:41] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 55/286 places, 275/613 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 498 ms. Remains : 55/286 places, 275/613 transitions.
[2025-05-31 00:37:41] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:37:41] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:37:41] [INFO ] Input system was already deterministic with 275 transitions.
[2025-05-31 00:37:41] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:37:41] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:37:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality15238542049708318515.gal : 3 ms
[2025-05-31 00:37:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality2367068727314151623.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15238542049708318515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2367068727314151623.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.32526e+07,1.67739,56948,2,3655,5,137987,6,0,493,167615,0


Converting to forward existential form...Done !
original formula: EG(((p127==0)||(p147==1)))
=> equivalent forward existential formula: [FwdG(Init,((p127==0)||(p147==1)))] != FALSE
Hit Full ! (commute/partial/dont) 201/0/74
(forward)formula 0,0,5.53012,135964,1,0,96,370119,19,3,6661,400060,95
FORMULA AutonomousCar-PT-07b-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 613/613 transitions.
Graph (trivial) has 268 edges and 286 vertex of which 4 / 286 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 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 283 transition count 496
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 151 rules applied. Total rules applied 266 place count 169 transition count 459
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 287 place count 148 transition count 459
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 287 place count 148 transition count 451
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 303 place count 140 transition count 451
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 313 place count 130 transition count 441
Iterating global reduction 3 with 10 rules applied. Total rules applied 323 place count 130 transition count 441
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 3 with 2 rules applied. Total rules applied 325 place count 130 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 326 place count 129 transition count 439
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 328 place count 127 transition count 431
Iterating global reduction 5 with 2 rules applied. Total rules applied 330 place count 127 transition count 431
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 332 place count 127 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 333 place count 126 transition count 429
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 7 with 90 rules applied. Total rules applied 423 place count 81 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 424 place count 81 transition count 383
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 437 place count 68 transition count 285
Iterating global reduction 8 with 13 rules applied. Total rules applied 450 place count 68 transition count 285
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 8 with 10 rules applied. Total rules applied 460 place count 68 transition count 275
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 465 place count 63 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 467 place count 62 transition count 274
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 468 place count 62 transition count 273
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 470 place count 60 transition count 271
Applied a total of 470 rules in 59 ms. Remains 60 /286 variables (removed 226) and now considering 271/613 (removed 342) transitions.
// Phase 1: matrix 271 rows 60 cols
[2025-05-31 00:37:47] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:37:47] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-31 00:37:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:37:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:37:47] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [53, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 211 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 58/286 places, 271/613 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 58 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 57 transition count 270
Applied a total of 2 rules in 17 ms. Remains 57 /58 variables (removed 1) and now considering 270/271 (removed 1) transitions.
// Phase 1: matrix 270 rows 57 cols
[2025-05-31 00:37:47] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:37:47] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-31 00:37:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:37:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:37:47] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 57/286 places, 270/613 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 483 ms. Remains : 57/286 places, 270/613 transitions.
[2025-05-31 00:37:47] [INFO ] Flatten gal took : 32 ms
[2025-05-31 00:37:47] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:37:47] [INFO ] Input system was already deterministic with 270 transitions.
[2025-05-31 00:37:47] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:37:47] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:37:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality2895604659288817789.gal : 3 ms
[2025-05-31 00:37:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality1511238269404513854.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2895604659288817789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1511238269404513854.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 00:38:17] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:38:17] [INFO ] Applying decomposition
[2025-05-31 00:38:17] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16779750934243965899.txt' '-o' '/tmp/graph16779750934243965899.bin' '-w' '/tmp/graph16779750934243965899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16779750934243965899.bin' '-l' '-1' '-v' '-w' '/tmp/graph16779750934243965899.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:38:17] [INFO ] Decomposing Gal with order
[2025-05-31 00:38:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:38:17] [INFO ] Removed a total of 1289 redundant transitions.
[2025-05-31 00:38:17] [INFO ] Flatten gal took : 24 ms
[2025-05-31 00:38:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 9 ms.
[2025-05-31 00:38:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality174782543730424721.gal : 1 ms
[2025-05-31 00:38:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality14151687299202008551.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality174782543730424721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14151687299202008551.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2.78214e+07,1.03069,38944,906,44,87437,633,540,111891,65,2657,0


Converting to forward existential form...Done !
original formula: EG(((i0.u0.p6==0)||(i3.u5.p105==1)))
=> equivalent forward existential formula: [FwdG(Init,((i0.u0.p6==0)||(i3.u5.p105==1)))] != FALSE
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,1.91794,52000,1,0,87437,633,3229,337147,285,2657,170540
FORMULA AutonomousCar-PT-07b-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 613/613 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 269 transition count 596
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 269 transition count 596
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 267 transition count 594
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 267 transition count 594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 266 transition count 593
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 266 transition count 593
Applied a total of 40 rules in 13 ms. Remains 266 /286 variables (removed 20) and now considering 593/613 (removed 20) transitions.
// Phase 1: matrix 593 rows 266 cols
[2025-05-31 00:38:19] [INFO ] Computed 12 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:19] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-31 00:38:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:20] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2025-05-31 00:38:20] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:28] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:28] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:28] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:28] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:29] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:29] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:29] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:29] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:29] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:30] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:30] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:30] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:30] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:30] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:30] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:31] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:31] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:31] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:31] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:32] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:32] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:32] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:33] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:33] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:33] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:33] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:33] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:34] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:34] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:34] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:34] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:35] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:35] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:35] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:35] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:36] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:36] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:36] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:36] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:36] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:39] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:40] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:40] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:40] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:41] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:41] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:41] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:41] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:41] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:42] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:42] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:42] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:42] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:42] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:46] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:46] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:47] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:47] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:47] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:47] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:47] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:47] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:47] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:47] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:48] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:48] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:48] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:48] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:48] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:48] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:49] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/859 variables, and 83 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 592/394 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:54] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:54] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:54] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:54] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:54] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:54] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:55] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:55] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:55] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:55] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:55] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:38:56] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 12/95 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 5 (OVERLAPS) 593/859 variables, 266/361 constraints. Problems are: Problem set: 2 solved, 590 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/859 variables, 392/753 constraints. Problems are: Problem set: 2 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/859 variables, and 753 constraints, problems are : Problem set: 2 solved, 590 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 590/394 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60666ms problems are : Problem set: 2 solved, 590 unsolved
Search for dead transitions found 2 dead transitions in 60668ms
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 : 266/286 places, 591/613 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 265 transition count 591
Applied a total of 1 rules in 5 ms. Remains 265 /266 variables (removed 1) and now considering 591/591 (removed 0) transitions.
// Phase 1: matrix 591 rows 265 cols
[2025-05-31 00:39:20] [INFO ] Computed 12 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:39:20] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-05-31 00:39:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:39:21] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 265/286 places, 591/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61588 ms. Remains : 265/286 places, 591/613 transitions.
[2025-05-31 00:39:21] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:39:21] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:39:21] [INFO ] Input system was already deterministic with 591 transitions.
[2025-05-31 00:39:21] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:39:21] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:39:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality3673686854712012721.gal : 4 ms
[2025-05-31 00:39:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality5983056948418388773.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3673686854712012721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5983056948418388773.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 00:39:51] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:39:51] [INFO ] Applying decomposition
[2025-05-31 00:39:51] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4529015046481225346.txt' '-o' '/tmp/graph4529015046481225346.bin' '-w' '/tmp/graph4529015046481225346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4529015046481225346.bin' '-l' '-1' '-v' '-w' '/tmp/graph4529015046481225346.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:39:51] [INFO ] Decomposing Gal with order
[2025-05-31 00:39:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:39:51] [INFO ] Removed a total of 1623 redundant transitions.
[2025-05-31 00:39:51] [INFO ] Flatten gal took : 40 ms
[2025-05-31 00:39:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 5 ms.
[2025-05-31 00:39:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality16048437051931005399.gal : 2 ms
[2025-05-31 00:39:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality10868994050467578013.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16048437051931005399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10868994050467578013.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 613/613 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 268 transition count 595
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 268 transition count 595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 266 transition count 593
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 266 transition count 593
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 265 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 265 transition count 592
Applied a total of 42 rules in 12 ms. Remains 265 /286 variables (removed 21) and now considering 592/613 (removed 21) transitions.
// Phase 1: matrix 592 rows 265 cols
[2025-05-31 00:40:21] [INFO ] Computed 12 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:21] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-05-31 00:40:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:22] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2025-05-31 00:40:22] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:30] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:30] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:30] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:30] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:31] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:31] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:31] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:31] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:31] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:32] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:32] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:32] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:32] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:32] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:33] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:33] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:33] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:33] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:33] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:34] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:34] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:34] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:34] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:35] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:35] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:35] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:35] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:36] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:36] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:36] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:36] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:36] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:37] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:37] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:37] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:37] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:37] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:37] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:37] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:38] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:41] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:42] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:42] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:42] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:42] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:42] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:42] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:43] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:43] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:43] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:43] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:43] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:43] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:43] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:44] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:44] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:44] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:44] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:44] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:44] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:45] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:45] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:45] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:46] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:46] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:46] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:46] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:46] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:46] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:46] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:47] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:47] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:47] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:47] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:48] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:48] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:48] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:48] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:48] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:49] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:49] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:50] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:50] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:51] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:51] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:51] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:51] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:51] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:52] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:52] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:52] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:52] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:52] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:52] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 19 ms to minimize.
SMT process timed out in 30728ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 30729ms
Starting structural reductions in LTL mode, iteration 1 : 265/286 places, 592/613 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31164 ms. Remains : 265/286 places, 592/613 transitions.
[2025-05-31 00:40:52] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:40:52] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:40:53] [INFO ] Input system was already deterministic with 592 transitions.
[2025-05-31 00:40:53] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:40:53] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:40:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality3523946727360683076.gal : 4 ms
[2025-05-31 00:40:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality6723300021306928116.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3523946727360683076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6723300021306928116.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 00:41:23] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:41:23] [INFO ] Applying decomposition
[2025-05-31 00:41:23] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12481524032893645894.txt' '-o' '/tmp/graph12481524032893645894.bin' '-w' '/tmp/graph12481524032893645894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12481524032893645894.bin' '-l' '-1' '-v' '-w' '/tmp/graph12481524032893645894.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:41:23] [INFO ] Decomposing Gal with order
[2025-05-31 00:41:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:41:23] [INFO ] Removed a total of 1633 redundant transitions.
[2025-05-31 00:41:23] [INFO ] Flatten gal took : 38 ms
[2025-05-31 00:41:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 9 ms.
[2025-05-31 00:41:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality6283802638472395666.gal : 4 ms
[2025-05-31 00:41:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality5021894862895839909.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6283802638472395666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5021894862895839909.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2.81943e+13,4.26468,153228,16492,139,331888,2595,676,318871,93,9844,0


Converting to forward existential form...Done !
original formula: AX(AG((((i7.i1.u39.p127==0) + ((AF(((i18.u86.p278==0)&&(i10.u47.p153==1))) * (i1.i3.u98.p318==0)) * (i10.u46.p152==1))) + ((AG((i3.i0.u12...214
=> equivalent forward existential formula: (([(FwdU((FwdU(EY(Init),TRUE) * !(((i7.i1.u39.p127==0) + ((!(EG(!(((i18.u86.p278==0)&&(i10.u47.p153==1))))) * (i...610
Reverse transition relation is NOT exact ! Due to transitions t249, t251, t253, t281, t309, t358, t386, t442, t589, i1.i2.t25, i2.u16.t226, i2.u16.t229, i2...944
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 613/613 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 268 transition count 595
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 268 transition count 595
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 267 transition count 594
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 267 transition count 594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 266 transition count 593
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 266 transition count 593
Applied a total of 40 rules in 22 ms. Remains 266 /286 variables (removed 20) and now considering 593/613 (removed 20) transitions.
// Phase 1: matrix 593 rows 266 cols
[2025-05-31 00:41:53] [INFO ] Computed 12 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:41:53] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-05-31 00:41:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:41:53] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2025-05-31 00:41:53] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:02] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:02] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:02] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:02] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:02] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:02] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:03] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:03] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:03] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:03] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:03] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:03] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:04] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:04] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:04] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:04] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:04] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:05] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:05] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:05] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:05] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:06] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:06] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:06] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:06] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:06] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:07] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:07] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:07] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:07] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:08] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:08] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:11] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:15] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:15] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:15] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:16] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:16] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:16] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:17] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:17] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:17] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:17] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:17] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/859 variables, and 56 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 592/394 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:28] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:28] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:28] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:29] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:29] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:29] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:29] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:30] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:30] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:34] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:34] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:34] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:34] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:34] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:35] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:35] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:35] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:35] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:35] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:36] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:36] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:36] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:36] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:36] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:36] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:36] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:37] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:37] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:37] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 6 (OVERLAPS) 593/859 variables, 266/351 constraints. Problems are: Problem set: 2 solved, 590 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/859 variables, 392/743 constraints. Problems are: Problem set: 2 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/859 variables, and 743 constraints, problems are : Problem set: 2 solved, 590 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 590/394 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60689ms problems are : Problem set: 2 solved, 590 unsolved
Search for dead transitions found 2 dead transitions in 60692ms
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 : 266/286 places, 591/613 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 265 transition count 591
Applied a total of 1 rules in 4 ms. Remains 265 /266 variables (removed 1) and now considering 591/591 (removed 0) transitions.
// Phase 1: matrix 591 rows 265 cols
[2025-05-31 00:42:54] [INFO ] Computed 12 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:42:54] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-31 00:42:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:42:54] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 265/286 places, 591/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61603 ms. Remains : 265/286 places, 591/613 transitions.
[2025-05-31 00:42:55] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:42:55] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:42:55] [INFO ] Input system was already deterministic with 591 transitions.
[2025-05-31 00:42:55] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:42:55] [INFO ] Flatten gal took : 23 ms
[2025-05-31 00:42:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality3310070715262698214.gal : 4 ms
[2025-05-31 00:42:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality8815144931731331409.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3310070715262698214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8815144931731331409.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 00:43:25] [INFO ] Flatten gal took : 22 ms
[2025-05-31 00:43:25] [INFO ] Applying decomposition
[2025-05-31 00:43:25] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16696709412578330204.txt' '-o' '/tmp/graph16696709412578330204.bin' '-w' '/tmp/graph16696709412578330204.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16696709412578330204.bin' '-l' '-1' '-v' '-w' '/tmp/graph16696709412578330204.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:43:25] [INFO ] Decomposing Gal with order
[2025-05-31 00:43:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:43:25] [INFO ] Removed a total of 1607 redundant transitions.
[2025-05-31 00:43:25] [INFO ] Flatten gal took : 36 ms
[2025-05-31 00:43:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 4 ms.
[2025-05-31 00:43:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality9809517444652663554.gal : 2 ms
[2025-05-31 00:43:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality6335372753167037071.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9809517444652663554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6335372753167037071.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 613/613 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 268 transition count 595
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 268 transition count 595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 266 transition count 593
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 266 transition count 593
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 265 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 265 transition count 592
Applied a total of 42 rules in 13 ms. Remains 265 /286 variables (removed 21) and now considering 592/613 (removed 21) transitions.
// Phase 1: matrix 592 rows 265 cols
[2025-05-31 00:43:55] [INFO ] Computed 12 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:43:55] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-05-31 00:43:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:43:55] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2025-05-31 00:43:55] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:03] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:04] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:04] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:04] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:04] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:05] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:05] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:05] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:05] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:05] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:06] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:06] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:06] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:06] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:06] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:06] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:07] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:07] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:07] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:07] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:08] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:08] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:08] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:08] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:09] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:09] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:09] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:09] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:09] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:09] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:10] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:10] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:10] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:10] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:11] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:11] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:11] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:11] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:11] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:12] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:15] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:15] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:15] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:15] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:16] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:16] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:16] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:16] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:17] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:17] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:17] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:17] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:17] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:18] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:18] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:18] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:18] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:18] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:19] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:22] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:22] [INFO ] Deduced a trap composed of 41 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:23] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:23] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:23] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 265/857 variables, and 76 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/265 constraints, PredecessorRefiner: 591/393 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:29] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:30] [INFO ] Deduced a trap composed of 63 places in 160 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:30] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:31] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:31] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:31] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:31] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:31] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:31] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:31] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:32] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:32] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 12/88 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:36] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:36] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:36] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:41] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:41] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:41] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:41] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:41] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:41] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:41] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:41] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:42] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:42] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:42] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:42] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:42] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:42] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:42] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:43] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD452 is UNSAT
At refinement iteration 7 (OVERLAPS) 592/857 variables, 265/372 constraints. Problems are: Problem set: 2 solved, 589 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/857 variables, 391/763 constraints. Problems are: Problem set: 2 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 857/857 variables, and 763 constraints, problems are : Problem set: 2 solved, 589 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 589/393 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60686ms problems are : Problem set: 2 solved, 589 unsolved
Search for dead transitions found 2 dead transitions in 60689ms
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 : 265/286 places, 590/613 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 264 transition count 590
Applied a total of 1 rules in 4 ms. Remains 264 /265 variables (removed 1) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 264 cols
[2025-05-31 00:44:56] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:44:56] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-31 00:44:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:44:57] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 264/286 places, 590/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61601 ms. Remains : 264/286 places, 590/613 transitions.
[2025-05-31 00:44:57] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:44:57] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:44:57] [INFO ] Input system was already deterministic with 590 transitions.
[2025-05-31 00:44:57] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:44:57] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:44:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality11534954440921506923.gal : 3 ms
[2025-05-31 00:44:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality14352150787030656379.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11534954440921506923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14352150787030656379.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 00:45:27] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:45:27] [INFO ] Applying decomposition
[2025-05-31 00:45:27] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5967208092700897992.txt' '-o' '/tmp/graph5967208092700897992.bin' '-w' '/tmp/graph5967208092700897992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5967208092700897992.bin' '-l' '-1' '-v' '-w' '/tmp/graph5967208092700897992.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:45:27] [INFO ] Decomposing Gal with order
[2025-05-31 00:45:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:45:27] [INFO ] Removed a total of 1625 redundant transitions.
[2025-05-31 00:45:27] [INFO ] Flatten gal took : 34 ms
[2025-05-31 00:45:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 4 ms.
[2025-05-31 00:45:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality1180269432225423314.gal : 2 ms
[2025-05-31 00:45:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality7799146149905160273.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1180269432225423314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7799146149905160273.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 613/613 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 266 transition count 593
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 266 transition count 593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 264 transition count 591
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 263 transition count 590
Applied a total of 46 rules in 19 ms. Remains 263 /286 variables (removed 23) and now considering 590/613 (removed 23) transitions.
// Phase 1: matrix 590 rows 263 cols
[2025-05-31 00:45:57] [INFO ] Computed 12 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:57] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-31 00:45:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:57] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2025-05-31 00:45:57] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:06] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:06] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:06] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:06] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:06] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:06] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:07] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:07] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:07] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:07] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:07] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:07] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:07] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:08] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:08] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:08] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:08] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:08] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:09] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:09] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:09] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:09] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:10] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:10] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:10] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:10] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:11] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:11] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:11] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:11] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:11] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:12] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:12] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:12] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:12] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:13] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:13] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:13] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:13] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:13] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:17] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:18] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:18] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:18] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:18] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:19] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:19] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:19] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:21] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:21] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:22] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:23] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:23] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:23] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:23] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:23] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:23] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:24] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:24] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:24] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:24] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:24] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:24] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:25] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:25] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:25] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 78 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/391 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:31] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:33] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:37] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:38] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD451 is UNSAT
At refinement iteration 6 (OVERLAPS) 590/853 variables, 263/345 constraints. Problems are: Problem set: 2 solved, 587 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 389/734 constraints. Problems are: Problem set: 2 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 853/853 variables, and 734 constraints, problems are : Problem set: 2 solved, 587 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 587/391 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60656ms problems are : Problem set: 2 solved, 587 unsolved
Search for dead transitions found 2 dead transitions in 60660ms
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 : 263/286 places, 588/613 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 588
Applied a total of 1 rules in 4 ms. Remains 262 /263 variables (removed 1) and now considering 588/588 (removed 0) transitions.
// Phase 1: matrix 588 rows 262 cols
[2025-05-31 00:46:58] [INFO ] Computed 12 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:46:58] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-05-31 00:46:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:46:59] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 262/286 places, 588/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61550 ms. Remains : 262/286 places, 588/613 transitions.
[2025-05-31 00:46:59] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:46:59] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:46:59] [INFO ] Input system was already deterministic with 588 transitions.
[2025-05-31 00:46:59] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:46:59] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:46:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality10961724308274592124.gal : 4 ms
[2025-05-31 00:46:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality1671830862609465844.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10961724308274592124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1671830862609465844.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 00:47:29] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:47:29] [INFO ] Applying decomposition
[2025-05-31 00:47:29] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3984942524134155976.txt' '-o' '/tmp/graph3984942524134155976.bin' '-w' '/tmp/graph3984942524134155976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3984942524134155976.bin' '-l' '-1' '-v' '-w' '/tmp/graph3984942524134155976.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:47:29] [INFO ] Decomposing Gal with order
[2025-05-31 00:47:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:47:29] [INFO ] Removed a total of 1618 redundant transitions.
[2025-05-31 00:47:29] [INFO ] Flatten gal took : 35 ms
[2025-05-31 00:47:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 4 ms.
[2025-05-31 00:47:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality8991035136249158362.gal : 3 ms
[2025-05-31 00:47:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality13986867224622185537.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8991035136249158362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13986867224622185537.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2.70292e+13,3.69509,158352,9178,121,358186,1832,664,792297,91,12688,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,3.71329,158352,1,0,358186,1832,896,792297,116,12688,972
FORMULA AutonomousCar-PT-07b-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 613/613 transitions.
Graph (trivial) has 265 edges and 286 vertex of which 4 / 286 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 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 283 transition count 497
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 148 rules applied. Total rules applied 262 place count 170 transition count 462
Reduce places removed 18 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 21 rules applied. Total rules applied 283 place count 152 transition count 459
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 286 place count 149 transition count 459
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 286 place count 149 transition count 452
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 300 place count 142 transition count 452
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 308 place count 134 transition count 444
Iterating global reduction 4 with 8 rules applied. Total rules applied 316 place count 134 transition count 444
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 316 place count 134 transition count 443
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 318 place count 133 transition count 443
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 320 place count 131 transition count 435
Iterating global reduction 4 with 2 rules applied. Total rules applied 322 place count 131 transition count 435
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 4 with 2 rules applied. Total rules applied 324 place count 131 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 325 place count 130 transition count 433
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 415 place count 85 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 416 place count 85 transition count 387
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 427 place count 74 transition count 305
Iterating global reduction 7 with 11 rules applied. Total rules applied 438 place count 74 transition count 305
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 6 rules applied. Total rules applied 444 place count 74 transition count 299
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 447 place count 71 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 449 place count 70 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 450 place count 70 transition count 297
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 452 place count 68 transition count 295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 453 place count 67 transition count 295
Applied a total of 453 rules in 93 ms. Remains 67 /286 variables (removed 219) and now considering 295/613 (removed 318) transitions.
// Phase 1: matrix 295 rows 67 cols
[2025-05-31 00:47:33] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:33] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-05-31 00:47:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:47:33] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [60, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 228 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 65/286 places, 295/613 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 65 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 64 transition count 294
Applied a total of 2 rules in 14 ms. Remains 64 /65 variables (removed 1) and now considering 294/295 (removed 1) transitions.
// Phase 1: matrix 294 rows 64 cols
[2025-05-31 00:47:33] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:33] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-31 00:47:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:47:33] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 64/286 places, 294/613 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 557 ms. Remains : 64/286 places, 294/613 transitions.
[2025-05-31 00:47:33] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:47:33] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:47:33] [INFO ] Input system was already deterministic with 294 transitions.
[2025-05-31 00:47:33] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:47:33] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:47:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality17124066763531996818.gal : 2 ms
[2025-05-31 00:47:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality17847341857529449984.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17124066763531996818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17847341857529449984.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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.07241e+07,2.03867,73600,2,5026,5,143232,6,0,548,171917,0


Converting to forward existential form...Done !
original formula: EF((((p243==1) * E((p173==1) U (p111==1))) * ((p204==0)||(p120==1))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * ((p204==0)||(p120==1))) * (p243==1)),(p173==1)) * (p111==1))] != FALSE
Hit Full ! (commute/partial/dont) 292/0/2
(forward)formula 0,1,2.0651,73600,1,0,13,143232,17,3,1341,171917,6
FORMULA AutonomousCar-PT-07b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 00:47:35] [INFO ] Flatten gal took : 37 ms
[2025-05-31 00:47:35] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:47:35] [INFO ] Applying decomposition
[2025-05-31 00:47:35] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8983161846879710135.txt' '-o' '/tmp/graph8983161846879710135.bin' '-w' '/tmp/graph8983161846879710135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8983161846879710135.bin' '-l' '-1' '-v' '-w' '/tmp/graph8983161846879710135.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:47:36] [INFO ] Decomposing Gal with order
[2025-05-31 00:47:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:47:36] [INFO ] Removed a total of 1615 redundant transitions.
[2025-05-31 00:47:36] [INFO ] Flatten gal took : 38 ms
[2025-05-31 00:47:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 5 ms.
[2025-05-31 00:47:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality9896278399857593746.gal : 3 ms
[2025-05-31 00:47:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality8137191159895153808.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9896278399857593746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8137191159895153808.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 6 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.58063e+13,663.826,9996344,13076,166,3.02115e+06,3353,717,1.29052e+08,104,24047,0


Converting to forward existential form...Done !
original formula: A((EX(((i14.i1.u90.p264==0)||(i3.u85.p250==1))) + (A((((i7.i2.u47.p143!=0)||(i4.i0.u21.p81==1))||((i2.i0.u20.p41==0)||(i16.i2.u97.p289==1...422
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((!(E(TRUE U !((i1.i1.u8.p29==0)))) * ((i9.i1.u59.p162!=1) + EG(((i4.i1.u23.p74==0)||(i3....1719
Reverse transition relation is NOT exact ! Due to transitions t72, t94, t120, t147, t178, t206, t234, t260, t267, t270, t300, t328, t370, t610, i0.u2.t271,...890
Detected timeout of ITS tools.
[2025-05-31 01:12:37] [INFO ] Applying decomposition
[2025-05-31 01:12:37] [INFO ] Flatten gal took : 153 ms
[2025-05-31 01:12:37] [INFO ] Decomposing Gal with order
[2025-05-31 01:12:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:12:37] [INFO ] Removed a total of 1761 redundant transitions.
[2025-05-31 01:12:38] [INFO ] Flatten gal took : 303 ms
[2025-05-31 01:12:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 106 ms.
[2025-05-31 01:12:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality14328299869009903269.gal : 17 ms
[2025-05-31 01:12:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality11730544023483345403.ctl : 10 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14328299869009903269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11730544023483345403.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 6 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.58063e+13,0.092849,6896,566,1053,3221,2836,246,9085,309,14895,0


Converting to forward existential form...Done !
original formula: A((EX(((i1.i0.u19.p264==0)||(i1.i0.i0.u18.p250==1))) + (A((((i1.i0.i0.i0.i0.i0.u15.p143!=0)||(i1.i0.i0.i0.i0.i0.i0.i0.u13.p81==1))||((i1....614
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((!(E(TRUE U !((i1.i0.i0.u24.p29==0)))) * ((i1.i0.i0.i0.i0.u16.p162!=1) + EG(((i1.i0.i0.i...2449
Reverse transition relation is NOT exact ! Due to transitions t376, i0.u2.t270, i0.u2.t271, i0.u3.t267, i1.t610, i1.i0.u19.t37, i1.i0.u19.t41, i1.i0.u19.t4...1621
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-05-31 01:17:59] [INFO ] Flatten gal took : 112 ms
[2025-05-31 01:18:00] [INFO ] Input system was already deterministic with 613 transitions.
[2025-05-31 01:18:00] [INFO ] Transformed 286 places.
[2025-05-31 01:18:00] [INFO ] Transformed 613 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-31 01:18:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality1411984521757443070.gal : 8 ms
[2025-05-31 01:18:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality6994901624955830313.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1411984521757443070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6994901624955830313.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 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.58063e+13,19.4164,541756,2,189390,5,2.88798e+06,6,0,1759,1.56199e+06,0


Converting to forward existential form...Done !
original formula: A((EX(((p264==0)||(p250==1))) + (A((((p143!=0)||(p81==1))||((p41==0)||(p289==1))) U EX((((p43==0)||(p113==1))&&((p82==0)||(p307==1))))) *...264
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((!(E(TRUE U !((p29==0)))) * ((p162!=1) + EG(((p74==0)||(p92==1)))))) U (!(!(EG(!(EG((p16...1169
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t19, t28, t37, t41, t42, t43, t72, t73, t76, t78, t79, t80, t94, t100, t101, t104, ...711

BK_TIME_CONFINEMENT_REACHED

--------------------
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
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ sed s/.jar//
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-07b"
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-5832"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-07b, 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 r002-tall-174853729800705"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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