About the Execution of ITS-Tools for MedleyA-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 656723.00 | 0.00 | 0.00 | FTFTTFFFFFFTTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100212.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 MedleyA-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100212
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 110K 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 MedleyA-PT-15-LTLFireability-00
FORMULA_NAME MedleyA-PT-15-LTLFireability-01
FORMULA_NAME MedleyA-PT-15-LTLFireability-02
FORMULA_NAME MedleyA-PT-15-LTLFireability-03
FORMULA_NAME MedleyA-PT-15-LTLFireability-04
FORMULA_NAME MedleyA-PT-15-LTLFireability-05
FORMULA_NAME MedleyA-PT-15-LTLFireability-06
FORMULA_NAME MedleyA-PT-15-LTLFireability-07
FORMULA_NAME MedleyA-PT-15-LTLFireability-08
FORMULA_NAME MedleyA-PT-15-LTLFireability-09
FORMULA_NAME MedleyA-PT-15-LTLFireability-10
FORMULA_NAME MedleyA-PT-15-LTLFireability-11
FORMULA_NAME MedleyA-PT-15-LTLFireability-12
FORMULA_NAME MedleyA-PT-15-LTLFireability-13
FORMULA_NAME MedleyA-PT-15-LTLFireability-14
FORMULA_NAME MedleyA-PT-15-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748868711021
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 12:51:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 12:51:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:51:54] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2025-06-02 12:51:54] [INFO ] Transformed 192 places.
[2025-06-02 12:51:54] [INFO ] Transformed 475 transitions.
[2025-06-02 12:51:54] [INFO ] Found NUPN structural information;
[2025-06-02 12:51:54] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-15-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 473/473 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 151 transition count 407
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 151 transition count 407
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 108 place count 151 transition count 381
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 149 transition count 377
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 149 transition count 377
Applied a total of 112 rules in 58 ms. Remains 149 /192 variables (removed 43) and now considering 377/473 (removed 96) transitions.
// Phase 1: matrix 377 rows 149 cols
[2025-06-02 12:51:54] [INFO ] Computed 7 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:51:55] [INFO ] Implicit Places using invariants in 356 ms returned []
[2025-06-02 12:51:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:51:55] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2025-06-02 12:51:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:01] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:01] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:02] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:02] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:02] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:02] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:02] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:02] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:03] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:03] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:04] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:04] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:04] [INFO ] Deduced a trap composed of 96 places in 186 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:04] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:07] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:07] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (OVERLAPS) 377/526 variables, 149/172 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/526 variables, and 172 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 377/526 variables, 149/172 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 376/548 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:37] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:38] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:38] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:40] [INFO ] Deduced a trap composed of 100 places in 205 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:52:40] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 5/553 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/526 variables, and 553 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60503ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60537ms
Starting structural reductions in LTL mode, iteration 1 : 149/192 places, 377/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61503 ms. Remains : 149/192 places, 377/473 transitions.
Support contains 44 out of 149 places after structural reductions.
[2025-06-02 12:52:56] [INFO ] Flatten gal took : 75 ms
[2025-06-02 12:52:56] [INFO ] Flatten gal took : 59 ms
[2025-06-02 12:52:56] [INFO ] Input system was already deterministic with 377 transitions.
RANDOM walk for 40000 steps (8 resets) in 2572 ms. (15 steps per ms) remains 36/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 89 ms. (44 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 98 ms. (40 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 102 ms. (38 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 124 ms. (32 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
[2025-06-02 12:52:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 1 (OVERLAPS) 106/143 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 6/149 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 377/526 variables, 149/156 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/156 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/156 constraints. Problems are: Problem set: 3 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 156 constraints, problems are : Problem set: 3 solved, 30 unsolved in 1537 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 30 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 110/143 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 6/149 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:00] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 377/526 variables, 149/157 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 30/187 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:02] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 14 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/526 variables, 1/188 constraints. Problems are: Problem set: 3 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:03] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 1/189 constraints. Problems are: Problem set: 3 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/526 variables, and 189 constraints, problems are : Problem set: 3 solved, 30 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 30/33 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6585ms problems are : Problem set: 3 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 377/377 transitions.
Graph (trivial) has 93 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 143 transition count 354
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 129 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 128 transition count 353
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 31 place count 128 transition count 346
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 45 place count 121 transition count 346
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 47 place count 119 transition count 344
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 119 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 49 place count 119 transition count 343
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 118 transition count 343
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 71 place count 108 transition count 333
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 107 transition count 329
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 107 transition count 329
Performed 12 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 97 place count 95 transition count 394
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 123 place count 95 transition count 368
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 127 place count 93 transition count 381
Free-agglomeration rule applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 140 place count 93 transition count 368
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 155 place count 80 transition count 366
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 156 place count 79 transition count 364
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 79 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 160 place count 79 transition count 361
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 78 transition count 360
Applied a total of 161 rules in 231 ms. Remains 78 /149 variables (removed 71) and now considering 360/377 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 78/149 places, 360/377 transitions.
RANDOM walk for 40000 steps (8 resets) in 674 ms. (59 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 24/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
[2025-06-02 12:53:05] [INFO ] Flow matrix only has 350 transitions (discarded 10 similar events)
// Phase 1: matrix 350 rows 78 cols
[2025-06-02 12:53:05] [INFO ] Computed 7 invariants in 5 ms
[2025-06-02 12:53:05] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 48/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 333/400 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 30/101 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 28/428 variables, 11/112 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 30/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/428 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 145 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 48/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 333/400 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 30/101 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 28/428 variables, 11/112 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 30/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 15/160 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:07] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:07] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/428 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 162 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2632 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3779ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 8 properties in 4937 ms.
Support contains 13 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 360/360 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 78 transition count 358
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 76 transition count 358
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 76 transition count 354
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 70 transition count 354
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 56 edges and 70 vertex of which 18 / 70 are part of one of the 7 SCC in 1 ms
Free SCC test removed 11 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 19 place count 59 transition count 350
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 71 place count 59 transition count 298
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 74 place count 56 transition count 282
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 56 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 56 transition count 281
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 86 place count 52 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 87 place count 52 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 6 with 94 rules applied. Total rules applied 181 place count 52 transition count 223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 181 place count 52 transition count 222
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 183 place count 51 transition count 222
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 189 place count 48 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 190 place count 48 transition count 218
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 193 place count 48 transition count 215
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 196 place count 45 transition count 215
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 197 place count 45 transition count 215
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 198 place count 45 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 199 place count 45 transition count 214
Applied a total of 199 rules in 61 ms. Remains 45 /78 variables (removed 33) and now considering 214/360 (removed 146) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 45/78 places, 214/360 transitions.
RANDOM walk for 40000 steps (3758 resets) in 419 ms. (95 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40001 steps (60 resets) in 127 ms. (312 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (60 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
[2025-06-02 12:53:14] [INFO ] Flow matrix only has 202 transitions (discarded 12 similar events)
// Phase 1: matrix 202 rows 45 cols
[2025-06-02 12:53:14] [INFO ] Computed 5 invariants in 2 ms
[2025-06-02 12:53:14] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/170 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/242 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/243 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:14] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/247 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/247 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/170 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/242 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/243 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/247 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:15] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/247 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 648ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 214/214 transitions.
Graph (trivial) has 33 edges and 45 vertex of which 10 / 45 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 40 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 39 transition count 199
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 39 transition count 197
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 37 transition count 197
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 37 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 36 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 36 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 35 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 33 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 32 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 32 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 51 place count 32 transition count 154
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 32 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 53 place count 31 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 55 place count 30 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 57 place count 29 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 65 place count 29 transition count 150
Applied a total of 65 rules in 44 ms. Remains 29 /45 variables (removed 16) and now considering 150/214 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 29/45 places, 150/214 transitions.
RANDOM walk for 28628 steps (3291 resets) in 184 ms. (154 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-15-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA MedleyA-PT-15-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 15 stabilizing places and 15 stable transitions
FORMULA MedleyA-PT-15-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((p1||(p2 U (p3||G(p2)))))))'
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 377/377 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 142 transition count 366
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 142 transition count 366
Applied a total of 14 rules in 9 ms. Remains 142 /149 variables (removed 7) and now considering 366/377 (removed 11) transitions.
// Phase 1: matrix 366 rows 142 cols
[2025-06-02 12:53:15] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:53:16] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 12:53:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:53:16] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-02 12:53:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:22] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:22] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:22] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:22] [INFO ] Deduced a trap composed of 81 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:22] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:22] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:23] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:23] [INFO ] Deduced a trap composed of 93 places in 174 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:24] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:24] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:24] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:24] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 366/508 variables, 142/161 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:46] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 16 ms to minimize.
SMT process timed out in 30123ms, After SMT, problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 30126ms
Starting structural reductions in LTL mode, iteration 1 : 142/149 places, 366/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30540 ms. Remains : 142/149 places, 366/377 transitions.
Stuttering acceptance computed with spot in 484 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3) (NOT p2)), true]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-00 finished in 31122 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))||X((G(p4)||p3))))'
Support contains 7 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 377/377 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 142 transition count 366
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 142 transition count 366
Applied a total of 14 rules in 9 ms. Remains 142 /149 variables (removed 7) and now considering 366/377 (removed 11) transitions.
// Phase 1: matrix 366 rows 142 cols
[2025-06-02 12:53:47] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:53:47] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-02 12:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:53:47] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-02 12:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:53] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:54] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:54] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:54] [INFO ] Deduced a trap composed of 81 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:54] [INFO ] Deduced a trap composed of 37 places in 222 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:54] [INFO ] Deduced a trap composed of 81 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:55] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:55] [INFO ] Deduced a trap composed of 82 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:55] [INFO ] Deduced a trap composed of 93 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:56] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:56] [INFO ] Deduced a trap composed of 93 places in 168 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:56] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:57] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:57] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:57] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:53:59] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:00] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:00] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/508 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:08] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:10] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 169 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 366/508 variables, 142/169 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 365/534 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:31] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 535 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 142/149 places, 366/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60681 ms. Remains : 142/149 places, 366/377 transitions.
Stuttering acceptance computed with spot in 672 ms :[true, (OR (NOT p2) p0), (AND (NOT p2) (NOT p3) (NOT p4)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND p0 (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p3) (NOT p4)), (OR (AND (NOT p2) (NOT p4)) (AND p0 (NOT p4))), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (NOT p2), (NOT p2), (NOT p4)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 398 ms.
Product exploration explored 100000 steps with 50000 reset in 334 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3 p4), (X (NOT p2)), (X p3), (X p4), (X (NOT (AND p0 (NOT p3) p4))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3) p4))), (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3) p4))), (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3) (NOT p4)))), (X (NOT (AND p0 (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3) p4))), (X (NOT (AND (NOT p2) p1 p0 (NOT p3) p4))), (X (NOT (AND (NOT p2) p1 p0 (NOT p3) (NOT p4)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p4)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p4))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0 p4)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p4))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p4))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p4)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p4))))), (X (X (NOT (AND p0 p4)))), (X (X (NOT (AND (NOT p2) p1 p4)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) p4))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) p4)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 40 factoid took 51 ms. Reduced automaton from 11 states, 46 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-15-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-15-LTLFireability-01 finished in 62214 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||(F(!p1)&&X(F(!p2)))) U (G((!p0||(F(!p1)&&X(F(!p2)))))||((!p0||(F(!p1)&&X(F(!p2))))&&X(!p3)))))'
Support contains 7 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 377/377 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 141 transition count 364
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 141 transition count 364
Applied a total of 16 rules in 6 ms. Remains 141 /149 variables (removed 8) and now considering 364/377 (removed 13) transitions.
// Phase 1: matrix 364 rows 141 cols
[2025-06-02 12:54:49] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:54:49] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 12:54:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:54:49] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2025-06-02 12:54:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:55] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:55] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:56] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:56] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:56] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:56] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:57] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:57] [INFO ] Deduced a trap composed of 92 places in 203 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:57] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:57] [INFO ] Deduced a trap composed of 97 places in 174 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:58] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:58] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:58] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:54:59] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/162 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:09] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 163 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:23] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:26] [INFO ] Deduced a trap composed of 97 places in 202 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 364/505 variables, 141/165 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 363/528 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:37] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:37] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 530 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 141/149 places, 364/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60517 ms. Remains : 141/149 places, 364/377 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (AND p0 p1) (AND p0 p2)), p1, p2, (OR (AND p0 p1 p3) (AND p0 p2 p3))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p3))), (X (NOT (AND p0 p1 p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 29 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-15-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-15-LTLFireability-03 finished in 61014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(p0) U (p1 U (X(X(X(p1)))||p2))))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 377/377 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 142 transition count 366
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 142 transition count 366
Applied a total of 14 rules in 6 ms. Remains 142 /149 variables (removed 7) and now considering 366/377 (removed 11) transitions.
// Phase 1: matrix 366 rows 142 cols
[2025-06-02 12:55:50] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:55:50] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-02 12:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:55:50] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-02 12:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:57] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:57] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:57] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:57] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:57] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:58] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:58] [INFO ] Deduced a trap composed of 78 places in 197 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:58] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:58] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:59] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:59] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:55:59] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:02] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:02] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:06] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:06] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:07] [INFO ] Deduced a trap composed of 92 places in 194 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:08] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:11] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 366/508 variables, 142/168 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 168 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:24] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:25] [INFO ] Deduced a trap composed of 97 places in 193 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:27] [INFO ] Deduced a trap composed of 85 places in 228 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:27] [INFO ] Deduced a trap composed of 96 places in 210 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:28] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 34 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (OVERLAPS) 366/508 variables, 142/173 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 365/538 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:50] [INFO ] Deduced a trap along path composed of 2 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:50] [INFO ] Deduced a trap along path composed of 14 places in 90 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 540 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 142/149 places, 366/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60663 ms. Remains : 142/149 places, 366/377 transitions.
Stuttering acceptance computed with spot in 525 ms :[(OR p2 p1), true, p1, (OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p1, p1, p0, (AND p1 p0), (AND p1 p0), (AND p0 p1)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-05
Product exploration explored 100000 steps with 20010 reset in 99 ms.
Product exploration explored 100000 steps with 20035 reset in 289 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 199 ms. Reduced automaton from 11 states, 26 edges and 3 AP (stutter sensitive) to 11 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 473 ms :[(OR p2 p1), true, p1, (OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p1, p1, p0, (AND p1 p0), (AND p1 p0), (AND p0 p1)]
RANDOM walk for 40000 steps (8 resets) in 521 ms. (76 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 275 ms. (144 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 234 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 190 ms. (209 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 188 ms. (211 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 155 ms. (256 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 133 ms. (298 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 1132399 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :10 out of 11
Probabilistic random walk after 1132399 steps, saw 236385 distinct states, run finished after 3026 ms. (steps per millisecond=374 ) properties seen :10
[2025-06-02 12:56:56] [INFO ] Invariant cache hit.
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, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 92/508 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 2/7 constraints, State Equation: 0/142 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1)]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) (NOT p2))))
Knowledge based reduction with 20 factoid took 237 ms. Reduced automaton from 11 states, 26 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-15-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-15-LTLFireability-05 finished in 66573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 377/377 transitions.
Graph (trivial) has 150 edges and 149 vertex of which 6 / 149 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 144 transition count 350
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 122 transition count 350
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 122 transition count 341
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 113 transition count 341
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 72 place count 104 transition count 325
Iterating global reduction 2 with 9 rules applied. Total rules applied 81 place count 104 transition count 325
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 81 place count 104 transition count 324
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 103 transition count 324
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 109 place count 90 transition count 311
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 88 transition count 304
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 88 transition count 304
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 147 place count 71 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 2 with 38 rules applied. Total rules applied 185 place count 71 transition count 383
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 193 place count 67 transition count 431
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 66 transition count 430
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 74 edges and 64 vertex of which 28 / 64 are part of one of the 11 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 197 place count 47 transition count 430
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 3 with 87 rules applied. Total rules applied 284 place count 47 transition count 343
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 289 place count 42 transition count 276
Iterating global reduction 4 with 5 rules applied. Total rules applied 294 place count 42 transition count 276
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 304 place count 42 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 86 transitions
Redundant transition composition rules discarded 86 transitions
Iterating global reduction 5 with 86 rules applied. Total rules applied 390 place count 42 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 390 place count 42 transition count 178
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 394 place count 40 transition count 178
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 395 place count 39 transition count 172
Iterating global reduction 5 with 1 rules applied. Total rules applied 396 place count 39 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 400 place count 37 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 403 place count 37 transition count 167
Applied a total of 403 rules in 181 ms. Remains 37 /149 variables (removed 112) and now considering 167/377 (removed 210) transitions.
[2025-06-02 12:56:57] [INFO ] Flow matrix only has 147 transitions (discarded 20 similar events)
// Phase 1: matrix 147 rows 37 cols
[2025-06-02 12:56:57] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:56:57] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-02 12:56:57] [INFO ] Flow matrix only has 147 transitions (discarded 20 similar events)
[2025-06-02 12:56:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:56:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 12:56:57] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:56:57] [INFO ] Redundant transitions in 117 ms returned [120, 121, 163, 164, 166]
Found 5 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
Running 156 sub problems to find dead transitions.
[2025-06-02 12:56:57] [INFO ] Flow matrix only has 142 transitions (discarded 20 similar events)
// Phase 1: matrix 142 rows 37 cols
[2025-06-02 12:56:57] [INFO ] Computed 5 invariants in 2 ms
[2025-06-02 12:56:57] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:58] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:58] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:58] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:58] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:56:58] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 141/178 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/179 variables, and 59 constraints, problems are : Problem set: 0 solved, 156 unsolved in 7349 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 141/178 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:57:11] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 6 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/178 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 0/178 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/179 variables, and 216 constraints, problems are : Problem set: 0 solved, 156 unsolved in 17713 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25177ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 25181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/149 places, 162/377 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 37 transition count 161
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 36 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 35 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 35 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 34 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 34 transition count 150
Applied a total of 14 rules in 15 ms. Remains 34 /37 variables (removed 3) and now considering 150/162 (removed 12) transitions.
[2025-06-02 12:57:22] [INFO ] Flow matrix only has 133 transitions (discarded 17 similar events)
// Phase 1: matrix 133 rows 34 cols
[2025-06-02 12:57:22] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:57:22] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 12:57:22] [INFO ] Flow matrix only has 133 transitions (discarded 17 similar events)
[2025-06-02 12:57:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:57:22] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-02 12:57:22] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/149 places, 150/377 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26013 ms. Remains : 34/149 places, 150/377 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-06 finished in 26092 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 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 377/377 transitions.
Graph (trivial) has 151 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 142 transition count 349
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 121 transition count 349
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 43 place count 121 transition count 340
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 61 place count 112 transition count 340
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 69 place count 104 transition count 325
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 104 transition count 325
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 77 place count 104 transition count 324
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 103 transition count 324
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 105 place count 90 transition count 311
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 88 transition count 304
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 88 transition count 304
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 143 place count 71 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 2 with 38 rules applied. Total rules applied 181 place count 71 transition count 383
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 189 place count 67 transition count 431
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 66 transition count 430
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 75 edges and 64 vertex of which 28 / 64 are part of one of the 11 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 193 place count 47 transition count 430
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 3 with 87 rules applied. Total rules applied 280 place count 47 transition count 343
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 285 place count 42 transition count 276
Iterating global reduction 4 with 5 rules applied. Total rules applied 290 place count 42 transition count 276
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 300 place count 42 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 5 with 87 rules applied. Total rules applied 387 place count 42 transition count 179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 387 place count 42 transition count 177
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 391 place count 40 transition count 177
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 392 place count 39 transition count 171
Iterating global reduction 5 with 1 rules applied. Total rules applied 393 place count 39 transition count 171
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 397 place count 37 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 400 place count 37 transition count 166
Applied a total of 400 rules in 90 ms. Remains 37 /149 variables (removed 112) and now considering 166/377 (removed 211) transitions.
[2025-06-02 12:57:23] [INFO ] Flow matrix only has 146 transitions (discarded 20 similar events)
// Phase 1: matrix 146 rows 37 cols
[2025-06-02 12:57:23] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:57:23] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-02 12:57:23] [INFO ] Flow matrix only has 146 transitions (discarded 20 similar events)
[2025-06-02 12:57:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:57:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-02 12:57:23] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:57:23] [INFO ] Redundant transitions in 32 ms returned [119, 120, 162, 163, 165]
Found 5 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
Running 157 sub problems to find dead transitions.
[2025-06-02 12:57:23] [INFO ] Flow matrix only has 141 transitions (discarded 20 similar events)
// Phase 1: matrix 141 rows 37 cols
[2025-06-02 12:57:23] [INFO ] Computed 5 invariants in 0 ms
[2025-06-02 12:57:23] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 1/5 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 12:57:25] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:57:25] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:57:25] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:57:25] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:57:25] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:57:25] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:57:26] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 140/177 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 41/90 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/178 variables, and 90 constraints, problems are : Problem set: 0 solved, 157 unsolved in 8277 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 7/7 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/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 1/37 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 140/177 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 41/90 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/247 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 12:57:44] [INFO ] Deduced a trap along path composed of 8 places in 82 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 177/178 variables, and 248 constraints, problems are : Problem set: 0 solved, 157 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38361ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 38361ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/149 places, 161/377 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 37 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 36 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 35 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 35 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 34 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 34 transition count 149
Applied a total of 14 rules in 12 ms. Remains 34 /37 variables (removed 3) and now considering 149/161 (removed 12) transitions.
[2025-06-02 12:58:02] [INFO ] Flow matrix only has 132 transitions (discarded 17 similar events)
// Phase 1: matrix 132 rows 34 cols
[2025-06-02 12:58:02] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:58:02] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 12:58:02] [INFO ] Flow matrix only has 132 transitions (discarded 17 similar events)
[2025-06-02 12:58:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:58:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 12:58:02] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/149 places, 149/377 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39709 ms. Remains : 34/149 places, 149/377 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-08 finished in 39839 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||X(X(X(F(p1)))))&&(X(X(X(F(p1))))||G(p2))))))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 377/377 transitions.
Graph (trivial) has 147 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 142 transition count 349
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 121 transition count 349
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 43 place count 121 transition count 340
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 61 place count 112 transition count 340
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 70 place count 103 transition count 324
Iterating global reduction 2 with 9 rules applied. Total rules applied 79 place count 103 transition count 324
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 79 place count 103 transition count 323
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 102 transition count 323
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 107 place count 89 transition count 310
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 87 transition count 303
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 87 transition count 303
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 145 place count 70 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 2 with 49 rules applied. Total rules applied 194 place count 70 transition count 377
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 200 place count 67 transition count 412
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 66 transition count 411
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 68 edges and 64 vertex of which 20 / 64 are part of one of the 8 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 204 place count 52 transition count 411
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 255 place count 52 transition count 360
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 257 place count 50 transition count 329
Iterating global reduction 4 with 2 rules applied. Total rules applied 259 place count 50 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 4 with 104 rules applied. Total rules applied 363 place count 50 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 363 place count 50 transition count 223
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 367 place count 48 transition count 223
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 369 place count 46 transition count 208
Iterating global reduction 4 with 2 rules applied. Total rules applied 371 place count 46 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 375 place count 44 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 382 place count 44 transition count 199
Applied a total of 382 rules in 89 ms. Remains 44 /149 variables (removed 105) and now considering 199/377 (removed 178) transitions.
[2025-06-02 12:58:02] [INFO ] Flow matrix only has 183 transitions (discarded 16 similar events)
// Phase 1: matrix 183 rows 44 cols
[2025-06-02 12:58:02] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:58:03] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-02 12:58:03] [INFO ] Flow matrix only has 183 transitions (discarded 16 similar events)
[2025-06-02 12:58:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:58:03] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 12:58:03] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:58:03] [INFO ] Redundant transitions in 110 ms returned [20, 21, 22, 25, 26, 27, 109, 110, 111, 153, 154, 156, 157, 159, 161, 164, 165, 182, 184, 185, 187, 188, 189, 190, 192, 195, 196, 197]
Found 28 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 28 transitions
Redundant transitions reduction (with SMT) removed 28 transitions.
Running 165 sub problems to find dead transitions.
[2025-06-02 12:58:03] [INFO ] Flow matrix only has 155 transitions (discarded 16 similar events)
// Phase 1: matrix 155 rows 44 cols
[2025-06-02 12:58:03] [INFO ] Computed 5 invariants in 2 ms
[2025-06-02 12:58:03] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:58:03] [INFO ] Deduced a trap composed of 8 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 12:58:03] [INFO ] Deduced a trap composed of 8 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 12:58:04] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:58:04] [INFO ] Deduced a trap composed of 8 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 12:58:04] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 154/198 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 36/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/198 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/199 variables, and 90 constraints, problems are : Problem set: 0 solved, 165 unsolved in 7426 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 154/198 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 36/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 165/255 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:58:13] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:58:14] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/199 variables, and 257 constraints, problems are : Problem set: 0 solved, 165 unsolved in 17998 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25537ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 25538ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/149 places, 171/377 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 44 transition count 170
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 20 place count 40 transition count 169
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 40 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 39 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 39 transition count 168
Applied a total of 23 rules in 15 ms. Remains 39 /44 variables (removed 5) and now considering 168/171 (removed 3) transitions.
[2025-06-02 12:58:28] [INFO ] Flow matrix only has 149 transitions (discarded 19 similar events)
// Phase 1: matrix 149 rows 39 cols
[2025-06-02 12:58:28] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:58:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 12:58:28] [INFO ] Flow matrix only has 149 transitions (discarded 19 similar events)
[2025-06-02 12:58:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:58:29] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-02 12:58:29] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/149 places, 168/377 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26301 ms. Remains : 39/149 places, 168/377 transitions.
Stuttering acceptance computed with spot in 433 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-09
Product exploration explored 100000 steps with 19969 reset in 323 ms.
Product exploration explored 100000 steps with 19939 reset in 314 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter insensitive) to 11 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 585 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), false, false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), false, false, false, false, false, false]
RANDOM walk for 40000 steps (10054 resets) in 284 ms. (140 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40000 steps (101 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (134 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (226 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (299 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (420 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (354 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
[2025-06-02 12:58:31] [INFO ] Flow matrix only has 149 transitions (discarded 19 similar events)
[2025-06-02 12:58:31] [INFO ] Invariant cache hit.
[2025-06-02 12:58:31] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 14/18 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 87/105 variables, 18/20 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 73/178 variables, 14/34 constraints. Problems are: Problem set: 4 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 9/43 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/43 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 2/45 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 4/49 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:58:31] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/50 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/50 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/187 variables, 3/53 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 1/54 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 24/78 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/78 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/187 variables, 0/78 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/188 variables, and 78 constraints, problems are : Problem set: 4 solved, 2 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 87/105 variables, 18/20 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/22 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/22 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 73/178 variables, 14/36 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 9/45 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/45 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 2/47 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 4/51 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 1/52 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/52 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/187 variables, 3/55 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 1/56 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 24/80 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:58:31] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 1/81 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 0/81 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/187 variables, 0/81 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/188 variables, and 81 constraints, problems are : Problem set: 4 solved, 2 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 814ms problems are : Problem set: 4 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 168/168 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 167
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 9 place count 39 transition count 159
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 31 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 31 transition count 151
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 31 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 31 transition count 150
Applied a total of 27 rules in 17 ms. Remains 31 /39 variables (removed 8) and now considering 150/168 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 31/39 places, 150/168 transitions.
RANDOM walk for 30011 steps (186 resets) in 163 ms. (182 steps per ms) remains 0/2 properties
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p2) (NOT p0))), (G (OR p1 (NOT p2) (NOT p0))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2) (NOT p0)))), (F (NOT (AND (OR p1 p2) (OR p1 p0)))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 (AND p2 p0)))), (F p0), (F (NOT (OR (NOT p1) p2 (NOT p0))))]
Knowledge based reduction with 9 factoid took 689 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 39 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 39 /39 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2025-06-02 12:58:33] [INFO ] Flow matrix only has 149 transitions (discarded 19 similar events)
[2025-06-02 12:58:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:58:33] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 12:58:33] [INFO ] Flow matrix only has 149 transitions (discarded 19 similar events)
[2025-06-02 12:58:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:58:33] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-02 12:58:33] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:58:33] [INFO ] Redundant transitions in 30 ms returned []
Running 162 sub problems to find dead transitions.
[2025-06-02 12:58:33] [INFO ] Flow matrix only has 149 transitions (discarded 19 similar events)
[2025-06-02 12:58:33] [INFO ] Invariant cache hit.
[2025-06-02 12:58:33] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:58:34] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:58:34] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:58:34] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:58:34] [INFO ] Deduced a trap composed of 8 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 12:58:34] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 148/187 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 33/82 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/187 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/188 variables, and 82 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8256 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 148/187 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 33/82 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 162/244 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:58:46] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/188 variables, and 245 constraints, problems are : Problem set: 0 solved, 162 unsolved in 17169 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25533ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 25534ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25843 ms. Remains : 39/39 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (10008 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1006 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4002 steps, run visited all 1 properties in 13 ms. (steps per millisecond=307 )
Probabilistic random walk after 4002 steps, saw 1368 distinct states, run finished after 19 ms. (steps per millisecond=210 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 89 ms.
Product exploration explored 100000 steps with 0 reset in 207 ms.
Built C files in :
/tmp/ltsmin15247840367075624924
[2025-06-02 12:58:59] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2025-06-02 12:58:59] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:58:59] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2025-06-02 12:58:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:58:59] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2025-06-02 12:58:59] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:58:59] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15247840367075624924
Running compilation step : cd /tmp/ltsmin15247840367075624924;'/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 981 ms.
Running link step : cd /tmp/ltsmin15247840367075624924;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin15247840367075624924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11688089966332030043.hoa' '--buchi-type=spotba'
LTSmin run took 319 ms.
FORMULA MedleyA-PT-15-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-15-LTLFireability-09 finished in 58642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 377/377 transitions.
Graph (trivial) has 150 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 142 transition count 348
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 120 transition count 348
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 45 place count 120 transition count 340
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 61 place count 112 transition count 340
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 70 place count 103 transition count 324
Iterating global reduction 2 with 9 rules applied. Total rules applied 79 place count 103 transition count 324
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 79 place count 103 transition count 323
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 102 transition count 323
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 107 place count 89 transition count 310
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 87 transition count 303
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 87 transition count 303
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 145 place count 70 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 2 with 45 rules applied. Total rules applied 190 place count 70 transition count 381
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 196 place count 67 transition count 416
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 197 place count 66 transition count 415
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 59 edges and 65 vertex of which 15 / 65 are part of one of the 6 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 199 place count 56 transition count 415
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 241 place count 56 transition count 373
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 244 place count 53 transition count 316
Iterating global reduction 4 with 3 rules applied. Total rules applied 247 place count 53 transition count 316
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 261 place count 53 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 52 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 5 with 60 rules applied. Total rules applied 323 place count 52 transition count 255
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 324 place count 51 transition count 243
Iterating global reduction 5 with 1 rules applied. Total rules applied 325 place count 51 transition count 243
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 329 place count 49 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 347 place count 49 transition count 245
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 348 place count 48 transition count 239
Iterating global reduction 5 with 1 rules applied. Total rules applied 349 place count 48 transition count 239
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 354 place count 48 transition count 234
Applied a total of 354 rules in 80 ms. Remains 48 /149 variables (removed 101) and now considering 234/377 (removed 143) transitions.
[2025-06-02 12:59:01] [INFO ] Flow matrix only has 187 transitions (discarded 47 similar events)
// Phase 1: matrix 187 rows 48 cols
[2025-06-02 12:59:01] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:59:01] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-02 12:59:01] [INFO ] Flow matrix only has 187 transitions (discarded 47 similar events)
[2025-06-02 12:59:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:59:01] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-02 12:59:01] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:59:01] [INFO ] Redundant transitions in 34 ms returned [201, 212, 224, 231]
Found 4 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
Running 224 sub problems to find dead transitions.
[2025-06-02 12:59:01] [INFO ] Flow matrix only has 183 transitions (discarded 47 similar events)
// Phase 1: matrix 183 rows 48 cols
[2025-06-02 12:59:01] [INFO ] Computed 6 invariants in 1 ms
[2025-06-02 12:59:01] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:02] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:02] [INFO ] Deduced a trap composed of 8 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 12:59:02] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:03] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:03] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:03] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:03] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 182/230 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 50/111 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 1/231 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 112 constraints, problems are : Problem set: 0 solved, 224 unsolved in 13772 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 182/230 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 50/111 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 224/335 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 1/231 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 11 (OVERLAPS) 0/231 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 336 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43888ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 43891ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/149 places, 230/377 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44329 ms. Remains : 48/149 places, 230/377 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 87 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLFireability-10 finished in 44559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 377/377 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 143 transition count 367
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 143 transition count 367
Applied a total of 12 rules in 4 ms. Remains 143 /149 variables (removed 6) and now considering 367/377 (removed 10) transitions.
// Phase 1: matrix 367 rows 143 cols
[2025-06-02 12:59:45] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:59:46] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-02 12:59:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:59:46] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2025-06-02 12:59:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:52] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:52] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:53] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:53] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:53] [INFO ] Deduced a trap composed of 81 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:53] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:53] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:54] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:54] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:54] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:54] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:55] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:55] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:55] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:56] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:56] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:58] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:59:59] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:03] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (OVERLAPS) 367/510 variables, 143/169 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/510 variables, and 169 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:19] [INFO ] Deduced a trap composed of 86 places in 215 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:20] [INFO ] Deduced a trap composed of 97 places in 192 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:20] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:21] [INFO ] Deduced a trap composed of 95 places in 214 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:24] [INFO ] Deduced a trap composed of 97 places in 185 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (OVERLAPS) 367/510 variables, 143/174 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 366/540 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:41] [INFO ] Deduced a trap along path composed of 2 places in 123 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:42] [INFO ] Deduced a trap along path composed of 2 places in 150 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:42] [INFO ] Deduced a trap along path composed of 14 places in 125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 543 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 143/149 places, 367/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60655 ms. Remains : 143/149 places, 367/377 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 127 ms.
Product exploration explored 100000 steps with 0 reset in 230 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/143 stabilizing places and 14/367 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 199 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
[2025-06-02 13:00:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/143 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:47] [INFO ] Deduced a trap composed of 17 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 13:00:47] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 367/510 variables, 143/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/510 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/143 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 367/510 variables, 143/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/510 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 590ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 367/367 transitions.
Graph (trivial) has 141 edges and 143 vertex of which 9 / 143 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 137 transition count 337
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 116 transition count 337
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 43 place count 116 transition count 328
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 61 place count 107 transition count 328
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 107 transition count 327
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 104 transition count 322
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 104 transition count 322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 68 place count 104 transition count 321
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 103 transition count 321
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 98 place count 89 transition count 307
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 87 transition count 300
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 87 transition count 300
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -149
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 140 place count 68 transition count 449
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 145 place count 68 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 4 with 54 rules applied. Total rules applied 199 place count 68 transition count 390
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 203 place count 66 transition count 412
Free-agglomeration rule applied 21 times with reduction of 8 identical transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 224 place count 66 transition count 383
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 4 with 55 rules applied. Total rules applied 279 place count 45 transition count 349
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 5 with 34 rules applied. Total rules applied 313 place count 45 transition count 315
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 314 place count 44 transition count 314
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 38 edges and 42 vertex of which 10 / 42 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 317 place count 37 transition count 314
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 6 with 79 rules applied. Total rules applied 396 place count 37 transition count 235
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 401 place count 32 transition count 207
Iterating global reduction 7 with 5 rules applied. Total rules applied 406 place count 32 transition count 207
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 415 place count 32 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 8 with 44 rules applied. Total rules applied 459 place count 32 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 463 place count 30 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 467 place count 28 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 483 place count 28 transition count 146
Applied a total of 483 rules in 82 ms. Remains 28 /143 variables (removed 115) and now considering 146/367 (removed 221) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 28/143 places, 146/367 transitions.
RANDOM walk for 96 steps (12 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p0)))), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 447 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
[2025-06-02 13:00:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:00:49] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p0)))), (F p0), (F (NOT (AND p1 (NOT p0)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 408 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-15-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-15-LTLFireability-13 finished in 64008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)||p0))&&F(G((p2||F((G(p1)||p3))))))))'
Support contains 6 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 377/377 transitions.
Graph (trivial) has 134 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 142 transition count 348
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 120 transition count 348
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 45 place count 120 transition count 340
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 61 place count 112 transition count 340
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 70 place count 103 transition count 324
Iterating global reduction 2 with 9 rules applied. Total rules applied 79 place count 103 transition count 324
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 79 place count 103 transition count 323
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 102 transition count 323
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 107 place count 89 transition count 310
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 87 transition count 303
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 87 transition count 303
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 139 place count 73 transition count 397
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 179 place count 73 transition count 357
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 185 place count 70 transition count 389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 69 transition count 388
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 51 edges and 68 vertex of which 15 / 68 are part of one of the 6 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 188 place count 59 transition count 388
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 215 place count 59 transition count 361
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 217 place count 57 transition count 323
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 57 transition count 323
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 233 place count 57 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 5 with 33 rules applied. Total rules applied 266 place count 57 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 268 place count 56 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 289 place count 56 transition count 268
Applied a total of 289 rules in 65 ms. Remains 56 /149 variables (removed 93) and now considering 268/377 (removed 109) transitions.
[2025-06-02 13:00:50] [INFO ] Flow matrix only has 215 transitions (discarded 53 similar events)
// Phase 1: matrix 215 rows 56 cols
[2025-06-02 13:00:50] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:00:50] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 13:00:50] [INFO ] Flow matrix only has 215 transitions (discarded 53 similar events)
[2025-06-02 13:00:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:00:50] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 13:00:50] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:00:50] [INFO ] Redundant transitions in 27 ms returned [261, 265]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 260 sub problems to find dead transitions.
[2025-06-02 13:00:50] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
// Phase 1: matrix 213 rows 56 cols
[2025-06-02 13:00:50] [INFO ] Computed 6 invariants in 2 ms
[2025-06-02 13:00:50] [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/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:51] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:51] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:51] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:52] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:52] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 212/268 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 43/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 1/269 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/269 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 111 constraints, problems are : Problem set: 0 solved, 260 unsolved in 23314 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 212/268 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 43/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 260/370 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:23] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 1/269 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/269 variables, and 372 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53468ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 53470ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/149 places, 266/377 transitions.
Applied a total of 0 rules in 5 ms. Remains 56 /56 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53901 ms. Remains : 56/149 places, 266/377 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 202 ms.
Product exploration explored 100000 steps with 0 reset in 234 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 p0 (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p0), (X (NOT p1)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 195 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 663 ms. (60 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 680 ms. (58 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 608 ms. (65 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 335 ms. (119 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 239 ms. (166 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
[2025-06-02 13:01:45] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
[2025-06-02 13:01:45] [INFO ] Invariant cache hit.
[2025-06-02 13:01:45] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/44 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 201/245 variables, 44/48 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 21/69 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 23/268 variables, 12/81 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/83 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 22/105 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/269 variables, 1/106 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/269 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 106 constraints, problems are : Problem set: 2 solved, 4 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 38/44 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 201/245 variables, 44/48 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 21/69 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 2/71 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 23/268 variables, 12/83 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 2/85 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 22/107 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 2/109 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/109 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/269 variables, 1/110 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/110 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/269 variables, 0/110 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 110 constraints, problems are : Problem set: 2 solved, 4 unsolved in 866 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1204ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 449 ms.
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 266/266 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 56 transition count 259
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 56 transition count 257
Free-agglomeration rule applied 16 times with reduction of 3 identical transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 25 place count 56 transition count 238
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 58 place count 40 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 84 place count 40 transition count 195
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 84 place count 40 transition count 194
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 39 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 38 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 38 transition count 187
Applied a total of 94 rules in 31 ms. Remains 38 /56 variables (removed 18) and now considering 187/266 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 38/56 places, 187/266 transitions.
RANDOM walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 4742 steps, run visited all 4 properties in 37 ms. (steps per millisecond=128 )
Probabilistic random walk after 4742 steps, saw 1588 distinct states, run finished after 37 ms. (steps per millisecond=128 ) properties seen :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p0), (X (NOT p1)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (G (OR p1 (NOT p2) p3)), (G (OR (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (AND (OR p1 p3) (OR p2 p3)))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 p2 p3))), (F (NOT p0)), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR (NOT p1) p0))), (F p1)]
Knowledge based reduction with 23 factoid took 657 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3))]
Support contains 5 out of 56 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 266/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 56 /56 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2025-06-02 13:01:48] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
[2025-06-02 13:01:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:01:49] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 13:01:49] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
[2025-06-02 13:01:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:01:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 13:01:49] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:01:49] [INFO ] Redundant transitions in 4 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-02 13:01:49] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
[2025-06-02 13:01:49] [INFO ] Invariant cache hit.
[2025-06-02 13:01:49] [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/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:50] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:50] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:50] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:51] [INFO ] Deduced a trap composed of 9 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 13:01:51] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 212/268 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 43/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 1/269 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/269 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 111 constraints, problems are : Problem set: 0 solved, 260 unsolved in 21852 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 212/268 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 43/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 260/370 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:17] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:19] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 1/269 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/269 variables, and 373 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51978ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 51980ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52306 ms. Remains : 56/56 places, 266/266 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) p0 p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 195 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 139 ms. (285 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
[2025-06-02 13:02:42] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
[2025-06-02 13:02:42] [INFO ] Invariant cache hit.
[2025-06-02 13:02:42] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 39/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 201/245 variables, 44/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 21/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 23/268 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 22/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/269 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/269 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 106 constraints, problems are : Problem set: 0 solved, 6 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 39/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 201/245 variables, 44/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 21/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 23/268 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 22/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:42] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:43] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/269 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/269 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 114 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1365 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1837ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 436 ms.
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 266/266 transitions.
Graph (trivial) has 38 edges and 56 vertex of which 2 / 56 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 54 transition count 258
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 8 place count 54 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 19 place count 54 transition count 242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 52 transition count 221
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 52 transition count 221
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 29 place count 52 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 51 transition count 205
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 51 transition count 205
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 50 transition count 219
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 50 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 41 place count 50 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 41 place count 50 transition count 210
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 49 transition count 210
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 46 place count 49 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 48 place count 49 transition count 205
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 59 place count 49 transition count 194
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 76 place count 38 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 86 place count 38 transition count 178
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 87 place count 38 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 88 place count 37 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 97 place count 37 transition count 178
Applied a total of 97 rules in 34 ms. Remains 37 /56 variables (removed 19) and now considering 178/266 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 37/56 places, 178/266 transitions.
RANDOM walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 2/2 properties
BEST_FIRST walk for 36779 steps (8 resets) in 77 ms. (471 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0 p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p3 p1))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0)), (F (NOT p3)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p3 (NOT p1))))]
Knowledge based reduction with 15 factoid took 533 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 166 ms.
Product exploration explored 100000 steps with 0 reset in 184 ms.
Built C files in :
/tmp/ltsmin14595906078701448020
[2025-06-02 13:02:45] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2025-06-02 13:02:45] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:02:45] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2025-06-02 13:02:45] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:02:45] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2025-06-02 13:02:45] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:02:45] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14595906078701448020
Running compilation step : cd /tmp/ltsmin14595906078701448020;'/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 1080 ms.
Running link step : cd /tmp/ltsmin14595906078701448020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14595906078701448020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15240191306766746108.hoa' '--buchi-type=spotba'
LTSmin run took 700 ms.
FORMULA MedleyA-PT-15-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-15-LTLFireability-14 finished in 117705 ms.
All properties solved by simple procedures.
Total runtime 653743 ms.
BK_STOP 1748869367744
--------------------
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="MedleyA-PT-15"
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 MedleyA-PT-15, 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 r128-smll-174876524100212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-15.tgz
mv MedleyA-PT-15 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 ;