Execution Chart

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

Trace from the execution

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

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

=== Now, execution of the tool begins

BK_START 1748652292802

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202505121319
[2025-05-31 00:44:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 00:44:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:44:54] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2025-05-31 00:44:54] [INFO ] Transformed 323 places.
[2025-05-31 00:44:54] [INFO ] Transformed 846 transitions.
[2025-05-31 00:44:54] [INFO ] Found NUPN structural information;
[2025-05-31 00:44:54] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA AutonomousCar-PT-07b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 276 transition count 799
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 276 transition count 799
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 290 place count 276 transition count 603
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 299 place count 267 transition count 594
Iterating global reduction 1 with 9 rules applied. Total rules applied 308 place count 267 transition count 594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 309 place count 266 transition count 593
Iterating global reduction 1 with 1 rules applied. Total rules applied 310 place count 266 transition count 593
Applied a total of 310 rules in 94 ms. Remains 266 /323 variables (removed 57) and now considering 593/846 (removed 253) transitions.
// Phase 1: matrix 593 rows 266 cols
[2025-05-31 00:44:54] [INFO ] Computed 12 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:44:54] [INFO ] Implicit Places using invariants in 323 ms returned []
[2025-05-31 00:44:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:44:55] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2025-05-31 00:44:55] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:04] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 27 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 18 places in 185 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:04] [INFO ] Deduced a trap composed of 31 places in 181 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 32 places in 183 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:05] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:05] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 21 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 35 places in 180 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:05] [INFO ] Deduced a trap composed of 36 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:45:05] [INFO ] Deduced a trap composed of 36 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:45:06] [INFO ] Deduced a trap composed of 23 places in 179 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:06] [INFO ] Deduced a trap composed of 21 places in 182 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:06] [INFO ] Deduced a trap composed of 24 places in 177 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:06] [INFO ] Deduced a trap composed of 37 places in 174 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 14 places in 206 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:07] [INFO ] Deduced a trap composed of 50 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:45:07] [INFO ] Deduced a trap composed of 38 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:45:07] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 21 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 40 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:45:07] [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:45:08] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:08] [INFO ] Deduced a trap composed of 31 places in 184 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:09] [INFO ] Deduced a trap composed of 20 places in 189 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:09] [INFO ] Deduced a trap composed of 22 places in 189 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:09] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:09] [INFO ] Deduced a trap composed of 21 places in 187 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:09] [INFO ] Deduced a trap composed of 41 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:10] [INFO ] Deduced a trap composed of 41 places in 133 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 42 places in 163 ms of which 28 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 142 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:10] [INFO ] Deduced a trap composed of 43 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:45:11] [INFO ] Deduced a trap composed of 42 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:45:11] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:11] [INFO ] Deduced a trap composed of 44 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:45:11] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:12] [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:45:12] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:12] [INFO ] Deduced a trap composed of 45 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:45:13] [INFO ] Deduced a trap composed of 10 places in 173 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:13] [INFO ] Deduced a trap composed of 15 places in 172 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:13] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:16] [INFO ] Deduced a trap composed of 31 places in 146 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:16] [INFO ] Deduced a trap composed of 31 places in 146 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 32 places in 126 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 32 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:17] [INFO ] Deduced a trap composed of 27 places in 203 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:17] [INFO ] Deduced a trap composed of 28 places in 202 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:17] [INFO ] Deduced a trap composed of 31 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:45:17] [INFO ] Deduced a trap composed of 32 places in 172 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:17] [INFO ] Deduced a trap composed of 32 places in 146 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:18] [INFO ] Deduced a trap composed of 33 places in 158 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:18] [INFO ] Deduced a trap composed of 34 places in 178 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:18] [INFO ] Deduced a trap composed of 25 places in 186 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:18] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:19] [INFO ] Deduced a trap composed of 43 places in 136 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:19] [INFO ] Deduced a trap composed of 44 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:45:19] [INFO ] Deduced a trap composed of 45 places in 123 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:19] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:19] [INFO ] Deduced a trap composed of 46 places in 133 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:19] [INFO ] Deduced a trap composed of 32 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:45:20] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:21] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:21] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:21] [INFO ] Deduced a trap composed of 25 places in 161 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:22] [INFO ] Deduced a trap composed of 41 places in 122 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:22] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:22] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:22] [INFO ] Deduced a trap composed of 31 places in 158 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:23] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:23] [INFO ] Deduced a trap composed of 31 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:23] [INFO ] Deduced a trap composed of 31 places in 188 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:24] [INFO ] Deduced a trap composed of 30 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:45:24] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 11 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/859 variables, and 84 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 592/394 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:30] [INFO ] Deduced a trap composed of 49 places in 211 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:30] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:31] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:31] [INFO ] Deduced a trap composed of 45 places in 120 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:31] [INFO ] Deduced a trap composed of 46 places in 112 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:31] [INFO ] Deduced a trap composed of 46 places in 106 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:31] [INFO ] Deduced a trap composed of 41 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:45:32] [INFO ] Deduced a trap composed of 43 places in 136 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:32] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:32] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:32] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:32] [INFO ] Deduced a trap composed of 43 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:45:32] [INFO ] Deduced a trap composed of 44 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:45:33] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:33] [INFO ] Deduced a trap composed of 46 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:45:33] [INFO ] Deduced a trap composed of 31 places in 161 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:33] [INFO ] Deduced a trap composed of 32 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:45:33] [INFO ] Deduced a trap composed of 43 places in 93 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:33] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:34] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:36] [INFO ] Deduced a trap composed of 41 places in 103 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:36] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 6 (OVERLAPS) 593/859 variables, 266/372 constraints. Problems are: Problem set: 2 solved, 590 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/859 variables, 392/764 constraints. Problems are: Problem set: 2 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:54] [INFO ] Deduced a trap composed of 36 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:45:54] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/859 variables, and 766 constraints, problems are : Problem set: 2 solved, 590 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 590/394 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61069ms problems are : Problem set: 2 solved, 590 unsolved
Search for dead transitions found 2 dead transitions in 61088ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 266/323 places, 591/846 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 6 ms. Remains 266 /266 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61983 ms. Remains : 266/323 places, 591/846 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Support contains 43 out of 265 places after structural reductions.
[2025-05-31 00:45:56] [INFO ] Flatten gal took : 119 ms
[2025-05-31 00:45:56] [INFO ] Flatten gal took : 58 ms
[2025-05-31 00:45:56] [INFO ] Input system was already deterministic with 591 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (355 resets) in 1215 ms. (32 steps per ms) remains 6/24 properties
BEST_FIRST walk for 40003 steps (68 resets) in 158 ms. (251 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (75 resets) in 124 ms. (320 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (69 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (64 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
// Phase 1: matrix 591 rows 265 cols
[2025-05-31 00:45:57] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 161/265 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
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 230 ms of which 21 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 31 places in 173 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:58] [INFO ] Deduced a trap composed of 31 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:45:58] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 591/856 variables, 265/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/856 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/856 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 856/856 variables, and 281 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 161/265 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
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 31 places in 161 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 591/856 variables, 265/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
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 32 places in 153 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/856 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:59] [INFO ] Deduced a trap along path composed of 3 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:45:59] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 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 along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/856 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/856 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/856 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 856/856 variables, and 286 constraints, problems are : Problem set: 0 solved, 2 unsolved in 982 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2196ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 555 ms.
Support contains 6 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 591/591 transitions.
Graph (trivial) has 249 edges and 265 vertex of which 4 / 265 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1081 edges and 263 vertex of which 261 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 261 transition count 486
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 143 rules applied. Total rules applied 246 place count 162 transition count 442
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 272 place count 136 transition count 442
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 272 place count 136 transition count 436
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 284 place count 130 transition count 436
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 285 place count 129 transition count 435
Iterating global reduction 3 with 1 rules applied. Total rules applied 286 place count 129 transition count 435
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 402 place count 71 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 403 place count 71 transition count 376
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 416 place count 58 transition count 284
Iterating global reduction 4 with 13 rules applied. Total rules applied 429 place count 58 transition count 284
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 434 place count 58 transition count 279
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 5 with 2 rules applied. Total rules applied 436 place count 57 transition count 278
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 445 place count 57 transition count 269
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 454 place count 48 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 455 place count 47 transition count 268
Applied a total of 455 rules in 121 ms. Remains 47 /265 variables (removed 218) and now considering 268/591 (removed 323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 47/265 places, 268/591 transitions.
RANDOM walk for 40000 steps (697 resets) in 515 ms. (77 steps per ms) remains 1/2 properties
BEST_FIRST walk for 3755 steps (8 resets) in 7 ms. (469 steps per ms) remains 0/1 properties
Computed a total of 43 stabilizing places and 43 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' '!((X(X(G(p0))) U (p1 U p2)))'
Support contains 6 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 591/591 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 590
Applied a total of 2 rules in 7 ms. Remains 264 /265 variables (removed 1) and now considering 590/591 (removed 1) transitions.
// Phase 1: matrix 590 rows 264 cols
[2025-05-31 00:46:01] [INFO ] Computed 12 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:46:01] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-31 00:46:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:46:01] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2025-05-31 00:46:01] [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:46:10] [INFO ] Deduced a trap composed of 17 places in 199 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:10] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:10] [INFO ] Deduced a trap composed of 49 places in 199 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:10] [INFO ] Deduced a trap composed of 26 places in 174 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 22 places in 176 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:11] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 39 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 14 places in 179 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:11] [INFO ] Deduced a trap composed of 31 places in 190 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:11] [INFO ] Deduced a trap composed of 32 places in 176 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:12] [INFO ] Deduced a trap composed of 33 places in 169 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:12] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:12] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:12] [INFO ] Deduced a trap composed of 31 places in 165 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:12] [INFO ] Deduced a trap composed of 31 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:12] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:13] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:13] [INFO ] Deduced a trap composed of 18 places in 185 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:13] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:13] [INFO ] Deduced a trap composed of 41 places in 133 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:14] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 13 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:14] [INFO ] Deduced a trap composed of 24 places in 185 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:15] [INFO ] Deduced a trap composed of 35 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:15] [INFO ] Deduced a trap composed of 36 places in 167 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:15] [INFO ] Deduced a trap composed of 36 places in 157 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:15] [INFO ] Deduced a trap composed of 21 places in 183 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:15] [INFO ] Deduced a trap composed of 33 places in 176 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:16] [INFO ] Deduced a trap composed of 34 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:46:16] [INFO ] Deduced a trap composed of 35 places in 174 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:16] [INFO ] Deduced a trap composed of 36 places in 184 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:16] [INFO ] Deduced a trap composed of 37 places in 149 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:16] [INFO ] Deduced a trap composed of 38 places in 161 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:16] [INFO ] Deduced a trap composed of 38 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:46:17] [INFO ] Deduced a trap composed of 21 places in 204 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:17] [INFO ] Deduced a trap composed of 31 places in 204 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:17] [INFO ] Deduced a trap composed of 33 places in 192 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:17] [INFO ] Deduced a trap composed of 32 places in 160 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:18] [INFO ] Deduced a trap composed of 31 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:18] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:18] [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:46:18] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 9 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:21] [INFO ] Deduced a trap composed of 37 places in 204 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:21] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:22] [INFO ] Deduced a trap composed of 39 places in 192 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:22] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:22] [INFO ] Deduced a trap composed of 41 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:46:22] [INFO ] Deduced a trap composed of 42 places in 160 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:22] [INFO ] Deduced a trap composed of 42 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:46:23] [INFO ] Deduced a trap composed of 32 places in 168 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:23] [INFO ] Deduced a trap composed of 37 places in 143 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:23] [INFO ] Deduced a trap composed of 42 places in 149 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:23] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:23] [INFO ] Deduced a trap composed of 38 places in 141 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:24] [INFO ] Deduced a trap composed of 42 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:46:24] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:24] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:24] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:24] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:24] [INFO ] Deduced a trap composed of 46 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:46:25] [INFO ] Deduced a trap composed of 43 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:25] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 9 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:25] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:25] [INFO ] Deduced a trap composed of 39 places in 121 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:26] [INFO ] Deduced a trap composed of 27 places in 182 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:26] [INFO ] Deduced a trap composed of 39 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:46:26] [INFO ] Deduced a trap composed of 40 places in 156 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:26] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:27] [INFO ] Deduced a trap composed of 43 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:46:28] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:28] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:28] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:28] [INFO ] Deduced a trap composed of 45 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:46:29] [INFO ] Deduced a trap composed of 5 places in 165 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:29] [INFO ] Deduced a trap composed of 10 places in 188 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:29] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/854 variables, and 86 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 589/391 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 74/86 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:35] [INFO ] Deduced a trap composed of 32 places in 136 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:35] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 26 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 42 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:36] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:36] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:36] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:36] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:36] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:37] [INFO ] Deduced a trap composed of 51 places in 146 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:37] [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:46:37] [INFO ] Deduced a trap composed of 46 places in 123 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:37] [INFO ] Deduced a trap composed of 51 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:37] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:37] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:38] [INFO ] Deduced a trap composed of 31 places in 189 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:38] [INFO ] Deduced a trap composed of 42 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:46:38] [INFO ] Deduced a trap composed of 43 places in 128 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:38] [INFO ] Deduced a trap composed of 45 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:38] [INFO ] Deduced a trap composed of 46 places in 113 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:38] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/106 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:40] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 1/107 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:46] [INFO ] Deduced a trap composed of 41 places in 105 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:46] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 2/109 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:50] [INFO ] Deduced a trap composed of 32 places in 137 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:51] [INFO ] Deduced a trap composed of 31 places in 152 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:51] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:51] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:51] [INFO ] Deduced a trap composed of 32 places in 142 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:51] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:51] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:46:52] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 8/117 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/854 variables, and 117 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 198/391 constraints, Known Traps: 105/105 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60745ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 60747ms
Starting structural reductions in LTL mode, iteration 1 : 264/265 places, 590/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61400 ms. Remains : 264/265 places, 590/591 transitions.
Stuttering acceptance computed with spot in 435 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-00 finished in 61893 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||(p1&&F(p2))))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 591/591 transitions.
Graph (trivial) has 244 edges and 265 vertex of which 4 / 265 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 262 transition count 492
Reduce places removed 96 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 138 rules applied. Total rules applied 235 place count 166 transition count 450
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 27 rules applied. Total rules applied 262 place count 141 transition count 448
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 264 place count 139 transition count 448
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 264 place count 139 transition count 441
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 278 place count 132 transition count 441
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 280 place count 130 transition count 439
Iterating global reduction 4 with 2 rules applied. Total rules applied 282 place count 130 transition count 439
Performed 58 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 398 place count 72 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 399 place count 72 transition count 379
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 413 place count 58 transition count 281
Iterating global reduction 5 with 14 rules applied. Total rules applied 427 place count 58 transition count 281
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 434 place count 58 transition count 274
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 6 with 4 rules applied. Total rules applied 438 place count 56 transition count 272
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 440 place count 54 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 441 place count 53 transition count 270
Applied a total of 441 rules in 145 ms. Remains 53 /265 variables (removed 212) and now considering 270/591 (removed 321) transitions.
// Phase 1: matrix 270 rows 53 cols
[2025-05-31 00:47:03] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:03] [INFO ] Implicit Places using invariants in 618 ms returned []
[2025-05-31 00:47:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:47:03] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [49, 52]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 784 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/265 places, 270/591 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 49 transition count 268
Applied a total of 4 rules in 12 ms. Remains 49 /51 variables (removed 2) and now considering 268/270 (removed 2) transitions.
// Phase 1: matrix 268 rows 49 cols
[2025-05-31 00:47:03] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:04] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-31 00:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:47:04] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/265 places, 268/591 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1330 ms. Remains : 49/265 places, 268/591 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-01
Product exploration explored 100000 steps with 272 reset in 257 ms.
Product exploration explored 100000 steps with 69 reset in 136 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 335 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2529 resets) in 978 ms. (40 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (271 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
[2025-05-31 00:47:05] [INFO ] Invariant cache hit.
[2025-05-31 00:47:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 164/174 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 132/306 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/313 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/316 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/317 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 58 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 10/317 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 2/8 constraints, State Equation: 0/49 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 271ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F p2), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 443 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 49 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 268/268 transitions.
Applied a total of 0 rules in 11 ms. Remains 49 /49 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2025-05-31 00:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:06] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-05-31 00:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:47:06] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:47:06] [INFO ] Redundant transitions in 25 ms returned []
Running 267 sub problems to find dead transitions.
[2025-05-31 00:47:06] [INFO ] Invariant cache hit.
[2025-05-31 00:47:06] [INFO ] State equation strengthened by 1 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 267/316 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 267 unsolved
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 16 places in 99 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:11] [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:47:13] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 1/317 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:17] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:20] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:20] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 64 constraints, problems are : Problem set: 0 solved, 267 unsolved in 20818 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 267/140 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 267/316 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 5/203 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:42] [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:47:42] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 267 unsolved
SMT process timed out in 51481ms, After SMT, problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 51483ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51874 ms. Remains : 49/49 places, 268/268 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 64 steps (2 resets) in 4 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p2), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 5 factoid took 231 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 320 reset in 76 ms.
Product exploration explored 100000 steps with 174 reset in 79 ms.
Built C files in :
/tmp/ltsmin8475708042890560601
[2025-05-31 00:47:59] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2025-05-31 00:47:59] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 00:47:59] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2025-05-31 00:47:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 00:47:59] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2025-05-31 00:47:59] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 00:47:59] [INFO ] Built C files in 143ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8475708042890560601
Running compilation step : cd /tmp/ltsmin8475708042890560601;'/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 964 ms.
Running link step : cd /tmp/ltsmin8475708042890560601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8475708042890560601;'/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/stateBased15810527363000930295.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 268/268 transitions.
Applied a total of 0 rules in 11 ms. Remains 49 /49 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2025-05-31 00:48:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:14] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-31 00:48:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:48:14] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:48:14] [INFO ] Redundant transitions in 13 ms returned []
Running 267 sub problems to find dead transitions.
[2025-05-31 00:48:14] [INFO ] Invariant cache hit.
[2025-05-31 00:48:14] [INFO ] State equation strengthened by 1 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 267/316 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:16] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:19] [INFO ] Deduced a trap along path composed of 2 places in 22 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:20] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 1/317 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:25] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:27] [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:48:27] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 64 constraints, problems are : Problem set: 0 solved, 267 unsolved in 20151 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 267/140 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 267/316 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 5/203 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:49] [INFO ] Deduced a trap along path composed of 2 places in 25 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:49] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 267 unsolved
SMT process timed out in 50604ms, After SMT, problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 50606ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50983 ms. Remains : 49/49 places, 268/268 transitions.
Built C files in :
/tmp/ltsmin14008168109922474917
[2025-05-31 00:49:05] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2025-05-31 00:49:05] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 00:49:05] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2025-05-31 00:49:05] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 00:49:05] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2025-05-31 00:49:05] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 00:49:05] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14008168109922474917
Running compilation step : cd /tmp/ltsmin14008168109922474917;'/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 805 ms.
Running link step : cd /tmp/ltsmin14008168109922474917;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14008168109922474917;'/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/stateBased9981052025622591668.hoa' '--buchi-type=spotba'
LTSmin run took 11612 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-07b-LTLFireability-01 finished in 134852 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)&&F(G(p1)))))'
Support contains 6 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 591/591 transitions.
Graph (trivial) has 247 edges and 265 vertex of which 4 / 265 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 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 262 transition count 490
Reduce places removed 98 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 140 rules applied. Total rules applied 239 place count 164 transition count 448
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 139 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 266 place count 138 transition count 447
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 266 place count 138 transition count 441
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 278 place count 132 transition count 441
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 280 place count 130 transition count 439
Iterating global reduction 4 with 2 rules applied. Total rules applied 282 place count 130 transition count 439
Performed 57 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 396 place count 73 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 397 place count 73 transition count 380
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 410 place count 60 transition count 289
Iterating global reduction 5 with 13 rules applied. Total rules applied 423 place count 60 transition count 289
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 429 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 6 with 2 rules applied. Total rules applied 431 place count 59 transition count 282
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 432 place count 59 transition count 282
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 434 place count 57 transition count 280
Applied a total of 434 rules in 63 ms. Remains 57 /265 variables (removed 208) and now considering 280/591 (removed 311) transitions.
// Phase 1: matrix 280 rows 57 cols
[2025-05-31 00:49:17] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:49:17] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-05-31 00:49:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:49:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:49:18] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [53, 56]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 307 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/265 places, 280/591 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 54 transition count 279
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 2 with 2 rules applied. Total rules applied 4 place count 53 transition count 278
Applied a total of 4 rules in 15 ms. Remains 53 /55 variables (removed 2) and now considering 278/280 (removed 2) transitions.
// Phase 1: matrix 278 rows 53 cols
[2025-05-31 00:49:18] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:49:18] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-31 00:49:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:49:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:49:18] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/265 places, 278/591 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 667 ms. Remains : 53/265 places, 278/591 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-02
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-02 finished in 785 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((X((F(p0)||X(!p1)))||G(!p2)))) U ((p0&&X(X((X((F(p0)||X(!p1)))||G(!p2)))))||X(X(G((X((F(p0)||X(!p1)))||G(!p2))))))))'
Support contains 13 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 591/591 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 589
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 589
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 262 transition count 588
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 262 transition count 588
Applied a total of 6 rules in 14 ms. Remains 262 /265 variables (removed 3) and now considering 588/591 (removed 3) transitions.
// Phase 1: matrix 588 rows 262 cols
[2025-05-31 00:49:18] [INFO ] Computed 12 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:49:18] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-31 00:49:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:49:18] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 587 sub problems to find dead transitions.
[2025-05-31 00:49:18] [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:49:26] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:26] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:27] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:27] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:27] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:27] [INFO ] Deduced a trap composed of 38 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:49:27] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:28] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:28] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:28] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:28] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:28] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:28] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:29] [INFO ] Deduced a trap composed of 41 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:49:29] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:29] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:29] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:29] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:30] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:30] [INFO ] Deduced a trap composed of 49 places in 179 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:49:31] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:31] [INFO ] Deduced a trap composed of 41 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:49:31] [INFO ] Deduced a trap composed of 41 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:49:31] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:32] [INFO ] Deduced a trap composed of 31 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:49:32] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:32] [INFO ] Deduced a trap composed of 31 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:49:32] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:33] [INFO ] Deduced a trap composed of 43 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:49:33] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:33] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:33] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:33] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:33] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:33] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:34] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:34] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:34] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:34] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:34] [INFO ] Deduced a trap composed of 46 places in 105 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:49:37] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:37] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:37] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:38] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:38] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:38] [INFO ] Deduced a trap composed of 63 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:49:39] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:40] [INFO ] Deduced a trap composed of 32 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:49:40] [INFO ] Deduced a trap composed of 31 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:49:40] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:40] [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:49:40] [INFO ] Deduced a trap composed of 42 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:49:40] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:41] [INFO ] Deduced a trap composed of 32 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:49:41] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:41] [INFO ] Deduced a trap composed of 45 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:49:41] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:41] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:41] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:42] [INFO ] Deduced a trap composed of 46 places in 94 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:49:42] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:42] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:43] [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:49:43] [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:49:43] [INFO ] Deduced a trap composed of 41 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:49:44] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:44] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:45] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:45] [INFO ] Deduced a trap composed of 5 places in 172 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:49:49] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 262/850 variables, and 82 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: 70/70 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, 70/82 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:49:52] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:53] [INFO ] Deduced a trap composed of 46 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:49:54] [INFO ] Deduced a trap composed of 46 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:49:54] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 4/86 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:49:58] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:58] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:59] [INFO ] Deduced a trap composed of 43 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:49:59] [INFO ] Deduced a trap composed of 44 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:49:59] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:59] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:59] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:59] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:00] [INFO ] Deduced a trap composed of 45 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:50:00] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:00] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:00] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:00] [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:50:01] [INFO ] Deduced a trap composed of 46 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:50:01] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:01] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 16/102 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (OVERLAPS) 588/850 variables, 262/364 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/850 variables, 389/753 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 753 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 587/389 constraints, Known Traps: 90/90 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60719ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 60721ms
Starting structural reductions in LTL mode, iteration 1 : 262/265 places, 588/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61095 ms. Remains : 262/265 places, 588/591 transitions.
Stuttering acceptance computed with spot in 861 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p1 p2), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (NOT p0), (AND (NOT p0) p1 p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), false, (AND (NOT p0) p2 p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-05
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Product exploration explored 100000 steps with 25000 reset in 113 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 93 ms. Reduced automaton from 22 states, 60 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
RANDOM walk for 40000 steps (195 resets) in 211 ms. (188 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (75 resets) in 171 ms. (232 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (85 resets) in 136 ms. (291 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (65 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (64 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
[2025-05-31 00:50:21] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 218/231 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/262 variables, 2/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 588/850 variables, 262/274 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:21] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:22] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:22] [INFO ] Deduced a trap composed of 31 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:50:22] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/850 variables, 4/278 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:22] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/850 variables, 1/279 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/850 variables, 0/279 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/850 variables, 0/279 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 850/850 variables, and 279 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1155 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 101/106 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 156/262 variables, 7/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 4/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:22] [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:50:23] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 2/18 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 588/850 variables, 262/280 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/850 variables, 1/281 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:23] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:23] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/850 variables, 2/283 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/850 variables, 0/283 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/850 variables, 0/283 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 850/850 variables, and 283 constraints, problems are : Problem set: 3 solved, 1 unsolved in 668 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 1890ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 5 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 588/588 transitions.
Graph (trivial) has 244 edges and 262 vertex of which 4 / 262 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1078 edges and 260 vertex of which 258 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 258 transition count 487
Reduce places removed 95 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 136 rules applied. Total rules applied 235 place count 163 transition count 446
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 260 place count 139 transition count 445
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 263 place count 138 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 264 place count 137 transition count 443
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 264 place count 137 transition count 437
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 276 place count 131 transition count 437
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 396 place count 71 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 397 place count 71 transition count 376
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 411 place count 57 transition count 278
Iterating global reduction 6 with 14 rules applied. Total rules applied 425 place count 57 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 431 place count 57 transition count 272
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 433 place count 56 transition count 271
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 441 place count 56 transition count 263
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 449 place count 48 transition count 263
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 450 place count 48 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 451 place count 47 transition count 261
Applied a total of 451 rules in 110 ms. Remains 47 /262 variables (removed 215) and now considering 261/588 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 47/262 places, 261/588 transitions.
RANDOM walk for 21024 steps (239 resets) in 128 ms. (162 steps per ms) remains 0/1 properties
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (G (OR (NOT p1) p0 p2)), (G (OR (NOT p1) p0 (NOT p2))), (G (OR (NOT p1) p0))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F p2), (F (NOT p0)), (F p1)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 26 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLFireability-05 finished in 65075 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(G((X((X(G(p2))||p1))&&p0))))'
Support contains 13 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 591/591 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 589
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 589
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 262 transition count 588
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 262 transition count 588
Applied a total of 6 rules in 8 ms. Remains 262 /265 variables (removed 3) and now considering 588/591 (removed 3) transitions.
[2025-05-31 00:50:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:50:23] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-05-31 00:50:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:50:24] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 587 sub problems to find dead transitions.
[2025-05-31 00:50:24] [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:50:31] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:32] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:32] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:32] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:32] [INFO ] Deduced a trap composed of 37 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:50:32] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:32] [INFO ] Deduced a trap composed of 39 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:50:33] [INFO ] Deduced a trap composed of 40 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:50:33] [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:50:33] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:33] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:33] [INFO ] Deduced a trap composed of 39 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:50:34] [INFO ] Deduced a trap composed of 40 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:50:34] [INFO ] Deduced a trap composed of 41 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:50:34] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:34] [INFO ] Deduced a trap composed of 42 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:50:34] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:34] [INFO ] Deduced a trap composed of 24 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:50:35] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:35] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 24 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:50:36] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:36] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:36] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:36] [INFO ] Deduced a trap composed of 32 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:50:37] [INFO ] Deduced a trap composed of 31 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:50:37] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:37] [INFO ] Deduced a trap composed of 31 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:50:37] [INFO ] Deduced a trap composed of 32 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:50:38] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:38] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:38] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:38] [INFO ] Deduced a trap composed of 46 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:50:38] [INFO ] Deduced a trap composed of 46 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:50:39] [INFO ] Deduced a trap composed of 43 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:50:39] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:39] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:39] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:39] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:39] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:40] [INFO ] Deduced a trap composed of 46 places in 134 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:50:42] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:43] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:43] [INFO ] Deduced a trap composed of 22 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:50:43] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:44] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:44] [INFO ] Deduced a trap composed of 63 places in 175 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:44] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:45] [INFO ] Deduced a trap composed of 32 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:50:45] [INFO ] Deduced a trap composed of 31 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:50:45] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:45] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:46] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:46] [INFO ] Deduced a trap composed of 46 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:50:46] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:46] [INFO ] Deduced a trap composed of 41 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:50:46] [INFO ] Deduced a trap composed of 45 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:50:46] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:47] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:47] [INFO ] Deduced a trap composed of 45 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:50:47] [INFO ] Deduced a trap composed of 46 places in 97 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:50:47] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:48] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:48] [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:50:48] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:49] [INFO ] Deduced a trap composed of 41 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:50:49] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:50] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:50] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:50] [INFO ] Deduced a trap composed of 5 places in 176 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:50:53] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 262/850 variables, and 82 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/262 constraints, PredecessorRefiner: 587/389 constraints, Known Traps: 70/70 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, 70/82 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:50:57] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:58] [INFO ] Deduced a trap composed of 46 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:50:59] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:59] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 4/86 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:51:03] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:03] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:03] [INFO ] Deduced a trap composed of 43 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:51:04] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:04] [INFO ] Deduced a trap composed of 45 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:51:04] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:04] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:04] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:04] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:05] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:05] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:05] [INFO ] Deduced a trap composed of 46 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:51:05] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:05] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:06] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:06] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 16/102 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (OVERLAPS) 588/850 variables, 262/364 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/850 variables, 389/753 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 753 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 587/389 constraints, Known Traps: 90/90 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60680ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 60681ms
Starting structural reductions in LTL mode, iteration 1 : 262/265 places, 588/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61105 ms. Remains : 262/265 places, 588/591 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-06 finished in 61276 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)||F(p1)) U !((F(p1) U !p0)||F(p2))))'
Support contains 8 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 591/591 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 589
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 589
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 262 transition count 588
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 262 transition count 588
Applied a total of 6 rules in 12 ms. Remains 262 /265 variables (removed 3) and now considering 588/591 (removed 3) transitions.
[2025-05-31 00:51:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:51:25] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-31 00:51:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:51:25] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 587 sub problems to find dead transitions.
[2025-05-31 00:51:25] [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:51:33] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:33] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:33] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:33] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:33] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:34] [INFO ] Deduced a trap composed of 38 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:51:34] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:34] [INFO ] Deduced a trap composed of 40 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:51:34] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:34] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:35] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:35] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:35] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:35] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:35] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:35] [INFO ] Deduced a trap composed of 42 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:51:36] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:36] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:36] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:36] [INFO ] Deduced a trap composed of 49 places in 183 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:51:37] [INFO ] Deduced a trap composed of 31 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:51:37] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:38] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:38] [INFO ] Deduced a trap composed of 32 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:51:38] [INFO ] Deduced a trap composed of 31 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:51:38] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:39] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:39] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:39] [INFO ] Deduced a trap composed of 43 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:51:39] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:40] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:40] [INFO ] Deduced a trap composed of 46 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:51:40] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:40] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:40] [INFO ] Deduced a trap composed of 43 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:51:40] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:40] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:41] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:41] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:41] [INFO ] Deduced a trap composed of 46 places in 111 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:51:44] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:44] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:44] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:45] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:45] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:45] [INFO ] Deduced a trap composed of 63 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:51:45] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:46] [INFO ] Deduced a trap composed of 32 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:51:46] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:47] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:47] [INFO ] Deduced a trap composed of 31 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:51:47] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:47] [INFO ] Deduced a trap composed of 46 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:51:47] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:48] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:48] [INFO ] Deduced a trap composed of 45 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:51:48] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:48] [INFO ] Deduced a trap composed of 42 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:51:48] [INFO ] Deduced a trap composed of 45 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:51:48] [INFO ] Deduced a trap composed of 46 places in 113 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:51:49] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:49] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:50] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:50] [INFO ] Deduced a trap composed of 42 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:51:50] [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:51:50] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:51] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:51] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:52] [INFO ] Deduced a trap composed of 5 places in 174 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:51:55] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 262/850 variables, and 82 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/262 constraints, PredecessorRefiner: 587/389 constraints, Known Traps: 70/70 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, 70/82 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:51:59] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:00] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:00] [INFO ] Deduced a trap composed of 46 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:52:01] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 4/86 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:52:04] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:04] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:05] [INFO ] Deduced a trap composed of 43 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:52:05] [INFO ] Deduced a trap composed of 44 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:52:05] [INFO ] Deduced a trap composed of 45 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:52:05] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:05] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:06] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:06] [INFO ] Deduced a trap composed of 45 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:52:06] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:06] [INFO ] Deduced a trap composed of 45 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:52:06] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:06] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:07] [INFO ] Deduced a trap composed of 46 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:52:07] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:07] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 16/102 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (OVERLAPS) 588/850 variables, 262/364 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/850 variables, 389/753 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 753 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 587/389 constraints, Known Traps: 90/90 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60641ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 60642ms
Starting structural reductions in LTL mode, iteration 1 : 262/265 places, 588/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61077 ms. Remains : 262/265 places, 588/591 transitions.
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p0) p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) p1), (AND (NOT p1) (NOT p0) p2), p2, (NOT p0), (NOT p1), (OR (AND (NOT p0) p1) (AND p1 p2)), (AND (NOT p1) p0 p2), (AND p1 p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-07
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-07 finished in 61469 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(X((p0||F((X(p2)&&p1)))))&&F(p3))))'
Support contains 13 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 591/591 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 590
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 263 transition count 589
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 263 transition count 589
Applied a total of 4 rules in 10 ms. Remains 263 /265 variables (removed 2) and now considering 589/591 (removed 2) transitions.
// Phase 1: matrix 589 rows 263 cols
[2025-05-31 00:52:26] [INFO ] Computed 12 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:52:26] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-05-31 00:52:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:52:26] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2025-05-31 00:52:26] [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/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:34] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:34] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:34] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:35] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:35] [INFO ] Deduced a trap composed of 21 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:52:35] [INFO ] Deduced a trap composed of 26 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:52:35] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:36] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:36] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:36] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:36] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:36] [INFO ] Deduced a trap composed of 18 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:52:36] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:37] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:37] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:37] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:37] [INFO ] Deduced a trap composed of 63 places in 182 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:37] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:38] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:38] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:38] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:38] [INFO ] Deduced a trap composed of 35 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:52:39] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:39] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:39] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:39] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:40] [INFO ] Deduced a trap composed of 40 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:52:40] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:40] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:40] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:40] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:41] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:41] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:41] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:41] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:41] [INFO ] Deduced a trap composed of 41 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:52:42] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:42] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:42] [INFO ] Deduced a trap composed of 42 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:52:42] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:45] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:45] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:46] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:46] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:46] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:46] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:46] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:47] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:47] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:47] [INFO ] Deduced a trap composed of 31 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:52:47] [INFO ] Deduced a trap composed of 41 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:52:48] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:49] [INFO ] Deduced a trap composed of 43 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:52:49] [INFO ] Deduced a trap composed of 44 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:52:49] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:49] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:49] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:52] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:53] [INFO ] Deduced a trap composed of 38 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:52:53] [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:52:53] [INFO ] Deduced a trap composed of 31 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:52:54] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:54] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:54] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:54] [INFO ] Deduced a trap composed of 46 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:52:54] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:54] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:55] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:55] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:55] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:55] [INFO ] Deduced a trap composed of 42 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:52:55] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:56] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:56] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:56] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:56] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:56] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:57] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/852 variables, and 90 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 588/390 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:01] [INFO ] Deduced a trap composed of 43 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:53:02] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:02] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:02] [INFO ] Deduced a trap composed of 46 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:53:02] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:06] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:07] [INFO ] Deduced a trap composed of 42 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:53:07] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:07] [INFO ] Deduced a trap composed of 45 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:53:07] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:07] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:07] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:08] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:08] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:08] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:08] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:09] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:09] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 6 (OVERLAPS) 589/852 variables, 263/371 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 390/761 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/852 variables, and 761 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 588/390 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60697ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 60698ms
Starting structural reductions in LTL mode, iteration 1 : 263/265 places, 589/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61125 ms. Remains : 263/265 places, 589/591 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-11
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-11 finished in 61422 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 1 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 591/591 transitions.
Graph (trivial) has 249 edges and 265 vertex of which 4 / 265 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 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 262 transition count 490
Reduce places removed 98 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 140 rules applied. Total rules applied 239 place count 164 transition count 448
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 139 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 266 place count 138 transition count 447
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 266 place count 138 transition count 440
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 280 place count 131 transition count 440
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 282 place count 129 transition count 438
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 129 transition count 438
Performed 58 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 400 place count 71 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 401 place count 71 transition count 378
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 416 place count 56 transition count 272
Iterating global reduction 5 with 15 rules applied. Total rules applied 431 place count 56 transition count 272
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 438 place count 56 transition count 265
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 6 with 4 rules applied. Total rules applied 442 place count 54 transition count 263
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 444 place count 52 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 445 place count 51 transition count 261
Applied a total of 445 rules in 41 ms. Remains 51 /265 variables (removed 214) and now considering 261/591 (removed 330) transitions.
// Phase 1: matrix 261 rows 51 cols
[2025-05-31 00:53:27] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:28] [INFO ] Implicit Places using invariants in 313 ms returned []
[2025-05-31 00:53:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:53:28] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [47, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 462 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/265 places, 261/591 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 47 transition count 259
Applied a total of 4 rules in 7 ms. Remains 47 /49 variables (removed 2) and now considering 259/261 (removed 2) transitions.
// Phase 1: matrix 259 rows 47 cols
[2025-05-31 00:53:28] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:28] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-05-31 00:53:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:53:28] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/265 places, 259/591 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 841 ms. Remains : 47/265 places, 259/591 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 9 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLFireability-12 finished in 1327 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((X((X(!p0)&&!p1)) U p2))))'
Support contains 1 out of 265 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 591/591 transitions.
Graph (trivial) has 231 edges and 265 vertex of which 4 / 265 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 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 262 transition count 491
Reduce places removed 97 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 139 rules applied. Total rules applied 237 place count 165 transition count 449
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 263 place count 140 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 139 transition count 448
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 264 place count 139 transition count 443
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 274 place count 134 transition count 443
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 276 place count 132 transition count 441
Iterating global reduction 4 with 2 rules applied. Total rules applied 278 place count 132 transition count 441
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 4 with 102 rules applied. Total rules applied 380 place count 81 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 381 place count 81 transition count 388
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 392 place count 70 transition count 314
Iterating global reduction 5 with 11 rules applied. Total rules applied 403 place count 70 transition count 314
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 410 place count 70 transition count 307
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 6 with 4 rules applied. Total rules applied 414 place count 68 transition count 305
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 416 place count 66 transition count 303
Applied a total of 416 rules in 34 ms. Remains 66 /265 variables (removed 199) and now considering 303/591 (removed 288) transitions.
// Phase 1: matrix 303 rows 66 cols
[2025-05-31 00:53:29] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:29] [INFO ] Implicit Places using invariants in 648 ms returned []
[2025-05-31 00:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:53:29] [INFO ] Implicit Places using invariants and state equation in 153 ms returned [62, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 817 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/265 places, 303/591 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 62 transition count 301
Applied a total of 4 rules in 7 ms. Remains 62 /64 variables (removed 2) and now considering 301/303 (removed 2) transitions.
// Phase 1: matrix 301 rows 62 cols
[2025-05-31 00:53:30] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:30] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-31 00:53:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:53:30] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/265 places, 301/591 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1078 ms. Remains : 62/265 places, 301/591 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-14
Stuttering criterion allowed to conclude after 202 steps with 24 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-14 finished in 1164 ms.
All properties solved by simple procedures.
Total runtime 516308 ms.

BK_STOP 1748652810344

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
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-174853729800708"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;