Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063900292.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 DES-PT-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063900292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K 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.1K 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 140K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 79K 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 DES-PT-10b-LTLFireability-00
FORMULA_NAME DES-PT-10b-LTLFireability-01
FORMULA_NAME DES-PT-10b-LTLFireability-02
FORMULA_NAME DES-PT-10b-LTLFireability-03
FORMULA_NAME DES-PT-10b-LTLFireability-04
FORMULA_NAME DES-PT-10b-LTLFireability-05
FORMULA_NAME DES-PT-10b-LTLFireability-06
FORMULA_NAME DES-PT-10b-LTLFireability-07
FORMULA_NAME DES-PT-10b-LTLFireability-08
FORMULA_NAME DES-PT-10b-LTLFireability-09
FORMULA_NAME DES-PT-10b-LTLFireability-10
FORMULA_NAME DES-PT-10b-LTLFireability-11
FORMULA_NAME DES-PT-10b-LTLFireability-12
FORMULA_NAME DES-PT-10b-LTLFireability-13
FORMULA_NAME DES-PT-10b-LTLFireability-14
FORMULA_NAME DES-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748689364120

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 11:02:46] [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 11:02:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 11:02:46] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2025-05-31 11:02:46] [INFO ] Transformed 320 places.
[2025-05-31 11:02:46] [INFO ] Transformed 271 transitions.
[2025-05-31 11:02:46] [INFO ] Found NUPN structural information;
[2025-05-31 11:02:47] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-10b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-10b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 271
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 297 transition count 251
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 297 transition count 251
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 289 transition count 243
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 289 transition count 243
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 289 transition count 237
Applied a total of 65 rules in 130 ms. Remains 289 /320 variables (removed 31) and now considering 237/271 (removed 34) transitions.
// Phase 1: matrix 237 rows 289 cols
[2025-05-31 11:02:47] [INFO ] Computed 62 invariants in 49 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:02:48] [INFO ] Implicit Places using invariants in 779 ms returned []
[2025-05-31 11:02:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:02:49] [INFO ] Implicit Places using invariants and state equation in 846 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1682 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 288/320 places, 237/271 transitions.
Applied a total of 0 rules in 13 ms. Remains 288 /288 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1851 ms. Remains : 288/320 places, 237/271 transitions.
Support contains 46 out of 288 places after structural reductions.
[2025-05-31 11:02:49] [INFO ] Flatten gal took : 101 ms
[2025-05-31 11:02:49] [INFO ] Flatten gal took : 48 ms
[2025-05-31 11:02:49] [INFO ] Input system was already deterministic with 237 transitions.
Support contains 44 out of 288 places (down from 46) after GAL structural reductions.
RANDOM walk for 40000 steps (347 resets) in 2449 ms. (16 steps per ms) remains 3/33 properties
BEST_FIRST walk for 40004 steps (51 resets) in 428 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (49 resets) in 345 ms. (115 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (47 resets) in 273 ms. (146 steps per ms) remains 3/3 properties
// Phase 1: matrix 237 rows 288 cols
[2025-05-31 11:02:50] [INFO ] Computed 61 invariants in 19 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 144/171 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 94/265 variables, 26/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/271 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 223/494 variables, 271/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:51] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:52] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:52] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:52] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 19/513 variables, 11/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/513 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 6/519 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 4/523 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/523 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/525 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/525 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/525 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 353 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1855 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 144/171 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 94/265 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/271 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 223/494 variables, 271/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:54] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:54] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:54] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:54] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:55] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:55] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:55] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 21 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 7/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:55] [INFO ] Deduced a trap along path composed of 4 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:56] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/494 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/494 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 19/513 variables, 11/359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/513 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/519 variables, 3/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:57] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 26 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/519 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/519 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 4/523 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:02:57] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/525 variables, and 366 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 287/288 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 6927ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 237/237 transitions.
Graph (complete) has 562 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 282 transition count 214
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 265 transition count 214
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 265 transition count 204
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 255 transition count 204
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 65 place count 247 transition count 196
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 247 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 247 transition count 193
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 243 transition count 189
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 243 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 89 place count 243 transition count 184
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 91 place count 242 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 91 place count 242 transition count 181
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 95 place count 240 transition count 181
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 243 place count 166 transition count 107
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 5 with 4 rules applied. Total rules applied 247 place count 164 transition count 109
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 164 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 249 place count 163 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 162 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 251 place count 161 transition count 107
Applied a total of 251 rules in 109 ms. Remains 161 /288 variables (removed 127) and now considering 107/237 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 161/288 places, 107/237 transitions.
RANDOM walk for 40000 steps (1708 resets) in 896 ms. (44 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (330 resets) in 250 ms. (159 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (320 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (311 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 304467 steps, run visited all 3 properties in 1517 ms. (steps per millisecond=200 )
Probabilistic random walk after 304467 steps, saw 71826 distinct states, run finished after 1523 ms. (steps per millisecond=199 ) properties seen :3
FORMULA DES-PT-10b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 97 stabilizing places and 90 stable transitions
Graph (complete) has 562 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 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(X(X(p0))))||F(p1)))))'
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 237/237 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 278 transition count 227
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 278 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 278 transition count 224
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 274 transition count 220
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 274 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 274 transition count 216
Applied a total of 35 rules in 19 ms. Remains 274 /288 variables (removed 14) and now considering 216/237 (removed 21) transitions.
// Phase 1: matrix 216 rows 274 cols
[2025-05-31 11:03:00] [INFO ] Computed 61 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:03:01] [INFO ] Implicit Places using invariants in 411 ms returned []
[2025-05-31 11:03:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:03:01] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-05-31 11:03:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/490 variables, 274/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:11] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:12] [INFO ] Deduced a trap composed of 7 places in 267 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:12] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:12] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:12] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:13] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:13] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:13] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:13] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:14] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:14] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:14] [INFO ] Deduced a trap composed of 23 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 11:03:14] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:14] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:14] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:15] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:15] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:15] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:15] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:15] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:19] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:19] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:19] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:19] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:19] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:19] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:19] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:20] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:20] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:20] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:20] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:20] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:20] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:20] [INFO ] Deduced a trap composed of 10 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 11:03:21] [INFO ] Deduced a trap composed of 11 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 11:03:21] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:21] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 17/372 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:23] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:25] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:28] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 375 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:35] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:35] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:35] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:36] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:38] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 216/490 variables, 274/380 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 215/595 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:49] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:49] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:49] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:50] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:50] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:50] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:50] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:51] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:51] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:51] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:52] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:52] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:52] [INFO ] Deduced a trap composed of 33 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 11:03:52] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:03:59] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 610 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 274/288 places, 216/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61345 ms. Remains : 274/288 places, 216/237 transitions.
Stuttering acceptance computed with spot in 626 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLFireability-00
Product exploration explored 100000 steps with 3097 reset in 595 ms.
Product exploration explored 100000 steps with 3061 reset in 311 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 529 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/274 stabilizing places and 89/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 285 steps (1 resets) in 9 ms. (28 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 216/216 transitions.
Applied a total of 0 rules in 11 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2025-05-31 11:04:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:04:05] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-05-31 11:04:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:04:06] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-05-31 11:04:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/490 variables, 274/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:14] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:15] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:15] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:15] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:15] [INFO ] Deduced a trap composed of 12 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 11:04:16] [INFO ] Deduced a trap composed of 13 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 11:04:16] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:16] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:16] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:16] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:17] [INFO ] Deduced a trap composed of 23 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 11:04:17] [INFO ] Deduced a trap composed of 23 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 11:04:17] [INFO ] Deduced a trap composed of 25 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 11:04:17] [INFO ] Deduced a trap composed of 14 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 11:04:17] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:17] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:18] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:18] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:18] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:18] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:22] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:22] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:22] [INFO ] Deduced a trap composed of 20 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 11:04:22] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:22] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:23] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:23] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:23] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:23] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:23] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:23] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:23] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:23] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:24] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:24] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:24] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:24] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 17/372 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:27] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:28] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:29] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 17 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 375 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:40] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:40] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:40] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:40] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:42] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 216/490 variables, 274/380 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 215/595 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:54] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:55] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:55] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:55] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:55] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:55] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:55] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:56] [INFO ] Deduced a trap composed of 27 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 11:04:56] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:57] [INFO ] Deduced a trap composed of 30 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 11:04:57] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:57] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:57] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:04:57] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:04] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 610 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Finished structural reductions in LTL mode , in 1 iterations and 61175 ms. Remains : 274/274 places, 216/216 transitions.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 529 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/274 stabilizing places and 89/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 292 steps (0 resets) in 7 ms. (36 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 279 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 3183 reset in 251 ms.
Product exploration explored 100000 steps with 3033 reset in 585 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 216/216 transitions.
Graph (complete) has 529 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 269 transition count 213
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 269 transition count 215
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 269 transition count 215
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 264 transition count 210
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 264 transition count 210
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 1 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 110 place count 264 transition count 213
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 120 place count 254 transition count 203
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 130 place count 254 transition count 203
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 135 place count 254 transition count 223
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 252 transition count 217
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 252 transition count 217
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 139 rules in 123 ms. Remains 252 /274 variables (removed 22) and now considering 217/216 (removed -1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:05:09] [INFO ] Redundant transitions in 19 ms returned []
Running 216 sub problems to find dead transitions.
// Phase 1: matrix 217 rows 252 cols
[2025-05-31 11:05:09] [INFO ] Computed 59 invariants in 7 ms
[2025-05-31 11:05:09] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/252 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:17] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 6 ms to minimize.
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD158 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/60 constraints. Problems are: Problem set: 14 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:18] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:18] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:18] [INFO ] Deduced a trap composed of 4 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 11:05:18] [INFO ] Deduced a trap composed of 3 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 11:05:18] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:18] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD178 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:19] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:19] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:19] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:19] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:19] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:19] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:19] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:19] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 15/75 constraints. Problems are: Problem set: 46 solved, 170 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/75 constraints. Problems are: Problem set: 46 solved, 170 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 7 (OVERLAPS) 217/469 variables, 252/327 constraints. Problems are: Problem set: 107 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 8/335 constraints. Problems are: Problem set: 107 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/335 constraints. Problems are: Problem set: 107 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/469 variables, 0/335 constraints. Problems are: Problem set: 107 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 335 constraints, problems are : Problem set: 107 solved, 109 unsolved in 18194 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 252/252 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 107 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 13/13 constraints. Problems are: Problem set: 107 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 107 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 66/230 variables, 32/45 constraints. Problems are: Problem set: 107 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 16/61 constraints. Problems are: Problem set: 107 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/61 constraints. Problems are: Problem set: 107 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 14/244 variables, 14/75 constraints. Problems are: Problem set: 107 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:31] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:31] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 2/77 constraints. Problems are: Problem set: 107 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:32] [INFO ] Deduced a trap composed of 11 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 11:05:32] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:32] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 3/80 constraints. Problems are: Problem set: 107 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:33] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/81 constraints. Problems are: Problem set: 107 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/81 constraints. Problems are: Problem set: 107 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 213/457 variables, 244/325 constraints. Problems are: Problem set: 107 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 8/333 constraints. Problems are: Problem set: 107 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 109/442 constraints. Problems are: Problem set: 107 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:49] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:49] [INFO ] Deduced a trap along path composed of 5 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:49] [INFO ] Deduced a trap along path composed of 5 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:05:49] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 4/446 constraints. Problems are: Problem set: 107 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/469 variables, and 446 constraints, problems are : Problem set: 107 solved, 109 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 244/252 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 109/216 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 48322ms problems are : Problem set: 107 solved, 109 unsolved
Search for dead transitions found 107 dead transitions in 48325ms
Found 107 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 107 transitions
Dead transitions reduction (with SMT) removed 107 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 252/274 places, 110/216 transitions.
Graph (complete) has 556 edges and 252 vertex of which 165 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.1 ms
Discarding 87 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 165 /252 variables (removed 87) and now considering 110/110 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 165/274 places, 110/216 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48492 ms. Remains : 165/274 places, 110/216 transitions.
Built C files in :
/tmp/ltsmin6415301782835208275
[2025-05-31 11:05:58] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6415301782835208275
Running compilation step : cd /tmp/ltsmin6415301782835208275;'/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 803 ms.
Running link step : cd /tmp/ltsmin6415301782835208275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin6415301782835208275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1949500215525082954.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 274 cols
[2025-05-31 11:06:13] [INFO ] Computed 61 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:06:13] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-31 11:06:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:06:14] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-05-31 11:06:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/490 variables, 274/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:22] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:22] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:22] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:23] [INFO ] Deduced a trap composed of 10 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 11:06:23] [INFO ] Deduced a trap composed of 12 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 11:06:23] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:23] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:24] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:24] [INFO ] Deduced a trap composed of 24 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 11:06:24] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:24] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:24] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:24] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:25] [INFO ] Deduced a trap composed of 14 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 11:06:25] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:25] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:25] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:25] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:25] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:26] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:30] [INFO ] Deduced a trap composed of 18 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 11:06:30] [INFO ] Deduced a trap composed of 19 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 11:06:30] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:31] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:31] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:31] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:31] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:31] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:31] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:31] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:31] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:32] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:32] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:32] [INFO ] Deduced a trap composed of 10 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 11:06:32] [INFO ] Deduced a trap composed of 11 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 11:06:32] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:33] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 17/372 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:35] [INFO ] Deduced a trap composed of 13 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 11:06:37] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:39] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 375 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:47] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:47] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:47] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:47] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:06:50] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 216/490 variables, 274/380 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 215/595 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:07:03] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:07:03] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:07:03] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:07:03] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:07:03] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:07:03] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:07:03] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:07:04] [INFO ] Deduced a trap composed of 27 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 11:07:04] [INFO ] Deduced a trap composed of 28 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 11:07:04] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:07:04] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:07:04] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:07:04] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:07:05] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:07:11] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 610 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Finished structural reductions in LTL mode , in 1 iterations and 60756 ms. Remains : 274/274 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin3664308170877948385
[2025-05-31 11:07:14] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3664308170877948385
Running compilation step : cd /tmp/ltsmin3664308170877948385;'/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 810 ms.
Running link step : cd /tmp/ltsmin3664308170877948385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3664308170877948385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2211545489824337245.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 11:07:29] [INFO ] Flatten gal took : 30 ms
[2025-05-31 11:07:29] [INFO ] Flatten gal took : 28 ms
[2025-05-31 11:07:29] [INFO ] Time to serialize gal into /tmp/LTL885344084724839948.gal : 8 ms
[2025-05-31 11:07:29] [INFO ] Time to serialize properties into /tmp/LTL10749367492374799932.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL885344084724839948.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17365827862528379243.hoa' '-atoms' '/tmp/LTL10749367492374799932.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10749367492374799932.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17365827862528379243.hoa
Detected timeout of ITS tools.
[2025-05-31 11:07:44] [INFO ] Flatten gal took : 16 ms
[2025-05-31 11:07:44] [INFO ] Flatten gal took : 16 ms
[2025-05-31 11:07:44] [INFO ] Time to serialize gal into /tmp/LTL16868617722590839289.gal : 2 ms
[2025-05-31 11:07:44] [INFO ] Time to serialize properties into /tmp/LTL3527004434252872231.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16868617722590839289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3527004434252872231.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(X(X("(p77==1)")))))||(F("(p52==0)"))))))
Formula 0 simplified : XF(XXXX!"(p77==1)" & G!"(p52==0)")
Detected timeout of ITS tools.
[2025-05-31 11:07:59] [INFO ] Flatten gal took : 34 ms
[2025-05-31 11:07:59] [INFO ] Applying decomposition
[2025-05-31 11:07:59] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18261666158747378320.txt' '-o' '/tmp/graph18261666158747378320.bin' '-w' '/tmp/graph18261666158747378320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18261666158747378320.bin' '-l' '-1' '-v' '-w' '/tmp/graph18261666158747378320.weights' '-q' '0' '-e' '0.001'
[2025-05-31 11:07:59] [INFO ] Decomposing Gal with order
[2025-05-31 11:07:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 11:07:59] [INFO ] Removed a total of 11 redundant transitions.
[2025-05-31 11:07:59] [INFO ] Flatten gal took : 83 ms
[2025-05-31 11:07:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 12 ms.
[2025-05-31 11:07:59] [INFO ] Time to serialize gal into /tmp/LTL16037659891375897153.gal : 9 ms
[2025-05-31 11:07:59] [INFO ] Time to serialize properties into /tmp/LTL12814450654280009202.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16037659891375897153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12814450654280009202.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(X(X("(i3.u11.p77==1)")))))||(F("(i1.i1.u6.p52==0)"))))))
Formula 0 simplified : XF(XXXX!"(i3.u11.p77==1)" & G!"(i1.i1.u6.p52==0)")
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t87, t173, t197, t198, t231, u30.t79, i0.u73.t17, i0.u73.t154, i1.i1.u12.t120, i1.i1...848
Computing Next relation with stutter on 6.47736e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-10b-LTLFireability-00 finished in 314391 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) U ((!p1&&X(!p0))||X(G(!p0)))) U (F(p2) U X(p3))))'
Support contains 6 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 237/237 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 280 transition count 229
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 280 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 280 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 277 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 277 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 277 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 276 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 276 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 276 transition count 218
Applied a total of 31 rules in 22 ms. Remains 276 /288 variables (removed 12) and now considering 218/237 (removed 19) transitions.
// Phase 1: matrix 218 rows 276 cols
[2025-05-31 11:08:15] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:08:15] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-05-31 11:08:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:08:16] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-31 11:08:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/494 variables, 276/337 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:24] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:24] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:24] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:24] [INFO ] Deduced a trap composed of 19 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 11:08:24] [INFO ] Deduced a trap composed of 29 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 11:08:25] [INFO ] Deduced a trap composed of 22 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 11:08:25] [INFO ] Deduced a trap composed of 17 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 11:08:26] [INFO ] Deduced a trap composed of 19 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 11:08:26] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:26] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:26] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:26] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:26] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:26] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:26] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:27] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:27] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:27] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:27] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:27] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 20/357 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:29] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:29] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:29] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:29] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:29] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:29] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:29] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:30] [INFO ] Deduced a trap composed of 7 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 11:08:30] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:30] [INFO ] Deduced a trap composed of 13 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 11:08:30] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:30] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:30] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:31] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:31] [INFO ] Deduced a trap composed of 14 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 11:08:31] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:31] [INFO ] Deduced a trap composed of 11 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 11:08:32] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:32] [INFO ] Deduced a trap composed of 21 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 11:08:32] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 30 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:35] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:35] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:36] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 32 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:38] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:44] [INFO ] Deduced a trap along path composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:44] [INFO ] Deduced a trap along path composed of 4 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:44] [INFO ] Deduced a trap along path composed of 4 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:45] [INFO ] Deduced a trap along path composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/494 variables, and 385 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 44/105 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:47] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:47] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:47] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:47] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:47] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:47] [INFO ] Deduced a trap composed of 26 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 11:08:48] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:48] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:49] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:50] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:08:50] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 218/494 variables, 276/392 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 217/609 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:01] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:01] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:02] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:02] [INFO ] Deduced a trap composed of 27 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 11:09:02] [INFO ] Deduced a trap composed of 28 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 11:09:03] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:03] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:04] [INFO ] Deduced a trap composed of 28 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 11:09:04] [INFO ] Deduced a trap composed of 29 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 11:09:09] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 619 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/4 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 276/288 places, 218/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61098 ms. Remains : 276/288 places, 218/237 transitions.
Stuttering acceptance computed with spot in 548 ms :[(NOT p3), (AND (NOT p2) p0 (NOT p3)), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p2))]
Running random walk in product with property : DES-PT-10b-LTLFireability-01
Product exploration explored 100000 steps with 33337 reset in 226 ms.
Product exploration explored 100000 steps with 33451 reset in 230 ms.
Computed a total of 97 stabilizing places and 90 stable transitions
Graph (complete) has 534 edges and 276 vertex of which 271 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Computed a total of 97 stabilizing places and 90 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 195 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 502 ms :[(NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (341 resets) in 884 ms. (45 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (64 resets) in 256 ms. (155 steps per ms) remains 1/1 properties
[2025-05-31 11:09:18] [INFO ] Invariant cache hit.
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: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 25/494 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 2/32 constraints, Generalized P Invariants (flows): 0/29 constraints, State Equation: 0/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p2 p3 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p3))), (F p2), (F p3), (F p1), (F p0)]
Knowledge based reduction with 23 factoid took 830 ms. Reduced automaton from 9 states, 17 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 532 ms :[(NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 542 ms :[(NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p2))]
[2025-05-31 11:09:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:09:20] [INFO ] [Real]Absence check using 32 positive place invariants in 29 ms returned sat
[2025-05-31 11:09:20] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 183 ms returned sat
[2025-05-31 11:09:21] [INFO ] [Real]Absence check using state equation in 1133 ms returned sat
[2025-05-31 11:09:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:09:22] [INFO ] [Nat]Absence check using 32 positive place invariants in 20 ms returned sat
[2025-05-31 11:09:22] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 47 ms returned sat
[2025-05-31 11:09:24] [INFO ] [Nat]Absence check using state equation in 2209 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:24] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 13 ms to minimize.
[2025-05-31 11:09:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2025-05-31 11:09:24] [INFO ] Computed and/alt/rep : 212/392/212 causal constraints (skipped 5 transitions) in 24 ms.
[2025-05-31 11:09:29] [INFO ] Added : 182 causal constraints over 37 iterations in 4492 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 6 out of 276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 218/218 transitions.
Applied a total of 0 rules in 8 ms. Remains 276 /276 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2025-05-31 11:09:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:09:29] [INFO ] Implicit Places using invariants in 375 ms returned []
[2025-05-31 11:09:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:09:30] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-31 11:09:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/494 variables, 276/337 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:37] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:37] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:38] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:38] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:38] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:38] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:39] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:39] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:39] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:39] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:39] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:39] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:39] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:39] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:40] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:40] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:40] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:40] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:40] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:40] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 20/357 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:41] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:41] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:41] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:41] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:42] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:42] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:42] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:42] [INFO ] Deduced a trap composed of 7 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 11:09:42] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:42] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:42] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:42] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:43] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:43] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:43] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:43] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:43] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:44] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:44] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:44] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:46] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:46] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:47] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 21 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:50] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:57] [INFO ] Deduced a trap along path composed of 4 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:57] [INFO ] Deduced a trap along path composed of 4 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:57] [INFO ] Deduced a trap along path composed of 4 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:09:58] [INFO ] Deduced a trap along path composed of 8 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/494 variables, and 385 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 44/105 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:01] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:01] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:01] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:01] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:02] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:02] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:02] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:03] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:04] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:05] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:05] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 218/494 variables, 276/392 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 217/609 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:18] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:18] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:18] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:19] [INFO ] Deduced a trap composed of 27 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 11:10:19] [INFO ] Deduced a trap composed of 28 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 11:10:20] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:20] [INFO ] Deduced a trap composed of 28 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 11:10:20] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:21] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:27] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 619 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/4 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Finished structural reductions in LTL mode , in 1 iterations and 61280 ms. Remains : 276/276 places, 218/218 transitions.
Computed a total of 97 stabilizing places and 90 stable transitions
Graph (complete) has 534 edges and 276 vertex of which 271 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 97 stabilizing places and 90 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 212 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 530 ms :[(NOT p3), (AND (NOT p2) p0 (NOT p3)), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p2))]
RANDOM walk for 20738 steps (177 resets) in 225 ms. (91 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (F p0), (F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p0) p3 p2))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) p3))), (F p2), (F p3), (F (NOT (OR p3 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F p1)]
Knowledge based reduction with 19 factoid took 840 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 597 ms :[(NOT p3), (AND (NOT p2) p0 (NOT p3)), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 564 ms :[(NOT p3), (AND (NOT p2) p0 (NOT p3)), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p2))]
[2025-05-31 11:10:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:10:33] [INFO ] [Real]Absence check using 32 positive place invariants in 48 ms returned sat
[2025-05-31 11:10:33] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 345 ms returned sat
[2025-05-31 11:10:34] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2025-05-31 11:10:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:10:35] [INFO ] [Nat]Absence check using 32 positive place invariants in 18 ms returned sat
[2025-05-31 11:10:35] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 52 ms returned sat
[2025-05-31 11:10:36] [INFO ] [Nat]Absence check using state equation in 1791 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:37] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 9 ms to minimize.
[2025-05-31 11:10:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2025-05-31 11:10:37] [INFO ] Computed and/alt/rep : 212/392/212 causal constraints (skipped 5 transitions) in 35 ms.
[2025-05-31 11:10:41] [INFO ] Added : 182 causal constraints over 37 iterations in 4466 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 612 ms :[(NOT p3), (AND (NOT p2) p0 (NOT p3)), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 25068 reset in 215 ms.
Product exploration explored 100000 steps with 24997 reset in 220 ms.
Applying partial POR strategy [false, true, false, false, true, true, false, true, false]
Stuttering acceptance computed with spot in 551 ms :[(NOT p3), (AND (NOT p2) p0 (NOT p3)), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p2))]
Support contains 6 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 218/218 transitions.
Graph (complete) has 534 edges and 276 vertex of which 271 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 271 transition count 215
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 16 place count 271 transition count 216
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 271 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 266 transition count 211
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 266 transition count 211
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 107 place count 266 transition count 214
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 115 place count 258 transition count 206
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 123 place count 258 transition count 206
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 128 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 257 transition count 225
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 257 transition count 225
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 130 rules in 110 ms. Remains 257 /276 variables (removed 19) and now considering 225/218 (removed -7) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:10:43] [INFO ] Redundant transitions in 18 ms returned []
Running 224 sub problems to find dead transitions.
// Phase 1: matrix 225 rows 257 cols
[2025-05-31 11:10:43] [INFO ] Computed 59 invariants in 5 ms
[2025-05-31 11:10:43] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/257 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:51] [INFO ] Deduced a trap composed of 2 places in 246 ms of which 18 ms to minimize.
Problem TDEAD169 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 1/60 constraints. Problems are: Problem set: 4 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/60 constraints. Problems are: Problem set: 4 solved, 220 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
At refinement iteration 6 (OVERLAPS) 225/482 variables, 257/317 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 16/333 constraints. Problems are: Problem set: 107 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:56] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:10:56] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 2/335 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/335 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/482 variables, 0/335 constraints. Problems are: Problem set: 107 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 335 constraints, problems are : Problem set: 107 solved, 117 unsolved in 22095 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 257/257 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 107 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 12/12 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 70/239 variables, 33/45 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 6/51 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 3/54 constraints. Problems are: Problem set: 107 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:07] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:07] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 2/56 constraints. Problems are: Problem set: 107 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 1/57 constraints. Problems are: Problem set: 107 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:08] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 2/59 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/59 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 10/249 variables, 8/67 constraints. Problems are: Problem set: 107 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:11] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:11] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 2/69 constraints. Problems are: Problem set: 107 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:12] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:12] [INFO ] Deduced a trap composed of 5 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 11:11:12] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:12] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 4/73 constraints. Problems are: Problem set: 107 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:13] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:14] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 2/75 constraints. Problems are: Problem set: 107 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:14] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:11:15] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 2/77 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/77 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 15 (OVERLAPS) 221/470 variables, 249/326 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/470 variables, 16/342 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/470 variables, 117/459 constraints. Problems are: Problem set: 107 solved, 117 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/470 variables, 0/459 constraints. Problems are: Problem set: 107 solved, 117 unsolved
SMT process timed out in 52218ms, After SMT, problems are : Problem set: 107 solved, 117 unsolved
Search for dead transitions found 107 dead transitions in 52221ms
Found 107 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 107 transitions
Dead transitions reduction (with SMT) removed 107 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 257/276 places, 118/218 transitions.
Graph (complete) has 497 edges and 257 vertex of which 170 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.4 ms
Discarding 87 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 170 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 15 ms. Remains 170 /257 variables (removed 87) and now considering 126/118 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 170/276 places, 126/218 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52388 ms. Remains : 170/276 places, 126/218 transitions.
Built C files in :
/tmp/ltsmin1208557506501820259
[2025-05-31 11:11:35] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1208557506501820259
Running compilation step : cd /tmp/ltsmin1208557506501820259;'/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 560 ms.
Running link step : cd /tmp/ltsmin1208557506501820259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin1208557506501820259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3135590029473496959.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 218/218 transitions.
Applied a total of 0 rules in 11 ms. Remains 276 /276 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 276 cols
[2025-05-31 11:11:50] [INFO ] Computed 61 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:11:51] [INFO ] Implicit Places using invariants in 265 ms returned []
[2025-05-31 11:11:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:11:51] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-31 11:11:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/494 variables, 276/337 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:01] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:01] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:01] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:01] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:01] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:02] [INFO ] Deduced a trap composed of 22 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 11:12:02] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:02] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:02] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:03] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:03] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:03] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:03] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:03] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:03] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:03] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:04] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:04] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:04] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:04] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 20/357 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:05] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:05] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:05] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:05] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:06] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:06] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:06] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:06] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:06] [INFO ] Deduced a trap composed of 10 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 11:12:06] [INFO ] Deduced a trap composed of 13 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 11:12:06] [INFO ] Deduced a trap composed of 14 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 11:12:06] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:07] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:07] [INFO ] Deduced a trap composed of 13 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 11:12:07] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:07] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:07] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:08] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:08] [INFO ] Deduced a trap composed of 21 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 11:12:08] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 30 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:10] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:11] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:12] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 30 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:15] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:12:22] [INFO ] Deduced a trap along path composed of 4 places in 66 ms of which 4 ms to minimize.
SMT process timed out in 30099ms, After SMT, problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 30101ms
Finished structural reductions in LTL mode , in 1 iterations and 31139 ms. Remains : 276/276 places, 218/218 transitions.
Built C files in :
/tmp/ltsmin13048239900057435699
[2025-05-31 11:12:22] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13048239900057435699
Running compilation step : cd /tmp/ltsmin13048239900057435699;'/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 896 ms.
Running link step : cd /tmp/ltsmin13048239900057435699;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin13048239900057435699;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2183275159135983616.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 11:12:37] [INFO ] Flatten gal took : 13 ms
[2025-05-31 11:12:37] [INFO ] Flatten gal took : 14 ms
[2025-05-31 11:12:37] [INFO ] Time to serialize gal into /tmp/LTL1298131321012114445.gal : 3 ms
[2025-05-31 11:12:37] [INFO ] Time to serialize properties into /tmp/LTL2667604257206969093.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1298131321012114445.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2348786153265088786.hoa' '-atoms' '/tmp/LTL2667604257206969093.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2667604257206969093.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2348786153265088786.hoa
Detected timeout of ITS tools.
[2025-05-31 11:12:52] [INFO ] Flatten gal took : 19 ms
[2025-05-31 11:12:52] [INFO ] Flatten gal took : 19 ms
[2025-05-31 11:12:52] [INFO ] Time to serialize gal into /tmp/LTL1706496362826575565.gal : 2 ms
[2025-05-31 11:12:52] [INFO ] Time to serialize properties into /tmp/LTL3045581598902812722.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1706496362826575565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3045581598902812722.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((X(!("((p181==1)&&(p281==1))")))U((X(G(!("((p181==1)&&(p281==1))"))))||((!("((p184==1)&&(p307==1))"))&&(X(!("((p181==1)&&(p281==1)...200
Formula 0 simplified : (X"((p181==1)&&(p281==1))" R (XF"((p181==1)&&(p281==1))" & ("((p184==1)&&(p307==1))" | X"((p181==1)&&(p281==1))"))) R (G!"(p92==1)" ...171
Detected timeout of ITS tools.
[2025-05-31 11:13:07] [INFO ] Flatten gal took : 11 ms
[2025-05-31 11:13:07] [INFO ] Applying decomposition
[2025-05-31 11:13:07] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15224286073184544439.txt' '-o' '/tmp/graph15224286073184544439.bin' '-w' '/tmp/graph15224286073184544439.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15224286073184544439.bin' '-l' '-1' '-v' '-w' '/tmp/graph15224286073184544439.weights' '-q' '0' '-e' '0.001'
[2025-05-31 11:13:07] [INFO ] Decomposing Gal with order
[2025-05-31 11:13:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 11:13:07] [INFO ] Removed a total of 15 redundant transitions.
[2025-05-31 11:13:07] [INFO ] Flatten gal took : 41 ms
[2025-05-31 11:13:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-05-31 11:13:07] [INFO ] Time to serialize gal into /tmp/LTL17702400974689108121.gal : 6 ms
[2025-05-31 11:13:07] [INFO ] Time to serialize properties into /tmp/LTL3761102798941802785.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17702400974689108121.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3761102798941802785.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((X(!("((i6.i0.u36.p181==1)&&(i10.i1.u68.p281==1))")))U((X(G(!("((i6.i0.u36.p181==1)&&(i10.i1.u68.p281==1))"))))||((!("((i6.i0.u37....304
Formula 0 simplified : (X"((i6.i0.u36.p181==1)&&(i10.i1.u68.p281==1))" R (XF"((i6.i0.u36.p181==1)&&(i10.i1.u68.p281==1))" & ("((i6.i0.u37.p184==1)&&(i6.i0....275
Detected timeout of ITS tools.
Treatment of property DES-PT-10b-LTLFireability-01 finished in 307651 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((p0&&X(p0)))&&(p1||X(((p2||X(p3)) U (p1&&(p2||X(p3)))))))))'
Support contains 5 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 237/237 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 280 transition count 229
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 280 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 280 transition count 227
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 276 transition count 223
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 276 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 30 place count 276 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 275 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 275 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 275 transition count 217
Applied a total of 33 rules in 17 ms. Remains 275 /288 variables (removed 13) and now considering 217/237 (removed 20) transitions.
// Phase 1: matrix 217 rows 275 cols
[2025-05-31 11:13:22] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:13:22] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-05-31 11:13:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:13:23] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-31 11:13:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:30] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:30] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:30] [INFO ] Deduced a trap composed of 22 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 11:13:31] [INFO ] Deduced a trap composed of 22 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 11:13:31] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:31] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:32] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:32] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:32] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:32] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:32] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:32] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:32] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:34] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 217/492 variables, 275/350 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:39] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:39] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:39] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:39] [INFO ] Deduced a trap composed of 13 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 11:13:40] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:40] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:40] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:40] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:40] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:41] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:41] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:41] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:41] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:41] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:41] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:41] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:41] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:41] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:42] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:42] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 20/370 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:46] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:46] [INFO ] Deduced a trap composed of 10 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 11:13:47] [INFO ] Deduced a trap composed of 11 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 11:13:47] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:47] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 34 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 5/375 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:49] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:49] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:49] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:49] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:49] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:49] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:49] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:49] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:50] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:50] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:50] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:50] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:50] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:50] [INFO ] Deduced a trap composed of 14 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 11:13:50] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 15/390 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 390 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 54/115 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:56] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:57] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:57] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:57] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:57] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:13:58] [INFO ] Deduced a trap composed of 19 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 11:13:58] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 217/492 variables, 275/397 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 216/613 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:08] [INFO ] Deduced a trap composed of 21 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 11:14:12] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:12] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:12] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:12] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:14] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:15] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:15] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:17] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 622 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60054ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 275/288 places, 217/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60822 ms. Remains : 275/288 places, 217/237 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p3)]
Running random walk in product with property : DES-PT-10b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-03 finished in 61208 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(G(p0))&&(p1||X(X(F(p2)))))))'
Support contains 4 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 237/237 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 280 transition count 229
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 280 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 280 transition count 227
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 277 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 277 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 277 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 276 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 276 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 276 transition count 219
Applied a total of 30 rules in 32 ms. Remains 276 /288 variables (removed 12) and now considering 219/237 (removed 18) transitions.
// Phase 1: matrix 219 rows 276 cols
[2025-05-31 11:14:23] [INFO ] Computed 61 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:14:24] [INFO ] Implicit Places using invariants in 372 ms returned []
[2025-05-31 11:14:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:14:25] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-31 11:14:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:34] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:34] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:34] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 218 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 219/495 variables, 276/340 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:42] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:42] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:42] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:42] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:42] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:43] [INFO ] Deduced a trap composed of 22 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 11:14:43] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:43] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:43] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:44] [INFO ] Deduced a trap composed of 23 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 11:14:44] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:45] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:46] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:46] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 21 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 14/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:48] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:49] [INFO ] Deduced a trap composed of 12 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 11:14:49] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:50] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 4/358 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:52] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:53] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:53] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:53] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:53] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:53] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/495 variables, and 364 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 27/88 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:57] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:58] [INFO ] Deduced a trap composed of 21 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 11:14:58] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:58] [INFO ] Deduced a trap composed of 14 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 11:14:58] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:58] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:58] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:58] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:58] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:59] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:59] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:14:59] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:00] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:00] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:01] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:01] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:01] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:01] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:01] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:01] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:01] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:01] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:01] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:01] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 11/112 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:03] [INFO ] Deduced a trap composed of 13 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 11:15:03] [INFO ] Deduced a trap composed of 18 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 11:15:04] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:04] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 219/495 variables, 276/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 218/610 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:16] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:16] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:16] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:16] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:17] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:17] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:23] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:23] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 618 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 276/288 places, 219/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61198 ms. Remains : 276/288 places, 219/237 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : DES-PT-10b-LTLFireability-04
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-04 finished in 61447 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(X(F(p0))))))'
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 237/237 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 278 transition count 227
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 278 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 278 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 275 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 275 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 275 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 274 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 274 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 274 transition count 216
Applied a total of 35 rules in 17 ms. Remains 274 /288 variables (removed 14) and now considering 216/237 (removed 21) transitions.
// Phase 1: matrix 216 rows 274 cols
[2025-05-31 11:15:25] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:15:25] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-05-31 11:15:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:15:26] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-05-31 11:15:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:34] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:34] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:35] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:35] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:35] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 216/490 variables, 274/340 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:41] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:42] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:42] [INFO ] Deduced a trap composed of 10 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 11:15:42] [INFO ] Deduced a trap composed of 12 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 11:15:42] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:42] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:43] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:43] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:43] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:43] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:43] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:43] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:43] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:43] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:44] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:44] [INFO ] Deduced a trap composed of 23 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 11:15:44] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:44] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:44] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:44] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:45] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:46] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:46] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:46] [INFO ] Deduced a trap composed of 14 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 11:15:46] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 5/365 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:55] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:55] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:55] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:55] [INFO ] Deduced a trap composed of 13 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 11:15:55] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:56] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:56] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:15:56] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 17 ms to minimize.
SMT process timed out in 30078ms, After SMT, problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 30079ms
Starting structural reductions in LTL mode, iteration 1 : 274/288 places, 216/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30990 ms. Remains : 274/288 places, 216/237 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-05
Stuttering criterion allowed to conclude after 395 steps with 4 reset in 3 ms.
FORMULA DES-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-05 finished in 31202 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(G(p0))&&G(p1))))))'
Support contains 3 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 237/237 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 279 transition count 228
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 279 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 279 transition count 225
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 276 transition count 222
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 276 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 276 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 275 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 275 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 275 transition count 217
Applied a total of 33 rules in 32 ms. Remains 275 /288 variables (removed 13) and now considering 217/237 (removed 20) transitions.
// Phase 1: matrix 217 rows 275 cols
[2025-05-31 11:15:56] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:15:56] [INFO ] Implicit Places using invariants in 285 ms returned []
[2025-05-31 11:15:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:15:57] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-31 11:15:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:04] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:04] [INFO ] Deduced a trap composed of 16 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 11:16:04] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:06] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 217/492 variables, 275/340 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:10] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:10] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:10] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:11] [INFO ] Deduced a trap composed of 13 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 11:16:11] [INFO ] Deduced a trap composed of 30 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 11:16:11] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:11] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:11] [INFO ] Deduced a trap composed of 17 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 11:16:12] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:12] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:12] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:12] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:12] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:12] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:12] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:13] [INFO ] Deduced a trap composed of 13 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 11:16:13] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:13] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:14] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:14] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:19] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:19] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 27 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:20] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:20] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:21] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:21] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:21] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:23] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 18 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 6/368 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 368 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 32/93 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:30] [INFO ] Deduced a trap composed of 21 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 11:16:30] [INFO ] Deduced a trap composed of 29 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 11:16:31] [INFO ] Deduced a trap composed of 18 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 11:16:31] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:31] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:31] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:31] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:31] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:31] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:31] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:32] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:32] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:32] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:32] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:33] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:33] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:33] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:33] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:33] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:33] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:34] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:34] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:34] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:34] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:34] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:34] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:35] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:35] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:35] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:36] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:36] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 217/492 variables, 275/399 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 216/615 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:47] [INFO ] Deduced a trap composed of 17 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 11:16:47] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:47] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:49] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:50] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:50] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:16:50] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 622 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 275/288 places, 217/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60960 ms. Remains : 275/288 places, 217/237 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-06 finished in 61189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 288/288 places, 237/237 transitions.
Graph (complete) has 562 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 281 transition count 216
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 265 transition count 216
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 33 place count 265 transition count 207
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 256 transition count 207
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 248 transition count 199
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 248 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 248 transition count 196
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 74 place count 244 transition count 192
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 244 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 83 place count 244 transition count 187
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 85 place count 243 transition count 186
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 85 place count 243 transition count 184
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 89 place count 241 transition count 184
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 243 place count 164 transition count 107
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 5 with 4 rules applied. Total rules applied 247 place count 162 transition count 109
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 249 place count 160 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 250 place count 159 transition count 107
Applied a total of 250 rules in 50 ms. Remains 159 /288 variables (removed 129) and now considering 107/237 (removed 130) transitions.
// Phase 1: matrix 107 rows 159 cols
[2025-05-31 11:16:57] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:16:58] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-05-31 11:16:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:16:58] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:16:58] [INFO ] Redundant transitions in 2 ms returned []
Running 104 sub problems to find dead transitions.
[2025-05-31 11:16:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 2/158 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 107/265 variables, 158/216 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:00] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:02] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:02] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:02] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:02] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:02] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:02] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 1/266 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:06] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 8 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/266 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 13 (OVERLAPS) 0/266 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 225 constraints, problems are : Problem set: 0 solved, 104 unsolved in 12994 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 2/158 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 107/265 variables, 158/224 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 104/328 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 1/266 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/266 variables, and 329 constraints, problems are : Problem set: 0 solved, 104 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43027ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 43028ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/288 places, 107/237 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43732 ms. Remains : 159/288 places, 107/237 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-08
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-08 finished in 43791 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&&X((X(X(p1))&&G(p2))))))))'
Support contains 3 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 237/237 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 278 transition count 227
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 278 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 278 transition count 224
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 274 transition count 220
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 274 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 274 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 273 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 273 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 273 transition count 214
Applied a total of 38 rules in 38 ms. Remains 273 /288 variables (removed 15) and now considering 214/237 (removed 23) transitions.
// Phase 1: matrix 214 rows 273 cols
[2025-05-31 11:17:41] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:17:41] [INFO ] Implicit Places using invariants in 266 ms returned []
[2025-05-31 11:17:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:17:42] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2025-05-31 11:17:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/487 variables, 273/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:49] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:49] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:49] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:50] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:50] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:50] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:50] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:50] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:50] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:51] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:51] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:51] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:51] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:51] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:51] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:51] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:51] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:52] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:52] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:52] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:55] [INFO ] Deduced a trap composed of 14 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 11:17:56] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:56] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:56] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:56] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:56] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:56] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 7/361 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:17:59] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:01] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:02] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:02] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:02] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:02] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:02] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:02] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:02] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:02] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:03] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:03] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:03] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 12/374 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:09] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:09] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:10] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:10] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/487 variables, and 378 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 44/105 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:15] [INFO ] Deduced a trap composed of 19 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 11:18:15] [INFO ] Deduced a trap composed of 16 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 11:18:15] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:16] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:16] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:16] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:16] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:16] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:16] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:17] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:17] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:17] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:17] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:17] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:17] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 15/120 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:19] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:20] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:21] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:22] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 214/487 variables, 273/397 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 213/610 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:32] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 611 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 273/288 places, 214/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60937 ms. Remains : 273/288 places, 214/237 transitions.
Stuttering acceptance computed with spot in 422 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-10b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-09 finished in 61385 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) U ((!p1&&X(!p0))||X(G(!p0)))) U p2))'
Support contains 5 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 237/237 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 279 transition count 228
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 279 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 279 transition count 225
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 276 transition count 222
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 276 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 276 transition count 219
Applied a total of 30 rules in 23 ms. Remains 276 /288 variables (removed 12) and now considering 219/237 (removed 18) transitions.
// Phase 1: matrix 219 rows 276 cols
[2025-05-31 11:18:42] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:18:43] [INFO ] Implicit Places using invariants in 285 ms returned []
[2025-05-31 11:18:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:18:44] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-31 11:18:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/495 variables, 276/337 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:53] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:53] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:53] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:53] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:55] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 5/342 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:58] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:18:59] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:00] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:00] [INFO ] Deduced a trap composed of 23 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 11:19:01] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:01] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:01] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:01] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:01] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:01] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:02] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:02] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:02] [INFO ] Deduced a trap composed of 14 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 11:19:02] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:03] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:03] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:03] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:03] [INFO ] Deduced a trap composed of 19 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 11:19:03] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:03] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:03] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:04] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:05] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:06] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:06] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:07] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 32 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:11] [INFO ] Deduced a trap composed of 19 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 11:19:11] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:11] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:11] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:11] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:11] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:11] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:12] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:12] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:12] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 10/378 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/495 variables, and 378 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 41/102 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:16] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:16] [INFO ] Deduced a trap composed of 21 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 11:19:16] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:16] [INFO ] Deduced a trap composed of 14 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 11:19:16] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:17] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:17] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:17] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:17] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:17] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:17] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:17] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:18] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:18] [INFO ] Deduced a trap composed of 13 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 11:19:18] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:19] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:20] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 219/495 variables, 276/395 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 218/613 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:36] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 614 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 276/288 places, 219/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61169 ms. Remains : 276/288 places, 219/237 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), p0, p0, true]
Running random walk in product with property : DES-PT-10b-LTLFireability-10
Product exploration explored 100000 steps with 37162 reset in 282 ms.
Product exploration explored 100000 steps with 37241 reset in 418 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 534 edges and 276 vertex of which 271 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/276 stabilizing places and 89/219 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 13 factoid took 456 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), p0, p0, true]
RANDOM walk for 40000 steps (335 resets) in 152 ms. (261 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (57 resets) in 236 ms. (168 steps per ms) remains 1/1 properties
[2025-05-31 11:19:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/165 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/253 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/260 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 206/466 variables, 260/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/485 variables, 11/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/491 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/493 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/495 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/495 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/495 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/165 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/253 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/260 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 206/466 variables, 260/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:46] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:46] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/485 variables, 11/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:46] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:46] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/485 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/485 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/491 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/493 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/493 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/495 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/495 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/495 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/495 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1120 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1592ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 325 ms.
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 219/219 transitions.
Graph (complete) has 534 edges and 276 vertex of which 271 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 271 transition count 197
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 254 transition count 197
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 254 transition count 186
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 243 transition count 186
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 207 place count 169 transition count 112
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 166 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 166 transition count 114
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 166 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 216 place count 165 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 164 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 218 place count 163 transition count 112
Applied a total of 218 rules in 59 ms. Remains 163 /276 variables (removed 113) and now considering 112/219 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 163/276 places, 112/219 transitions.
RANDOM walk for 40000 steps (1528 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (272 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1232831 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :0 out of 1
Probabilistic random walk after 1232831 steps, saw 176472 distinct states, run finished after 3005 ms. (steps per millisecond=410 ) properties seen :0
// Phase 1: matrix 112 rows 163 cols
[2025-05-31 11:19:50] [INFO ] Computed 60 invariants in 3 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/77 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/110 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 31/141 variables, 21/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/150 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/262 variables, 150/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/275 variables, 13/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/275 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/275 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/275 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 163/163 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/77 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/110 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 31/141 variables, 21/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/150 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/262 variables, 150/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/275 variables, 13/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/275 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/275 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/275 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/275 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 467ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 179 ms.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 112/112 transitions.
Applied a total of 0 rules in 6 ms. Remains 163 /163 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 163/163 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 112/112 transitions.
Applied a total of 0 rules in 5 ms. Remains 163 /163 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2025-05-31 11:19:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:19:51] [INFO ] Implicit Places using invariants in 301 ms returned []
[2025-05-31 11:19:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:19:52] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:19:52] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2025-05-31 11:19:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/161 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 2/163 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 112/275 variables, 163/223 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:58] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:58] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:59] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:19:59] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:01] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:01] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/275 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 229 constraints, problems are : Problem set: 0 solved, 109 unsolved in 13734 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 2/163 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 112/275 variables, 163/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 109/338 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:18] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 339 constraints, problems are : Problem set: 0 solved, 109 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43764ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 43765ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44528 ms. Remains : 163/163 places, 112/112 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-31 11:20:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 11:20:36] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-31 11:20:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2025-05-31 11:20:36] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 11:20:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2025-05-31 11:20:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2025-05-31 11:20:36] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 11:20:36] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 11:20:36] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 348 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p2 (NOT p1)))), (F p2)]
Knowledge based reduction with 13 factoid took 813 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), p0, p0, true]
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), p0, p0, true]
// Phase 1: matrix 219 rows 276 cols
[2025-05-31 11:20:37] [INFO ] Computed 61 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:20:37] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2025-05-31 11:20:37] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 66 ms returned sat
[2025-05-31 11:20:38] [INFO ] [Real]Absence check using state equation in 947 ms returned sat
[2025-05-31 11:20:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:20:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2025-05-31 11:20:39] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 104 ms returned sat
[2025-05-31 11:20:39] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2025-05-31 11:20:39] [INFO ] Computed and/alt/rep : 213/392/213 causal constraints (skipped 5 transitions) in 16 ms.
[2025-05-31 11:20:40] [INFO ] Added : 120 causal constraints over 24 iterations in 1234 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 276 /276 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2025-05-31 11:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:20:41] [INFO ] Implicit Places using invariants in 312 ms returned []
[2025-05-31 11:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:20:41] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-31 11:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/495 variables, 276/337 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:50] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:50] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:50] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:50] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:52] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 5/342 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:55] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:56] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:58] [INFO ] Deduced a trap composed of 22 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 11:20:58] [INFO ] Deduced a trap composed of 23 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 11:20:58] [INFO ] Deduced a trap composed of 15 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 11:20:58] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:58] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:58] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:59] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:59] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:59] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:59] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:20:59] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:00] [INFO ] Deduced a trap composed of 10 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 11:21:00] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:00] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:00] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:01] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:01] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:01] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:01] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:01] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:02] [INFO ] Deduced a trap composed of 18 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 11:21:04] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:04] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:04] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 32 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:08] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:08] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:08] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:08] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:08] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:08] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:09] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:09] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:09] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:09] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 10/378 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:11] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/495 variables, and 379 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:14] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:14] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:14] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:14] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:15] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:15] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:15] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:15] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:15] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:16] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:16] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 11/114 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:17] [INFO ] Deduced a trap composed of 19 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 11:21:17] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 219/495 variables, 276/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 218/610 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:30] [INFO ] Deduced a trap composed of 14 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 11:21:30] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:30] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:31] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:31] [INFO ] Deduced a trap composed of 24 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 11:21:32] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:32] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:32] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:33] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:33] [INFO ] Deduced a trap composed of 26 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 11:21:33] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:36] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:38] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:40] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 624 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Finished structural reductions in LTL mode , in 1 iterations and 60899 ms. Remains : 276/276 places, 219/219 transitions.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 534 edges and 276 vertex of which 271 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/276 stabilizing places and 89/219 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 13 factoid took 401 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), p0, p0, true]
RANDOM walk for 40000 steps (352 resets) in 118 ms. (336 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (58 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
[2025-05-31 11:21:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/165 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/253 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/260 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 206/466 variables, 260/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/485 variables, 11/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/491 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/493 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/495 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/495 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/495 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/165 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/253 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/260 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 206/466 variables, 260/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:43] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:43] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/485 variables, 11/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:43] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:43] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/485 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/485 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/491 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/493 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/493 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/495 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/495 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/495 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/495 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 984 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1453ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 249 ms.
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 219/219 transitions.
Graph (complete) has 534 edges and 276 vertex of which 271 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 271 transition count 197
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 254 transition count 197
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 254 transition count 186
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 243 transition count 186
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 207 place count 169 transition count 112
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 166 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 166 transition count 114
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 166 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 216 place count 165 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 164 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 218 place count 163 transition count 112
Applied a total of 218 rules in 51 ms. Remains 163 /276 variables (removed 113) and now considering 112/219 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 163/276 places, 112/219 transitions.
RANDOM walk for 40000 steps (1550 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (272 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1171495 steps, run timeout after 3001 ms. (steps per millisecond=390 ) properties seen :0 out of 1
Probabilistic random walk after 1171495 steps, saw 169549 distinct states, run finished after 3004 ms. (steps per millisecond=389 ) properties seen :0
// Phase 1: matrix 112 rows 163 cols
[2025-05-31 11:21:47] [INFO ] Computed 60 invariants in 3 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/77 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/110 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 31/141 variables, 21/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/150 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/262 variables, 150/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/275 variables, 13/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/275 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/275 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/275 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 163/163 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/77 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/110 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 31/141 variables, 21/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/150 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/262 variables, 150/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/275 variables, 13/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/275 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/275 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/275 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/275 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 560ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 112/112 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 163/163 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2025-05-31 11:21:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:21:48] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-05-31 11:21:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:21:48] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:21:48] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2025-05-31 11:21:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/161 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 2/163 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 112/275 variables, 163/223 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:54] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:54] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:55] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:55] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:56] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:21:56] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/275 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 229 constraints, problems are : Problem set: 0 solved, 109 unsolved in 12134 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 2/163 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 112/275 variables, 163/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 109/338 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:22:12] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 339 constraints, problems are : Problem set: 0 solved, 109 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42186ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 42186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42859 ms. Remains : 163/163 places, 112/112 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-31 11:22:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 11:22:30] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2025-05-31 11:22:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2025-05-31 11:22:30] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 11:22:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-31 11:22:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2025-05-31 11:22:31] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 11:22:31] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 11:22:31] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 321 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p2 (NOT p1)))), (F p2)]
Knowledge based reduction with 13 factoid took 803 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), p0, p0, true]
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), p0, p0, true]
// Phase 1: matrix 219 rows 276 cols
[2025-05-31 11:22:32] [INFO ] Computed 61 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:22:32] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2025-05-31 11:22:32] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 110 ms returned sat
[2025-05-31 11:22:33] [INFO ] [Real]Absence check using state equation in 1135 ms returned sat
[2025-05-31 11:22:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:22:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 19 ms returned sat
[2025-05-31 11:22:34] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 63 ms returned sat
[2025-05-31 11:22:34] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2025-05-31 11:22:34] [INFO ] Computed and/alt/rep : 213/392/213 causal constraints (skipped 5 transitions) in 15 ms.
[2025-05-31 11:22:35] [INFO ] Added : 120 causal constraints over 24 iterations in 1088 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), p0, p0, true]
Product exploration explored 100000 steps with 37060 reset in 203 ms.
Product exploration explored 100000 steps with 37092 reset in 233 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), p0, p0, true]
Support contains 5 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 219/219 transitions.
Graph (complete) has 534 edges and 276 vertex of which 271 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 271 transition count 216
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 16 place count 271 transition count 218
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 271 transition count 218
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 266 transition count 213
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 266 transition count 213
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 107 place count 266 transition count 216
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 117 place count 256 transition count 206
Deduced a syphon composed of 81 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 127 place count 256 transition count 206
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 133 place count 256 transition count 234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 254 transition count 228
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 254 transition count 228
Deduced a syphon composed of 85 places in 0 ms
Applied a total of 137 rules in 50 ms. Remains 254 /276 variables (removed 22) and now considering 228/219 (removed -9) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:22:36] [INFO ] Redundant transitions in 1 ms returned []
Running 227 sub problems to find dead transitions.
// Phase 1: matrix 228 rows 254 cols
[2025-05-31 11:22:36] [INFO ] Computed 59 invariants in 3 ms
[2025-05-31 11:22:36] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/254 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 227 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 5 (OVERLAPS) 228/482 variables, 254/313 constraints. Problems are: Problem set: 108 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 16/329 constraints. Problems are: Problem set: 108 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/329 constraints. Problems are: Problem set: 108 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:22:47] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/482 variables, 1/330 constraints. Problems are: Problem set: 108 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/330 constraints. Problems are: Problem set: 108 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/482 variables, 0/330 constraints. Problems are: Problem set: 108 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 330 constraints, problems are : Problem set: 108 solved, 119 unsolved in 17432 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 254/254 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 108 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 13/13 constraints. Problems are: Problem set: 108 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/13 constraints. Problems are: Problem set: 108 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 66/234 variables, 32/45 constraints. Problems are: Problem set: 108 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 1/46 constraints. Problems are: Problem set: 108 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/46 constraints. Problems are: Problem set: 108 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 13/247 variables, 14/60 constraints. Problems are: Problem set: 108 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:22:56] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:22:57] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:22:57] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:22:57] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:22:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 5/65 constraints. Problems are: Problem set: 108 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/65 constraints. Problems are: Problem set: 108 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 224/471 variables, 247/312 constraints. Problems are: Problem set: 108 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 16/328 constraints. Problems are: Problem set: 108 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 119/447 constraints. Problems are: Problem set: 108 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:08] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/471 variables, 1/448 constraints. Problems are: Problem set: 108 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/482 variables, and 448 constraints, problems are : Problem set: 108 solved, 119 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 247/254 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 119/227 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47493ms problems are : Problem set: 108 solved, 119 unsolved
Search for dead transitions found 108 dead transitions in 47495ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 254/276 places, 120/219 transitions.
Graph (complete) has 570 edges and 254 vertex of which 169 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 169 /254 variables (removed 85) and now considering 120/120 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 169/276 places, 120/219 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47562 ms. Remains : 169/276 places, 120/219 transitions.
Built C files in :
/tmp/ltsmin13435336526515766627
[2025-05-31 11:23:24] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13435336526515766627
Running compilation step : cd /tmp/ltsmin13435336526515766627;'/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 859 ms.
Running link step : cd /tmp/ltsmin13435336526515766627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin13435336526515766627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1623646019136198287.hoa' '--buchi-type=spotba'
LTSmin run took 5531 ms.
FORMULA DES-PT-10b-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10b-LTLFireability-10 finished in 287950 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) U X((F(G(p1)) U p2))))'
Support contains 5 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 237/237 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 279 transition count 228
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 279 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 279 transition count 225
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 276 transition count 222
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 276 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 276 transition count 219
Applied a total of 30 rules in 11 ms. Remains 276 /288 variables (removed 12) and now considering 219/237 (removed 18) transitions.
// Phase 1: matrix 219 rows 276 cols
[2025-05-31 11:23:30] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:23:31] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-05-31 11:23:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:23:31] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-31 11:23:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:39] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:40] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:40] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:40] [INFO ] Deduced a trap composed of 30 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 11:23:40] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:41] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:41] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:41] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:42] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:43] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:43] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:43] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:44] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:44] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:44] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:44] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:44] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:44] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:44] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:44] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:44] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:44] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:44] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:44] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:45] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:45] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:45] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 18/88 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 219/495 variables, 276/364 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:49] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:49] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:49] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:50] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:51] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:51] [INFO ] Deduced a trap composed of 11 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 11:23:51] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:51] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:52] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:52] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:52] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:52] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:53] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 13/377 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:58] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:59] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:59] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:23:59] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 23 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/495 variables, and 381 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 44/105 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:04] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:05] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:05] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:05] [INFO ] Deduced a trap composed of 14 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 11:24:05] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:05] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:05] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:05] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:06] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:06] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:06] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:06] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:06] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 13/118 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:07] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:09] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:09] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:11] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:11] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 219/495 variables, 276/399 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 218/617 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:23] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:24] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:27] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 620 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 276/288 places, 219/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60874 ms. Remains : 276/288 places, 219/237 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-10b-LTLFireability-11
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-11 finished in 61116 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((p0&&G(p1)))))'
Support contains 3 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 237/237 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 278 transition count 227
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 278 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 278 transition count 224
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 274 transition count 220
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 274 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 274 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 273 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 273 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 273 transition count 214
Applied a total of 38 rules in 30 ms. Remains 273 /288 variables (removed 15) and now considering 214/237 (removed 23) transitions.
// Phase 1: matrix 214 rows 273 cols
[2025-05-31 11:24:32] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:24:32] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-05-31 11:24:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:24:32] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2025-05-31 11:24:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/487 variables, 273/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:41] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:41] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:41] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:41] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:42] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:42] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:42] [INFO ] Deduced a trap composed of 30 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 11:24:42] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:42] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:42] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:42] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:43] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:43] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:43] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:43] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:43] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:43] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:43] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:43] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:44] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:47] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:47] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:47] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:47] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:47] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:47] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:48] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 7/361 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:50] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:52] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:52] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:52] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:53] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:53] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:53] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:53] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:53] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:53] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:53] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:53] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:53] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 12/374 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:00] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:00] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:00] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:00] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
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 487/487 variables, and 378 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 44/105 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:05] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:05] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:06] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:06] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:06] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:06] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:06] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:06] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:07] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:07] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:07] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:07] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:07] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:07] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:08] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 15/120 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:10] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:11] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:12] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:13] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 214/487 variables, 273/397 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 213/610 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:25] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 611 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 273/288 places, 214/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60914 ms. Remains : 273/288 places, 214/237 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-10b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 343 steps with 2 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-12 finished in 61099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))||G((p2&&X(p3))))))'
Support contains 7 out of 288 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 288/288 places, 237/237 transitions.
Graph (complete) has 562 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 281 transition count 217
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 266 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 265 transition count 216
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 33 place count 265 transition count 206
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 53 place count 255 transition count 206
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 60 place count 248 transition count 199
Iterating global reduction 3 with 7 rules applied. Total rules applied 67 place count 248 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 248 transition count 197
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 72 place count 245 transition count 194
Iterating global reduction 4 with 3 rules applied. Total rules applied 75 place count 245 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 78 place count 245 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 245 transition count 190
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 80 place count 244 transition count 190
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 220 place count 174 transition count 120
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 226 place count 171 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 230 place count 171 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 169 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 168 transition count 120
Applied a total of 233 rules in 41 ms. Remains 168 /288 variables (removed 120) and now considering 120/237 (removed 117) transitions.
// Phase 1: matrix 120 rows 168 cols
[2025-05-31 11:25:33] [INFO ] Computed 58 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:25:33] [INFO ] Implicit Places using invariants in 311 ms returned []
[2025-05-31 11:25:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:25:33] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:25:33] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2025-05-31 11:25:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 2/166 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 2/168 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 120/288 variables, 168/226 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:39] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:40] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:40] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:40] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:43] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 9 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/288 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:46] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 15 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/288 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 15 (OVERLAPS) 0/288 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 232 constraints, problems are : Problem set: 0 solved, 116 unsolved in 18330 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 2/166 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 2/168 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:54] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:55] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 13 (OVERLAPS) 120/288 variables, 168/234 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 116/350 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:26:03] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:26:03] [INFO ] Deduced a trap along path composed of 2 places in 65 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:26:03] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/288 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 288/288 variables, and 353 constraints, problems are : Problem set: 0 solved, 116 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 48362ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 48362ms
Starting structural reductions in SI_LTL mode, iteration 1 : 168/288 places, 120/237 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49056 ms. Remains : 168/288 places, 120/237 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : DES-PT-10b-LTLFireability-14
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-14 finished in 49205 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(X(X(p0))))||F(p1)))))'
Found a Lengthening insensitive property : DES-PT-10b-LTLFireability-00
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 288/288 places, 237/237 transitions.
Graph (complete) has 562 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 281 transition count 216
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 265 transition count 216
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 265 transition count 206
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 255 transition count 206
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 247 transition count 198
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 247 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 247 transition count 195
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 76 place count 243 transition count 191
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 243 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 84 place count 243 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 84 place count 243 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 88 place count 241 transition count 185
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 238 place count 166 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 240 place count 165 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 242 place count 163 transition count 108
Applied a total of 242 rules in 50 ms. Remains 163 /288 variables (removed 125) and now considering 108/237 (removed 129) transitions.
// Phase 1: matrix 108 rows 163 cols
[2025-05-31 11:26:22] [INFO ] Computed 59 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:26:23] [INFO ] Implicit Places using invariants in 251 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 265 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 162/288 places, 108/237 transitions.
Applied a total of 0 rules in 8 ms. Remains 162 /162 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 323 ms. Remains : 162/288 places, 108/237 transitions.
Running random walk in product with property : DES-PT-10b-LTLFireability-00
Product exploration explored 100000 steps with 8561 reset in 356 ms.
Product exploration explored 100000 steps with 8248 reset in 371 ms.
Computed a total of 57 stabilizing places and 52 stable transitions
Computed a total of 57 stabilizing places and 52 stable transitions
Detected a total of 57/162 stabilizing places and 52/108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 117 steps (2 resets) in 5 ms. (19 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 280 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 162 cols
[2025-05-31 11:26:25] [INFO ] Computed 58 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:26:25] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-05-31 11:26:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:26:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 11:26:25] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-05-31 11:26:25] [INFO ] Invariant cache hit.
[2025-05-31 11:26:25] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/160 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 108/269 variables, 161/219 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:26:31] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:26:31] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 1/270 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:26:34] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:26:36] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 16 (OVERLAPS) 0/270 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 227 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13006 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 108/269 variables, 161/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 105/331 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:26:45] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:26:47] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:26:50] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:26:54] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:26:54] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:26:58] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 1)
(s70 1)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/270 variables, and 337 constraints, problems are : Problem set: 0 solved, 105 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 161/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43033ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 43033ms
Finished structural reductions in LTL mode , in 1 iterations and 43635 ms. Remains : 162/162 places, 108/108 transitions.
Computed a total of 57 stabilizing places and 52 stable transitions
Computed a total of 57 stabilizing places and 52 stable transitions
Detected a total of 57/162 stabilizing places and 52/108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 211 steps (6 resets) in 5 ms. (35 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 318 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 8510 reset in 348 ms.
Product exploration explored 100000 steps with 8447 reset in 396 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:27:11] [INFO ] Redundant transitions in 0 ms returned []
Running 105 sub problems to find dead transitions.
[2025-05-31 11:27:11] [INFO ] Invariant cache hit.
[2025-05-31 11:27:11] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/160 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 108/269 variables, 161/219 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:27:16] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:27:17] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 1/270 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:27:20] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:27:21] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 16 (OVERLAPS) 0/270 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 227 constraints, problems are : Problem set: 0 solved, 105 unsolved in 12479 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 108/269 variables, 161/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 105/331 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:27:29] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:27:31] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:27:34] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:27:38] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:27:38] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:27:42] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/270 variables, and 337 constraints, problems are : Problem set: 0 solved, 105 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 161/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42503ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 42505ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42514 ms. Remains : 162/162 places, 108/108 transitions.
Built C files in :
/tmp/ltsmin15528149789350985762
[2025-05-31 11:27:54] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15528149789350985762
Running compilation step : cd /tmp/ltsmin15528149789350985762;'/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 543 ms.
Running link step : cd /tmp/ltsmin15528149789350985762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin15528149789350985762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14111291937873629260.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 162 /162 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-05-31 11:28:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:28:09] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-05-31 11:28:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:28:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 11:28:09] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-05-31 11:28:09] [INFO ] Invariant cache hit.
[2025-05-31 11:28:09] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/160 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 108/269 variables, 161/219 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:28:15] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:28:16] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 1/270 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:28:19] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:28:20] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 16 (OVERLAPS) 0/270 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 227 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 108/269 variables, 161/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 105/331 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:28:30] [INFO ] Deduced a trap composed of 3 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 11:28:31] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:28:34] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:28:38] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:28:38] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:28:42] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 9 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/270 variables, and 337 constraints, problems are : Problem set: 0 solved, 105 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 161/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43057ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 43057ms
Finished structural reductions in LTL mode , in 1 iterations and 43541 ms. Remains : 162/162 places, 108/108 transitions.
Built C files in :
/tmp/ltsmin5762078633303409037
[2025-05-31 11:28:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5762078633303409037
Running compilation step : cd /tmp/ltsmin5762078633303409037;'/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 371 ms.
Running link step : cd /tmp/ltsmin5762078633303409037;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin5762078633303409037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4583793734008161527.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 11:29:08] [INFO ] Flatten gal took : 11 ms
[2025-05-31 11:29:08] [INFO ] Flatten gal took : 6 ms
[2025-05-31 11:29:08] [INFO ] Time to serialize gal into /tmp/LTL11758022570692967198.gal : 1 ms
[2025-05-31 11:29:08] [INFO ] Time to serialize properties into /tmp/LTL4652853610871704240.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11758022570692967198.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11493206427423855444.hoa' '-atoms' '/tmp/LTL4652853610871704240.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4652853610871704240.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11493206427423855444.hoa
Detected timeout of ITS tools.
[2025-05-31 11:29:23] [INFO ] Flatten gal took : 11 ms
[2025-05-31 11:29:23] [INFO ] Flatten gal took : 11 ms
[2025-05-31 11:29:23] [INFO ] Time to serialize gal into /tmp/LTL12057300029269181878.gal : 3 ms
[2025-05-31 11:29:23] [INFO ] Time to serialize properties into /tmp/LTL15799823614788394704.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12057300029269181878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15799823614788394704.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(X(X("(p77==1)")))))||(F("(p52==0)"))))))
Formula 0 simplified : XF(XXXX!"(p77==1)" & G!"(p52==0)")
Detected timeout of ITS tools.
[2025-05-31 11:29:38] [INFO ] Flatten gal took : 11 ms
[2025-05-31 11:29:38] [INFO ] Applying decomposition
[2025-05-31 11:29:38] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11403361519658483924.txt' '-o' '/tmp/graph11403361519658483924.bin' '-w' '/tmp/graph11403361519658483924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11403361519658483924.bin' '-l' '-1' '-v' '-w' '/tmp/graph11403361519658483924.weights' '-q' '0' '-e' '0.001'
[2025-05-31 11:29:38] [INFO ] Decomposing Gal with order
[2025-05-31 11:29:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 11:29:38] [INFO ] Removed a total of 27 redundant transitions.
[2025-05-31 11:29:38] [INFO ] Flatten gal took : 22 ms
[2025-05-31 11:29:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2025-05-31 11:29:38] [INFO ] Time to serialize gal into /tmp/LTL11726662880327559882.gal : 4 ms
[2025-05-31 11:29:38] [INFO ] Time to serialize properties into /tmp/LTL7661232103660711675.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11726662880327559882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7661232103660711675.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(X(X("(i1.u4.p77==1)")))))||(F("(i0.u0.p52==0)"))))))
Formula 0 simplified : XF(XXXX!"(i1.u4.p77==1)" & G!"(i0.u0.p52==0)")
Reverse transition relation is NOT exact ! Due to transitions t108_t114_t121_t132, t231_t79, t7_t48_t39, t198_t34, t197_t25, t106_t107_t131_t236_t139_t140_...529
Computing Next relation with stutter on 6.47736e+06 deadlock states
70 unique states visited
0 strongly connected components in search stack
70 transitions explored
64 items max in DFS search stack
567 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.72956,133400,1,0,244617,10339,1645,457390,1435,42474,343377
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property DES-PT-10b-LTLFireability-00 finished in 202427 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
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) U ((!p1&&X(!p0))||X(G(!p0)))) U (F(p2) U X(p3))))'
[2025-05-31 11:29:44] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13644546369960944297
[2025-05-31 11:29:44] [INFO ] Computing symmetric may disable matrix : 237 transitions.
[2025-05-31 11:29:44] [INFO ] Applying decomposition
[2025-05-31 11:29:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 11:29:44] [INFO ] Computing symmetric may enable matrix : 237 transitions.
[2025-05-31 11:29:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 11:29:44] [INFO ] Flatten gal took : 23 ms
[2025-05-31 11:29:44] [INFO ] Computing Do-Not-Accords matrix : 237 transitions.
[2025-05-31 11:29:44] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 11:29:44] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13644546369960944297
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2592758997805917159.txt' '-o' '/tmp/graph2592758997805917159.bin' '-w' '/tmp/graph2592758997805917159.weights'
Running compilation step : cd /tmp/ltsmin13644546369960944297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2592758997805917159.bin' '-l' '-1' '-v' '-w' '/tmp/graph2592758997805917159.weights' '-q' '0' '-e' '0.001'
[2025-05-31 11:29:44] [INFO ] Decomposing Gal with order
[2025-05-31 11:29:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 11:29:45] [INFO ] Removed a total of 27 redundant transitions.
[2025-05-31 11:29:45] [INFO ] Flatten gal took : 23 ms
[2025-05-31 11:29:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2025-05-31 11:29:45] [INFO ] Time to serialize gal into /tmp/LTLFireability8650604526632898190.gal : 5 ms
[2025-05-31 11:29:45] [INFO ] Time to serialize properties into /tmp/LTLFireability6175856662980062477.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8650604526632898190.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6175856662980062477.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(G((X(X(X(X("(i1.u10.p77==1)")))))||(F("(i2.u5.p52==0)"))))))
Formula 0 simplified : XF(XXXX!"(i1.u10.p77==1)" & G!"(i2.u5.p52==0)")
Compilation finished in 994 ms.
Running link step : cd /tmp/ltsmin13644546369960944297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13644546369960944297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(X(X(X((LTLAPp0==true)))))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t132, t173, t197, t198, t231, i0.u35.t79, i1.t123, i1.u9.t164, i1.u9.t165, i1.u9.t16...902
Computing Next relation with stutter on 7.16102e+07 deadlock states
462 unique states visited
0 strongly connected components in search stack
465 transitions explored
267 items max in DFS search stack
32582 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,325.877,2204828,1,0,4.37537e+06,10749,2192,9.87134e+06,512,59915,1277160
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-10b-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((X(!("((i10.u41.p181==1)&&(i10.u71.p281==1))")))U(((!("((i10.u42.p184==1)&&(i10.u42.p307==1))"))&&(X(!("((i10.u41.p181==1)&&(i10.u...278
Formula 1 simplified : (X"((i10.u41.p181==1)&&(i10.u71.p281==1))" R (XF"((i10.u41.p181==1)&&(i10.u71.p281==1))" & ("((i10.u42.p184==1)&&(i10.u42.p307==1))"...249
Computing Next relation with stutter on 7.16102e+07 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13644546369960944297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(X(X(X((LTLAPp0==true)))))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13644546369960944297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(!(LTLAPp2==true)) U ((!(LTLAPp3==true)&&X(!(LTLAPp2==true)))||X([](!(LTLAPp2==true))))) U (<>((LTLAPp4==true)) U X((LTLAPp5==true))))' '--buchi-type=spotba'
274 unique states visited
184 strongly connected components in search stack
274 transitions explored
226 items max in DFS search stack
17217 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,498.055,2898716,1,0,5.52596e+06,10749,2156,1.33915e+07,512,59915,455287
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DES-PT-10b-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2744020 ms.

BK_STOP 1748692110770

--------------------
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="DES-PT-10b"
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 DES-PT-10b, 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 r058-smll-174854063900292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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