About the Execution of ITS-Tools for EisenbergMcGuire-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 365131.00 | 0.00 | 0.00 | FFFFFFFFFFFFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860068100756.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 EisenbergMcGuire-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860068100756
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 121K 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 EisenbergMcGuire-PT-03-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748834817987
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 03:26:59] [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-06-02 03:26:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:26:59] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2025-06-02 03:26:59] [INFO ] Transformed 117 places.
[2025-06-02 03:26:59] [INFO ] Transformed 216 transitions.
[2025-06-02 03:26:59] [INFO ] Found NUPN structural information;
[2025-06-02 03:26:59] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 210
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 210
Applied a total of 4 rules in 21 ms. Remains 115 /117 variables (removed 2) and now considering 210/216 (removed 6) transitions.
[2025-06-02 03:26:59] [INFO ] Flow matrix only has 147 transitions (discarded 63 similar events)
// Phase 1: matrix 147 rows 115 cols
[2025-06-02 03:26:59] [INFO ] Computed 10 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:26:59] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-06-02 03:26:59] [INFO ] Flow matrix only has 147 transitions (discarded 63 similar events)
[2025-06-02 03:26:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:26:59] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-02 03:26:59] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2025-06-02 03:26:59] [INFO ] Flow matrix only has 147 transitions (discarded 63 similar events)
[2025-06-02 03:26:59] [INFO ] Invariant cache hit.
[2025-06-02 03:26:59] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:00] [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-06-02 03:27:00] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:00] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:01] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:01] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:01] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:01] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:01] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:01] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:01] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:01] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:02] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:02] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:02] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:02] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:02] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:02] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:02] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:03] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:03] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:03] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:03] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:03] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:03] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 147/262 variables, 115/150 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 52/202 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:07] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:07] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:07] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 0/262 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 205 constraints, problems are : Problem set: 0 solved, 207 unsolved in 14072 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:14] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:14] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 147/262 variables, 115/155 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 52/207 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 207/414 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:17] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (OVERLAPS) 0/262 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 415 constraints, problems are : Problem set: 0 solved, 207 unsolved in 15074 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29223ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 29237ms
Starting structural reductions in LTL mode, iteration 1 : 115/117 places, 210/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29706 ms. Remains : 115/117 places, 210/216 transitions.
Support contains 33 out of 115 places after structural reductions.
[2025-06-02 03:27:29] [INFO ] Flatten gal took : 41 ms
[2025-06-02 03:27:29] [INFO ] Flatten gal took : 17 ms
[2025-06-02 03:27:29] [INFO ] Input system was already deterministic with 210 transitions.
Support contains 32 out of 115 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1110 ms. (36 steps per ms) remains 8/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
[2025-06-02 03:27:30] [INFO ] Flow matrix only has 147 transitions (discarded 63 similar events)
[2025-06-02 03:27:30] [INFO ] Invariant cache hit.
[2025-06-02 03:27:30] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 87/100 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 10/110 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:30] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 5/115 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:30] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:30] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:30] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:30] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:30] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:30] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:30] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:30] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:30] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 147/262 variables, 115/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 52/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/262 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 191 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1415 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 87/100 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 10/110 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/115 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 147/262 variables, 115/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 52/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 7/198 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/262 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/262 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 199 constraints, problems are : Problem set: 0 solved, 7 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2065ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 4 properties in 589 ms.
Support contains 8 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 210/210 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 113 transition count 208
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 4 place count 113 transition count 178
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 64 place count 83 transition count 178
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 79 transition count 166
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 79 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 73 transition count 160
Applied a total of 84 rules in 27 ms. Remains 73 /115 variables (removed 42) and now considering 160/210 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 73/115 places, 160/210 transitions.
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 4650 steps, run visited all 3 properties in 32 ms. (steps per millisecond=145 )
Probabilistic random walk after 4650 steps, saw 1463 distinct states, run finished after 35 ms. (steps per millisecond=132 ) properties seen :3
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&X(F((p1&&F(p2))))))))))'
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 210/210 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 112 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 112 transition count 201
Applied a total of 6 rules in 6 ms. Remains 112 /115 variables (removed 3) and now considering 201/210 (removed 9) transitions.
[2025-06-02 03:27:33] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2025-06-02 03:27:33] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:27:33] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-02 03:27:33] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2025-06-02 03:27:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:27:33] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-02 03:27:33] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-02 03:27:33] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2025-06-02 03:27:33] [INFO ] Invariant cache hit.
[2025-06-02 03:27:33] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:34] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:34] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:34] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:34] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:34] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:34] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:34] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:34] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:34] [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-06-02 03:27:34] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:35] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:35] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:35] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:35] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:35] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:35] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:35] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:35] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:35] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:35] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:36] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:36] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:37] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 138/250 variables, 112/146 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 46/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 192 constraints, problems are : Problem set: 0 solved, 198 unsolved in 11561 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 138/250 variables, 112/146 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 46/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 198/390 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:47] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:49] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:51] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 0/250 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 393 constraints, problems are : Problem set: 0 solved, 198 unsolved in 16170 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27773ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 27776ms
Starting structural reductions in LTL mode, iteration 1 : 112/115 places, 201/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28020 ms. Remains : 112/115 places, 201/210 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-00
Product exploration explored 100000 steps with 579 reset in 265 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-00 finished in 28690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&((G(p1) U p0) U X(((p0 U p2) U p3)))))))'
Support contains 10 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 210/210 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 111 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 198
Applied a total of 8 rules in 9 ms. Remains 111 /115 variables (removed 4) and now considering 198/210 (removed 12) transitions.
[2025-06-02 03:28:02] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2025-06-02 03:28:02] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:02] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-02 03:28:02] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:28:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:02] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:28:02] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-02 03:28:02] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:28:02] [INFO ] Invariant cache hit.
[2025-06-02 03:28:02] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:02] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:02] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:02] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:02] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:03] [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-06-02 03:28:03] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:03] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:03] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:03] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:03] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:03] [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-06-02 03:28:03] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:03] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:03] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:03] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:03] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:04] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:04] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:04] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:04] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:05] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/143 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/187 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:08] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:08] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:08] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:08] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:08] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:09] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 193 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13172 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 135/246 variables, 111/149 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 44/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 195/388 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:17] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:17] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:17] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:18] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:18] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 393 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13214 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26409ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 26410ms
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 198/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26629 ms. Remains : 111/115 places, 198/210 transitions.
Stuttering acceptance computed with spot in 475 ms :[p0, true, (AND p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (NOT p3), (NOT p1), (AND p1 (NOT p0) (NOT p3) (NOT p2)), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-01
Entered a terminal (fully accepting) state of product in 280 steps with 7 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-01 finished in 27139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1) U (p2 U !p0))))'
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 210/210 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 113 transition count 204
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 113 transition count 204
Applied a total of 4 rules in 6 ms. Remains 113 /115 variables (removed 2) and now considering 204/210 (removed 6) transitions.
[2025-06-02 03:28:29] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
// Phase 1: matrix 141 rows 113 cols
[2025-06-02 03:28:29] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:29] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 03:28:29] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2025-06-02 03:28:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:29] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 03:28:29] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-02 03:28:29] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2025-06-02 03:28:29] [INFO ] Invariant cache hit.
[2025-06-02 03:28:29] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:29] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:30] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:30] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:30] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:30] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:30] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:30] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:30] [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-06-02 03:28:30] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:30] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:30] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:31] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:31] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:31] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:31] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:31] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:32] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:33] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 141/254 variables, 113/142 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 48/190 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:39] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:39] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 7 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/254 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (OVERLAPS) 0/254 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 192 constraints, problems are : Problem set: 0 solved, 201 unsolved in 15851 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 141/254 variables, 113/144 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 48/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 201/393 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:47] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:47] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:48] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:48] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:48] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:48] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:49] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 7/400 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/254 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 400 constraints, problems are : Problem set: 0 solved, 201 unsolved in 12714 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28595ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 28597ms
Starting structural reductions in LTL mode, iteration 1 : 113/115 places, 204/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28825 ms. Remains : 113/115 places, 204/210 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, p0, p0, (OR (NOT p1) p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-03
Entered a terminal (fully accepting) state of product in 11 steps with 3 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-03 finished in 28955 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(((F(G(!p0)) U G(!p1)) U X(p2))))))'
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 210/210 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 112 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 112 transition count 201
Applied a total of 6 rules in 9 ms. Remains 112 /115 variables (removed 3) and now considering 201/210 (removed 9) transitions.
[2025-06-02 03:28:58] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2025-06-02 03:28:58] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 03:28:58] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2025-06-02 03:28:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:58] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-02 03:28:58] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-02 03:28:58] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2025-06-02 03:28:58] [INFO ] Invariant cache hit.
[2025-06-02 03:28:58] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:58] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:58] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:59] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:59] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:59] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:59] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:59] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:59] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:59] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:59] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:59] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:59] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:59] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:00] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:00] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:00] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:00] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:00] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:00] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:00] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:00] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:01] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/146 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:03] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:04] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/250 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 194 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12731 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:11] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:11] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:11] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:11] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:11] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/153 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 198/397 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:15] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:16] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:17] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 0/250 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 16372 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29125ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 29126ms
Starting structural reductions in LTL mode, iteration 1 : 112/115 places, 201/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29355 ms. Remains : 112/115 places, 201/210 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) p0), p0, p1]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-04
Product exploration explored 100000 steps with 20022 reset in 120 ms.
Product exploration explored 100000 steps with 19978 reset in 143 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) p0), p0, p1]
RANDOM walk for 40000 steps (8 resets) in 488 ms. (81 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
[2025-06-02 03:29:28] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2025-06-02 03:29:28] [INFO ] Invariant cache hit.
[2025-06-02 03:29:28] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/98 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:28] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:28] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem apf3 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 11/109 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 138/247 variables, 109/121 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 46/167 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/250 variables, 3/170 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 1/171 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/250 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 171 constraints, problems are : Problem set: 1 solved, 3 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/98 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/109 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:28] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 138/247 variables, 109/122 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 46/168 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:29] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/250 variables, 3/173 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 1/174 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 2/176 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/250 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 176 constraints, problems are : Problem set: 1 solved, 3 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 681ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 19 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 201/201 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 109 transition count 198
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 109 transition count 168
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 79 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 78 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 78 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 80 place count 72 transition count 159
Applied a total of 80 rules in 17 ms. Remains 72 /112 variables (removed 40) and now considering 159/201 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 72/112 places, 159/201 transitions.
RANDOM walk for 40000 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2742 steps, run visited all 1 properties in 12 ms. (steps per millisecond=228 )
Probabilistic random walk after 2742 steps, saw 964 distinct states, run finished after 12 ms. (steps per millisecond=228 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (X (NOT p1))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p0), p0, p1]
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p0), p0, p1]
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2025-06-02 03:29:30] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2025-06-02 03:29:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:29:30] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 03:29:30] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2025-06-02 03:29:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:29:30] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-02 03:29:30] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-02 03:29:30] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2025-06-02 03:29:30] [INFO ] Invariant cache hit.
[2025-06-02 03:29:30] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:30] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:30] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:31] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:31] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:31] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:31] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:31] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:31] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:31] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:31] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:31] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:31] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:31] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:32] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:32] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:32] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:32] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:32] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:32] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:32] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:32] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:32] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:33] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/146 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:35] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:36] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/250 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 194 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12943 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:43] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:43] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:44] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:44] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:44] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/153 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 198/397 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:47] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:48] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:49] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 0/250 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 16088 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29057ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 29059ms
Finished structural reductions in LTL mode , in 1 iterations and 29274 ms. Remains : 112/112 places, 201/201 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p0), p0, p1]
RANDOM walk for 40000 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
[2025-06-02 03:29:59] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2025-06-02 03:29:59] [INFO ] Invariant cache hit.
[2025-06-02 03:29:59] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/98 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:59] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/109 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:00] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:00] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 138/247 variables, 109/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 46/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/250 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/250 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/98 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/109 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 138/247 variables, 109/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 46/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:00] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/250 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:00] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/250 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/250 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 177 constraints, problems are : Problem set: 0 solved, 2 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 678ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 21 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 201/201 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 109 transition count 198
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 109 transition count 168
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 79 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 78 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 78 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 80 place count 72 transition count 159
Applied a total of 80 rules in 14 ms. Remains 72 /112 variables (removed 40) and now considering 159/201 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 72/112 places, 159/201 transitions.
RANDOM walk for 40000 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2742 steps, run visited all 1 properties in 8 ms. (steps per millisecond=342 )
Probabilistic random walk after 2742 steps, saw 964 distinct states, run finished after 8 ms. (steps per millisecond=342 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p0), p0, p1]
Stuttering acceptance computed with spot in 291 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p0), p0, p1]
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p0), p0, p1]
Product exploration explored 100000 steps with 20029 reset in 98 ms.
Product exploration explored 100000 steps with 19981 reset in 107 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p0), p0, p1]
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 201
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 3 place count 112 transition count 231
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 29 place count 112 transition count 231
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 112 transition count 231
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 109 transition count 228
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 109 transition count 228
Deduced a syphon composed of 35 places in 0 ms
Applied a total of 44 rules in 14 ms. Remains 109 /112 variables (removed 3) and now considering 228/201 (removed -27) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:30:02] [INFO ] Redundant transitions in 8 ms returned []
Running 225 sub problems to find dead transitions.
[2025-06-02 03:30:02] [INFO ] Flow matrix only has 150 transitions (discarded 78 similar events)
// Phase 1: matrix 150 rows 109 cols
[2025-06-02 03:30:02] [INFO ] Computed 10 invariants in 1 ms
[2025-06-02 03:30:02] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 7 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:03] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 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 TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:04] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:04] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:04] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 4 ms to minimize.
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 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 TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 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 TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 20/30 constraints. Problems are: Problem set: 65 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:04] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:04] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 2/32 constraints. Problems are: Problem set: 65 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:05] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:05] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:05] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/35 constraints. Problems are: Problem set: 65 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:06] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/36 constraints. Problems are: Problem set: 65 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:06] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 1/37 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/37 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 150/259 variables, 109/146 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 68/214 constraints. Problems are: Problem set: 65 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:08] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:09] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/216 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/216 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 12 (OVERLAPS) 0/259 variables, 0/216 constraints. Problems are: Problem set: 65 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 216 constraints, problems are : Problem set: 65 solved, 160 unsolved in 11125 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 65 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 29/30 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/30 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 35/109 variables, 6/36 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/39 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/39 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 150/259 variables, 109/148 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 68/216 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 160/376 constraints. Problems are: Problem set: 65 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:16] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:17] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:17] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 3/379 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/379 constraints. Problems are: Problem set: 65 solved, 160 unsolved
At refinement iteration 11 (OVERLAPS) 0/259 variables, 0/379 constraints. Problems are: Problem set: 65 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 379 constraints, problems are : Problem set: 65 solved, 160 unsolved in 14188 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 160/225 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25346ms problems are : Problem set: 65 solved, 160 unsolved
Search for dead transitions found 65 dead transitions in 25350ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 109/112 places, 163/201 transitions.
Graph (complete) has 460 edges and 109 vertex of which 74 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.4 ms
Discarding 35 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 74 /109 variables (removed 35) and now considering 163/163 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/112 places, 163/201 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25393 ms. Remains : 74/112 places, 163/201 transitions.
Built C files in :
/tmp/ltsmin17186033265385545277
[2025-06-02 03:30:27] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17186033265385545277
Running compilation step : cd /tmp/ltsmin17186033265385545277;'/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 397 ms.
Running link step : cd /tmp/ltsmin17186033265385545277;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin17186033265385545277;'/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/stateBased6561846858605697850.hoa' '--buchi-type=spotba'
LTSmin run took 601 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-04 finished in 90733 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||G(p1))))&&((p2 U X(G(p2)))||X(p0))))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 210/210 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 111 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 198
Applied a total of 8 rules in 4 ms. Remains 111 /115 variables (removed 4) and now considering 198/210 (removed 12) transitions.
[2025-06-02 03:30:28] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2025-06-02 03:30:28] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:30:28] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-02 03:30:28] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:30:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:30:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:30:29] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-02 03:30:29] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:30:29] [INFO ] Invariant cache hit.
[2025-06-02 03:30:29] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:29] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:29] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:29] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:29] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:29] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:29] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:29] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:30] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:30] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:30] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:30] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:30] [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-06-02 03:30:30] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:30] [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-06-02 03:30:30] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:30] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:30] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:31] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:31] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:31] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:31] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/143 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/187 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:35] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:35] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:35] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:35] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:35] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:36] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 193 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 135/246 variables, 111/149 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 44/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 195/388 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:44] [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-06-02 03:30:44] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:44] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:45] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:45] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 393 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13138 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26345ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 26346ms
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 198/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26582 ms. Remains : 111/115 places, 198/210 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-05 finished in 26859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F((X(X(p0))&&F(p1)))) U (X(p1)&&p2)))))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 210/210 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 113 transition count 204
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 113 transition count 204
Applied a total of 4 rules in 7 ms. Remains 113 /115 variables (removed 2) and now considering 204/210 (removed 6) transitions.
[2025-06-02 03:30:55] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
// Phase 1: matrix 141 rows 113 cols
[2025-06-02 03:30:55] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:30:55] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 03:30:55] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2025-06-02 03:30:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:30:55] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 03:30:55] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-02 03:30:55] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2025-06-02 03:30:55] [INFO ] Invariant cache hit.
[2025-06-02 03:30:55] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:56] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:56] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:56] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:56] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:56] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:56] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:56] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:56] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:57] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:57] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:57] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:57] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:57] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:57] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:57] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:57] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:58] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:58] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:58] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:59] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 141/254 variables, 113/144 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 48/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:03] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:04] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 6 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/254 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:06] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:06] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (OVERLAPS) 0/254 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 196 constraints, problems are : Problem set: 0 solved, 201 unsolved in 17202 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 141/254 variables, 113/148 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 48/196 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 201/397 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:15] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:15] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:15] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:19] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:20] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:20] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:21] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 3/404 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 404 constraints, problems are : Problem set: 0 solved, 201 unsolved in 17890 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35107ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 35108ms
Starting structural reductions in LTL mode, iteration 1 : 113/115 places, 204/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35351 ms. Remains : 113/115 places, 204/210 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-07
Product exploration explored 100000 steps with 916 reset in 95 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-07 finished in 35818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 210/210 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 207
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 112 transition count 207
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 6 place count 112 transition count 179
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 62 place count 84 transition count 179
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 80 transition count 167
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 80 transition count 167
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 82 place count 74 transition count 161
Applied a total of 82 rules in 19 ms. Remains 74 /115 variables (removed 41) and now considering 161/210 (removed 49) transitions.
[2025-06-02 03:31:31] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
// Phase 1: matrix 98 rows 74 cols
[2025-06-02 03:31:31] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:31:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 03:31:31] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2025-06-02 03:31:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:31:31] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:31:31] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:31:31] [INFO ] Redundant transitions in 6 ms returned []
Running 158 sub problems to find dead transitions.
[2025-06-02 03:31:31] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2025-06-02 03:31:31] [INFO ] Invariant cache hit.
[2025-06-02 03:31:31] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:32] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:32] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:32] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:32] [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-06-02 03:31:32] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:32] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:32] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:32] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:32] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:33] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 98/172 variables, 74/96 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 44/140 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:34] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 0/172 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 141 constraints, problems are : Problem set: 0 solved, 158 unsolved in 6081 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:38] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:38] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:38] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:38] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:38] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:38] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:39] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:39] [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-06-02 03:31:39] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:39] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:39] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:39] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:40] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:40] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:40] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 98/172 variables, 74/112 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 158/314 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:42] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:44] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:45] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:45] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/172 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:51] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:51] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/172 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 19 (OVERLAPS) 0/172 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 320 constraints, problems are : Problem set: 0 solved, 158 unsolved in 20818 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26924ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 26924ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/115 places, 161/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27122 ms. Remains : 74/115 places, 161/210 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-08
Product exploration explored 100000 steps with 1 reset in 94 ms.
Stack based approach found an accepted trace after 152 steps with 0 reset with depth 153 and stack size 123 in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-08 finished in 27355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 210/210 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 207
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 112 transition count 207
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 112 transition count 178
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 83 transition count 178
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 79 transition count 166
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 79 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 73 transition count 160
Applied a total of 84 rules in 21 ms. Remains 73 /115 variables (removed 42) and now considering 160/210 (removed 50) transitions.
[2025-06-02 03:31:58] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
// Phase 1: matrix 97 rows 73 cols
[2025-06-02 03:31:58] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:31:58] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 03:31:58] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2025-06-02 03:31:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:31:58] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:31:59] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:31:59] [INFO ] Redundant transitions in 1 ms returned []
Running 157 sub problems to find dead transitions.
[2025-06-02 03:31:59] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2025-06-02 03:31:59] [INFO ] Invariant cache hit.
[2025-06-02 03:31:59] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:59] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:59] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:59] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:59] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:59] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:59] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:00] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:00] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:00] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:00] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:00] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:00] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:00] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:00] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:00] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:00] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:01] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:01] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:01] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:01] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 97/170 variables, 73/103 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 44/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:04] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/170 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:06] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/170 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/170 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 149 constraints, problems are : Problem set: 0 solved, 157 unsolved in 10007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/105 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 44/149 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 157/306 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:11] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:12] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 308 constraints, problems are : Problem set: 0 solved, 157 unsolved in 9772 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19795ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 19796ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/115 places, 160/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20009 ms. Remains : 73/115 places, 160/210 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 91 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-10 finished in 20201 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&&X(p1))) U X(p2)))'
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 210/210 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 111 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 198
Applied a total of 8 rules in 2 ms. Remains 111 /115 variables (removed 4) and now considering 198/210 (removed 12) transitions.
[2025-06-02 03:32:19] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2025-06-02 03:32:19] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:32:19] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-02 03:32:19] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:32:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:32:19] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:32:19] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-02 03:32:19] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:32:19] [INFO ] Invariant cache hit.
[2025-06-02 03:32:19] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:19] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:19] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:19] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:19] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:20] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:20] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:20] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:20] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:20] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:20] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:20] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:20] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:20] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:20] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:20] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:20] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:21] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:21] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:21] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:21] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:22] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/143 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/187 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:25] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:25] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:25] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:25] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:25] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:26] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 193 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13339 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 135/246 variables, 111/149 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 44/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 195/388 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:34] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:35] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:35] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:35] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:36] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 393 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13059 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26415ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 26415ms
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 198/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26627 ms. Remains : 111/115 places, 198/210 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (NOT p1) p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-11
Entered a terminal (fully accepting) state of product in 94 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-11 finished in 26811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 210/210 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 207
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 112 transition count 207
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 112 transition count 177
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 82 transition count 177
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 78 transition count 165
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 78 transition count 165
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 84 place count 73 transition count 160
Applied a total of 84 rules in 14 ms. Remains 73 /115 variables (removed 42) and now considering 160/210 (removed 50) transitions.
[2025-06-02 03:32:45] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
// Phase 1: matrix 97 rows 73 cols
[2025-06-02 03:32:45] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:32:45] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-02 03:32:45] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2025-06-02 03:32:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:32:45] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:32:46] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:32:46] [INFO ] Redundant transitions in 1 ms returned []
Running 157 sub problems to find dead transitions.
[2025-06-02 03:32:46] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2025-06-02 03:32:46] [INFO ] Invariant cache hit.
[2025-06-02 03:32:46] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:46] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:46] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:46] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:46] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:46] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:46] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:46] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:46] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:46] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:46] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:47] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:47] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:47] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:47] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:47] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:47] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:47] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 97/170 variables, 73/101 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 44/145 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:49] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:49] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:50] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 148 constraints, problems are : Problem set: 0 solved, 157 unsolved in 6586 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:52] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 97/170 variables, 73/105 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 44/149 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 157/306 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:56] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/170 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/170 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 307 constraints, problems are : Problem set: 0 solved, 157 unsolved in 10281 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16879ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 16880ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/115 places, 160/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17073 ms. Remains : 73/115 places, 160/210 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 94 ms.
Stack based approach found an accepted trace after 257 steps with 0 reset with depth 258 and stack size 148 in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-15 finished in 17227 ms.
All properties solved by simple procedures.
Total runtime 363951 ms.
BK_STOP 1748835183118
--------------------
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="EisenbergMcGuire-PT-03"
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 EisenbergMcGuire-PT-03, 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 r072-tall-174860068100756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-03.tgz
mv EisenbergMcGuire-PT-03 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 '
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 ;