Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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 60K 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.7K 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 142K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 91K 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-20b-LTLFireability-00
FORMULA_NAME DES-PT-20b-LTLFireability-01
FORMULA_NAME DES-PT-20b-LTLFireability-02
FORMULA_NAME DES-PT-20b-LTLFireability-03
FORMULA_NAME DES-PT-20b-LTLFireability-04
FORMULA_NAME DES-PT-20b-LTLFireability-05
FORMULA_NAME DES-PT-20b-LTLFireability-06
FORMULA_NAME DES-PT-20b-LTLFireability-07
FORMULA_NAME DES-PT-20b-LTLFireability-08
FORMULA_NAME DES-PT-20b-LTLFireability-09
FORMULA_NAME DES-PT-20b-LTLFireability-10
FORMULA_NAME DES-PT-20b-LTLFireability-11
FORMULA_NAME DES-PT-20b-LTLFireability-12
FORMULA_NAME DES-PT-20b-LTLFireability-13
FORMULA_NAME DES-PT-20b-LTLFireability-14
FORMULA_NAME DES-PT-20b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748701848545

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-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 14:30:50] [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 14:30:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 14:30:51] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2025-05-31 14:30:51] [INFO ] Transformed 360 places.
[2025-05-31 14:30:51] [INFO ] Transformed 311 transitions.
[2025-05-31 14:30:51] [INFO ] Found NUPN structural information;
[2025-05-31 14:30:51] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-20b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-20b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 311/311 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 357 transition count 311
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 338 transition count 292
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 338 transition count 292
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 326 transition count 280
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 326 transition count 280
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 74 place count 326 transition count 271
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 325 transition count 270
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 325 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 325 transition count 269
Applied a total of 77 rules in 143 ms. Remains 325 /360 variables (removed 35) and now considering 269/311 (removed 42) transitions.
// Phase 1: matrix 269 rows 325 cols
[2025-05-31 14:30:51] [INFO ] Computed 62 invariants in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:30:52] [INFO ] Implicit Places using invariants in 786 ms returned []
[2025-05-31 14:30:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:30:53] [INFO ] Implicit Places using invariants and state equation in 957 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1818 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 324/360 places, 269/311 transitions.
Applied a total of 0 rules in 19 ms. Remains 324 /324 variables (removed 0) and now considering 269/269 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2010 ms. Remains : 324/360 places, 269/311 transitions.
Support contains 52 out of 324 places after structural reductions.
[2025-05-31 14:30:54] [INFO ] Flatten gal took : 120 ms
[2025-05-31 14:30:54] [INFO ] Flatten gal took : 63 ms
[2025-05-31 14:30:54] [INFO ] Input system was already deterministic with 269 transitions.
RANDOM walk for 40000 steps (341 resets) in 2307 ms. (17 steps per ms) remains 10/34 properties
BEST_FIRST walk for 40004 steps (49 resets) in 569 ms. (70 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 293 ms. (136 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (47 resets) in 255 ms. (156 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (53 resets) in 286 ms. (139 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (58 resets) in 354 ms. (112 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (51 resets) in 442 ms. (90 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (51 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (49 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (57 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
// Phase 1: matrix 269 rows 324 cols
[2025-05-31 14:30:55] [INFO ] Computed 61 invariants in 14 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 31/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 143/187 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 121/308 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/309 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 258/567 variables, 309/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 19/586 variables, 11/381 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/586 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 5/591 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 2/593 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:30:57] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 34 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/593 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/593 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/593 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 386 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3157 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 31/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 143/187 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 121/308 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/309 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 258/567 variables, 309/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:31:00] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:31:00] [INFO ] Deduced a trap along path composed of 3 places in 100 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 19/586 variables, 11/391 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/586 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:31:03] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:31:04] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/593 variables, and 395 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 320/324 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 8233ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 269/269 transitions.
Graph (complete) has 672 edges and 324 vertex of which 319 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
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 319 transition count 250
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 32 place count 305 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 304 transition count 249
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 304 transition count 239
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 53 place count 294 transition count 239
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 58 place count 289 transition count 234
Iterating global reduction 3 with 5 rules applied. Total rules applied 63 place count 289 transition count 234
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 68 place count 284 transition count 229
Iterating global reduction 3 with 5 rules applied. Total rules applied 73 place count 284 transition count 229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 77 place count 284 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 77 place count 284 transition count 223
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 282 transition count 223
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 227 place count 209 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 231 place count 207 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 206 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 205 transition count 151
Applied a total of 233 rules in 234 ms. Remains 205 /324 variables (removed 119) and now considering 151/269 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 205/324 places, 151/269 transitions.
RANDOM walk for 40000 steps (1543 resets) in 828 ms. (48 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (323 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (316 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (304 resets) in 196 ms. (203 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (302 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (337 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (290 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (309 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (299 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (312 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 597049 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 9
Probabilistic random walk after 597049 steps, saw 81070 distinct states, run finished after 3010 ms. (steps per millisecond=198 ) properties seen :0
// Phase 1: matrix 151 rows 205 cols
[2025-05-31 14:31:08] [INFO ] Computed 60 invariants in 3 ms
[2025-05-31 14:31:08] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 23/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 69/105 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 80/185 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/186 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 151/337 variables, 186/246 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 6/252 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 19/356 variables, 19/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/356 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 271 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1226 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 205/205 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 23/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 69/105 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 80/185 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:31:09] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/186 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 151/337 variables, 186/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 7/260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:31:11] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 14 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:31:12] [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 14:31:13] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:31:15] [INFO ] Deduced a trap along path composed of 3 places in 116 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/337 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 19/356 variables, 19/283 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/356 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:31:23] [INFO ] Deduced a trap along path composed of 8 places in 97 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/356 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/356 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:31:30] [INFO ] Deduced a trap along path composed of 15 places in 90 ms of which 2 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/356 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:31:31] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 7 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/356 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/356 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 0/356 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 288 constraints, problems are : Problem set: 0 solved, 9 unsolved in 30497 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 205/205 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 31756ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 16834 ms.
Support contains 13 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 151/151 transitions.
Applied a total of 0 rules in 10 ms. Remains 205 /205 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 205/205 places, 151/151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 151/151 transitions.
Applied a total of 0 rules in 11 ms. Remains 205 /205 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2025-05-31 14:31:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:31:57] [INFO ] Implicit Places using invariants in 276 ms returned []
[2025-05-31 14:31:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:31:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-31 14:31:57] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 14:31:57] [INFO ] Redundant transitions in 7 ms returned []
Running 148 sub problems to find dead transitions.
[2025-05-31 14:31:57] [INFO ] Invariant cache hit.
[2025-05-31 14:31:57] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 3/205 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 151/356 variables, 205/265 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 0/356 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 271 constraints, problems are : Problem set: 0 solved, 148 unsolved in 14645 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 205/205 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 3/205 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 151/356 variables, 205/265 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 148/419 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:32:21] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:32:22] [INFO ] Deduced a trap composed of 19 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 14:32:22] [INFO ] Deduced a trap composed of 4 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 14:32:22] [INFO ] Deduced a trap composed of 8 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 14:32:25] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:32:26] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 6/425 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 425 constraints, problems are : Problem set: 0 solved, 148 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 205/205 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44778ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 44782ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45568 ms. Remains : 205/205 places, 151/151 transitions.
FORMULA DES-PT-20b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 138 stabilizing places and 131 stable transitions
Graph (complete) has 672 edges and 324 vertex of which 319 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.11 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(p0)))||(F(p0) U (p1||X(G(!p1)))))))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 269/269 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 318 transition count 263
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 318 transition count 263
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 313 transition count 258
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 313 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 313 transition count 254
Applied a total of 26 rules in 35 ms. Remains 313 /324 variables (removed 11) and now considering 254/269 (removed 15) transitions.
// Phase 1: matrix 254 rows 313 cols
[2025-05-31 14:32:42] [INFO ] Computed 61 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:32:43] [INFO ] Implicit Places using invariants in 421 ms returned []
[2025-05-31 14:32:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:32:44] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-05-31 14:32: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/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:32:52] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:32:55] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:32:56] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:32:56] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:32:56] [INFO ] Deduced a trap composed of 11 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 14:32:56] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:32:57] [INFO ] Deduced a trap composed of 13 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 14:32:57] [INFO ] Deduced a trap composed of 14 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 14:32:57] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:03] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:03] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:03] [INFO ] Deduced a trap composed of 14 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 14:33:03] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:04] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:04] [INFO ] Deduced a trap composed of 17 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 14:33:04] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:04] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:05] [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 14:33:05] [INFO ] Deduced a trap composed of 18 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 14:33:05] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:05] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:05] [INFO ] Deduced a trap composed of 22 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 14:33:05] [INFO ] Deduced a trap composed of 15 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 14:33:06] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:06] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:06] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 400 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 26/87 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:18] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:18] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:18] [INFO ] Deduced a trap composed of 14 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 14:33:18] [INFO ] Deduced a trap composed of 17 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 14:33:19] [INFO ] Deduced a trap composed of 9 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 14:33:19] [INFO ] Deduced a trap composed of 12 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 14:33:19] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:20] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:22] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:23] [INFO ] Deduced a trap composed of 14 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 14:33:24] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:24] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:25] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 254/567 variables, 313/413 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 253/666 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:43] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:44] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:44] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 669 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 313/324 places, 254/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61433 ms. Remains : 313/324 places, 254/269 transitions.
Stuttering acceptance computed with spot in 695 ms :[false, false, false, false, (AND (NOT p0) p1), (NOT p0), false, false]
Running random walk in product with property : DES-PT-20b-LTLFireability-02
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 15 ms.
FORMULA DES-PT-20b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-02 finished in 62287 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)&&(p1 U X(G(p1)))))))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 269/269 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 318 transition count 263
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 318 transition count 263
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 313 transition count 258
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 313 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 313 transition count 254
Applied a total of 26 rules in 46 ms. Remains 313 /324 variables (removed 11) and now considering 254/269 (removed 15) transitions.
[2025-05-31 14:33:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:33:45] [INFO ] Implicit Places using invariants in 516 ms returned []
[2025-05-31 14:33:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:33:46] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-05-31 14:33:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:54] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:56] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:58] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:58] [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 14:33:58] [INFO ] Deduced a trap composed of 11 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 14:33:58] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:33:58] [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 14:33:59] [INFO ] Deduced a trap composed of 14 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 14:33:59] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:04] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:04] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:05] [INFO ] Deduced a trap composed of 14 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 14:34:05] [INFO ] Deduced a trap composed of 17 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 14:34:05] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:06] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:06] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:06] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:06] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:06] [INFO ] Deduced a trap composed of 18 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 14:34:06] [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 14:34:07] [INFO ] Deduced a trap composed of 19 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 14:34:07] [INFO ] Deduced a trap composed of 22 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 14:34:07] [INFO ] Deduced a trap composed of 15 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 14:34:08] [INFO ] Deduced a trap composed of 13 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 14:34:08] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:08] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:16] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 8 ms to minimize.
(s176 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 0.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 0.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 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.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 1.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 1.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 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 401 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 27/88 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:20] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:20] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:20] [INFO ] Deduced a trap composed of 17 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 14:34:21] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:23] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:24] [INFO ] Deduced a trap composed of 15 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 14:34:25] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:27] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:27] [INFO ] Deduced a trap composed of 21 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 14:34:27] [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 14:34:27] [INFO ] Deduced a trap composed of 23 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 14:34:28] [INFO ] Deduced a trap composed of 24 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 14:34:28] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:31] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:31] [INFO ] Deduced a trap composed of 20 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 14:34:31] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:36] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:36] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (OVERLAPS) 254/567 variables, 313/419 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 253/672 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 672 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 313/324 places, 254/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61587 ms. Remains : 313/324 places, 254/269 transitions.
Stuttering acceptance computed with spot in 369 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DES-PT-20b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-03 finished in 62009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((X(p1)||p0)))||F(p2))))'
Support contains 5 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 269/269 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 318 transition count 263
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 318 transition count 263
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 313 transition count 258
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 313 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 313 transition count 254
Applied a total of 26 rules in 32 ms. Remains 313 /324 variables (removed 11) and now considering 254/269 (removed 15) transitions.
[2025-05-31 14:34:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:34:47] [INFO ] Implicit Places using invariants in 437 ms returned []
[2025-05-31 14:34:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:34:48] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1421 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-05-31 14:34: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/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:56] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:34:59] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:00] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:00] [INFO ] Deduced a trap composed of 10 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 14:35:00] [INFO ] Deduced a trap composed of 11 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 14:35:00] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:01] [INFO ] Deduced a trap composed of 13 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 14:35:01] [INFO ] Deduced a trap composed of 14 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 14:35:01] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:07] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:07] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:08] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:08] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:09] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:09] [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 14:35:09] [INFO ] Deduced a trap composed of 17 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 14:35:09] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:09] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:10] [INFO ] Deduced a trap composed of 18 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 14:35:10] [INFO ] Deduced a trap composed of 21 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 14:35:10] [INFO ] Deduced a trap composed of 19 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 14:35:10] [INFO ] Deduced a trap composed of 22 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 14:35:10] [INFO ] Deduced a trap composed of 15 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 14:35:11] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:11] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:12] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 400 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 26/87 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:22] [INFO ] Deduced a trap composed of 10 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 14:35:22] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:22] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:23] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:24] [INFO ] Deduced a trap composed of 9 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 14:35:24] [INFO ] Deduced a trap composed of 12 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 14:35:24] [INFO ] Deduced a trap composed of 13 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 14:35:24] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:26] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:27] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:29] [INFO ] Deduced a trap composed of 29 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 14:35:29] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:30] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 254/567 variables, 313/413 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 253/666 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:47] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:47] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:48] [INFO ] Deduced a trap composed of 20 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 14:35:48] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:48] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 671 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 313/324 places, 254/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61558 ms. Remains : 313/324 places, 254/269 transitions.
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DES-PT-20b-LTLFireability-06
Product exploration explored 100000 steps with 24992 reset in 488 ms.
Product exploration explored 100000 steps with 25051 reset in 368 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.15 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Detected a total of 136/313 stabilizing places and 129/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 196 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (354 resets) in 483 ms. (82 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (52 resets) in 344 ms. (115 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (49 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (48 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
[2025-05-31 14:35:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 143/164 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 127/291 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/298 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 243/541 variables, 298/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 19/560 variables, 11/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/565 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/567 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/567 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 374 constraints, problems are : Problem set: 0 solved, 4 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 143/164 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 127/291 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/298 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 243/541 variables, 298/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:52] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:52] [INFO ] Deduced a trap along path composed of 10 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:52] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:52] [INFO ] Deduced a trap along path composed of 8 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:35:52] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 19/560 variables, 11/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/560 variables, 3/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 5/565 variables, 3/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/565 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/567 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/567 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/567 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 383 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2573 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 3382ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2672 ms.
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Graph (complete) has 647 edges and 313 vertex of which 308 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 308 transition count 234
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 293 transition count 232
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 291 transition count 232
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 37 place count 291 transition count 222
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 57 place count 281 transition count 222
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 3 with 150 rules applied. Total rules applied 207 place count 206 transition count 147
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 3 with 4 rules applied. Total rules applied 211 place count 204 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 212 place count 203 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 202 transition count 148
Applied a total of 213 rules in 51 ms. Remains 202 /313 variables (removed 111) and now considering 148/254 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 202/313 places, 148/254 transitions.
RANDOM walk for 40000 steps (1674 resets) in 265 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (346 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (322 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (332 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (324 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 576902 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 4
Probabilistic random walk after 576902 steps, saw 82154 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
// Phase 1: matrix 148 rows 202 cols
[2025-05-31 14:36:00] [INFO ] Computed 60 invariants in 7 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/24 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 76/100 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/138 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 32/170 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/179 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 148/327 variables, 179/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 23/350 variables, 23/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/350 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/350 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/350 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 262 constraints, problems are : Problem set: 0 solved, 4 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/24 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 76/100 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/138 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 32/170 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/179 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 148/327 variables, 179/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 23/350 variables, 23/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/350 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/350 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/350 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/350 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 266 constraints, problems are : Problem set: 0 solved, 4 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1405ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1342 ms.
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 148/148 transitions.
Applied a total of 0 rules in 9 ms. Remains 202 /202 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 202/202 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 148/148 transitions.
Applied a total of 0 rules in 8 ms. Remains 202 /202 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2025-05-31 14:36:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:36:03] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-05-31 14:36:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:36:03] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 14:36:03] [INFO ] Redundant transitions in 7 ms returned []
Running 145 sub problems to find dead transitions.
[2025-05-31 14:36:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 2/202 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 148/350 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:36:11] [INFO ] Deduced a trap composed of 13 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 14:36:12] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:36:12] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:36:15] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:36:17] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 0/350 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 267 constraints, problems are : Problem set: 0 solved, 145 unsolved in 19831 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 2/202 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 148/350 variables, 202/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 145/412 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:36:33] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 413 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49893ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 49893ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50590 ms. Remains : 202/202 places, 148/148 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 202 /202 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Running SMT prover for 4 properties.
[2025-05-31 14:36:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 14:36:53] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 14:36:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2025-05-31 14:36:53] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2025-05-31 14:36:54] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-05-31 14:36:54] [INFO ] After 410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-31 14:36:54] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 838 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 6 factoid took 250 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
// Phase 1: matrix 254 rows 313 cols
[2025-05-31 14:36:55] [INFO ] Computed 61 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:36:55] [INFO ] Implicit Places using invariants in 441 ms returned []
[2025-05-31 14:36:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:36:56] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-05-31 14:36:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:04] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:06] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:08] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:08] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:08] [INFO ] Deduced a trap composed of 11 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 14:37:08] [INFO ] Deduced a trap composed of 14 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 14:37:09] [INFO ] Deduced a trap composed of 13 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 14:37:09] [INFO ] Deduced a trap composed of 14 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 14:37:09] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:14] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:15] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:15] [INFO ] Deduced a trap composed of 14 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 14:37:15] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:16] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:16] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:16] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:16] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:16] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:17] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:17] [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 14:37:17] [INFO ] Deduced a trap composed of 19 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 14:37:17] [INFO ] Deduced a trap composed of 22 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 14:37:17] [INFO ] Deduced a trap composed of 15 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 14:37:18] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:18] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:19] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:24] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:25] [INFO ] Deduced a trap composed of 13 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 14:37:25] [INFO ] Deduced a trap composed of 11 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 14:37:26] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 404 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 30/91 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:29] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:30] [INFO ] Deduced a trap composed of 17 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 14:37:30] [INFO ] Deduced a trap composed of 21 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 14:37:30] [INFO ] Deduced a trap composed of 22 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 14:37:30] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:30] [INFO ] Deduced a trap composed of 20 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 14:37:30] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:30] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:30] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:33] [INFO ] Deduced a trap composed of 21 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 14:37:33] [INFO ] Deduced a trap composed of 22 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 14:37:33] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:33] [INFO ] Deduced a trap composed of 23 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 14:37:34] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/418 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 253/671 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:49] [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 14:37:51] [INFO ] Deduced a trap composed of 17 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 14:37:51] [INFO ] Deduced a trap composed of 22 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 14:37:52] [INFO ] Deduced a trap composed of 18 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 14:37:53] [INFO ] Deduced a trap composed of 19 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 14:37:53] [INFO ] Deduced a trap composed of 21 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 14:37:53] [INFO ] Deduced a trap composed of 23 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 14:37:53] [INFO ] Deduced a trap composed of 23 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 14:37:53] [INFO ] Deduced a trap composed of 24 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 14:37:53] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:54] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 682 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Finished structural reductions in LTL mode , in 1 iterations and 61407 ms. Remains : 313/313 places, 254/254 transitions.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Detected a total of 136/313 stabilizing places and 129/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 133 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (356 resets) in 117 ms. (338 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (53 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (50 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (48 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (51 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
[2025-05-31 14:37:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 143/164 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 127/291 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/298 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 243/541 variables, 298/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 19/560 variables, 11/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/565 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/567 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/567 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 374 constraints, problems are : Problem set: 0 solved, 4 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 143/164 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 127/291 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/298 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 243/541 variables, 298/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:57] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:58] [INFO ] Deduced a trap along path composed of 10 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:58] [INFO ] Deduced a trap along path composed of 9 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:58] [INFO ] Deduced a trap along path composed of 8 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:37:58] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 19/560 variables, 11/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/560 variables, 3/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 5/565 variables, 3/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/565 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/567 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/567 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/567 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 383 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1629 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 2186ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1652 ms.
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 308 transition count 234
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 293 transition count 232
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 291 transition count 232
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 37 place count 291 transition count 222
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 57 place count 281 transition count 222
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 3 with 150 rules applied. Total rules applied 207 place count 206 transition count 147
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 3 with 4 rules applied. Total rules applied 211 place count 204 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 212 place count 203 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 202 transition count 148
Applied a total of 213 rules in 57 ms. Remains 202 /313 variables (removed 111) and now considering 148/254 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 202/313 places, 148/254 transitions.
RANDOM walk for 40000 steps (1742 resets) in 304 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (346 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (333 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (332 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (309 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 638610 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 4
Probabilistic random walk after 638610 steps, saw 89510 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
// Phase 1: matrix 148 rows 202 cols
[2025-05-31 14:38:04] [INFO ] Computed 60 invariants in 2 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/24 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 76/100 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/138 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 32/170 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/179 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 148/327 variables, 179/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 23/350 variables, 23/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/350 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/350 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/350 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 262 constraints, problems are : Problem set: 0 solved, 4 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/24 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 76/100 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/138 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 32/170 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/179 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 148/327 variables, 179/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 23/350 variables, 23/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/350 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/350 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/350 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/350 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 266 constraints, problems are : Problem set: 0 solved, 4 unsolved in 902 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1265ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1412 ms.
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 148/148 transitions.
Applied a total of 0 rules in 13 ms. Remains 202 /202 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 202/202 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 148/148 transitions.
Applied a total of 0 rules in 7 ms. Remains 202 /202 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2025-05-31 14:38:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:38:07] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-05-31 14:38:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:38:07] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 14:38:07] [INFO ] Redundant transitions in 8 ms returned []
Running 145 sub problems to find dead transitions.
[2025-05-31 14:38:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 2/202 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 148/350 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:38:16] [INFO ] Deduced a trap composed of 13 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 14:38:17] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:38:17] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:38:20] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:38:22] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 0/350 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 267 constraints, problems are : Problem set: 0 solved, 145 unsolved in 23115 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 2/202 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 148/350 variables, 202/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 145/412 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:38:39] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 413 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53166ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 53167ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53899 ms. Remains : 202/202 places, 148/148 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 202 /202 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Running SMT prover for 4 properties.
[2025-05-31 14:39:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 14:39:00] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 14:39:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2025-05-31 14:39:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2025-05-31 14:39:01] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-05-31 14:39:01] [INFO ] After 384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-31 14:39:01] [INFO ] After 667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 804 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 6 factoid took 242 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 25053 reset in 116 ms.
Product exploration explored 100000 steps with 24937 reset in 139 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 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 308 transition count 251
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 308 transition count 252
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 308 transition count 252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 304 transition count 248
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 304 transition count 248
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 107 place count 304 transition count 252
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 117 place count 294 transition count 242
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 127 place count 294 transition count 242
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 132 place count 294 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 292 transition count 262
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 292 transition count 262
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 136 rules in 124 ms. Remains 292 /313 variables (removed 21) and now considering 262/254 (removed -8) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 14:39:03] [INFO ] Redundant transitions in 26 ms returned []
Running 261 sub problems to find dead transitions.
// Phase 1: matrix 262 rows 292 cols
[2025-05-31 14:39:03] [INFO ] Computed 59 invariants in 9 ms
[2025-05-31 14:39:03] [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/291 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/291 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/292 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 261 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 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 TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 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 TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 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 TDEAD209 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 262/554 variables, 292/351 constraints. Problems are: Problem set: 110 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 16/367 constraints. Problems are: Problem set: 110 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 0/367 constraints. Problems are: Problem set: 110 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:39:16] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 8 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/554 variables, 1/368 constraints. Problems are: Problem set: 110 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/368 constraints. Problems are: Problem set: 110 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/554 variables, 0/368 constraints. Problems are: Problem set: 110 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 368 constraints, problems are : Problem set: 110 solved, 151 unsolved in 28103 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 292/292 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 110 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 12/12 constraints. Problems are: Problem set: 110 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/12 constraints. Problems are: Problem set: 110 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 67/271 variables, 33/45 constraints. Problems are: Problem set: 110 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 1/46 constraints. Problems are: Problem set: 110 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/46 constraints. Problems are: Problem set: 110 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 14/285 variables, 14/60 constraints. Problems are: Problem set: 110 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:39:35] [INFO ] Deduced a trap composed of 15 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 14:39:35] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:39:35] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:39:35] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 4/64 constraints. Problems are: Problem set: 110 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:39:37] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:39:37] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:39:37] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 3/67 constraints. Problems are: Problem set: 110 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/67 constraints. Problems are: Problem set: 110 solved, 151 unsolved
At refinement iteration 9 (OVERLAPS) 259/544 variables, 285/352 constraints. Problems are: Problem set: 110 solved, 151 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/544 variables, 16/368 constraints. Problems are: Problem set: 110 solved, 151 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 151/519 constraints. Problems are: Problem set: 110 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:39:57] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:39:57] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/554 variables, and 521 constraints, problems are : Problem set: 110 solved, 151 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 285/292 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 151/261 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 58217ms problems are : Problem set: 110 solved, 151 unsolved
Search for dead transitions found 110 dead transitions in 58218ms
Found 110 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 110 transitions
Dead transitions reduction (with SMT) removed 110 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 292/313 places, 152/254 transitions.
Graph (complete) has 696 edges and 292 vertex of which 205 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.3 ms
Discarding 87 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 205 /292 variables (removed 87) and now considering 152/152 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 205/313 places, 152/254 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58400 ms. Remains : 205/313 places, 152/254 transitions.
Built C files in :
/tmp/ltsmin8152499750252019953
[2025-05-31 14:40:01] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8152499750252019953
Running compilation step : cd /tmp/ltsmin8152499750252019953;'/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 874 ms.
Running link step : cd /tmp/ltsmin8152499750252019953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin8152499750252019953;'/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/stateBased5829911162004297874.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 7 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
// Phase 1: matrix 254 rows 313 cols
[2025-05-31 14:40:16] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:40:17] [INFO ] Implicit Places using invariants in 290 ms returned []
[2025-05-31 14:40:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:40:18] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-05-31 14:40:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:25] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:28] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:29] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:29] [INFO ] Deduced a trap composed of 10 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 14:40:29] [INFO ] Deduced a trap composed of 11 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 14:40:30] [INFO ] Deduced a trap composed of 14 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 14:40:30] [INFO ] Deduced a trap composed of 13 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 14:40:30] [INFO ] Deduced a trap composed of 14 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 14:40:30] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:36] [INFO ] Deduced a trap composed of 7 places in 293 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:36] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:37] [INFO ] Deduced a trap composed of 14 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 14:40:37] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:37] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:37] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:38] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:38] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:38] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:38] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:39] [INFO ] Deduced a trap composed of 21 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 14:40:39] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:39] [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 14:40:39] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:40] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:40] [INFO ] Deduced a trap composed of 21 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 14:40:40] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:48] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 9 ms to minimize.
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 0.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 0.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 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 401 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 27/88 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:52] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:52] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:52] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:53] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:55] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:55] [INFO ] Deduced a trap composed of 15 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 14:40:56] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:40:58] [INFO ] Deduced a trap composed of 24 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 14:40:58] [INFO ] Deduced a trap composed of 21 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 14:40:58] [INFO ] Deduced a trap composed of 22 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 14:40:59] [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 14:40:59] [INFO ] Deduced a trap composed of 24 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 14:40:59] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:41:02] [INFO ] Deduced a trap composed of 25 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 14:41:02] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:41:02] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:41:07] [INFO ] Deduced a trap composed of 29 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 14:41:07] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (OVERLAPS) 254/567 variables, 313/419 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 253/672 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 672 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in LTL mode , in 1 iterations and 61329 ms. Remains : 313/313 places, 254/254 transitions.
Built C files in :
/tmp/ltsmin11608712183997529809
[2025-05-31 14:41:18] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11608712183997529809
Running compilation step : cd /tmp/ltsmin11608712183997529809;'/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 991 ms.
Running link step : cd /tmp/ltsmin11608712183997529809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin11608712183997529809;'/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/stateBased3277425125758399661.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 14:41:33] [INFO ] Flatten gal took : 24 ms
[2025-05-31 14:41:33] [INFO ] Flatten gal took : 21 ms
[2025-05-31 14:41:33] [INFO ] Time to serialize gal into /tmp/LTL5014139422992858040.gal : 6 ms
[2025-05-31 14:41:33] [INFO ] Time to serialize properties into /tmp/LTL6464471746604921607.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/LTL5014139422992858040.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6234414395593742797.hoa' '-atoms' '/tmp/LTL6464471746604921607.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/LTL6464471746604921607.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6234414395593742797.hoa
Detected timeout of ITS tools.
[2025-05-31 14:41:48] [INFO ] Flatten gal took : 27 ms
[2025-05-31 14:41:48] [INFO ] Flatten gal took : 20 ms
[2025-05-31 14:41:48] [INFO ] Time to serialize gal into /tmp/LTL7914468097121036245.gal : 4 ms
[2025-05-31 14:41:48] [INFO ] Time to serialize properties into /tmp/LTL9802422105798328010.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7914468097121036245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9802422105798328010.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 : !((G((X(X(("((p49==0)||(p204==0))")||(X("(((p49==0)||(p204==0))||(p177==0))")))))||(F("((p201==1)&&(p203==1))")))))
Formula 0 simplified : F(XX(!"((p49==0)||(p204==0))" & X!"(((p49==0)||(p204==0))||(p177==0))") & G!"((p201==1)&&(p203==1))")
Detected timeout of ITS tools.
[2025-05-31 14:42:03] [INFO ] Flatten gal took : 20 ms
[2025-05-31 14:42:03] [INFO ] Applying decomposition
[2025-05-31 14:42:03] [INFO ] Flatten gal took : 28 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/graph7424013951912622589.txt' '-o' '/tmp/graph7424013951912622589.bin' '-w' '/tmp/graph7424013951912622589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7424013951912622589.bin' '-l' '-1' '-v' '-w' '/tmp/graph7424013951912622589.weights' '-q' '0' '-e' '0.001'
[2025-05-31 14:42:03] [INFO ] Decomposing Gal with order
[2025-05-31 14:42:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 14:42:04] [INFO ] Removed a total of 11 redundant transitions.
[2025-05-31 14:42:04] [INFO ] Flatten gal took : 123 ms
[2025-05-31 14:42:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 16 ms.
[2025-05-31 14:42:04] [INFO ] Time to serialize gal into /tmp/LTL13793858643726910621.gal : 13 ms
[2025-05-31 14:42:04] [INFO ] Time to serialize properties into /tmp/LTL14643340710987161224.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/LTL13793858643726910621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14643340710987161224.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 : !((G((X(X(("((u31.p49==0)||(u31.p204==0))")||(X("(((u31.p49==0)||(u31.p204==0))||(i3.i1.i0.u27.p177==0))")))))||(F("((i3.i0.i1.u30.p20...191
Formula 0 simplified : F(XX(!"((u31.p49==0)||(u31.p204==0))" & X!"(((u31.p49==0)||(u31.p204==0))||(i3.i1.i0.u27.p177==0))") & G!"((i3.i0.i1.u30.p201==1)&&(...179
Detected timeout of ITS tools.
Treatment of property DES-PT-20b-LTLFireability-06 finished in 452253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U G((X(p1) U ((p2 U p3) U X(p4))))))))'
Support contains 6 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 269/269 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 319 transition count 264
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 319 transition count 264
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 315 transition count 260
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 315 transition count 260
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 315 transition count 257
Applied a total of 21 rules in 18 ms. Remains 315 /324 variables (removed 9) and now considering 257/269 (removed 12) transitions.
// Phase 1: matrix 257 rows 315 cols
[2025-05-31 14:42:19] [INFO ] Computed 61 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:42:19] [INFO ] Implicit Places using invariants in 337 ms returned []
[2025-05-31 14:42:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:42:20] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-05-31 14:42:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:31] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:31] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:32] [INFO ] Deduced a trap composed of 23 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 14:42:32] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:32] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:32] [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 14:42:32] [INFO ] Deduced a trap composed of 19 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 14:42:32] [INFO ] Deduced a trap composed of 20 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 14:42:32] [INFO ] Deduced a trap composed of 21 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 14:42:32] [INFO ] Deduced a trap composed of 22 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 14:42:33] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:33] [INFO ] Deduced a trap composed of 14 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 14:42:33] [INFO ] Deduced a trap composed of 13 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 14:42:33] [INFO ] Deduced a trap composed of 14 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 14:42:33] [INFO ] Deduced a trap composed of 10 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 14:42:33] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:33] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:34] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:34] [INFO ] Deduced a trap composed of 17 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 14:42:35] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:37] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:38] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:38] [INFO ] Deduced a trap composed of 32 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 14:42:39] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 257/572 variables, 315/400 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:43] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:43] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:43] [INFO ] Deduced a trap composed of 10 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 14:42:43] [INFO ] Deduced a trap composed of 13 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 14:42:44] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:44] [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 14:42:44] [INFO ] Deduced a trap composed of 17 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 14:42:45] [INFO ] Deduced a trap composed of 18 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 14:42:46] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:46] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 10/410 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/572 variables, and 410 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 34/95 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:53] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:53] [INFO ] Deduced a trap composed of 22 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 14:42:53] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:42:57] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 257/572 variables, 315/414 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 256/670 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:43:17] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:43:17] [INFO ] Deduced a trap composed of 20 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 14:43:18] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:43:18] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:43:18] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 675 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 315/324 places, 257/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61222 ms. Remains : 315/324 places, 257/269 transitions.
Stuttering acceptance computed with spot in 2143 ms :[(NOT p4), (NOT p4), (NOT p4), false, (AND (NOT p4) (NOT p1)), (NOT p4), (AND (NOT p1) (NOT p4)), (NOT p4), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (OR (AND (NOT p1) p3 (NOT p4)) (AND (NOT p1) p2 (NOT p4))), (AND (NOT p1) (NOT p3) (NOT p4)), (AND p1 (NOT p3) (NOT p4)), (OR (AND (NOT p0) (NOT p1) p3 (NOT p4)) (AND (NOT p0) (NOT p1) p2 (NOT p4))), true, (NOT p0), (NOT p3), (AND (NOT p4) p1), (AND p1 (NOT p3) (NOT p4)), (OR (AND p3 (NOT p4)) (AND p2 (NOT p4)) (AND p1 (NOT p4))), false, (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) p1 (NOT p3))), false, (AND p1 (NOT p4)), (AND p2 (NOT p3) (NOT p4)), (AND p2 (NOT p3) (NOT p4)), (AND p1 (NOT p3) (NOT p4)), (OR (AND (NOT p0) p1 (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Running random walk in product with property : DES-PT-20b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 55 steps with 1 reset in 1 ms.
FORMULA DES-PT-20b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-07 finished in 63490 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)||(G(p1) U p2)))'
Support contains 12 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 269/269 transitions.
Graph (complete) has 672 edges and 324 vertex of which 319 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 318 transition count 251
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 304 transition count 251
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 304 transition count 241
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 294 transition count 241
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 291 transition count 238
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 291 transition count 238
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 288 transition count 235
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 288 transition count 235
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 288 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 288 transition count 230
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 286 transition count 230
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 3 with 150 rules applied. Total rules applied 218 place count 211 transition count 155
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 3 with 6 rules applied. Total rules applied 224 place count 208 transition count 161
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 226 place count 206 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 205 transition count 159
Applied a total of 227 rules in 93 ms. Remains 205 /324 variables (removed 119) and now considering 159/269 (removed 110) transitions.
// Phase 1: matrix 159 rows 205 cols
[2025-05-31 14:43:22] [INFO ] Computed 58 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:43:23] [INFO ] Implicit Places using invariants in 384 ms returned []
[2025-05-31 14:43:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:43:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 14:43:23] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 14:43:23] [INFO ] Redundant transitions in 2 ms returned []
Running 156 sub problems to find dead transitions.
[2025-05-31 14:43:23] [INFO ] Invariant cache hit.
[2025-05-31 14:43:23] [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/202 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 1/203 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 1/204 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 159/363 variables, 204/262 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 8/270 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:43:35] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:43:35] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 1/364 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:43:40] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 14 (OVERLAPS) 0/364 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 274 constraints, problems are : Problem set: 0 solved, 156 unsolved in 23387 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 1/203 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 1/204 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:43:51] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 159/363 variables, 204/266 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 8/274 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 156/430 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:01] [INFO ] Deduced a trap composed of 14 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 14:44:03] [INFO ] Deduced a trap composed of 3 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 14:44:03] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 3/433 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/364 variables, and 433 constraints, problems are : Problem set: 0 solved, 156 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 204/205 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53441ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 53442ms
Starting structural reductions in SI_LTL mode, iteration 1 : 205/324 places, 159/269 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54550 ms. Remains : 205/324 places, 159/269 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20b-LTLFireability-08
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-08 finished in 54692 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 ((p0 U p1) U (X(X(p2))&&F(!p3)))))'
Support contains 5 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 269/269 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 320 transition count 265
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 320 transition count 265
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 317 transition count 262
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 317 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 317 transition count 260
Applied a total of 16 rules in 27 ms. Remains 317 /324 variables (removed 7) and now considering 260/269 (removed 9) transitions.
// Phase 1: matrix 260 rows 317 cols
[2025-05-31 14:44:17] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:44:17] [INFO ] Implicit Places using invariants in 284 ms returned []
[2025-05-31 14:44:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:44:18] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2025-05-31 14:44:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/577 variables, 317/378 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:26] [INFO ] Deduced a trap composed of 15 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 14:44:26] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:27] [INFO ] Deduced a trap composed of 14 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 14:44:27] [INFO ] Deduced a trap composed of 17 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 14:44:27] [INFO ] Deduced a trap composed of 18 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 14:44:27] [INFO ] Deduced a trap composed of 16 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 14:44:27] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:27] [INFO ] Deduced a trap composed of 26 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 14:44:28] [INFO ] Deduced a trap composed of 29 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 14:44:28] [INFO ] Deduced a trap composed of 10 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 14:44:28] [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 14:44:29] [INFO ] Deduced a trap composed of 13 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 14:44:29] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:29] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:30] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 15/393 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:34] [INFO ] Deduced a trap along path composed of 8 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:34] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:35] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:39] [INFO ] Deduced a trap composed of 21 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 14:44:40] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 2/398 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:44] [INFO ] Deduced a trap composed of 10 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 14:44:44] [INFO ] Deduced a trap composed of 13 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 14:44:45] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 3/401 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 577/577 variables, and 401 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:49] [INFO ] Deduced a trap composed of 32 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 14:44:49] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:49] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:49] [INFO ] Deduced a trap composed of 21 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 14:44:49] [INFO ] Deduced a trap composed of 13 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 14:44:49] [INFO ] Deduced a trap composed of 25 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 14:44:49] [INFO ] Deduced a trap composed of 30 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 14:44:50] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:50] [INFO ] Deduced a trap composed of 22 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 14:44:50] [INFO ] Deduced a trap composed of 23 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 14:44:50] [INFO ] Deduced a trap composed of 23 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 14:44:50] [INFO ] Deduced a trap composed of 17 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 14:44:50] [INFO ] Deduced a trap composed of 18 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 14:44:50] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:50] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:50] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:51] [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 14:44:51] [INFO ] Deduced a trap composed of 7 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 14:44:51] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:51] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:52] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:52] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:52] [INFO ] Deduced a trap composed of 19 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 14:44:52] [INFO ] Deduced a trap composed of 19 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 14:44:52] [INFO ] Deduced a trap composed of 20 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 14:44:52] [INFO ] Deduced a trap composed of 20 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 14:44:52] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:52] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:53] [INFO ] Deduced a trap composed of 22 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 14:44:53] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:53] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:53] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:53] [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 14:44:53] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:53] [INFO ] Deduced a trap composed of 24 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 14:44:53] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:54] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:54] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:54] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 19/120 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:56] [INFO ] Deduced a trap composed of 18 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 14:44:56] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:56] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:56] [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 14:44:56] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:44:56] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 260/577 variables, 317/443 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 259/702 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:18] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/577 variables, and 703 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in LTL mode, iteration 1 : 317/324 places, 260/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60963 ms. Remains : 317/324 places, 260/269 transitions.
Stuttering acceptance computed with spot in 843 ms :[(OR (NOT p2) p3), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false, p3, (AND (NOT p1) p0 p3), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND p0 (NOT p1) (NOT p2)), false, (AND p3 (NOT p2)), (AND (NOT p1) p0 p3 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DES-PT-20b-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 168 ms.
Product exploration explored 100000 steps with 33333 reset in 157 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 657 edges and 317 vertex of which 312 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) p2), (X (NOT p3)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (OR p1 p0))), (X (NOT (AND p3 (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 20 ms. Reduced automaton from 21 states, 41 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20b-LTLFireability-09 finished in 62197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 269/269 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 318 transition count 263
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 318 transition count 263
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 313 transition count 258
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 313 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 313 transition count 254
Applied a total of 26 rules in 22 ms. Remains 313 /324 variables (removed 11) and now considering 254/269 (removed 15) transitions.
// Phase 1: matrix 254 rows 313 cols
[2025-05-31 14:45:19] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:45:19] [INFO ] Implicit Places using invariants in 318 ms returned []
[2025-05-31 14:45:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:45:20] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-05-31 14:45:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:25] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:27] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:28] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:28] [INFO ] Deduced a trap composed of 10 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 14:45:28] [INFO ] Deduced a trap composed of 11 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 14:45:28] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:28] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:29] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:29] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:33] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:33] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:33] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:33] [INFO ] Deduced a trap composed of 17 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 14:45:34] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:34] [INFO ] Deduced a trap composed of 17 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 14:45:34] [INFO ] Deduced a trap composed of 17 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 14:45:34] [INFO ] Deduced a trap composed of 18 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 14:45:34] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:34] [INFO ] Deduced a trap composed of 18 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 14:45:34] [INFO ] Deduced a trap composed of 21 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 14:45:34] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:35] [INFO ] Deduced a trap composed of 22 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 14:45:35] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:35] [INFO ] Deduced a trap composed of 13 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 14:45:35] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:36] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:41] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:42] [INFO ] Deduced a trap composed of 13 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 14:45:42] [INFO ] Deduced a trap composed of 11 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 14:45:42] [INFO ] Deduced a trap composed of 32 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 14:45:43] [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 14:45:43] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:43] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 19 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:45] [INFO ] Deduced a trap composed of 14 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 14:45:45] [INFO ] Deduced a trap composed of 17 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 14:45:45] [INFO ] Deduced a trap composed of 21 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 14:45:45] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:45] [INFO ] Deduced a trap composed of 22 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 14:45:45] [INFO ] Deduced a trap composed of 23 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 14:45:45] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:45] [INFO ] Deduced a trap composed of 23 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 14:45:45] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 9/416 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:49] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 417 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 43/104 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:53] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:53] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:53] [INFO ] Deduced a trap composed of 18 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 14:45:53] [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 14:45:54] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:45:55] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/423 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 253/676 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:46:14] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:46:14] [INFO ] Deduced a trap composed of 12 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 14:46:15] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:46:15] [INFO ] Deduced a trap composed of 18 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 14:46:15] [INFO ] Deduced a trap composed of 20 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 14:46:15] [INFO ] Deduced a trap composed of 22 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 14:46:16] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 683 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Starting structural reductions in LTL mode, iteration 1 : 313/324 places, 254/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61075 ms. Remains : 313/324 places, 254/269 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-10 finished in 61211 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((F(G(p0))&&G(p1))))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 269/269 transitions.
Graph (complete) has 672 edges and 324 vertex of which 319 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
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 318 transition count 250
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 303 transition count 250
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 303 transition count 240
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 51 place count 293 transition count 240
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 288 transition count 235
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 288 transition count 235
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 283 transition count 230
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 283 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 283 transition count 226
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 75 place count 283 transition count 224
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 281 transition count 224
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 231 place count 205 transition count 148
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 3 with 4 rules applied. Total rules applied 235 place count 203 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 237 place count 201 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 200 transition count 148
Applied a total of 238 rules in 46 ms. Remains 200 /324 variables (removed 124) and now considering 148/269 (removed 121) transitions.
// Phase 1: matrix 148 rows 200 cols
[2025-05-31 14:46:20] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:46:21] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-31 14:46:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:46:21] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 14:46:21] [INFO ] Redundant transitions in 0 ms returned []
Running 144 sub problems to find dead transitions.
[2025-05-31 14:46:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 2/199 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 144 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 148/347 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:46:27] [INFO ] Deduced a trap composed of 14 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 14:46:27] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:46:29] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (OVERLAPS) 1/348 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/348 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (OVERLAPS) 0/348 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 261 constraints, problems are : Problem set: 0 solved, 144 unsolved in 14860 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 1/197 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 2/199 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 148/347 variables, 199/260 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 144/404 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:46:49] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:46:59] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/348 variables, and 406 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 199/200 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44893ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 44894ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/324 places, 148/269 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45542 ms. Remains : 200/324 places, 148/269 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLFireability-11
Product exploration explored 100000 steps with 5161 reset in 333 ms.
Product exploration explored 100000 steps with 5150 reset in 403 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/200 stabilizing places and 91/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 159 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (2047 resets) in 236 ms. (168 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (377 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
[2025-05-31 14:47:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/100 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/131 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/160 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/167 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 123/290 variables, 167/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/304 variables, 9/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/304 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 24/328 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/328 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/328 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 20/348 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/348 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/348 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/100 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/131 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/160 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/167 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 123/290 variables, 167/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/290 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/304 variables, 9/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/304 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/304 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 24/328 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/328 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/328 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 20/348 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/348 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/348 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 134 ms.
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 148/148 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 200 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 199 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 199 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 198 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 198 transition count 145
Applied a total of 6 rules in 18 ms. Remains 198 /200 variables (removed 2) and now considering 145/148 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 198/200 places, 145/148 transitions.
RANDOM walk for 40000 steps (2124 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (406 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1170724 steps, run timeout after 3001 ms. (steps per millisecond=390 ) properties seen :0 out of 1
Probabilistic random walk after 1170724 steps, saw 162731 distinct states, run finished after 3001 ms. (steps per millisecond=390 ) properties seen :0
// Phase 1: matrix 145 rows 198 cols
[2025-05-31 14:47:11] [INFO ] Computed 59 invariants in 2 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/99 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/134 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/159 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/166 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 120/286 variables, 166/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/300 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/300 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/300 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 24/324 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/324 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/324 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 19/343 variables, 19/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/343 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/343 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/99 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/134 variables, 22/31 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 14:47:11] [INFO ] Deduced a trap composed of 14 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 14:47:11] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/159 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/166 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/286 variables, 166/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/300 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/300 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/300 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 24/324 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/324 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/324 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/343 variables, 19/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/343 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/343 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 661ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 250 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 145/145 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 198/198 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 145/145 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2025-05-31 14:47:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:47:12] [INFO ] Implicit Places using invariants in 284 ms returned []
[2025-05-31 14:47:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:47:13] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 14:47:13] [INFO ] Redundant transitions in 1 ms returned []
Running 142 sub problems to find dead transitions.
[2025-05-31 14:47:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/197 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 145/342 variables, 197/256 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:47:16] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:47:16] [INFO ] Deduced a trap composed of 15 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 14:47:16] [INFO ] Deduced a trap composed of 5 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 14:47:16] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:47:21] [INFO ] Deduced a trap composed of 17 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 14:47:21] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:47:21] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 0/343 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 264 constraints, problems are : Problem set: 0 solved, 142 unsolved in 13615 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 2/197 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 145/342 variables, 197/263 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 142/405 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 43656ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 43657ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44380 ms. Remains : 198/198 places, 145/145 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 145
Applied a total of 1 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 198 cols
[2025-05-31 14:47:56] [INFO ] Computed 59 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 14:47:56] [INFO ] After 95ms 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 14:47:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2025-05-31 14:47:56] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 25 ms returned sat
[2025-05-31 14:47:57] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:47:57] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2025-05-31 14:47:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
TRAPS : Iteration 1
[2025-05-31 14:47:57] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 14:47:57] [INFO ] After 469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 578 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 217 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 200 cols
[2025-05-31 14:47:57] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:47:57] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-05-31 14:47:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:47:58] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 14:47:58] [INFO ] Redundant transitions in 1 ms returned []
Running 144 sub problems to find dead transitions.
[2025-05-31 14:47: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/196 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 2/199 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 144 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 148/347 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:48:04] [INFO ] Deduced a trap composed of 14 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 14:48:04] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:48:05] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (OVERLAPS) 1/348 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/348 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (OVERLAPS) 0/348 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 261 constraints, problems are : Problem set: 0 solved, 144 unsolved in 14930 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 1/197 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 2/199 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 148/347 variables, 199/260 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 144/404 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:48:26] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:48:36] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/348 variables, and 406 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 199/200 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44969ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 44969ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45626 ms. Remains : 200/200 places, 148/148 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/200 stabilizing places and 91/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 130 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (2047 resets) in 160 ms. (248 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (369 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
[2025-05-31 14:48:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/100 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/131 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/160 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/167 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 123/290 variables, 167/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/304 variables, 9/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/304 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 24/328 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/328 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/328 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 20/348 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/348 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/348 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/100 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/131 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/160 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/167 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 123/290 variables, 167/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/290 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/304 variables, 9/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/304 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/304 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 24/328 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/328 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/328 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 20/348 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/348 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/348 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 631ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 139 ms.
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 148/148 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 200 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 199 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 199 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 198 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 198 transition count 145
Applied a total of 6 rules in 16 ms. Remains 198 /200 variables (removed 2) and now considering 145/148 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 198/200 places, 145/148 transitions.
RANDOM walk for 40000 steps (2130 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (422 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1220013 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :0 out of 1
Probabilistic random walk after 1220013 steps, saw 169511 distinct states, run finished after 3001 ms. (steps per millisecond=406 ) properties seen :0
// Phase 1: matrix 145 rows 198 cols
[2025-05-31 14:48:47] [INFO ] Computed 59 invariants in 2 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/99 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/134 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/159 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/166 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 120/286 variables, 166/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/300 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/300 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/300 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 24/324 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/324 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/324 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 19/343 variables, 19/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/343 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/343 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/99 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/134 variables, 22/31 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 14:48:47] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:48:47] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/159 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/166 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/286 variables, 166/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/300 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/300 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/300 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 24/324 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/324 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/324 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/343 variables, 19/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/343 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/343 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 762ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 251 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 145/145 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 198/198 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 145/145 transitions.
Applied a total of 0 rules in 14 ms. Remains 198 /198 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2025-05-31 14:48:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:48:48] [INFO ] Implicit Places using invariants in 441 ms returned []
[2025-05-31 14:48:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:48:49] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 14:48:49] [INFO ] Redundant transitions in 0 ms returned []
Running 142 sub problems to find dead transitions.
[2025-05-31 14:48:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/197 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 145/342 variables, 197/256 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:48:52] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:48:52] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:48:53] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:48:53] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:48:57] [INFO ] Deduced a trap composed of 17 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 14:48:57] [INFO ] Deduced a trap composed of 19 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 14:48:57] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 0/343 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 264 constraints, problems are : Problem set: 0 solved, 142 unsolved in 13400 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 2/197 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 145/342 variables, 197/263 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 142/405 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 43442ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 43443ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44329 ms. Remains : 198/198 places, 145/145 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 145
Applied a total of 1 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 198 cols
[2025-05-31 14:49:32] [INFO ] Computed 59 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 14:49:32] [INFO ] After 115ms 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 14:49:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2025-05-31 14:49:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 21 ms returned sat
[2025-05-31 14:49:33] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:33] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 3 ms to minimize.
[2025-05-31 14:49:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
TRAPS : Iteration 1
[2025-05-31 14:49:33] [INFO ] After 495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 14:49:33] [INFO ] After 731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 865 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 201 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 5066 reset in 286 ms.
Product exploration explored 100000 steps with 5192 reset in 579 ms.
Built C files in :
/tmp/ltsmin13094554415180203809
[2025-05-31 14:49:35] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2025-05-31 14:49:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 14:49:35] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2025-05-31 14:49:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 14:49:35] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2025-05-31 14:49:35] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 14:49:35] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13094554415180203809
Running compilation step : cd /tmp/ltsmin13094554415180203809;'/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 523 ms.
Running link step : cd /tmp/ltsmin13094554415180203809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13094554415180203809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12618003251558788812.hoa' '--buchi-type=spotba'
LTSmin run took 777 ms.
FORMULA DES-PT-20b-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20b-LTLFireability-11 finished in 195630 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(p0) U (F(((p1&&X(F(p1)))||G(F(p1)))) U p2))))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 269/269 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 318 transition count 263
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 318 transition count 263
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 313 transition count 258
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 313 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 313 transition count 254
Applied a total of 26 rules in 17 ms. Remains 313 /324 variables (removed 11) and now considering 254/269 (removed 15) transitions.
// Phase 1: matrix 254 rows 313 cols
[2025-05-31 14:49:36] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:49:36] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-05-31 14:49:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:49:37] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-05-31 14:49:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:42] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:44] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:45] [INFO ] Deduced a trap composed of 29 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 14:49:45] [INFO ] Deduced a trap composed of 10 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 14:49:45] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:45] [INFO ] Deduced a trap composed of 14 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 14:49:45] [INFO ] Deduced a trap composed of 13 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 14:49:45] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:45] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:49] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:49] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:50] [INFO ] Deduced a trap composed of 14 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 14:49:50] [INFO ] Deduced a trap composed of 17 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 14:49:50] [INFO ] Deduced a trap composed of 16 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 14:49:50] [INFO ] Deduced a trap composed of 17 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 14:49:50] [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 14:49:50] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:50] [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 14:49:51] [INFO ] Deduced a trap composed of 18 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 14:49:51] [INFO ] Deduced a trap composed of 21 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 14:49:51] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:51] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:51] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:52] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:52] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:52] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:57] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:58] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:58] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:58] [INFO ] Deduced a trap composed of 32 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 14:49:59] [INFO ] Deduced a trap composed of 9 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 14:49:59] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:49:59] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 20 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:01] [INFO ] Deduced a trap composed of 14 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 14:50:01] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:01] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:01] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:01] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:01] [INFO ] Deduced a trap composed of 23 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 14:50:02] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:02] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:02] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 9/416 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:05] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 7 ms to minimize.
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 0.0)
(s25 1.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 0.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 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.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 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 417 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 43/104 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:09] [INFO ] Deduced a trap composed of 13 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 14:50:10] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:10] [INFO ] Deduced a trap composed of 18 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 14:50:10] [INFO ] Deduced a trap composed of 15 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 14:50:11] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:12] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/423 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 253/676 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:31] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:31] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:32] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:32] [INFO ] Deduced a trap composed of 18 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 14:50:32] [INFO ] Deduced a trap composed of 20 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 14:50:33] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:33] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 683 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 313/324 places, 254/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60961 ms. Remains : 313/324 places, 254/269 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (NOT p2), false, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-20b-LTLFireability-12
Product exploration explored 100000 steps with 17462 reset in 138 ms.
Product exploration explored 100000 steps with 17622 reset in 152 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Detected a total of 136/313 stabilizing places and 129/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 19 factoid took 896 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
RANDOM walk for 40000 steps (356 resets) in 177 ms. (224 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (53 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2025-05-31 14:50:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/163 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/269 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/297 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 241/538 variables, 297/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/557 variables, 11/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/563 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/565 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/567 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/567 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 374 constraints, problems are : Problem set: 0 solved, 1 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/163 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/269 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/297 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 241/538 variables, 297/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 1/359 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 14:50:40] [INFO ] Deduced a trap composed of 19 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 14:50:40] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 2/361 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 14:50:40] [INFO ] Deduced a trap along path composed of 4 places in 87 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/557 variables, 11/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/563 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/563 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/565 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/565 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/567 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/567 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/567 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1131 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1543ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 422 ms.
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Graph (complete) has 647 edges and 313 vertex of which 308 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
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 18 rules applied. Total rules applied 19 place count 308 transition count 233
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 292 transition count 233
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 35 place count 292 transition count 220
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 61 place count 279 transition count 220
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 213 place count 203 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 201 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 201 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 200 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 200 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 199 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 198 transition count 144
Applied a total of 222 rules in 39 ms. Remains 198 /313 variables (removed 115) and now considering 144/254 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 198/313 places, 144/254 transitions.
RANDOM walk for 40000 steps (1834 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (347 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1205875 steps, run timeout after 3001 ms. (steps per millisecond=401 ) properties seen :0 out of 1
Probabilistic random walk after 1205875 steps, saw 167603 distinct states, run finished after 3001 ms. (steps per millisecond=401 ) properties seen :0
// Phase 1: matrix 144 rows 198 cols
[2025-05-31 14:50:44] [INFO ] Computed 60 invariants in 2 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 89/155 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/164 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/166 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 120/286 variables, 166/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/299 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/299 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/301 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/301 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/301 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 22/323 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/323 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/323 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 19/342 variables, 19/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/342 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/342 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 89/155 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/164 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/166 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 120/286 variables, 166/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/299 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/299 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/299 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/301 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/301 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/301 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/323 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/323 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/323 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/342 variables, 19/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/342 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/342 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 746ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 222 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 198/198 places, 144/144 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2025-05-31 14:50:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:50:45] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-05-31 14:50:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:50:46] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 14:50:46] [INFO ] Redundant transitions in 0 ms returned []
Running 141 sub problems to find dead transitions.
[2025-05-31 14:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 141 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/197 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 144/341 variables, 197/257 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:50] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:50] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:51] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:51] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 1/342 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:54] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:50:54] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 14 (OVERLAPS) 0/342 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 264 constraints, problems are : Problem set: 0 solved, 141 unsolved in 14300 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 1/196 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 1/197 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 144/341 variables, 197/263 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 141/404 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/342 variables, and 404 constraints, problems are : Problem set: 0 solved, 141 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 197/198 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44352ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 44353ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45122 ms. Remains : 198/198 places, 144/144 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 144
Applied a total of 1 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 144 rows 198 cols
[2025-05-31 14:51:30] [INFO ] Computed 60 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 14:51:30] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-31 14:51:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2025-05-31 14:51:30] [INFO ] After 112ms 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 14:51:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2025-05-31 14:51:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2025-05-31 14:51:30] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 14:51:30] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 14:51:30] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 389 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 1098 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
// Phase 1: matrix 254 rows 313 cols
[2025-05-31 14:51:32] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 14:51:32] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2025-05-31 14:51:32] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 30 ms returned sat
[2025-05-31 14:51:35] [INFO ] [Real]Absence check using state equation in 2756 ms returned sat
[2025-05-31 14:51:35] [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 14:51:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 21 ms returned sat
[2025-05-31 14:51:35] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 40 ms returned sat
[2025-05-31 14:51:40] [INFO ] [Nat]Absence check using state equation in 5123 ms returned sat
[2025-05-31 14:51:40] [INFO ] Computed and/alt/rep : 248/493/248 causal constraints (skipped 5 transitions) in 20 ms.
[2025-05-31 14:51:46] [INFO ] Added : 220 causal constraints over 44 iterations in 5545 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 313 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2025-05-31 14:51:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:51:46] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-05-31 14:51:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:51:47] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-05-31 14:51:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:51:52] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:51:54] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:51:54] [INFO ] Deduced a trap composed of 29 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 14:51:55] [INFO ] Deduced a trap composed of 10 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 14:51:55] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:51:55] [INFO ] Deduced a trap composed of 14 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 14:51:55] [INFO ] Deduced a trap composed of 13 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 14:51:55] [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 14:51:55] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:51:59] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:51:59] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:00] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:00] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:00] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:00] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:00] [INFO ] Deduced a trap composed of 17 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 14:52:00] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:01] [INFO ] Deduced a trap composed of 19 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 14:52:01] [INFO ] Deduced a trap composed of 18 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 14:52:01] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:01] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:01] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:01] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:02] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:02] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:02] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:08] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:08] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:08] [INFO ] Deduced a trap composed of 11 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 14:52:09] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:09] [INFO ] Deduced a trap composed of 9 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 14:52:10] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:10] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 20 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:11] [INFO ] Deduced a trap composed of 14 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 14:52:12] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:12] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:12] [INFO ] Deduced a trap composed of 20 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 14:52:12] [INFO ] Deduced a trap composed of 22 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 14:52:12] [INFO ] Deduced a trap composed of 23 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 14:52:12] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:12] [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 14:52:12] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 9/416 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:16] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 417 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 43/104 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:19] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:19] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:20] [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 14:52:20] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:20] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:22] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/423 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 253/676 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:41] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:41] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:42] [INFO ] Deduced a trap composed of 23 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 14:52:42] [INFO ] Deduced a trap composed of 18 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 14:52:42] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:42] [INFO ] Deduced a trap composed of 22 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 14:52:42] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 683 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Finished structural reductions in LTL mode , in 1 iterations and 60936 ms. Remains : 313/313 places, 254/254 transitions.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Detected a total of 136/313 stabilizing places and 129/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 4 factoid took 357 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
RANDOM walk for 40000 steps (345 resets) in 125 ms. (317 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (50 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
[2025-05-31 14:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/163 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/269 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/297 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 241/538 variables, 297/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/557 variables, 11/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/563 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/565 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/567 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/567 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 374 constraints, problems are : Problem set: 0 solved, 1 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/163 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/269 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/297 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 241/538 variables, 297/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 1/359 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 14:52:48] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:48] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 2/361 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 14:52:49] [INFO ] Deduced a trap along path composed of 4 places in 103 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/557 variables, 11/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/563 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/563 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/565 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/565 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/567 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/567 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/567 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1170 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1572ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 415 ms.
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 308 transition count 233
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 292 transition count 233
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 35 place count 292 transition count 220
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 61 place count 279 transition count 220
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 213 place count 203 transition count 144
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 2 with 4 rules applied. Total rules applied 217 place count 201 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 201 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 200 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 200 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 199 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 198 transition count 144
Applied a total of 222 rules in 39 ms. Remains 198 /313 variables (removed 115) and now considering 144/254 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 198/313 places, 144/254 transitions.
RANDOM walk for 40000 steps (1834 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (349 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1227781 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :0 out of 1
Probabilistic random walk after 1227781 steps, saw 170593 distinct states, run finished after 3001 ms. (steps per millisecond=409 ) properties seen :0
// Phase 1: matrix 144 rows 198 cols
[2025-05-31 14:52:53] [INFO ] Computed 60 invariants in 2 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 89/155 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/164 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/166 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 120/286 variables, 166/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/299 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/299 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/301 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/301 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/301 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 22/323 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/323 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/323 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 19/342 variables, 19/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/342 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/342 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 89/155 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/164 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/166 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 120/286 variables, 166/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/299 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/299 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/299 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/301 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/301 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/301 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/323 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/323 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/323 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/342 variables, 19/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/342 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/342 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 731ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 223 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 198/198 places, 144/144 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2025-05-31 14:52:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:52:54] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-05-31 14:52:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:52:54] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 14:52:54] [INFO ] Redundant transitions in 1 ms returned []
Running 141 sub problems to find dead transitions.
[2025-05-31 14:52:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 141 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/197 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 144/341 variables, 197/257 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:59] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:59] [INFO ] Deduced a trap composed of 14 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 14:52:59] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:52:59] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 1/342 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:53:02] [INFO ] Deduced a trap composed of 17 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 14:53:02] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 14 (OVERLAPS) 0/342 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 264 constraints, problems are : Problem set: 0 solved, 141 unsolved in 13949 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 1/196 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 1/197 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 144/341 variables, 197/263 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 141/404 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/342 variables, and 404 constraints, problems are : Problem set: 0 solved, 141 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 197/198 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44015ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 44016ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44636 ms. Remains : 198/198 places, 144/144 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 144
Applied a total of 1 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 144 rows 198 cols
[2025-05-31 14:53:38] [INFO ] Computed 60 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 14:53:38] [INFO ] [Real]Absence check using 36 positive place invariants in 89 ms returned sat
[2025-05-31 14:53:38] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2025-05-31 14:53:38] [INFO ] After 279ms 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 14:53:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 22 ms returned sat
[2025-05-31 14:53:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2025-05-31 14:53:39] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 14:53:39] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 14:53:39] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 588 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 4 factoid took 471 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
// Phase 1: matrix 254 rows 313 cols
[2025-05-31 14:53:40] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 14:53:40] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2025-05-31 14:53:40] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 30 ms returned sat
[2025-05-31 14:53:43] [INFO ] [Real]Absence check using state equation in 2750 ms returned sat
[2025-05-31 14:53:43] [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 14:53:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 21 ms returned sat
[2025-05-31 14:53:43] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 39 ms returned sat
[2025-05-31 14:53:48] [INFO ] [Nat]Absence check using state equation in 5131 ms returned sat
[2025-05-31 14:53:48] [INFO ] Computed and/alt/rep : 248/493/248 causal constraints (skipped 5 transitions) in 19 ms.
[2025-05-31 14:53:54] [INFO ] Added : 220 causal constraints over 44 iterations in 5523 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 17396 reset in 120 ms.
Product exploration explored 100000 steps with 17344 reset in 137 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p1)]
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Graph (complete) has 647 edges and 313 vertex of which 308 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
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 308 transition count 251
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 15 place count 308 transition count 253
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 24 place count 308 transition count 253
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 303 transition count 248
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 303 transition count 248
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 110 place count 303 transition count 251
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 120 place count 293 transition count 241
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 130 place count 293 transition count 241
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 293 transition count 269
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 291 transition count 263
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 291 transition count 263
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 140 rules in 56 ms. Remains 291 /313 variables (removed 22) and now considering 263/254 (removed -9) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 14:53:54] [INFO ] Redundant transitions in 1 ms returned []
Running 262 sub problems to find dead transitions.
// Phase 1: matrix 263 rows 291 cols
[2025-05-31 14:53:54] [INFO ] Computed 59 invariants in 3 ms
[2025-05-31 14:53:54] [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/290 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/291 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 262 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 262 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 TDEAD28 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 TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 5 (OVERLAPS) 263/554 variables, 291/350 constraints. Problems are: Problem set: 113 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 16/366 constraints. Problems are: Problem set: 113 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 0/366 constraints. Problems are: Problem set: 113 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:08] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 6 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/554 variables, 1/367 constraints. Problems are: Problem set: 113 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/367 constraints. Problems are: Problem set: 113 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:17] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 6 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/554 variables, 1/368 constraints. Problems are: Problem set: 113 solved, 149 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 0/368 constraints. Problems are: Problem set: 113 solved, 149 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 (/ 17.0 20.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 0.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 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 (/ 19.0 20.0))
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.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 1.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 1.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 1.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.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 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/554 variables, and 368 constraints, problems are : Problem set: 113 solved, 149 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 291/291 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 113 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 13/13 constraints. Problems are: Problem set: 113 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/13 constraints. Problems are: Problem set: 113 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 68/270 variables, 32/45 constraints. Problems are: Problem set: 113 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 2/47 constraints. Problems are: Problem set: 113 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:26] [INFO ] Deduced a trap composed of 6 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 14:54:26] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 2/49 constraints. Problems are: Problem set: 113 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:27] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:27] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 2/51 constraints. Problems are: Problem set: 113 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/51 constraints. Problems are: Problem set: 113 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 14/284 variables, 14/65 constraints. Problems are: Problem set: 113 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:29] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:29] [INFO ] Deduced a trap composed of 4 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 14:54:29] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:29] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:30] [INFO ] Deduced a trap composed of 8 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 14:54:30] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 6/71 constraints. Problems are: Problem set: 113 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:31] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:31] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:31] [INFO ] Deduced a trap composed of 11 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 14:54:31] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:32] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 5/76 constraints. Problems are: Problem set: 113 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:32] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:32] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 2/78 constraints. Problems are: Problem set: 113 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:34] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:34] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:34] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 3/81 constraints. Problems are: Problem set: 113 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:35] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:36] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:54:36] [INFO ] Deduced a trap composed of 10 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 14:54:36] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 4/85 constraints. Problems are: Problem set: 113 solved, 149 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 0/85 constraints. Problems are: Problem set: 113 solved, 149 unsolved
At refinement iteration 14 (OVERLAPS) 259/543 variables, 284/369 constraints. Problems are: Problem set: 113 solved, 149 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/543 variables, 16/385 constraints. Problems are: Problem set: 113 solved, 149 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/543 variables, 149/534 constraints. Problems are: Problem set: 113 solved, 149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/554 variables, and 534 constraints, problems are : Problem set: 113 solved, 149 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 284/291 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 149/262 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 113 solved, 149 unsolved
Search for dead transitions found 113 dead transitions in 60088ms
Found 113 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 113 transitions
Dead transitions reduction (with SMT) removed 113 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 291/313 places, 150/254 transitions.
Graph (complete) has 698 edges and 291 vertex of which 203 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.1 ms
Discarding 88 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 203 /291 variables (removed 88) and now considering 150/150 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 203/313 places, 150/254 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60168 ms. Remains : 203/313 places, 150/254 transitions.
Built C files in :
/tmp/ltsmin15750434813350764990
[2025-05-31 14:54:55] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15750434813350764990
Running compilation step : cd /tmp/ltsmin15750434813350764990;'/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 656 ms.
Running link step : cd /tmp/ltsmin15750434813350764990;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15750434813350764990;'/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/stateBased18354405498222542568.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
// Phase 1: matrix 254 rows 313 cols
[2025-05-31 14:55:10] [INFO ] Computed 61 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:55:10] [INFO ] Implicit Places using invariants in 297 ms returned []
[2025-05-31 14:55:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:55:11] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-05-31 14:55:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:16] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:17] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:18] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:18] [INFO ] Deduced a trap composed of 10 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 14:55:18] [INFO ] Deduced a trap composed of 11 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 14:55:19] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:19] [INFO ] Deduced a trap composed of 13 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 14:55:19] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:19] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:23] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:23] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:23] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:23] [INFO ] Deduced a trap composed of 17 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 14:55:24] [INFO ] Deduced a trap composed of 16 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 14:55:24] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:24] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:24] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:24] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:25] [INFO ] Deduced a trap composed of 18 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 14:55:25] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:25] [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 14:55:25] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:25] [INFO ] Deduced a trap composed of 15 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 14:55:26] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:26] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:26] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:31] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:32] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:32] [INFO ] Deduced a trap composed of 11 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 14:55:33] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:33] [INFO ] Deduced a trap composed of 9 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 14:55:33] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:34] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 19 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:35] [INFO ] Deduced a trap composed of 14 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 14:55:35] [INFO ] Deduced a trap composed of 17 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 14:55:36] [INFO ] Deduced a trap composed of 21 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 14:55:36] [INFO ] Deduced a trap composed of 20 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 14:55:36] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:36] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:36] [INFO ] Deduced a trap composed of 21 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 14:55:36] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:36] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 9/416 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:40] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 417 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 43/104 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:43] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:43] [INFO ] Deduced a trap composed of 14 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 14:55:43] [INFO ] Deduced a trap composed of 18 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 14:55:44] [INFO ] Deduced a trap composed of 15 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 14:55:44] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:55:46] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/423 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 253/676 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:56:05] [INFO ] Deduced a trap composed of 14 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 14:56:05] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:56:05] [INFO ] Deduced a trap composed of 23 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 14:56:06] [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 14:56:06] [INFO ] Deduced a trap composed of 20 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 14:56:06] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:56:06] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 683 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Finished structural reductions in LTL mode , in 1 iterations and 60978 ms. Remains : 313/313 places, 254/254 transitions.
Built C files in :
/tmp/ltsmin16326027484790822532
[2025-05-31 14:56:11] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16326027484790822532
Running compilation step : cd /tmp/ltsmin16326027484790822532;'/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 663 ms.
Running link step : cd /tmp/ltsmin16326027484790822532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16326027484790822532;'/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/stateBased17463022954021093567.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 14:56:26] [INFO ] Flatten gal took : 17 ms
[2025-05-31 14:56:26] [INFO ] Flatten gal took : 15 ms
[2025-05-31 14:56:26] [INFO ] Time to serialize gal into /tmp/LTL2317568970911767582.gal : 3 ms
[2025-05-31 14:56:26] [INFO ] Time to serialize properties into /tmp/LTL5061075969013018428.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/LTL2317568970911767582.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11877475656895933382.hoa' '-atoms' '/tmp/LTL5061075969013018428.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/LTL5061075969013018428.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11877475656895933382.hoa
Detected timeout of ITS tools.
[2025-05-31 14:56:41] [INFO ] Flatten gal took : 15 ms
[2025-05-31 14:56:41] [INFO ] Flatten gal took : 20 ms
[2025-05-31 14:56:41] [INFO ] Time to serialize gal into /tmp/LTL6642239005663043352.gal : 2 ms
[2025-05-31 14:56:41] [INFO ] Time to serialize properties into /tmp/LTL10312509285666101407.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/LTL6642239005663043352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10312509285666101407.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("(p102==1)"))U((F((G(F("(p1!=1)")))||(("(p1!=1)")&&(X(F("(p1!=1)"))))))U("((p31==1)&&(p352==1))")))))
Formula 0 simplified : X(F!"(p102==1)" R (G(FG!"(p1!=1)" & (!"(p1!=1)" | XG!"(p1!=1)")) R !"((p31==1)&&(p352==1))"))
Detected timeout of ITS tools.
[2025-05-31 14:56:56] [INFO ] Flatten gal took : 14 ms
[2025-05-31 14:56:56] [INFO ] Applying decomposition
[2025-05-31 14:56:56] [INFO ] Flatten gal took : 14 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/graph17367356396479455290.txt' '-o' '/tmp/graph17367356396479455290.bin' '-w' '/tmp/graph17367356396479455290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17367356396479455290.bin' '-l' '-1' '-v' '-w' '/tmp/graph17367356396479455290.weights' '-q' '0' '-e' '0.001'
[2025-05-31 14:56:56] [INFO ] Decomposing Gal with order
[2025-05-31 14:56:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 14:56:56] [INFO ] Removed a total of 11 redundant transitions.
[2025-05-31 14:56:56] [INFO ] Flatten gal took : 29 ms
[2025-05-31 14:56:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-05-31 14:56:56] [INFO ] Time to serialize gal into /tmp/LTL6380999296514523069.gal : 6 ms
[2025-05-31 14:56:56] [INFO ] Time to serialize properties into /tmp/LTL4332969929019573699.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/LTL6380999296514523069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4332969929019573699.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...254
Read 1 LTL properties
Checking formula 0 : !((X((G("(i1.u7.p102==1)"))U((F((G(F("(i5.u0.p1!=1)")))||(("(i5.u0.p1!=1)")&&(X(F("(i5.u0.p1!=1)"))))))U("((u76.p31==1)&&(u76.p352==1)...162
Formula 0 simplified : X(F!"(i1.u7.p102==1)" R (G(FG!"(i5.u0.p1!=1)" & (!"(i5.u0.p1!=1)" | XG!"(i5.u0.p1!=1)")) R !"((u76.p31==1)&&(u76.p352==1))"))
Detected timeout of ITS tools.
Treatment of property DES-PT-20b-LTLFireability-12 finished in 455099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))||G(p2)||F(p3)))'
Support contains 8 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 269/269 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 318 transition count 263
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 318 transition count 263
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 313 transition count 258
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 313 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 313 transition count 254
Applied a total of 26 rules in 16 ms. Remains 313 /324 variables (removed 11) and now considering 254/269 (removed 15) transitions.
[2025-05-31 14:57:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:57:11] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-05-31 14:57:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:57:12] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-05-31 14:57:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:17] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:19] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:20] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:20] [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 14:57:20] [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 14:57:20] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:20] [INFO ] Deduced a trap composed of 13 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 14:57:20] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:20] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:24] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:24] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:25] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:25] [INFO ] Deduced a trap composed of 17 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 14:57:25] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:25] [INFO ] Deduced a trap composed of 17 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 14:57:25] [INFO ] Deduced a trap composed of 17 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 14:57:25] [INFO ] Deduced a trap composed of 18 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 14:57:25] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:26] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:26] [INFO ] Deduced a trap composed of 21 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 14:57:26] [INFO ] Deduced a trap composed of 19 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 14:57:26] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:26] [INFO ] Deduced a trap composed of 15 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 14:57:27] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:27] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:27] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:32] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:33] [INFO ] Deduced a trap composed of 13 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 14:57:33] [INFO ] Deduced a trap composed of 11 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 14:57:33] [INFO ] Deduced a trap composed of 32 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 14:57:34] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:34] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:34] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 19 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:36] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:36] [INFO ] Deduced a trap composed of 17 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 14:57:36] [INFO ] Deduced a trap composed of 21 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 14:57:36] [INFO ] Deduced a trap composed of 20 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 14:57:37] [INFO ] Deduced a trap composed of 22 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 14:57:37] [INFO ] Deduced a trap composed of 23 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 14:57:37] [INFO ] Deduced a trap composed of 21 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 14:57:37] [INFO ] Deduced a trap composed of 23 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 14:57:37] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 9/416 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:41] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 417 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 43/104 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:44] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:45] [INFO ] Deduced a trap composed of 14 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 14:57:45] [INFO ] Deduced a trap composed of 18 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 14:57:45] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:46] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:57:47] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/423 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 253/676 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:06] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:06] [INFO ] Deduced a trap composed of 12 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 14:58:07] [INFO ] Deduced a trap composed of 23 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 14:58:07] [INFO ] Deduced a trap composed of 18 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 14:58:07] [INFO ] Deduced a trap composed of 20 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 14:58:07] [INFO ] Deduced a trap composed of 22 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 14:58:07] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 683 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 313/324 places, 254/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60962 ms. Remains : 313/324 places, 254/269 transitions.
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : DES-PT-20b-LTLFireability-13
Product exploration explored 100000 steps with 924 reset in 208 ms.
Product exploration explored 100000 steps with 928 reset in 239 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Detected a total of 136/313 stabilizing places and 129/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p3) (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT p3)), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (AND (NOT p3) (NOT p1))), (X (AND (NOT p0) p2 (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (AND p2 (NOT p3) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 381 ms. Reduced automaton from 9 states, 25 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
RANDOM walk for 5517 steps (46 resets) in 49 ms. (110 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p3) (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT p3)), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (AND (NOT p3) (NOT p1))), (X (AND (NOT p0) p2 (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (AND p2 (NOT p3) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p3 p2))), (F (NOT p2)), (F p3), (F (NOT (AND (NOT p3) p2)))]
Knowledge based reduction with 34 factoid took 749 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 4 out of 313 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2025-05-31 14:58:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:58:15] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-05-31 14:58:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 14:58:15] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-05-31 14:58:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:20] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:22] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:23] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:23] [INFO ] Deduced a trap composed of 10 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 14:58:23] [INFO ] Deduced a trap composed of 11 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 14:58:23] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:23] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:24] [INFO ] Deduced a trap composed of 14 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 14:58:24] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:27] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:28] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:28] [INFO ] Deduced a trap composed of 14 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 14:58:28] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:29] [INFO ] Deduced a trap composed of 16 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 14:58:29] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:29] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:29] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:29] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:29] [INFO ] Deduced a trap composed of 18 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 14:58:29] [INFO ] Deduced a trap composed of 21 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 14:58:30] [INFO ] Deduced a trap composed of 19 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 14:58:30] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:30] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:30] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:31] [INFO ] Deduced a trap composed of 21 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 14:58:31] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:36] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:37] [INFO ] Deduced a trap composed of 13 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 14:58:37] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:37] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:38] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:38] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:38] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 20 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:40] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:40] [INFO ] Deduced a trap composed of 17 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 14:58:40] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:41] [INFO ] Deduced a trap composed of 20 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 14:58:41] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:41] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:41] [INFO ] Deduced a trap composed of 21 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 14:58:41] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:41] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 9/416 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:45] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 417 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 43/104 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:48] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:48] [INFO ] Deduced a trap composed of 14 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 14:58:48] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:48] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:49] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:58:50] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/423 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 253/676 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:09] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:10] [INFO ] Deduced a trap composed of 12 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 14:59:10] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:10] [INFO ] Deduced a trap composed of 18 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 14:59:11] [INFO ] Deduced a trap composed of 20 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 14:59:11] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:11] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 683 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in LTL mode , in 1 iterations and 60909 ms. Remains : 313/313 places, 254/254 transitions.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND (NOT p3) p2), (X (X p2)), (X (X (NOT p3))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
RANDOM walk for 7387 steps (66 resets) in 29 ms. (246 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p3) p2), (X (X p2)), (X (X (NOT p3))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(F p3), (F (NOT p2)), (F (NOT (AND p2 (NOT p3)))), (F (NOT (OR p2 p3)))]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 924 reset in 214 ms.
Product exploration explored 100000 steps with 945 reset in 241 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 308 transition count 251
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 15 place count 308 transition count 253
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 308 transition count 253
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 304 transition count 249
Deduced a syphon composed of 18 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 304 transition count 249
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 107 place count 304 transition count 252
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 117 place count 294 transition count 242
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 127 place count 294 transition count 242
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 133 place count 294 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 292 transition count 264
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 292 transition count 264
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 137 rules in 37 ms. Remains 292 /313 variables (removed 21) and now considering 264/254 (removed -10) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 14:59:17] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
// Phase 1: matrix 264 rows 292 cols
[2025-05-31 14:59:17] [INFO ] Computed 59 invariants in 3 ms
[2025-05-31 14:59:17] [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/291 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/291 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 1/292 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 263 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 263 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 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 TDEAD28 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 TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 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 TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 5 (OVERLAPS) 264/556 variables, 292/351 constraints. Problems are: Problem set: 113 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 16/367 constraints. Problems are: Problem set: 113 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:27] [INFO ] Deduced a trap composed of 4 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 14:59:27] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:27] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/370 constraints. Problems are: Problem set: 113 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/370 constraints. Problems are: Problem set: 113 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:33] [INFO ] Deduced a trap composed of 14 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 14:59:33] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 10 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/556 variables, 2/372 constraints. Problems are: Problem set: 113 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/372 constraints. Problems are: Problem set: 113 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/556 variables, 0/372 constraints. Problems are: Problem set: 113 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 372 constraints, problems are : Problem set: 113 solved, 150 unsolved in 25428 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 292/292 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 113 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 13/13 constraints. Problems are: Problem set: 113 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/13 constraints. Problems are: Problem set: 113 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 67/270 variables, 32/45 constraints. Problems are: Problem set: 113 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 5/50 constraints. Problems are: Problem set: 113 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/50 constraints. Problems are: Problem set: 113 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 14/284 variables, 14/64 constraints. Problems are: Problem set: 113 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:45] [INFO ] Deduced a trap composed of 3 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 14:59:46] [INFO ] Deduced a trap composed of 4 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 14:59:46] [INFO ] Deduced a trap composed of 4 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 14:59:46] [INFO ] Deduced a trap composed of 4 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 14:59:46] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:46] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 6/70 constraints. Problems are: Problem set: 113 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:47] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:48] [INFO ] Deduced a trap composed of 4 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 14:59:48] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:48] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:48] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 5/75 constraints. Problems are: Problem set: 113 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:49] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:49] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 2/77 constraints. Problems are: Problem set: 113 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 14:59:50] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 1/78 constraints. Problems are: Problem set: 113 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/78 constraints. Problems are: Problem set: 113 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 260/544 variables, 284/362 constraints. Problems are: Problem set: 113 solved, 150 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 16/378 constraints. Problems are: Problem set: 113 solved, 150 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 150/528 constraints. Problems are: Problem set: 113 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:08] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:09] [INFO ] Deduced a trap along path composed of 18 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/556 variables, and 530 constraints, problems are : Problem set: 113 solved, 150 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 284/292 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 150/263 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 55520ms problems are : Problem set: 113 solved, 150 unsolved
Search for dead transitions found 113 dead transitions in 55521ms
Found 113 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 113 transitions
Dead transitions reduction (with SMT) removed 113 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 292/313 places, 151/254 transitions.
Graph (complete) has 692 edges and 292 vertex of which 204 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.0 ms
Discarding 88 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 204 /292 variables (removed 88) and now considering 151/151 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 204/313 places, 151/254 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55603 ms. Remains : 204/313 places, 151/254 transitions.
Built C files in :
/tmp/ltsmin4751073082609033190
[2025-05-31 15:00:13] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4751073082609033190
Running compilation step : cd /tmp/ltsmin4751073082609033190;'/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 647 ms.
Running link step : cd /tmp/ltsmin4751073082609033190;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin4751073082609033190;'/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/stateBased3042340415803144776.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
// Phase 1: matrix 254 rows 313 cols
[2025-05-31 15:00:28] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:00:28] [INFO ] Implicit Places using invariants in 285 ms returned []
[2025-05-31 15:00:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:00:29] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-05-31 15:00:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:34] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:35] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:36] [INFO ] Deduced a trap composed of 29 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 15:00:36] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:37] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:37] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:37] [INFO ] Deduced a trap composed of 13 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 15:00:37] [INFO ] Deduced a trap composed of 14 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 15:00:37] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/383 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:41] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:41] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:41] [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 15:00:42] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:42] [INFO ] Deduced a trap composed of 16 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 15:00:42] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:42] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:42] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:42] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:43] [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 15:00:43] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:43] [INFO ] Deduced a trap composed of 19 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 15:00:43] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:43] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:44] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:44] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:44] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:50] [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 15:00:50] [INFO ] Deduced a trap composed of 13 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 15:00:50] [INFO ] Deduced a trap composed of 11 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 15:00:51] [INFO ] Deduced a trap composed of 32 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 15:00:51] [INFO ] Deduced a trap composed of 9 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 15:00:52] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:52] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 20 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:53] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:53] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:54] [INFO ] Deduced a trap composed of 21 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 15:00:54] [INFO ] Deduced a trap composed of 20 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 15:00:54] [INFO ] Deduced a trap composed of 22 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 15:00:54] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:54] [INFO ] Deduced a trap composed of 21 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 15:00:54] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:54] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 9/416 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:00:58] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 417 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 43/104 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:01:01] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:01:01] [INFO ] Deduced a trap composed of 14 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 15:01:01] [INFO ] Deduced a trap composed of 18 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 15:01:02] [INFO ] Deduced a trap composed of 15 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 15:01:02] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:01:04] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 254/567 variables, 313/423 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 253/676 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:01:22] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:01:23] [INFO ] Deduced a trap composed of 12 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 15:01:23] [INFO ] Deduced a trap composed of 23 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 15:01:23] [INFO ] Deduced a trap composed of 18 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 15:01:24] [INFO ] Deduced a trap composed of 20 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 15:01:24] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:01:24] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 683 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Finished structural reductions in LTL mode , in 1 iterations and 60941 ms. Remains : 313/313 places, 254/254 transitions.
Built C files in :
/tmp/ltsmin10967747665196077456
[2025-05-31 15:01:29] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10967747665196077456
Running compilation step : cd /tmp/ltsmin10967747665196077456;'/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 678 ms.
Running link step : cd /tmp/ltsmin10967747665196077456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10967747665196077456;'/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/stateBased383002344102540431.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 15:01:44] [INFO ] Flatten gal took : 14 ms
[2025-05-31 15:01:44] [INFO ] Flatten gal took : 11 ms
[2025-05-31 15:01:44] [INFO ] Time to serialize gal into /tmp/LTL17908542085077759103.gal : 3 ms
[2025-05-31 15:01:44] [INFO ] Time to serialize properties into /tmp/LTL7371517550432542889.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/LTL17908542085077759103.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8633156773351413484.hoa' '-atoms' '/tmp/LTL7371517550432542889.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/LTL7371517550432542889.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8633156773351413484.hoa
Detected timeout of ITS tools.
[2025-05-31 15:01:59] [INFO ] Flatten gal took : 14 ms
[2025-05-31 15:01:59] [INFO ] Flatten gal took : 29 ms
[2025-05-31 15:01:59] [INFO ] Time to serialize gal into /tmp/LTL4041143973636368359.gal : 12 ms
[2025-05-31 15:01:59] [INFO ] Time to serialize properties into /tmp/LTL5488802281540616428.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/LTL4041143973636368359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5488802281540616428.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 : !(((((G("((p41==1)&&(p352==1))"))U(X("((p336==1)&&(p338==1))")))||(G("((p282==0)||(p309==0))")))||(F("((p312==1)&&(p314==1))"))))
Formula 0 simplified : (F!"((p41==1)&&(p352==1))" R X!"((p336==1)&&(p338==1))") & F!"((p282==0)||(p309==0))" & G!"((p312==1)&&(p314==1))"
Detected timeout of ITS tools.
[2025-05-31 15:02:14] [INFO ] Flatten gal took : 12 ms
[2025-05-31 15:02:14] [INFO ] Applying decomposition
[2025-05-31 15:02:14] [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/graph13454183844788284308.txt' '-o' '/tmp/graph13454183844788284308.bin' '-w' '/tmp/graph13454183844788284308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13454183844788284308.bin' '-l' '-1' '-v' '-w' '/tmp/graph13454183844788284308.weights' '-q' '0' '-e' '0.001'
[2025-05-31 15:02:14] [INFO ] Decomposing Gal with order
[2025-05-31 15:02:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 15:02:14] [INFO ] Removed a total of 12 redundant transitions.
[2025-05-31 15:02:14] [INFO ] Flatten gal took : 40 ms
[2025-05-31 15:02:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 14 ms.
[2025-05-31 15:02:14] [INFO ] Time to serialize gal into /tmp/LTL13392094097911944129.gal : 5 ms
[2025-05-31 15:02:14] [INFO ] Time to serialize properties into /tmp/LTL12719044133877077746.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/LTL13392094097911944129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12719044133877077746.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 : !(((((G("((i11.u75.p41==1)&&(i11.u75.p352==1))"))U(X("((i10.u64.p336==1)&&(i10.u70.p338==1))")))||(G("((i6.i1.i0.u54.p282==0)||(i6.i1....234
Formula 0 simplified : (F!"((i11.u75.p41==1)&&(i11.u75.p352==1))" R X!"((i10.u64.p336==1)&&(i10.u70.p338==1))") & F!"((i6.i1.i0.u54.p282==0)||(i6.i1.i0.u54...221
Detected timeout of ITS tools.
Treatment of property DES-PT-20b-LTLFireability-13 finished in 318262 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((G(F(p0)) U p1)))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 269/269 transitions.
Graph (complete) has 672 edges and 324 vertex of which 319 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 318 transition count 253
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 306 transition count 253
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 306 transition count 241
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 294 transition count 241
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 289 transition count 236
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 289 transition count 236
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 284 transition count 231
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 284 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 284 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 73 place count 284 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 282 transition count 225
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 229 place count 206 transition count 149
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 3 with 4 rules applied. Total rules applied 233 place count 204 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 235 place count 202 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 236 place count 201 transition count 149
Applied a total of 236 rules in 59 ms. Remains 201 /324 variables (removed 123) and now considering 149/269 (removed 120) transitions.
// Phase 1: matrix 149 rows 201 cols
[2025-05-31 15:02:29] [INFO ] Computed 58 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:02:30] [INFO ] Implicit Places using invariants in 730 ms returned []
[2025-05-31 15:02:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:02:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-31 15:02:31] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 15:02:31] [INFO ] Redundant transitions in 0 ms returned []
Running 146 sub problems to find dead transitions.
[2025-05-31 15:02:31] [INFO ] Invariant cache hit.
[2025-05-31 15:02:31] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 1/199 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/200 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 146 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 149/349 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:02:37] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:02:38] [INFO ] Deduced a trap composed of 13 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 15:02:38] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (OVERLAPS) 1/350 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:02:43] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:02:43] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:02:43] [INFO ] Deduced a trap composed of 4 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 15:02:43] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:02:44] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:02:44] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:02:45] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 11 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/350 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 16 (OVERLAPS) 0/350 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 275 constraints, problems are : Problem set: 0 solved, 146 unsolved in 18872 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 201/201 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/199 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 1/200 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 149/349 variables, 200/268 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 6/274 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 146/420 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:02:59] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/350 variables, and 421 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/201 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48902ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 48904ms
Starting structural reductions in SI_LTL mode, iteration 1 : 201/324 places, 149/269 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50092 ms. Remains : 201/324 places, 149/269 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-20b-LTLFireability-14
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-14 finished in 50269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((X(p1)||p0)))||F(p2))))'
Found a Lengthening insensitive property : DES-PT-20b-LTLFireability-06
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 5 out of 324 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 324/324 places, 269/269 transitions.
Graph (complete) has 672 edges and 324 vertex of which 319 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 318 transition count 251
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 304 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 303 transition count 250
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 31 place count 303 transition count 241
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 49 place count 294 transition count 241
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 54 place count 289 transition count 236
Iterating global reduction 3 with 5 rules applied. Total rules applied 59 place count 289 transition count 236
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 64 place count 284 transition count 231
Iterating global reduction 3 with 5 rules applied. Total rules applied 69 place count 284 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 74 place count 284 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 283 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 75 place count 283 transition count 225
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 77 place count 282 transition count 225
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 5 with 150 rules applied. Total rules applied 227 place count 207 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 231 place count 205 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 203 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 202 transition count 150
Applied a total of 234 rules in 61 ms. Remains 202 /324 variables (removed 122) and now considering 150/269 (removed 119) transitions.
// Phase 1: matrix 150 rows 202 cols
[2025-05-31 15:03:20] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:03:20] [INFO ] Implicit Places using invariants in 467 ms returned []
[2025-05-31 15:03:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:03:21] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-05-31 15:03:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 2/202 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 150/352 variables, 202/260 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:03:27] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:03:27] [INFO ] Deduced a trap composed of 13 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 15:03:27] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:03:28] [INFO ] Deduced a trap composed of 12 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 15:03:29] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:03:30] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:03:31] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:03:33] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 14 (OVERLAPS) 0/352 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 268 constraints, problems are : Problem set: 0 solved, 147 unsolved in 17916 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 2/202 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 150/352 variables, 202/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 147/415 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:03:53] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 416 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47957ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 47958ms
Starting structural reductions in LI_LTL mode, iteration 1 : 202/324 places, 150/269 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 48834 ms. Remains : 202/324 places, 150/269 transitions.
Running random walk in product with property : DES-PT-20b-LTLFireability-06
Product exploration explored 100000 steps with 24995 reset in 262 ms.
Product exploration explored 100000 steps with 25043 reset in 299 ms.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Detected a total of 97/202 stabilizing places and 92/150 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 124 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (2049 resets) in 291 ms. (136 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (362 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (366 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (359 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (362 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
[2025-05-31 15:04:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 76/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/127 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 38/165 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/174 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 147/321 variables, 174/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 31/352 variables, 28/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/352 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/352 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 260 constraints, problems are : Problem set: 0 solved, 4 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 76/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/127 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 38/165 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/174 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 147/321 variables, 174/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 31/352 variables, 28/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/352 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/352 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/352 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 264 constraints, problems are : Problem set: 0 solved, 4 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1017ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 668 ms.
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 202 /202 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 202/202 places, 150/150 transitions.
RANDOM walk for 40000 steps (1950 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (371 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (362 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (371 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (367 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 635455 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 4
Probabilistic random walk after 635455 steps, saw 89237 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
[2025-05-31 15:04:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 76/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/127 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 38/165 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/174 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 147/321 variables, 174/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 31/352 variables, 28/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/352 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/352 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 260 constraints, problems are : Problem set: 0 solved, 4 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 76/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/127 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 38/165 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/174 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 147/321 variables, 174/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 31/352 variables, 28/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/352 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/352 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/352 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 264 constraints, problems are : Problem set: 0 solved, 4 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1020ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 681 ms.
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 202 /202 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 202/202 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 150/150 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2025-05-31 15:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:04:17] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-05-31 15:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:04:17] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 15:04:17] [INFO ] Redundant transitions in 0 ms returned []
Running 147 sub problems to find dead transitions.
[2025-05-31 15:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 2/202 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 150/352 variables, 202/260 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:04:23] [INFO ] Deduced a trap composed of 4 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 15:04:24] [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 15:04:24] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:04:25] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:04:25] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:04:26] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:04:28] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:04:29] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 14 (OVERLAPS) 0/352 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 268 constraints, problems are : Problem set: 0 solved, 147 unsolved in 18022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 2/202 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 150/352 variables, 202/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 147/415 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:04:50] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 416 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48055ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 48056ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48677 ms. Remains : 202/202 places, 150/150 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 8 ms. Remains 202 /202 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Running SMT prover for 4 properties.
[2025-05-31 15:05:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 15:05:05] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 15:05:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2025-05-31 15:05:06] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2025-05-31 15:05:06] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-05-31 15:05:06] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-31 15:05:06] [INFO ] After 446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 547 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 6 factoid took 166 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 150/150 transitions.
Applied a total of 0 rules in 2 ms. Remains 202 /202 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2025-05-31 15:05:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:05:07] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-05-31 15:05:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:05:07] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-05-31 15:05:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 2/202 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 150/352 variables, 202/260 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:05:13] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:05:14] [INFO ] Deduced a trap composed of 13 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 15:05:14] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:05:15] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:05:15] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 23 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:05:16] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:05:17] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:05:19] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 14 (OVERLAPS) 0/352 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 268 constraints, problems are : Problem set: 0 solved, 147 unsolved in 18056 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 2/202 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 150/352 variables, 202/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 147/415 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:05:40] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 416 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48090ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 48090ms
Finished structural reductions in LTL mode , in 1 iterations and 48725 ms. Remains : 202/202 places, 150/150 transitions.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Detected a total of 97/202 stabilizing places and 92/150 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 172 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (1977 resets) in 254 ms. (156 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (345 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (367 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (368 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (359 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
[2025-05-31 15:05:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 76/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/127 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 38/165 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/174 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 147/321 variables, 174/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 31/352 variables, 28/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/352 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/352 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 260 constraints, problems are : Problem set: 0 solved, 4 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 76/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/127 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 38/165 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/174 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 147/321 variables, 174/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 31/352 variables, 28/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/352 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/352 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/352 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 264 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1567ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1191 ms.
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 150/150 transitions.
Applied a total of 0 rules in 4 ms. Remains 202 /202 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 202/202 places, 150/150 transitions.
RANDOM walk for 40000 steps (2037 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (367 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (359 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (380 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (358 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 601293 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 4
Probabilistic random walk after 601293 steps, saw 84989 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2025-05-31 15:06:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 76/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/127 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 38/165 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/174 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 147/321 variables, 174/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 31/352 variables, 28/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/352 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/352 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 260 constraints, problems are : Problem set: 0 solved, 4 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 76/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/127 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 38/165 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/174 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 147/321 variables, 174/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 31/352 variables, 28/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/352 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/352 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/352 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 264 constraints, problems are : Problem set: 0 solved, 4 unsolved in 892 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1315ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1235 ms.
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 150/150 transitions.
Applied a total of 0 rules in 7 ms. Remains 202 /202 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 202/202 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 150/150 transitions.
Applied a total of 0 rules in 4 ms. Remains 202 /202 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2025-05-31 15:06:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:06:05] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-05-31 15:06:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:06:05] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 15:06:05] [INFO ] Redundant transitions in 0 ms returned []
Running 147 sub problems to find dead transitions.
[2025-05-31 15:06:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 2/202 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 150/352 variables, 202/260 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:06:13] [INFO ] Deduced a trap composed of 4 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 15:06:14] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:06:15] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:06:16] [INFO ] Deduced a trap composed of 12 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 15:06:16] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:06:18] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:06:20] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:06:23] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 14 (OVERLAPS) 0/352 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 268 constraints, problems are : Problem set: 0 solved, 147 unsolved in 26559 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 2/202 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 150/352 variables, 202/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 147/415 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:06:50] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 416 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56606ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 56607ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57389 ms. Remains : 202/202 places, 150/150 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 4 ms. Remains 202 /202 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Running SMT prover for 4 properties.
[2025-05-31 15:07:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 15:07:02] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 15:07:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2025-05-31 15:07:02] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2025-05-31 15:07:02] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-05-31 15:07:02] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-31 15:07:02] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 570 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 25106 reset in 368 ms.
Product exploration explored 100000 steps with 24968 reset in 485 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 150/150 transitions.
Applied a total of 0 rules in 4 ms. Remains 202 /202 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 15:07:05] [INFO ] Redundant transitions in 0 ms returned []
Running 147 sub problems to find dead transitions.
[2025-05-31 15:07:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 2/202 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 150/352 variables, 202/260 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:07:12] [INFO ] Deduced a trap composed of 4 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 15:07:13] [INFO ] Deduced a trap composed of 13 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 15:07:13] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:07:14] [INFO ] Deduced a trap composed of 12 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 15:07:14] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:07:16] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:07:18] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 13 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:07:21] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 14 (OVERLAPS) 0/352 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 268 constraints, problems are : Problem set: 0 solved, 147 unsolved in 25603 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 2/202 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 150/352 variables, 202/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 147/415 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:07:49] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 416 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55647ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 55649ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55660 ms. Remains : 202/202 places, 150/150 transitions.
Built C files in :
/tmp/ltsmin2377804556177765618
[2025-05-31 15:08:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2377804556177765618
Running compilation step : cd /tmp/ltsmin2377804556177765618;'/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 709 ms.
Running link step : cd /tmp/ltsmin2377804556177765618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2377804556177765618;'/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/stateBased17391420235347013686.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 150/150 transitions.
Applied a total of 0 rules in 2 ms. Remains 202 /202 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2025-05-31 15:08:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:08:16] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-31 15:08:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:08:16] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-05-31 15: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/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 2/202 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 150/352 variables, 202/260 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:08:22] [INFO ] Deduced a trap composed of 4 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 15:08:23] [INFO ] Deduced a trap composed of 13 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 15:08:23] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:08:25] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:08:25] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:08:27] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:08:29] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:08:31] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 14 (OVERLAPS) 0/352 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 268 constraints, problems are : Problem set: 0 solved, 147 unsolved in 23477 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 2/202 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 150/352 variables, 202/268 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 147/415 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:08:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 416 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53524ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 53525ms
Finished structural reductions in LTL mode , in 1 iterations and 54139 ms. Remains : 202/202 places, 150/150 transitions.
Built C files in :
/tmp/ltsmin2449334130116143135
[2025-05-31 15:09:10] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2449334130116143135
Running compilation step : cd /tmp/ltsmin2449334130116143135;'/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 597 ms.
Running link step : cd /tmp/ltsmin2449334130116143135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2449334130116143135;'/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/stateBased1432091290823316390.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 15:09:25] [INFO ] Flatten gal took : 8 ms
[2025-05-31 15:09:25] [INFO ] Flatten gal took : 8 ms
[2025-05-31 15:09:25] [INFO ] Time to serialize gal into /tmp/LTL7221769855318252323.gal : 2 ms
[2025-05-31 15:09:25] [INFO ] Time to serialize properties into /tmp/LTL668075146811928626.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/LTL7221769855318252323.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7120573290677964417.hoa' '-atoms' '/tmp/LTL668075146811928626.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...316
Loading property file /tmp/LTL668075146811928626.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7120573290677964417.hoa
Detected timeout of ITS tools.
[2025-05-31 15:09:40] [INFO ] Flatten gal took : 12 ms
[2025-05-31 15:09:40] [INFO ] Flatten gal took : 11 ms
[2025-05-31 15:09:40] [INFO ] Time to serialize gal into /tmp/LTL4833501863433195493.gal : 4 ms
[2025-05-31 15:09:40] [INFO ] Time to serialize properties into /tmp/LTL17468599312516514187.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/LTL4833501863433195493.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17468599312516514187.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 : !((G((X(X(("((p49==0)||(p204==0))")||(X("(((p49==0)||(p204==0))||(p177==0))")))))||(F("((p201==1)&&(p203==1))")))))
Formula 0 simplified : F(XX(!"((p49==0)||(p204==0))" & X!"(((p49==0)||(p204==0))||(p177==0))") & G!"((p201==1)&&(p203==1))")
Detected timeout of ITS tools.
[2025-05-31 15:09:55] [INFO ] Flatten gal took : 8 ms
[2025-05-31 15:09:55] [INFO ] Applying decomposition
[2025-05-31 15:09:55] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph757518890844239772.txt' '-o' '/tmp/graph757518890844239772.bin' '-w' '/tmp/graph757518890844239772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph757518890844239772.bin' '-l' '-1' '-v' '-w' '/tmp/graph757518890844239772.weights' '-q' '0' '-e' '0.001'
[2025-05-31 15:09:55] [INFO ] Decomposing Gal with order
[2025-05-31 15:09:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 15:09:55] [INFO ] Removed a total of 57 redundant transitions.
[2025-05-31 15:09:55] [INFO ] Flatten gal took : 25 ms
[2025-05-31 15:09:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 6 ms.
[2025-05-31 15:09:55] [INFO ] Time to serialize gal into /tmp/LTL5953460607205348071.gal : 4 ms
[2025-05-31 15:09:55] [INFO ] Time to serialize properties into /tmp/LTL12009678657937710961.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/LTL5953460607205348071.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12009678657937710961.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 : !((G((X(X(("((u8.p49==0)||(u8.p204==0))")||(X("(((u8.p49==0)||(u8.p204==0))||(i1.u6.p177==0))")))))||(F("((i1.u7.p201==1)&&(i1.u7.p203...166
Formula 0 simplified : F(XX(!"((u8.p49==0)||(u8.p204==0))" & X!"(((u8.p49==0)||(u8.p204==0))||(i1.u6.p177==0))") & G!"((i1.u7.p201==1)&&(i1.u7.p203==1))")
Detected timeout of ITS tools.
Treatment of property DES-PT-20b-LTLFireability-06 finished in 410422 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(p0) U (F(((p1&&X(F(p1)))||G(F(p1)))) U p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))||G(p2)||F(p3)))'
[2025-05-31 15:10:10] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2611873407335592164
[2025-05-31 15:10:10] [INFO ] Computing symmetric may disable matrix : 269 transitions.
[2025-05-31 15:10:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 15:10:10] [INFO ] Applying decomposition
[2025-05-31 15:10:10] [INFO ] Computing symmetric may enable matrix : 269 transitions.
[2025-05-31 15:10:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 15:10:10] [INFO ] Flatten gal took : 9 ms
[2025-05-31 15:10:10] [INFO ] Computing Do-Not-Accords matrix : 269 transitions.
[2025-05-31 15:10:10] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 15:10:10] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2611873407335592164
Running compilation step : cd /tmp/ltsmin2611873407335592164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' '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'
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/graph1146542651652844868.txt' '-o' '/tmp/graph1146542651652844868.bin' '-w' '/tmp/graph1146542651652844868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1146542651652844868.bin' '-l' '-1' '-v' '-w' '/tmp/graph1146542651652844868.weights' '-q' '0' '-e' '0.001'
[2025-05-31 15:10:10] [INFO ] Decomposing Gal with order
[2025-05-31 15:10:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 15:10:10] [INFO ] Removed a total of 18 redundant transitions.
[2025-05-31 15:10:10] [INFO ] Flatten gal took : 23 ms
[2025-05-31 15:10:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2025-05-31 15:10:11] [INFO ] Time to serialize gal into /tmp/LTLFireability7533201053645760864.gal : 5 ms
[2025-05-31 15:10:11] [INFO ] Time to serialize properties into /tmp/LTLFireability9451910511468275439.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/LTLFireability7533201053645760864.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9451910511468275439.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 3 LTL properties
Checking formula 0 : !((G((X(X(("((u35.p49==0)||(u35.p204==0))")||(X("(((u35.p49==0)||(u35.p204==0))||(i5.u29.p177==0))")))))||(F("((i7.u34.p201==1)&&(i7.u...173
Formula 0 simplified : F(XX(!"((u35.p49==0)||(u35.p204==0))" & X!"(((u35.p49==0)||(u35.p204==0))||(i5.u29.p177==0))") & G!"((i7.u34.p201==1)&&(i7.u34.p203=...161
Compilation finished in 992 ms.
Running link step : cd /tmp/ltsmin2611873407335592164;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2611873407335592164;'/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((LTLAPp1==true))||(LTLAPp0==true))))||<>((LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t57, t124, t198, t228, t229, t262, u35.t80, u36.t77, u77.t17, u77.t159, i0.i0.u16.t112, i...1055
Computing Next relation with stutter on 1.22791e+08 deadlock states
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2611873407335592164;'/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((LTLAPp1==true))||(LTLAPp0==true))))||<>((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2611873407335592164;'/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(([]((LTLAPp3==true)) U (<>((((LTLAPp4==true)&&X(<>((LTLAPp4==true))))||[](<>((LTLAPp4==true))))) U (LTLAPp5==true))))' '--buchi-type=spotba'
LTSmin run took 235 ms.
FORMULA DES-PT-20b-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2611873407335592164;'/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' '(([]((LTLAPp6==true)) U X((LTLAPp7==true)))||[]((LTLAPp8==true))||<>((LTLAPp9==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2611873407335592164;'/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' '(([]((LTLAPp6==true)) U X((LTLAPp7==true)))||[]((LTLAPp8==true))||<>((LTLAPp9==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin2611873407335592164;'/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((LTLAPp1==true))||(LTLAPp0==true))))||<>((LTLAPp2==true))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-20b"
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-20b, 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-174854063900308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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