Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729800707.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729800707
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748651970328

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202505121319
[2025-05-31 00:39:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 00:39:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:39:31] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2025-05-31 00:39:31] [INFO ] Transformed 323 places.
[2025-05-31 00:39:31] [INFO ] Transformed 846 transitions.
[2025-05-31 00:39:31] [INFO ] Found NUPN structural information;
[2025-05-31 00:39:31] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-07b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 287 transition count 810
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 287 transition count 810
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 268 place count 287 transition count 614
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 274 place count 281 transition count 608
Iterating global reduction 1 with 6 rules applied. Total rules applied 280 place count 281 transition count 608
Applied a total of 280 rules in 69 ms. Remains 281 /323 variables (removed 42) and now considering 608/846 (removed 238) transitions.
// Phase 1: matrix 608 rows 281 cols
[2025-05-31 00:39:31] [INFO ] Computed 12 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:39:32] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-05-31 00:39:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:39:32] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Running 607 sub problems to find dead transitions.
[2025-05-31 00:39:32] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:42] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:42] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:42] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:42] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:43] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:43] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:43] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:43] [INFO ] Deduced a trap composed of 34 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:39:43] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:44] [INFO ] Deduced a trap composed of 36 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:39:44] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:44] [INFO ] Deduced a trap composed of 37 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:39:44] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:44] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:45] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:45] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:45] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:45] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:45] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:46] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:46] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:46] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:46] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:47] [INFO ] Deduced a trap composed of 43 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:39:47] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:47] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:47] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:48] [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:39:48] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:48] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:49] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:49] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:49] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:49] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:49] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:49] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:49] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:50] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:50] [INFO ] Deduced a trap composed of 42 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:39:50] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:54] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:54] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:54] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:55] [INFO ] Deduced a trap composed of 32 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:39:55] [INFO ] Deduced a trap composed of 44 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:39:55] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:55] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:55] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:56] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:56] [INFO ] Deduced a trap composed of 45 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:39:56] [INFO ] Deduced a trap composed of 45 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:39:56] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:56] [INFO ] Deduced a trap composed of 47 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:39:57] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:57] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:39:57] [INFO ] Deduced a trap composed of 5 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:39:57] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:01] [INFO ] Deduced a trap composed of 21 places in 175 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:01] [INFO ] Deduced a trap composed of 31 places in 151 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:01] [INFO ] Deduced a trap composed of 32 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:40:01] [INFO ] Deduced a trap composed of 32 places in 133 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:02] [INFO ] Deduced a trap composed of 32 places in 138 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:02] [INFO ] Deduced a trap composed of 38 places in 145 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:02] [INFO ] Deduced a trap composed of 39 places in 107 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:02] [INFO ] Deduced a trap composed of 42 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:40:02] [INFO ] Deduced a trap composed of 44 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:40:02] [INFO ] Deduced a trap composed of 45 places in 93 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:02] [INFO ] Deduced a trap composed of 47 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:40:03] [INFO ] Deduced a trap composed of 31 places in 133 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:03] [INFO ] Deduced a trap composed of 39 places in 95 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:03] [INFO ] Deduced a trap composed of 47 places in 81 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:03] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 281/889 variables, and 84 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/281 constraints, PredecessorRefiner: 607/409 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:07] [INFO ] Deduced a trap composed of 31 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:40:08] [INFO ] Deduced a trap composed of 47 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:40:08] [INFO ] Deduced a trap composed of 47 places in 105 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:08] [INFO ] Deduced a trap composed of 42 places in 116 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:08] [INFO ] Deduced a trap composed of 44 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:40:08] [INFO ] Deduced a trap composed of 45 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:40:08] [INFO ] Deduced a trap composed of 47 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:09] [INFO ] Deduced a trap composed of 47 places in 88 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:09] [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:40:09] [INFO ] Deduced a trap composed of 43 places in 104 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:09] [INFO ] Deduced a trap composed of 48 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:40:10] [INFO ] Deduced a trap composed of 25 places in 152 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:10] [INFO ] Deduced a trap composed of 25 places in 151 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:10] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:14] [INFO ] Deduced a trap composed of 33 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:40:14] [INFO ] Deduced a trap composed of 32 places in 139 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:15] [INFO ] Deduced a trap composed of 32 places in 137 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:15] [INFO ] Deduced a trap composed of 33 places in 131 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:15] [INFO ] Deduced a trap composed of 43 places in 94 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:16] [INFO ] Deduced a trap composed of 32 places in 129 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:16] [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:40:16] [INFO ] Deduced a trap composed of 33 places in 124 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:16] [INFO ] Deduced a trap composed of 44 places in 89 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:16] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 10/108 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD468 is UNSAT
At refinement iteration 6 (OVERLAPS) 608/889 variables, 281/389 constraints. Problems are: Problem set: 2 solved, 605 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 407/796 constraints. Problems are: Problem set: 2 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 889/889 variables, and 796 constraints, problems are : Problem set: 2 solved, 605 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 605/409 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61057ms problems are : Problem set: 2 solved, 605 unsolved
Search for dead transitions found 2 dead transitions in 61078ms
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 : 281/323 places, 606/846 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 280 transition count 606
Applied a total of 1 rules in 8 ms. Remains 280 /281 variables (removed 1) and now considering 606/606 (removed 0) transitions.
// Phase 1: matrix 606 rows 280 cols
[2025-05-31 00:40:33] [INFO ] Computed 12 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:33] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-05-31 00:40:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:34] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 280/323 places, 606/846 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62474 ms. Remains : 280/323 places, 606/846 transitions.
Support contains 40 out of 280 places after structural reductions.
[2025-05-31 00:40:34] [INFO ] Flatten gal took : 139 ms
[2025-05-31 00:40:34] [INFO ] Flatten gal took : 57 ms
[2025-05-31 00:40:34] [INFO ] Input system was already deterministic with 606 transitions.
RANDOM walk for 40000 steps (255 resets) in 914 ms. (43 steps per ms) remains 0/23 properties
FORMULA AutonomousCar-PT-07b-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 47 stabilizing places and 47 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 606/606 transitions.
Graph (trivial) has 261 edges and 280 vertex of which 4 / 280 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 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 277 transition count 495
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 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 147 rules applied. Total rules applied 256 place count 169 transition count 456
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 279 place count 146 transition count 456
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 279 place count 146 transition count 448
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 295 place count 138 transition count 448
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 304 place count 129 transition count 439
Iterating global reduction 3 with 9 rules applied. Total rules applied 313 place count 129 transition count 439
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 315 place count 127 transition count 431
Iterating global reduction 3 with 2 rules applied. Total rules applied 317 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 3 with 2 rules applied. Total rules applied 319 place count 127 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 320 place count 126 transition count 429
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 424 place count 74 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 425 place count 74 transition count 376
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 437 place count 62 transition count 285
Iterating global reduction 6 with 12 rules applied. Total rules applied 449 place count 62 transition count 285
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 453 place count 62 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 7 with 2 rules applied. Total rules applied 455 place count 61 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 456 place count 61 transition count 279
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 458 place count 61 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 460 place count 59 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 461 place count 58 transition count 277
Applied a total of 461 rules in 194 ms. Remains 58 /280 variables (removed 222) and now considering 277/606 (removed 329) transitions.
// Phase 1: matrix 277 rows 58 cols
[2025-05-31 00:40:35] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:35] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-05-31 00:40:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:40:36] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [52, 57]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 442 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/280 places, 277/606 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 54 transition count 275
Applied a total of 4 rules in 15 ms. Remains 54 /56 variables (removed 2) and now considering 275/277 (removed 2) transitions.
// Phase 1: matrix 275 rows 54 cols
[2025-05-31 00:40:36] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:36] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-31 00:40:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:40:36] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/280 places, 275/606 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 936 ms. Remains : 54/280 places, 275/606 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-02
Stuttering criterion allowed to conclude after 28 steps with 1 reset in 2 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-02 finished in 1164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(((!p0&&F(p1)) U (G((!p0&&F(p1)))||(!p0&&F(p1)&&X(X(!p2))))))))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 606/606 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 269 transition count 595
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 269 transition count 595
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 266 transition count 592
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 266 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 265 transition count 591
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 265 transition count 591
Applied a total of 30 rules in 23 ms. Remains 265 /280 variables (removed 15) and now considering 591/606 (removed 15) transitions.
// Phase 1: matrix 591 rows 265 cols
[2025-05-31 00:40:36] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:36] [INFO ] Implicit Places using invariants in 301 ms returned []
[2025-05-31 00:40:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:37] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2025-05-31 00:40:37] [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.
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, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 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:40:45] [INFO ] Deduced a trap composed of 17 places in 193 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:45] [INFO ] Deduced a trap composed of 23 places in 209 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:45] [INFO ] Deduced a trap composed of 31 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:40:46] [INFO ] Deduced a trap composed of 32 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:40:46] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 20 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 34 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:40:46] [INFO ] Deduced a trap composed of 35 places in 161 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:46] [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:40:46] [INFO ] Deduced a trap composed of 36 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:40:47] [INFO ] Deduced a trap composed of 21 places in 151 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:47] [INFO ] Deduced a trap composed of 50 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:47] [INFO ] Deduced a trap composed of 33 places in 154 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 34 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:40:47] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 20 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 36 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:40:48] [INFO ] Deduced a trap composed of 37 places in 153 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:48] [INFO ] Deduced a trap composed of 38 places in 161 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:48] [INFO ] Deduced a trap composed of 38 places in 170 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:48] [INFO ] Deduced a trap composed of 37 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:40:48] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 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:40:49] [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:40:49] [INFO ] Deduced a trap composed of 38 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:40:49] [INFO ] Deduced a trap composed of 39 places in 155 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:49] [INFO ] Deduced a trap composed of 40 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:40:49] [INFO ] Deduced a trap composed of 41 places in 167 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:50] [INFO ] Deduced a trap composed of 42 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:40:50] [INFO ] Deduced a trap composed of 42 places in 165 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:50] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 20 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 35 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:50] [INFO ] Deduced a trap composed of 37 places in 163 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:51] [INFO ] Deduced a trap composed of 39 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:40:51] [INFO ] Deduced a trap composed of 25 places in 170 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:51] [INFO ] Deduced a trap composed of 22 places in 161 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:51] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 28 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 31 places in 162 ms of which 26 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 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:52] [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:52] [INFO ] Deduced a trap composed of 31 places in 119 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:52] [INFO ] Deduced a trap composed of 32 places in 116 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:52] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 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:40:56] [INFO ] Deduced a trap composed of 41 places in 133 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:56] [INFO ] Deduced a trap composed of 41 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:56] [INFO ] Deduced a trap composed of 42 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:56] [INFO ] Deduced a trap composed of 42 places in 130 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:57] [INFO ] Deduced a trap composed of 43 places in 126 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:57] [INFO ] Deduced a trap composed of 44 places in 117 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:57] [INFO ] Deduced a trap composed of 45 places in 106 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:57] [INFO ] Deduced a trap composed of 45 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:40:58] [INFO ] Deduced a trap composed of 14 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:40:58] [INFO ] Deduced a trap composed of 31 places in 151 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:58] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 11/63 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:41:02] [INFO ] Deduced a trap composed of 41 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:41:03] [INFO ] Deduced a trap composed of 31 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:41:03] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:03] [INFO ] Deduced a trap composed of 41 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:41:03] [INFO ] Deduced a trap composed of 42 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:41:03] [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:41:04] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 265/856 variables, and 70 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/265 constraints, PredecessorRefiner: 590/392 constraints, Known Traps: 58/58 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/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 58/70 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:41:11] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:11] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:11] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:12] [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:41:12] [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:41:12] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:12] [INFO ] Deduced a trap composed of 43 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:41:12] [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:41:13] [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:41:13] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:13] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:13] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:13] [INFO ] Deduced a trap composed of 42 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:41:14] [INFO ] Deduced a trap composed of 42 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:41:14] [INFO ] Deduced a trap composed of 43 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:41:14] [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:41:14] [INFO ] Deduced a trap composed of 31 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:41:14] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:15] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:15] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/90 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:41:16] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:17] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 6 (OVERLAPS) 591/856 variables, 265/357 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/856 variables, 392/749 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:41:36] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 856/856 variables, and 750 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 590/392 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60693ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60696ms
Starting structural reductions in LTL mode, iteration 1 : 265/280 places, 591/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61319 ms. Remains : 265/280 places, 591/606 transitions.
Stuttering acceptance computed with spot in 414 ms :[true, true, true, (NOT p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND p0 p2)), (OR (AND (NOT p1) p2) (AND p0 p2))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-03
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-03 finished in 61763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 606/606 transitions.
Graph (trivial) has 263 edges and 280 vertex of which 4 / 280 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 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 277 transition count 495
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 149 rules applied. Total rules applied 258 place count 169 transition count 454
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 283 place count 145 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 284 place count 144 transition count 453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 284 place count 144 transition count 446
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 298 place count 137 transition count 446
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 307 place count 128 transition count 437
Iterating global reduction 4 with 9 rules applied. Total rules applied 316 place count 128 transition count 437
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 318 place count 126 transition count 423
Iterating global reduction 4 with 2 rules applied. Total rules applied 320 place count 126 transition count 423
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 324 place count 126 transition count 419
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 326 place count 124 transition count 419
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 428 place count 73 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 429 place count 73 transition count 366
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 441 place count 61 transition count 275
Iterating global reduction 7 with 12 rules applied. Total rules applied 453 place count 61 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 457 place count 61 transition count 271
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 459 place count 60 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 461 place count 59 transition count 270
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 463 place count 57 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 464 place count 56 transition count 268
Applied a total of 464 rules in 65 ms. Remains 56 /280 variables (removed 224) and now considering 268/606 (removed 338) transitions.
// Phase 1: matrix 268 rows 56 cols
[2025-05-31 00:41:38] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:41:38] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-05-31 00:41:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:41:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:41:38] [INFO ] Implicit Places using invariants and state equation in 184 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 339 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/280 places, 268/606 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 267
Applied a total of 2 rules in 12 ms. Remains 54 /55 variables (removed 1) and now considering 267/268 (removed 1) transitions.
// Phase 1: matrix 267 rows 54 cols
[2025-05-31 00:41:38] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:41:38] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-31 00:41:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:41:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:41:39] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/280 places, 267/606 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 664 ms. Remains : 54/280 places, 267/606 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-04
Product exploration explored 100000 steps with 12 reset in 151 ms.
Product exploration explored 100000 steps with 25 reset in 80 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 16139 steps (1129 resets) in 394 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 267/267 transitions.
Applied a total of 0 rules in 10 ms. Remains 54 /54 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2025-05-31 00:41:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:41:39] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-31 00:41:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:41:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:41:40] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:41:40] [INFO ] Redundant transitions in 10 ms returned []
Running 266 sub problems to find dead transitions.
[2025-05-31 00:41:40] [INFO ] Invariant cache hit.
[2025-05-31 00:41:40] [INFO ] State equation strengthened by 2 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:41] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 266/320 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:43] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:45] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:45] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:46] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:46] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:46] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:46] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:41:49] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 1/321 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (OVERLAPS) 0/321 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 74 constraints, problems are : Problem set: 0 solved, 266 unsolved in 19076 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 266/139 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 266/320 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 139/205 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (OVERLAPS) 1/321 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/321 variables, and 213 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 266/139 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 49577ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 49578ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49837 ms. Remains : 54/54 places, 267/267 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 22268 steps (1582 resets) in 108 ms. (204 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7 reset in 139 ms.
Product exploration explored 100000 steps with 17 reset in 78 ms.
Built C files in :
/tmp/ltsmin5913077204258957644
[2025-05-31 00:42:30] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2025-05-31 00:42:30] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 00:42:30] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2025-05-31 00:42:30] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 00:42:30] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2025-05-31 00:42:30] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 00:42:30] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5913077204258957644
Running compilation step : cd /tmp/ltsmin5913077204258957644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 881 ms.
Running link step : cd /tmp/ltsmin5913077204258957644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5913077204258957644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8328424749833852738.hoa' '--buchi-type=spotba'
LTSmin run took 11123 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-07b-LTLCardinality-04 finished in 64278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(p1)) U X(X(G(p2)))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 606/606 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 269 transition count 595
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 269 transition count 595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 267 transition count 593
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 267 transition count 593
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 266 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 266 transition count 592
Applied a total of 28 rules in 18 ms. Remains 266 /280 variables (removed 14) and now considering 592/606 (removed 14) transitions.
// Phase 1: matrix 592 rows 266 cols
[2025-05-31 00:42:42] [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:42] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-31 00:42:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:42:43] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2025-05-31 00:42:43] [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.
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, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 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:42:51] [INFO ] Deduced a trap composed of 17 places in 177 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:51] [INFO ] Deduced a trap composed of 21 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:42:51] [INFO ] Deduced a trap composed of 35 places in 156 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:51] [INFO ] Deduced a trap composed of 36 places in 148 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:52] [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:42:52] [INFO ] Deduced a trap composed of 38 places in 146 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:52] [INFO ] Deduced a trap composed of 39 places in 161 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:52] [INFO ] Deduced a trap composed of 40 places in 154 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:52] [INFO ] Deduced a trap composed of 40 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:42:52] [INFO ] Deduced a trap composed of 21 places in 144 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:53] [INFO ] Deduced a trap composed of 29 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:42:53] [INFO ] Deduced a trap composed of 24 places in 168 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:53] [INFO ] Deduced a trap composed of 37 places in 153 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:53] [INFO ] Deduced a trap composed of 38 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:42:53] [INFO ] Deduced a trap composed of 39 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:54] [INFO ] Deduced a trap composed of 40 places in 172 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:54] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:54] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:54] [INFO ] Deduced a trap composed of 42 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:42:54] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 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:42:55] [INFO ] Deduced a trap composed of 20 places in 141 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:55] [INFO ] Deduced a trap composed of 22 places in 142 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:55] [INFO ] Deduced a trap composed of 38 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:42:56] [INFO ] Deduced a trap composed of 50 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:42:56] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:56] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:42:56] [INFO ] Deduced a trap composed of 31 places in 147 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:56] [INFO ] Deduced a trap composed of 32 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:42:57] [INFO ] Deduced a trap composed of 32 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:57] [INFO ] Deduced a trap composed of 31 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:42:57] [INFO ] Deduced a trap composed of 31 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:42:57] [INFO ] Deduced a trap composed of 32 places in 131 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:58] [INFO ] Deduced a trap composed of 32 places in 144 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:58] [INFO ] Deduced a trap composed of 31 places in 156 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:58] [INFO ] Deduced a trap composed of 41 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:42:58] [INFO ] Deduced a trap composed of 42 places in 123 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:58] [INFO ] Deduced a trap composed of 43 places in 117 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:59] [INFO ] Deduced a trap composed of 44 places in 115 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:59] [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:59] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 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:43:02] [INFO ] Deduced a trap composed of 25 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:43:02] [INFO ] Deduced a trap composed of 25 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:43:03] [INFO ] Deduced a trap composed of 41 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:43:03] [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:43:03] [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:43:03] [INFO ] Deduced a trap composed of 45 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:43:03] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:04] [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:43:04] [INFO ] Deduced a trap composed of 41 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:43:04] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:04] [INFO ] Deduced a trap composed of 42 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:43:04] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:04] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:05] [INFO ] Deduced a trap composed of 46 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:43:05] [INFO ] Deduced a trap composed of 46 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:43:05] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:05] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:05] [INFO ] Deduced a trap composed of 46 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:43:05] [INFO ] Deduced a trap composed of 46 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:43:06] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 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:43:07] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:08] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:08] [INFO ] Deduced a trap composed of 45 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:43:08] [INFO ] Deduced a trap composed of 43 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:43:08] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:08] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:08] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:09] [INFO ] Deduced a trap composed of 32 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:43:09] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 9/81 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:43:13] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:13] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:13] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/858 variables, and 84 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 591/393 constraints, Known Traps: 72/72 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/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 72/84 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:43:17] [INFO ] Deduced a trap composed of 14 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:43:17] [INFO ] Deduced a trap composed of 40 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:43:18] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 3/87 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:43:23] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 1/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:43:28] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:29] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 2/90 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:43:32] [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:43:33] [INFO ] Deduced a trap composed of 36 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:43:33] [INFO ] Deduced a trap composed of 43 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:43:34] [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:43:34] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/858 variables, and 95 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 198/393 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60703ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60707ms
Starting structural reductions in LTL mode, iteration 1 : 266/280 places, 592/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61166 ms. Remains : 266/280 places, 592/606 transitions.
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1611 steps with 373 reset in 7 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-05 finished in 61527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 606/606 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 266 transition count 592
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 266 transition count 592
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 263 transition count 589
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 263 transition count 589
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 262 transition count 588
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 262 transition count 588
Applied a total of 36 rules in 13 ms. Remains 262 /280 variables (removed 18) and now considering 588/606 (removed 18) transitions.
// Phase 1: matrix 588 rows 262 cols
[2025-05-31 00:43:44] [INFO ] Computed 12 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:43:44] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-31 00:43:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:43:44] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 587 sub problems to find dead transitions.
[2025-05-31 00:43:44] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:52] [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:43:52] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:52] [INFO ] Deduced a trap composed of 35 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:43:53] [INFO ] Deduced a trap composed of 36 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:43:53] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:53] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:53] [INFO ] Deduced a trap composed of 39 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:43:53] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:53] [INFO ] Deduced a trap composed of 40 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:43:54] [INFO ] Deduced a trap composed of 37 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:43:54] [INFO ] Deduced a trap composed of 38 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:43:54] [INFO ] Deduced a trap composed of 39 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:43:54] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:54] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:54] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:55] [INFO ] Deduced a trap composed of 42 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:43:55] [INFO ] Deduced a trap composed of 28 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:43:55] [INFO ] Deduced a trap composed of 24 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:43:55] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:55] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:56] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:56] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:57] [INFO ] Deduced a trap composed of 41 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:43:57] [INFO ] Deduced a trap composed of 32 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:43:57] [INFO ] Deduced a trap composed of 31 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:43:57] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:58] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:58] [INFO ] Deduced a trap composed of 32 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:43:58] [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:43:58] [INFO ] Deduced a trap composed of 43 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:43:58] [INFO ] Deduced a trap composed of 45 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:43:58] [INFO ] Deduced a trap composed of 46 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:43:59] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:59] [INFO ] Deduced a trap composed of 43 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:43:59] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:59] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:59] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:59] [INFO ] Deduced a trap composed of 44 places in 94 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:00] [INFO ] Deduced a trap composed of 44 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:44:00] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 587 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 19 places in 138 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:03] [INFO ] Deduced a trap composed of 20 places in 132 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:03] [INFO ] Deduced a trap composed of 22 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:44:03] [INFO ] Deduced a trap composed of 25 places in 143 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 37 places in 176 ms of which 27 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 63 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:44:04] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 31 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 32 places in 149 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:05] [INFO ] Deduced a trap composed of 31 places in 154 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 42 places in 117 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:05] [INFO ] Deduced a trap composed of 31 places in 141 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 42 places in 102 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 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:44:06] [INFO ] Deduced a trap composed of 32 places in 147 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:06] [INFO ] Deduced a trap composed of 41 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:44:06] [INFO ] Deduced a trap composed of 45 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:44:06] [INFO ] Deduced a trap composed of 41 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:44:06] [INFO ] Deduced a trap composed of 42 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:44:07] [INFO ] Deduced a trap composed of 45 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:44:07] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 587 unsolved
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 24 places in 164 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:07] [INFO ] Deduced a trap composed of 26 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:44:08] [INFO ] Deduced a trap composed of 41 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:44:08] [INFO ] Deduced a trap composed of 42 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:44:08] [INFO ] Deduced a trap composed of 41 places in 117 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:09] [INFO ] Deduced a trap composed of 42 places in 113 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:09] [INFO ] Deduced a trap composed of 32 places in 149 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:10] [INFO ] Deduced a trap composed of 32 places in 142 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:10] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:13] [INFO ] Deduced a trap composed of 21 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:44:14] [INFO ] Deduced a trap composed of 46 places in 112 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:14] [INFO ] Deduced a trap composed of 46 places in 105 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:14] [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:44:15] [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:44:15] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 262/850 variables, and 87 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/262 constraints, PredecessorRefiner: 587/389 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 587 unsolved
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 33 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:44:20] [INFO ] Deduced a trap composed of 43 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:44:20] [INFO ] Deduced a trap composed of 46 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:20] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 587 unsolved
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 14 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:44:24] [INFO ] Deduced a trap composed of 31 places in 119 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:25] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (OVERLAPS) 588/850 variables, 262/356 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/850 variables, 389/745 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 850/850 variables, and 745 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 587/389 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60717ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 60720ms
Starting structural reductions in LTL mode, iteration 1 : 262/280 places, 588/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61178 ms. Remains : 262/280 places, 588/606 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 270 steps with 2 reset in 2 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-06 finished in 61315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((G(F(!p0)) U p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 606/606 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 266 transition count 592
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 266 transition count 592
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 263 transition count 589
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 263 transition count 589
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 262 transition count 588
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 262 transition count 588
Applied a total of 36 rules in 17 ms. Remains 262 /280 variables (removed 18) and now considering 588/606 (removed 18) transitions.
[2025-05-31 00:44:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:44:45] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-31 00:44:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:44:45] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 587 sub problems to find dead transitions.
[2025-05-31 00:44:45] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:53] [INFO ] Deduced a trap composed of 17 places in 173 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:54] [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:44:54] [INFO ] Deduced a trap composed of 35 places in 156 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:54] [INFO ] Deduced a trap composed of 36 places in 157 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:54] [INFO ] Deduced a trap composed of 37 places in 150 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:54] [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:44:54] [INFO ] Deduced a trap composed of 39 places in 151 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:55] [INFO ] Deduced a trap composed of 40 places in 158 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:55] [INFO ] Deduced a trap composed of 40 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:44:55] [INFO ] Deduced a trap composed of 37 places in 156 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:55] [INFO ] Deduced a trap composed of 38 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:55] [INFO ] Deduced a trap composed of 39 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:44:55] [INFO ] Deduced a trap composed of 40 places in 151 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:56] [INFO ] Deduced a trap composed of 41 places in 148 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:56] [INFO ] Deduced a trap composed of 42 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:44:56] [INFO ] Deduced a trap composed of 42 places in 148 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:56] [INFO ] Deduced a trap composed of 28 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:44:56] [INFO ] Deduced a trap composed of 24 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:44:57] [INFO ] Deduced a trap composed of 23 places in 170 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:57] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:44:57] [INFO ] Deduced a trap composed of 31 places in 158 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:58] [INFO ] Deduced a trap composed of 41 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:58] [INFO ] Deduced a trap composed of 41 places in 152 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:58] [INFO ] Deduced a trap composed of 32 places in 149 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:58] [INFO ] Deduced a trap composed of 31 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:44:59] [INFO ] Deduced a trap composed of 32 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:59] [INFO ] Deduced a trap composed of 31 places in 147 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:59] [INFO ] Deduced a trap composed of 32 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:44:59] [INFO ] Deduced a trap composed of 43 places in 116 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:59] [INFO ] Deduced a trap composed of 43 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:45:00] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:00] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:00] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:00] [INFO ] Deduced a trap composed of 43 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:45:00] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:00] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:00] [INFO ] Deduced a trap composed of 44 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:45:00] [INFO ] Deduced a trap composed of 44 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:45:01] [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:45:01] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:04] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:04] [INFO ] Deduced a trap composed of 20 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:45:04] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:04] [INFO ] Deduced a trap composed of 25 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:45:05] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:05] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:05] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:06] [INFO ] Deduced a trap composed of 32 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:45:06] [INFO ] Deduced a trap composed of 31 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:45:06] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:07] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:07] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:07] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:07] [INFO ] Deduced a trap composed of 32 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:45:07] [INFO ] Deduced a trap composed of 41 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:45:07] [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:45:07] [INFO ] Deduced a trap composed of 41 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:45:08] [INFO ] Deduced a trap composed of 42 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:45:08] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:08] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:08] [INFO ] Deduced a trap composed of 24 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:45:08] [INFO ] Deduced a trap composed of 26 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:45:09] [INFO ] Deduced a trap composed of 41 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:45:09] [INFO ] Deduced a trap composed of 42 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:45:09] [INFO ] Deduced a trap composed of 41 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:45:10] [INFO ] Deduced a trap composed of 42 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:45:10] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:11] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:11] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:14] [INFO ] Deduced a trap composed of 21 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:45:15] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:15] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:16] [INFO ] Deduced a trap composed of 46 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:45:16] [INFO ] Deduced a trap composed of 46 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:45:16] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 262/850 variables, and 87 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/262 constraints, PredecessorRefiner: 587/389 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:19] [INFO ] Deduced a trap composed of 33 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:45:21] [INFO ] Deduced a trap composed of 43 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:45:21] [INFO ] Deduced a trap composed of 46 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:45:21] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:25] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:25] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:26] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (OVERLAPS) 588/850 variables, 262/356 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/850 variables, 389/745 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 850/850 variables, and 745 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 587/389 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60694ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 60697ms
Starting structural reductions in LTL mode, iteration 1 : 262/280 places, 588/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61125 ms. Remains : 262/280 places, 588/606 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), p0, p0]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 133 ms.
Product exploration explored 100000 steps with 33333 reset in 150 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Computed a total of 41 stabilizing places and 41 stable transitions
Detected a total of 41/262 stabilizing places and 41/588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 10 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLCardinality-07 finished in 61640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 606/606 transitions.
Graph (trivial) has 263 edges and 280 vertex of which 4 / 280 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 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 277 transition count 492
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 153 rules applied. Total rules applied 265 place count 166 transition count 450
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 290 place count 141 transition count 450
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 290 place count 141 transition count 443
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 304 place count 134 transition count 443
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 312 place count 126 transition count 435
Iterating global reduction 3 with 8 rules applied. Total rules applied 320 place count 126 transition count 435
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 323 place count 123 transition count 420
Iterating global reduction 3 with 3 rules applied. Total rules applied 326 place count 123 transition count 420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 330 place count 123 transition count 416
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 332 place count 121 transition count 416
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 434 place count 70 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 435 place count 70 transition count 363
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 445 place count 60 transition count 287
Iterating global reduction 6 with 10 rules applied. Total rules applied 455 place count 60 transition count 287
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 459 place count 60 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 461 place count 59 transition count 282
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 463 place count 57 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 464 place count 56 transition count 280
Applied a total of 464 rules in 97 ms. Remains 56 /280 variables (removed 224) and now considering 280/606 (removed 326) transitions.
// Phase 1: matrix 280 rows 56 cols
[2025-05-31 00:45:47] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:47] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-31 00:45:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:45:47] [INFO ] Implicit Places using invariants and state equation in 132 ms returned [52, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 217 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/280 places, 280/606 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 52 transition count 278
Applied a total of 4 rules in 14 ms. Remains 52 /54 variables (removed 2) and now considering 278/280 (removed 2) transitions.
// Phase 1: matrix 278 rows 52 cols
[2025-05-31 00:45:47] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:47] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-31 00:45:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:45:47] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/280 places, 278/606 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 529 ms. Remains : 52/280 places, 278/606 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-08
Stuttering criterion allowed to conclude after 33 steps with 2 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-08 finished in 566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 606/606 transitions.
Graph (trivial) has 258 edges and 280 vertex of which 4 / 280 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 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 277 transition count 498
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 142 rules applied. Total rules applied 248 place count 172 transition count 461
Reduce places removed 22 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 25 rules applied. Total rules applied 273 place count 150 transition count 458
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 278 place count 147 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 279 place count 146 transition count 456
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 279 place count 146 transition count 449
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 293 place count 139 transition count 449
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 303 place count 129 transition count 439
Iterating global reduction 5 with 10 rules applied. Total rules applied 313 place count 129 transition count 439
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 315 place count 127 transition count 425
Iterating global reduction 5 with 2 rules applied. Total rules applied 317 place count 127 transition count 425
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 321 place count 127 transition count 421
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 323 place count 125 transition count 421
Performed 52 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 427 place count 73 transition count 367
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 438 place count 62 transition count 283
Iterating global reduction 7 with 11 rules applied. Total rules applied 449 place count 62 transition count 283
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 452 place count 62 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 454 place count 61 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 455 place count 61 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 456 place count 61 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 458 place count 59 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 459 place count 58 transition count 277
Applied a total of 459 rules in 67 ms. Remains 58 /280 variables (removed 222) and now considering 277/606 (removed 329) transitions.
// Phase 1: matrix 277 rows 58 cols
[2025-05-31 00:45:47] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:47] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-05-31 00:45:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:45:48] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [52, 56]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 211 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/280 places, 277/606 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 277
Applied a total of 4 rules in 14 ms. Remains 54 /56 variables (removed 2) and now considering 277/277 (removed 0) transitions.
// Phase 1: matrix 277 rows 54 cols
[2025-05-31 00:45:48] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:48] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-05-31 00:45:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:45:48] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/280 places, 277/606 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 489 ms. Remains : 54/280 places, 277/606 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-10
Product exploration explored 100000 steps with 46 reset in 74 ms.
Stuttering criterion allowed to conclude after 4619 steps with 290 reset in 15 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-10 finished in 630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 606/606 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 267 transition count 593
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 267 transition count 593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 265 transition count 591
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 265 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 264 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 264 transition count 590
Applied a total of 32 rules in 20 ms. Remains 264 /280 variables (removed 16) and now considering 590/606 (removed 16) transitions.
// Phase 1: matrix 590 rows 264 cols
[2025-05-31 00:45:48] [INFO ] Computed 12 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:48] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-05-31 00:45:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:48] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2025-05-31 00:45:48] [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.
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, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 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:45:56] [INFO ] Deduced a trap composed of 17 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:45:57] [INFO ] Deduced a trap composed of 20 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:45:57] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:57] [INFO ] Deduced a trap composed of 21 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:45:57] [INFO ] Deduced a trap composed of 30 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:45:57] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:57] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:58] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:58] [INFO ] Deduced a trap composed of 37 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:45:58] [INFO ] Deduced a trap composed of 38 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:45:58] [INFO ] Deduced a trap composed of 39 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:45:58] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:59] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:59] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:59] [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:45:59] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:59] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:00] [INFO ] Deduced a trap composed of 31 places in 158 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:00] [INFO ] Deduced a trap composed of 37 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:46:00] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 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:00] [INFO ] Deduced a trap composed of 26 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:46:01] [INFO ] Deduced a trap composed of 37 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:01] [INFO ] Deduced a trap composed of 32 places in 120 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:01] [INFO ] Deduced a trap composed of 32 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:46:01] [INFO ] Deduced a trap composed of 41 places in 115 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:02] [INFO ] Deduced a trap composed of 42 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:46:02] [INFO ] Deduced a trap composed of 38 places in 141 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:02] [INFO ] Deduced a trap composed of 42 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:46:02] [INFO ] Deduced a trap composed of 42 places in 118 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:02] [INFO ] Deduced a trap composed of 42 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:46:03] [INFO ] Deduced a trap composed of 27 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:46:03] [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:46:03] [INFO ] Deduced a trap composed of 42 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:46:03] [INFO ] Deduced a trap composed of 32 places in 126 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:04] [INFO ] Deduced a trap composed of 31 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:04] [INFO ] Deduced a trap composed of 42 places in 136 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:04] [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:46:04] [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:46:05] [INFO ] Deduced a trap composed of 10 places in 157 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:05] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 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:08] [INFO ] Deduced a trap composed of 25 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:46:08] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 24 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 35 places in 174 ms of which 24 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 32 places in 148 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:09] [INFO ] Deduced a trap composed of 43 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:46:09] [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:09] [INFO ] Deduced a trap composed of 45 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:46:09] [INFO ] Deduced a trap composed of 46 places in 109 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:09] [INFO ] Deduced a trap composed of 46 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:46:10] [INFO ] Deduced a trap composed of 32 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:46:10] [INFO ] Deduced a trap composed of 31 places in 151 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:10] [INFO ] Deduced a trap composed of 41 places in 119 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:10] [INFO ] Deduced a trap composed of 44 places in 110 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:10] [INFO ] Deduced a trap composed of 45 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:46:10] [INFO ] Deduced a trap composed of 46 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:46:10] [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:11] [INFO ] Deduced a trap composed of 32 places in 150 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:11] [INFO ] Deduced a trap composed of 28 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:46:11] [INFO ] Deduced a trap composed of 41 places in 107 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:11] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/72 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:13] [INFO ] Deduced a trap composed of 44 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:46:13] [INFO ] Deduced a trap composed of 44 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:46:13] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 3/75 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:18] [INFO ] Deduced a trap composed of 43 places in 115 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:18] [INFO ] Deduced a trap composed of 43 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:46:18] [INFO ] Deduced a trap composed of 46 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:46:18] [INFO ] Deduced a trap composed of 46 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:46:18] [INFO ] Deduced a trap composed of 41 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:18] [INFO ] Deduced a trap composed of 43 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:46:18] [INFO ] Deduced a trap composed of 46 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:46:19] [INFO ] Deduced a trap composed of 46 places in 76 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:19] [INFO ] Deduced a trap composed of 45 places in 90 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 41 places in 94 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:19] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 10 ms to minimize.
SMT process timed out in 30730ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 30732ms
Starting structural reductions in LTL mode, iteration 1 : 264/280 places, 590/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31203 ms. Remains : 264/280 places, 590/606 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 22581 steps with 216 reset in 59 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-12 finished in 31364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!(p0 U p1))||!(G(p0) U G(p2))||X(p3))))'
Support contains 7 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 606/606 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 269 transition count 595
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 269 transition count 595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 267 transition count 593
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 267 transition count 593
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 266 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 266 transition count 592
Applied a total of 28 rules in 24 ms. Remains 266 /280 variables (removed 14) and now considering 592/606 (removed 14) transitions.
// Phase 1: matrix 592 rows 266 cols
[2025-05-31 00:46:19] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:46:20] [INFO ] Implicit Places using invariants in 351 ms returned []
[2025-05-31 00:46:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:46:20] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2025-05-31 00:46: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.
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, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 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:46:28] [INFO ] Deduced a trap composed of 17 places in 173 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:28] [INFO ] Deduced a trap composed of 18 places in 174 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:28] [INFO ] Deduced a trap composed of 31 places in 167 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:28] [INFO ] Deduced a trap composed of 32 places in 163 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:29] [INFO ] Deduced a trap composed of 33 places in 173 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:29] [INFO ] Deduced a trap composed of 34 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:46:29] [INFO ] Deduced a trap composed of 35 places in 159 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:29] [INFO ] Deduced a trap composed of 36 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:46:29] [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:46:29] [INFO ] Deduced a trap composed of 23 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:46:30] [INFO ] Deduced a trap composed of 21 places in 150 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:30] [INFO ] Deduced a trap composed of 24 places in 165 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:30] [INFO ] Deduced a trap composed of 37 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:30] [INFO ] Deduced a trap composed of 38 places in 158 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:30] [INFO ] Deduced a trap composed of 39 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:46:31] [INFO ] Deduced a trap composed of 14 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:46:31] [INFO ] Deduced a trap composed of 40 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:46:31] [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:46:31] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 23 ms to minimize.
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 42 places in 156 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, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:32] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:32] [INFO ] Deduced a trap composed of 22 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:46:32] [INFO ] Deduced a trap composed of 31 places in 128 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:32] [INFO ] Deduced a trap composed of 31 places in 119 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:33] [INFO ] Deduced a trap composed of 31 places in 164 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:33] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 23 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 41 places in 139 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:33] [INFO ] Deduced a trap composed of 41 places in 122 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 42 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:46:34] [INFO ] Deduced a trap composed of 38 places in 160 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:34] [INFO ] Deduced a trap composed of 42 places in 117 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:34] [INFO ] Deduced a trap composed of 42 places in 117 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:34] [INFO ] Deduced a trap composed of 42 places in 117 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:35] [INFO ] Deduced a trap composed of 44 places in 128 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:35] [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:46:35] [INFO ] Deduced a trap composed of 47 places in 131 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:36] [INFO ] Deduced a trap composed of 10 places in 167 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:36] [INFO ] Deduced a trap composed of 30 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:46:36] [INFO ] Deduced a trap composed of 30 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:46:36] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 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:46:39] [INFO ] Deduced a trap composed of 31 places in 126 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:40] [INFO ] Deduced a trap composed of 41 places in 116 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:41] [INFO ] Deduced a trap composed of 14 places in 153 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:41] [INFO ] Deduced a trap composed of 30 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:46:41] [INFO ] Deduced a trap composed of 31 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:46:41] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 6/58 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:46:45] [INFO ] Deduced a trap composed of 21 places in 128 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:45] [INFO ] Deduced a trap composed of 27 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:46:45] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 3/61 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:46:50] [INFO ] Deduced a trap composed of 32 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:46:50] [INFO ] Deduced a trap composed of 24 places in 134 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:50] [INFO ] Deduced a trap composed of 33 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:46:51] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 15 ms to minimize.
SMT process timed out in 30675ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 30679ms
Starting structural reductions in LTL mode, iteration 1 : 266/280 places, 592/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31347 ms. Remains : 266/280 places, 592/606 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-13
Product exploration explored 100000 steps with 11645 reset in 126 ms.
Product exploration explored 100000 steps with 11684 reset in 130 ms.
Computed a total of 43 stabilizing places and 43 stable transitions
Computed a total of 43 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X p0), (X (NOT p1)), (X (X (AND p0 p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 p3)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X p0)), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 116 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
RANDOM walk for 33812 steps (277 resets) in 84 ms. (397 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X p0), (X (NOT p1)), (X (X (AND p0 p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 p3)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X p0)), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p2) (AND p2 p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) (NOT p3)))), (F p1), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p3 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3) (NOT p1))))]
Knowledge based reduction with 17 factoid took 472 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 252 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 592/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 592/592 (removed 0) transitions.
[2025-05-31 00:46:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:46:53] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-31 00:46:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:46:53] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2025-05-31 00:46: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.
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, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 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:47:01] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:01] [INFO ] Deduced a trap composed of 18 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:47:01] [INFO ] Deduced a trap composed of 31 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:47:01] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:02] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:02] [INFO ] Deduced a trap composed of 34 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:47:02] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:02] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:02] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:03] [INFO ] Deduced a trap composed of 23 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:47:03] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:03] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:03] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:03] [INFO ] Deduced a trap composed of 38 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:47:03] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:04] [INFO ] Deduced a trap composed of 14 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:47:04] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:04] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:04] [INFO ] Deduced a trap composed of 42 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:47:04] [INFO ] Deduced a trap composed of 42 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, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:05] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:05] [INFO ] Deduced a trap composed of 22 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:47:05] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:05] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:06] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:06] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:06] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:06] [INFO ] Deduced a trap composed of 41 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:47:06] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:07] [INFO ] Deduced a trap composed of 38 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:47:07] [INFO ] Deduced a trap composed of 42 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:47:07] [INFO ] Deduced a trap composed of 42 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:47:07] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:08] [INFO ] Deduced a trap composed of 44 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:47:08] [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:47:08] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:09] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:09] [INFO ] Deduced a trap composed of 30 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:47:09] [INFO ] Deduced a trap composed of 30 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:47:09] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 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:47:12] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:13] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:14] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:14] [INFO ] Deduced a trap composed of 30 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:47:14] [INFO ] Deduced a trap composed of 31 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:47:15] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 6/58 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:47:18] [INFO ] Deduced a trap composed of 21 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:47:18] [INFO ] Deduced a trap composed of 27 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:47:18] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 3/61 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:47:23] [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:47:23] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:23] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:24] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/858 variables, and 65 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 591/393 constraints, Known Traps: 53/53 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/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 53/65 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:47:27] [INFO ] Deduced a trap composed of 28 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:47:27] [INFO ] Deduced a trap composed of 44 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:47:27] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:28] [INFO ] Deduced a trap composed of 46 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:47:28] [INFO ] Deduced a trap composed of 47 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:47:28] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:28] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:28] [INFO ] Deduced a trap composed of 44 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:47:28] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:28] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:29] [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:47:29] [INFO ] Deduced a trap composed of 32 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:47:29] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:29] [INFO ] Deduced a trap composed of 43 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:47:29] [INFO ] Deduced a trap composed of 45 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:47:29] [INFO ] Deduced a trap composed of 46 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:47:29] [INFO ] Deduced a trap composed of 46 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:47:30] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:30] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:30] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/85 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:47:31] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:32] [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:47:32] [INFO ] Deduced a trap composed of 46 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:47:32] [INFO ] Deduced a trap composed of 32 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:47:32] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:32] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:33] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:33] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:33] [INFO ] Deduced a trap composed of 32 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:47:33] [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:47:33] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 11/96 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:47:38] [INFO ] Deduced a trap composed of 43 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:47:38] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 7 (OVERLAPS) 592/858 variables, 266/364 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/858 variables, 393/757 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 858/858 variables, and 757 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 591/393 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60685ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60688ms
Finished structural reductions in LTL mode , in 1 iterations and 61139 ms. Remains : 266/266 places, 592/592 transitions.
Computed a total of 43 stabilizing places and 43 stable transitions
Computed a total of 43 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1))), (X p0), (X (NOT p1)), (X (X (AND p0 p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 p3)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT (AND p0 p2 p3 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 128 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
RANDOM walk for 36876 steps (268 resets) in 106 ms. (344 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X p2), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1))), (X p0), (X (NOT p1)), (X (X (AND p0 p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 p3)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT (AND p0 p2 p3 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p2) (AND p2 p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) (NOT p3)))), (F p1), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p3 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3) (NOT p1))))]
Knowledge based reduction with 17 factoid took 503 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 253 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 235 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Product exploration explored 100000 steps with 11533 reset in 121 ms.
Product exploration explored 100000 steps with 11466 reset in 134 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 243 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 592/592 transitions.
Graph (trivial) has 240 edges and 266 vertex of which 4 / 266 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.
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 264 transition count 590
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 110 place count 264 transition count 573
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 110 place count 264 transition count 573
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 131 place count 264 transition count 573
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 206 place count 189 transition count 498
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 75 rules applied. Total rules applied 281 place count 189 transition count 498
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 105 places in 1 ms
Iterating global reduction 2 with 66 rules applied. Total rules applied 347 place count 189 transition count 506
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 349 place count 189 transition count 504
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 407 place count 131 transition count 369
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 3 with 58 rules applied. Total rules applied 465 place count 131 transition count 369
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 475 place count 131 transition count 359
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 480 place count 126 transition count 354
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 485 place count 126 transition count 354
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 486 place count 126 transition count 354
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 488 place count 124 transition count 352
Deduced a syphon composed of 54 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 490 place count 124 transition count 352
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 492 place count 124 transition count 358
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 492 rules in 56 ms. Remains 124 /266 variables (removed 142) and now considering 358/592 (removed 234) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:47:56] [INFO ] Redundant transitions in 5 ms returned []
Running 357 sub problems to find dead transitions.
// Phase 1: matrix 358 rows 124 cols
[2025-05-31 00:47:56] [INFO ] Computed 11 invariants in 2 ms
[2025-05-31 00:47:56] [INFO ] State equation strengthened by 119 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:59] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:59] [INFO ] Deduced a trap composed of 4 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:47:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:59] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:59] [INFO ] Deduced a trap composed of 5 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:47:59] [INFO ] Deduced a trap composed of 7 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:48:00] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 12 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 7 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 4 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 4 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 9 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:48:01] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:01] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 4 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/31 constraints. Problems are: Problem set: 36 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:01] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:01] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:01] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:01] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:01] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:01] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 6 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:02] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:02] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 4 ms to minimize.
Problem TDEAD165 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:02] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:02] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:02] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:02] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 8 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:02] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 3 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 13/44 constraints. Problems are: Problem set: 53 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 53 solved, 304 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 5 (OVERLAPS) 357/481 variables, 124/168 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 118/286 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/286 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/482 variables, 1/287 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/287 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 10 (OVERLAPS) 0/482 variables, 0/287 constraints. Problems are: Problem set: 65 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 287 constraints, problems are : Problem set: 65 solved, 292 unsolved in 23141 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 124/124 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 357/229 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 65 solved, 292 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 57/124 variables, 11/11 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 33/44 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 357/481 variables, 124/168 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 118/286 constraints. Problems are: Problem set: 65 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 164/450 constraints. Problems are: Problem set: 65 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:30] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:30] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:30] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:30] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:30] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:30] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 6/456 constraints. Problems are: Problem set: 65 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/482 variables, and 456 constraints, problems are : Problem set: 65 solved, 292 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 124/124 constraints, ReadFeed: 118/119 constraints, PredecessorRefiner: 292/229 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 53659ms problems are : Problem set: 65 solved, 292 unsolved
Search for dead transitions found 65 dead transitions in 53660ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 124/266 places, 293/592 transitions.
Graph (complete) has 635 edges and 124 vertex of which 68 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.3 ms
Discarding 56 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 68 /124 variables (removed 56) and now considering 293/293 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/266 places, 293/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53742 ms. Remains : 68/266 places, 293/592 transitions.
Built C files in :
/tmp/ltsmin14103643790637166195
[2025-05-31 00:48:50] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14103643790637166195
Running compilation step : cd /tmp/ltsmin14103643790637166195;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1089 ms.
Running link step : cd /tmp/ltsmin14103643790637166195;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14103643790637166195;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8102121317724894985.hoa' '--buchi-type=spotba'
LTSmin run took 1109 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-07b-LTLCardinality-13 finished in 152804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 606/606 transitions.
Graph (trivial) has 263 edges and 280 vertex of which 4 / 280 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 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 277 transition count 494
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 151 rules applied. Total rules applied 261 place count 168 transition count 452
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 286 place count 143 transition count 452
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 286 place count 143 transition count 445
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 300 place count 136 transition count 445
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 309 place count 127 transition count 436
Iterating global reduction 3 with 9 rules applied. Total rules applied 318 place count 127 transition count 436
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 321 place count 124 transition count 421
Iterating global reduction 3 with 3 rules applied. Total rules applied 324 place count 124 transition count 421
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 328 place count 124 transition count 417
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 330 place count 122 transition count 417
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 432 place count 71 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 433 place count 71 transition count 364
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 443 place count 61 transition count 288
Iterating global reduction 6 with 10 rules applied. Total rules applied 453 place count 61 transition count 288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 457 place count 61 transition count 284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 459 place count 60 transition count 283
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 461 place count 58 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 462 place count 57 transition count 281
Applied a total of 462 rules in 47 ms. Remains 57 /280 variables (removed 223) and now considering 281/606 (removed 325) transitions.
// Phase 1: matrix 281 rows 57 cols
[2025-05-31 00:48:52] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:52] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-05-31 00:48:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:48:53] [INFO ] Implicit Places using invariants and state equation in 363 ms returned [51, 56]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 432 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/280 places, 281/606 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 279
Applied a total of 4 rules in 13 ms. Remains 53 /55 variables (removed 2) and now considering 279/281 (removed 2) transitions.
// Phase 1: matrix 279 rows 53 cols
[2025-05-31 00:48:53] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:53] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-05-31 00:48:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:48:53] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/280 places, 279/606 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 887 ms. Remains : 53/280 places, 279/606 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-15
Product exploration explored 100000 steps with 60 reset in 57 ms.
Entered a terminal (fully accepting) state of product in 671 steps with 46 reset in 2 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-15 finished in 1034 ms.
All properties solved by simple procedures.
Total runtime 562126 ms.

BK_STOP 1748652533606

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-174853729800707"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;