Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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 89K 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-16-LTLFireability-00
FORMULA_NAME MedleyA-PT-16-LTLFireability-01
FORMULA_NAME MedleyA-PT-16-LTLFireability-02
FORMULA_NAME MedleyA-PT-16-LTLFireability-03
FORMULA_NAME MedleyA-PT-16-LTLFireability-04
FORMULA_NAME MedleyA-PT-16-LTLFireability-05
FORMULA_NAME MedleyA-PT-16-LTLFireability-06
FORMULA_NAME MedleyA-PT-16-LTLFireability-07
FORMULA_NAME MedleyA-PT-16-LTLFireability-08
FORMULA_NAME MedleyA-PT-16-LTLFireability-09
FORMULA_NAME MedleyA-PT-16-LTLFireability-10
FORMULA_NAME MedleyA-PT-16-LTLFireability-11
FORMULA_NAME MedleyA-PT-16-LTLFireability-12
FORMULA_NAME MedleyA-PT-16-LTLFireability-13
FORMULA_NAME MedleyA-PT-16-LTLFireability-14
FORMULA_NAME MedleyA-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748870290978

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 13:18:13] [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 13:18:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 13:18:13] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2025-06-02 13:18:13] [INFO ] Transformed 196 places.
[2025-06-02 13:18:13] [INFO ] Transformed 392 transitions.
[2025-06-02 13:18:13] [INFO ] Found NUPN structural information;
[2025-06-02 13:18:13] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-16-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 164 transition count 342
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 164 transition count 342
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 79 place count 164 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 163 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 163 transition count 326
Applied a total of 81 rules in 97 ms. Remains 163 /196 variables (removed 33) and now considering 326/390 (removed 64) transitions.
// Phase 1: matrix 326 rows 163 cols
[2025-06-02 13:18:14] [INFO ] Computed 7 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:18:15] [INFO ] Implicit Places using invariants in 473 ms returned []
[2025-06-02 13:18:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:18:15] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2025-06-02 13:18:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:21] [INFO ] Deduced a trap composed of 23 places in 404 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:22] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:22] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:22] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:22] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:22] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:23] [INFO ] Deduced a trap composed of 90 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:23] [INFO ] Deduced a trap composed of 89 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:23] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:24] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:24] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:25] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:25] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:25] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:25] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:25] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:26] [INFO ] Deduced a trap composed of 110 places in 173 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:26] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:28] [INFO ] Deduced a trap composed of 105 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:28] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:29] [INFO ] Deduced a trap composed of 104 places in 190 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 326/489 variables, 163/191 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:37] [INFO ] Deduced a trap composed of 92 places in 207 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:38] [INFO ] Deduced a trap composed of 114 places in 193 ms of which 33 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:44] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/489 variables, and 194 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:48] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:49] [INFO ] Deduced a trap composed of 115 places in 220 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:49] [INFO ] Deduced a trap composed of 114 places in 230 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:50] [INFO ] Deduced a trap composed of 116 places in 207 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:52] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:52] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:52] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:53] [INFO ] Deduced a trap composed of 121 places in 193 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 326/489 variables, 163/202 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 325/527 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:06] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:08] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:08] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:09] [INFO ] Deduced a trap composed of 110 places in 164 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/489 variables, and 531 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60395ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 60427ms
Starting structural reductions in LTL mode, iteration 1 : 163/196 places, 326/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61629 ms. Remains : 163/196 places, 326/390 transitions.
Support contains 42 out of 163 places after structural reductions.
[2025-06-02 13:19:16] [INFO ] Flatten gal took : 77 ms
[2025-06-02 13:19:16] [INFO ] Flatten gal took : 35 ms
[2025-06-02 13:19:16] [INFO ] Input system was already deterministic with 326 transitions.
RANDOM walk for 40000 steps (8 resets) in 3022 ms. (13 steps per ms) remains 35/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 72 ms. (54 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 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 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 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 25 ms. (153 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 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 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 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 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 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
[2025-06-02 13:19:17] [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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 122/160 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:18] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:18] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:18] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:18] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:18] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:19] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:19] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:19] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 3/163 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 326/489 variables, 163/178 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/489 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 178 constraints, problems are : Problem set: 0 solved, 33 unsolved in 4124 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 122/160 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:22] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 3/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 326/489 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 33/212 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/489 variables, and 212 constraints, problems are : Problem set: 0 solved, 33 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9164ms problems are : Problem set: 0 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 326/326 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 21 place count 163 transition count 305
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 24 rules applied. Total rules applied 45 place count 142 transition count 302
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 141 transition count 300
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 139 transition count 300
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 50 place count 139 transition count 291
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 68 place count 130 transition count 291
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 72 place count 126 transition count 283
Iterating global reduction 4 with 4 rules applied. Total rules applied 76 place count 126 transition count 283
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 106 place count 111 transition count 268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 108 place count 111 transition count 266
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 124 place count 103 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 138 place count 103 transition count 285
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 138 place count 103 transition count 284
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 140 place count 102 transition count 284
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 142 place count 100 transition count 282
Iterating global reduction 5 with 2 rules applied. Total rules applied 144 place count 100 transition count 282
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 5 with 4 rules applied. Total rules applied 148 place count 98 transition count 292
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 159 place count 98 transition count 281
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 172 place count 87 transition count 279
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 174 place count 85 transition count 275
Iterating global reduction 6 with 2 rules applied. Total rules applied 176 place count 85 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 183 place count 85 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 84 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 185 place count 83 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 190 place count 83 transition count 262
Applied a total of 190 rules in 192 ms. Remains 83 /163 variables (removed 80) and now considering 262/326 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 83/163 places, 262/326 transitions.
RANDOM walk for 40000 steps (8 resets) in 606 ms. (65 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 60 ms. (65 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 58 ms. (67 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 60 ms. (65 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 54 ms. (72 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 89 ms. (44 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 62 ms. (63 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 57 ms. (68 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 74 ms. (53 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 56 ms. (70 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 61 ms. (64 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 69 ms. (57 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 60 ms. (65 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 68 ms. (57 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 96 ms. (41 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 95 ms. (41 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
Finished probabilistic random walk after 28630 steps, run visited all 30 properties in 214 ms. (steps per millisecond=133 )
Probabilistic random walk after 28630 steps, saw 7089 distinct states, run finished after 219 ms. (steps per millisecond=130 ) properties seen :30
Computed a total of 14 stabilizing places and 14 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||(!p0&&G(p1))))||((X(p2) U ((X(p2)&&(p3 U (G(p3)||(p3&&G(!p4)))))||X(G(p2)))) U ((!p0&&(X(p2) U ((X(p2)&&(p3 U (G(p3)||(p3&&G(!p4)))))||X(G(p2)))))||G((X(p2) U ((X(p2)&&(p3 U (G(p3)||(p3&&G(!p4)))))||X(G(p2)))))))))'
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 326/326 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 313
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 155 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 155 transition count 312
Applied a total of 16 rules in 28 ms. Remains 155 /163 variables (removed 8) and now considering 312/326 (removed 14) transitions.
// Phase 1: matrix 312 rows 155 cols
[2025-06-02 13:19:29] [INFO ] Computed 7 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:19:29] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-02 13:19:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:19:29] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2025-06-02 13:19:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:35] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:35] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:35] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:35] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:36] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:36] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:36] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:36] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:36] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:37] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:37] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:37] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:38] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:38] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:38] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:38] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:40] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:40] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:40] [INFO ] Deduced a trap composed of 87 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 13:19:41] [INFO ] Deduced a trap composed of 101 places in 177 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 312/467 variables, 155/182 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:52] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/467 variables, and 183 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/467 variables, 155/182 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 311/493 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 494 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 155/163 places, 312/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60721 ms. Remains : 155/163 places, 312/326 transitions.
Stuttering acceptance computed with spot in 3588 ms :[true, (AND p0 (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) p4), (AND p0 (NOT p2) (NOT p3) p4), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) p4 p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) p4 (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) p4), (AND p0 (NOT p3) p4), (AND p0 (NOT p3)), (AND (NOT p3) p4 p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p3) p4 (NOT p1)), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p4), (AND (NOT p2) p4), (AND p0 (NOT p2) p4), (AND p0 (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (NOT p2), (NOT p2), (NOT p2), (NOT p2), p0, (AND p0 (NOT p1)), (NOT p1), p4, (AND p0 p4), (AND p0 (NOT p1) p4), (AND (NOT p1) p4)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 1032 ms.
Product exploration explored 100000 steps with 0 reset in 685 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p3 (NOT p4) p2), (X p2), (X p3), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT p4)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) p4 p3 p2))), (X (NOT (AND (NOT p0) p4 p3 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3) p2))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND p1 p0 p4 (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 (NOT p4) p3 p2))), (X (NOT (AND p1 p0 p4 p3 p2))), (X (NOT (AND p1 (NOT p0) (NOT p3) p2))), (X (NOT (AND p0 (NOT p4) p3 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 (NOT p0) (NOT p4) p3 p2)), (X (NOT (AND (NOT p1) (NOT p0) p4 p3 p2))), (X (NOT (AND p0 (NOT p4) (NOT p3) p2))), (X (NOT (AND p1 p0 (NOT p4) (NOT p3) p2))), (X (NOT (AND p1 (NOT p0) (NOT p4) (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 p4 (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) p4 (NOT p3) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p4 (NOT p3) p2))), (X (NOT (AND p0 p4 p3 p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND p1 (NOT p0) p4 (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) p3 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p4) p3 p2))), (X (NOT (AND (NOT p1) p0 (NOT p4) (NOT p3) p2))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 p4 p3 p2))), (X (AND (NOT p0) (NOT p4) p3 p2)), (X p1), (X (NOT (AND p1 p0 (NOT p3) p2))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) p4 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) p0 p4 p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p4 p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p4) (NOT p2))))), (X (X (NOT (AND p1 p4 p3 p2)))), (X (X (NOT (AND p0 (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p4) p3 p2))), (X (X (NOT (AND p0 p4 p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p4 (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p4 p3 p2)))), (X (X (NOT (AND p1 p0 (NOT p4) p3 p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p4) p3 p2))), (X (X (NOT (AND (NOT p4) (NOT p3) p2)))), (X (X (AND p1 (NOT p4) p3 p2))), (X (X (NOT (AND (NOT p1) p0 p4 (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p4 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p4 p3 p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p0 p4 (NOT p3) p2)))), (X (X (NOT (AND p0 p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p0 p4 p3 p2)))), (X (X (AND (NOT p4) p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0) p4 p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p4 (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p1) p0 p4 p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p4 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND p1 p0 (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND p4 (NOT p2))))), (X (X (NOT (AND p1 p0 p4 (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p4 p3 (NOT p2))))), (X (X (NOT (AND p1 p4 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) p4 (NOT p3) p2)))), (X (X (NOT (AND p4 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p1 p0 p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p4 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p0 p4 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND p1 p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p4 p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 p3 p2)))), (X (X (NOT (AND p1 p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) p4 (NOT p3) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p4 p3 p2)))), (X (X (NOT (AND p1 p0 (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p1 p0 p4 p3 (NOT p2))))), (X (X (NOT (AND p4 p3 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p4 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p1 p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p4 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p4 (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 156 factoid took 713 ms. Reduced automaton from 46 states, 502 edges and 5 AP (stutter sensitive) to 45 states, 491 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 3215 ms :[true, (AND p0 (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p2) (NOT p3)), p4, (AND (NOT p3) p4), (AND (NOT p3) p4 (NOT p2)), (AND p0 (NOT p2) (NOT p3) p4), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) p4 (NOT p2) (NOT p1)), (AND (NOT p3) p4 (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p3) p4), (AND p0 (NOT p3)), (AND (NOT p3) p4 (NOT p1)), (AND (NOT p3) p4 p0 (NOT p1)), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), p0, (NOT p1), (AND p0 (NOT p1)), (AND p0 p4), (AND p4 (NOT p1)), (AND p4 p0 (NOT p1)), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p4), (AND (NOT p2) p4), (AND p0 (NOT p2) p4), (AND p0 (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4)]
RANDOM walk for 40000 steps (8 resets) in 2429 ms. (16 steps per ms) remains 165/165 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 165/165 properties
BEST_FIRST walk for 401 steps (8 resets) in 12 ms. (30 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 165/165 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 27 ms. (14 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 165/165 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 165/165 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
Probabilistic random walk after 100001 steps, saw 19445 distinct states, run finished after 1103 ms. (steps per millisecond=90 ) properties seen :58
[2025-06-02 13:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
Problem apf11 is UNSAT
Problem apf19 is UNSAT
Problem apf23 is UNSAT
Problem apf26 is UNSAT
Problem apf27 is UNSAT
Problem apf29 is UNSAT
Problem apf31 is UNSAT
Problem apf33 is UNSAT
Problem apf38 is UNSAT
Problem apf40 is UNSAT
Problem apf43 is UNSAT
Problem apf45 is UNSAT
Problem apf46 is UNSAT
Problem apf48 is UNSAT
Problem apf51 is UNSAT
Problem apf60 is UNSAT
Problem apf61 is UNSAT
Problem apf63 is UNSAT
Problem apf71 is UNSAT
Problem apf72 is UNSAT
Problem apf73 is UNSAT
Problem apf74 is UNSAT
Problem apf75 is UNSAT
Problem apf81 is UNSAT
Problem apf90 is UNSAT
Problem apf93 is UNSAT
Problem apf94 is UNSAT
Problem apf96 is UNSAT
Problem apf103 is UNSAT
Problem apf109 is UNSAT
Problem apf120 is UNSAT
Problem apf126 is UNSAT
Problem apf128 is UNSAT
Problem apf139 is UNSAT
Problem apf141 is UNSAT
Problem apf146 is UNSAT
Problem apf148 is UNSAT
Problem apf154 is UNSAT
Problem apf162 is UNSAT
At refinement iteration 1 (OVERLAPS) 144/152 variables, 6/6 constraints. Problems are: Problem set: 42 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:42] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 12 ms to minimize.
Problem apf7 is UNSAT
Problem apf14 is UNSAT
Problem apf24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:42] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:42] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 12 ms to minimize.
Problem apf47 is UNSAT
Problem apf86 is UNSAT
Problem apf106 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:42] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 17 ms to minimize.
Problem apf156 is UNSAT
Problem apf160 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 4/10 constraints. Problems are: Problem set: 50 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 50 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 3/155 variables, 1/11 constraints. Problems are: Problem set: 50 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 50 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 312/467 variables, 155/166 constraints. Problems are: Problem set: 50 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 0/166 constraints. Problems are: Problem set: 50 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/467 variables, 0/166 constraints. Problems are: Problem set: 50 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 166 constraints, problems are : Problem set: 50 solved, 57 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 50 solved, 57 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 50 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 144/152 variables, 6/6 constraints. Problems are: Problem set: 50 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 4/10 constraints. Problems are: Problem set: 50 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 50 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 3/155 variables, 1/11 constraints. Problems are: Problem set: 50 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 50 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 312/467 variables, 155/166 constraints. Problems are: Problem set: 50 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 57/223 constraints. Problems are: Problem set: 50 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:49] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:50] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:50] [INFO ] Deduced a trap along path composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 3/226 constraints. Problems are: Problem set: 50 solved, 57 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 226 constraints, problems are : Problem set: 50 solved, 57 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 57/107 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 10124ms problems are : Problem set: 50 solved, 57 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 312/312 transitions.
Graph (trivial) has 147 edges and 155 vertex of which 13 / 155 are part of one of the 3 SCC in 3 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 145 transition count 274
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 29 rules applied. Total rules applied 55 place count 120 transition count 270
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 59 place count 118 transition count 268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 116 transition count 268
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 61 place count 116 transition count 260
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 77 place count 108 transition count 260
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 80 place count 105 transition count 254
Iterating global reduction 4 with 3 rules applied. Total rules applied 83 place count 105 transition count 254
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 123 place count 85 transition count 234
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 127 place count 85 transition count 230
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 129 place count 83 transition count 226
Iterating global reduction 5 with 2 rules applied. Total rules applied 131 place count 83 transition count 226
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 163 place count 67 transition count 314
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 170 place count 67 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 172 place count 66 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 6 with 28 rules applied. Total rules applied 200 place count 66 transition count 290
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 202 place count 64 transition count 288
Iterating global reduction 6 with 2 rules applied. Total rules applied 204 place count 64 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 208 place count 62 transition count 318
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 210 place count 62 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 216 place count 62 transition count 310
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 227 place count 62 transition count 299
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 253 place count 51 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 281 place count 51 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 282 place count 50 transition count 255
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 22 edges and 49 vertex of which 2 / 49 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 284 place count 48 transition count 255
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 296 place count 48 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 10 with 33 rules applied. Total rules applied 329 place count 48 transition count 210
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 330 place count 47 transition count 203
Iterating global reduction 10 with 1 rules applied. Total rules applied 331 place count 47 transition count 203
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 332 place count 46 transition count 198
Iterating global reduction 10 with 1 rules applied. Total rules applied 333 place count 46 transition count 198
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 10 with 2 rules applied. Total rules applied 335 place count 45 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 337 place count 45 transition count 195
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 338 place count 45 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 339 place count 44 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 341 place count 44 transition count 192
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 342 place count 44 transition count 192
Applied a total of 342 rules in 147 ms. Remains 44 /155 variables (removed 111) and now considering 192/312 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 44/155 places, 192/312 transitions.
RANDOM walk for 40000 steps (8 resets) in 764 ms. (52 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4000 steps (8 resets) in 79 ms. (50 steps per ms) remains 49/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 75 ms. (52 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 70 ms. (56 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 84 ms. (47 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 58 ms. (67 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 60 ms. (65 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 81 ms. (48 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 41/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 35/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 72 ms. (54 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 70 ms. (56 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 68 ms. (57 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
[2025-06-02 13:20:52] [INFO ] Flow matrix only has 170 transitions (discarded 22 similar events)
// Phase 1: matrix 170 rows 44 cols
[2025-06-02 13:20:52] [INFO ] Computed 6 invariants in 2 ms
[2025-06-02 13:20:52] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 36/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:52] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:52] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:52] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 170/214 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 37/90 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 90 constraints, problems are : Problem set: 0 solved, 35 unsolved in 2204 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 36/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 170/214 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 37/90 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 125 constraints, problems are : Problem set: 0 solved, 35 unsolved in 3567 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5806ms problems are : Problem set: 0 solved, 35 unsolved
Fused 35 Parikh solutions to 17 different solutions.
Parikh walk visited 9 properties in 2718 ms.
Support contains 8 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 44 /44 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 44/44 places, 192/192 transitions.
RANDOM walk for 40000 steps (8 resets) in 304 ms. (131 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 69 ms. (57 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 57 ms. (68 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
Finished probabilistic random walk after 42725 steps, run visited all 26 properties in 298 ms. (steps per millisecond=143 )
Probabilistic random walk after 42725 steps, saw 8086 distinct states, run finished after 298 ms. (steps per millisecond=143 ) properties seen :26
Found 50 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p3 (NOT p4) p2), (X p2), (X p3), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT p4)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) p4 p3 p2))), (X (NOT (AND (NOT p0) p4 p3 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3) p2))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND p1 p0 p4 (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 (NOT p4) p3 p2))), (X (NOT (AND p1 p0 p4 p3 p2))), (X (NOT (AND p1 (NOT p0) (NOT p3) p2))), (X (NOT (AND p0 (NOT p4) p3 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 (NOT p0) (NOT p4) p3 p2)), (X (NOT (AND (NOT p1) (NOT p0) p4 p3 p2))), (X (NOT (AND p0 (NOT p4) (NOT p3) p2))), (X (NOT (AND p1 p0 (NOT p4) (NOT p3) p2))), (X (NOT (AND p1 (NOT p0) (NOT p4) (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 p4 (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) p4 (NOT p3) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p4 (NOT p3) p2))), (X (NOT (AND p0 p4 p3 p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND p1 (NOT p0) p4 (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) p3 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p4) p3 p2))), (X (NOT (AND (NOT p1) p0 (NOT p4) (NOT p3) p2))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 p4 p3 p2))), (X (AND (NOT p0) (NOT p4) p3 p2)), (X p1), (X (NOT (AND p1 p0 (NOT p3) p2))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) p4 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) p0 p4 p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p4 p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p4) (NOT p2))))), (X (X (NOT (AND p1 p4 p3 p2)))), (X (X (NOT (AND p0 (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p4) p3 p2))), (X (X (NOT (AND p0 p4 p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p4 (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p4 p3 p2)))), (X (X (NOT (AND p1 p0 (NOT p4) p3 p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p4) p3 p2))), (X (X (NOT (AND (NOT p4) (NOT p3) p2)))), (X (X (AND p1 (NOT p4) p3 p2))), (X (X (NOT (AND (NOT p1) p0 p4 (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p4 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p4 p3 p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p0 p4 (NOT p3) p2)))), (X (X (NOT (AND p0 p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p0 p4 p3 p2)))), (X (X (AND (NOT p4) p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0) p4 p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p4 (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p1) p0 p4 p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p4 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND p1 p0 (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND p4 (NOT p2))))), (X (X (NOT (AND p1 p0 p4 (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p4 p3 (NOT p2))))), (X (X (NOT (AND p1 p4 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) p4 (NOT p3) p2)))), (X (X (NOT (AND p4 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p1 p0 p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p4 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p0 p4 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND p1 p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p4 p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 p3 p2)))), (X (X (NOT (AND p1 p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) p4 (NOT p3) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p4 p3 p2)))), (X (X (NOT (AND p1 p0 (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p1 p0 p4 p3 (NOT p2))))), (X (X (NOT (AND p4 p3 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p4 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p1 p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p4 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p4 (NOT p3) (NOT p2))))), (G (OR (NOT p0) p1 (NOT p2) (NOT p3) (NOT p4))), (G (OR (NOT p0) (NOT p1) p2 (NOT p3) (NOT p4))), (G (OR (NOT p0) (NOT p1) (NOT p2) p3 (NOT p4))), (G (OR p2 p3 (NOT p4))), (G (OR (NOT p1) p3 (NOT p4))), (G (OR p0 (NOT p1) p3 (NOT p4))), (G (OR p0 p1 (NOT p2) p3 (NOT p4))), (G (OR (NOT p0) p1 p4)), (G (OR p1 (NOT p2) p3 (NOT p4))), (G (OR (NOT p0) p1 p3 (NOT p4))), (G (OR p1 p2 (NOT p3) (NOT p4))), (G (OR (NOT p0) (NOT p1) p3 (NOT p4))), (G (OR p1 p3 (NOT p4))), (G (OR (NOT p2) p3 (NOT p4))), (G (OR (NOT p0) p1 p2 p4)), (G (OR (NOT p1) p2 p3 (NOT p4))), (G (OR p1 p2 (NOT p4))), (G (OR (NOT p0) p1 p2 (NOT p3) (NOT p4))), (G (OR (NOT p0) p1 p2 p3 (NOT p4))), (G (OR (NOT p0) p1 (NOT p4))), (G (OR (NOT p0) (NOT p1) p2 p3 (NOT p4))), (G (OR (NOT p0) p1 p2 (NOT p4))), (G (OR p0 p1 p2 (NOT p3) (NOT p4))), (G (OR (NOT p0) p1 p2 (NOT p3) p4)), (G (OR (NOT p0) p1 (NOT p2) p3)), (G (OR (NOT p0) p1 p2 p3 p4)), (G (OR p3 (NOT p4))), (G (OR (NOT p0) p1 p2)), (G (OR (NOT p0) p1 (NOT p3) p4)), (G (OR (NOT p0) p1 p3 p4)), (G (OR (NOT p0) p1 (NOT p2) (NOT p3) p4)), (G (OR (NOT p0) (NOT p2) p3 (NOT p4))), (G (OR p0 (NOT p1) p2 p3 (NOT p4))), (G (OR p1 p2 p3 (NOT p4))), (G (OR p0 p1 p2 p3 (NOT p4))), (G (OR p0 p1 p2 (NOT p4))), (G (OR (NOT p0) p2 p3 (NOT p4))), (G (OR (NOT p0) p1 (NOT p2) p3 p4)), (G (OR p0 p1 p3 (NOT p4))), (G (OR (NOT p0) p1 (NOT p3) (NOT p4))), (G (OR (NOT p0) p2 (NOT p3) (NOT p4))), (G (OR (NOT p0) p1 p3)), (G (OR p0 (NOT p1) (NOT p2) p3 (NOT p4))), (G (OR (NOT p0) p2 (NOT p4))), (G (OR (NOT p0) (NOT p1) p2 (NOT p4))), (G (OR (NOT p0) p3 (NOT p4))), (G (OR (NOT p0) p1)), (G (OR (NOT p0) p1 p2 p3)), (G (OR (NOT p1) (NOT p2) p3 (NOT p4))), (G (OR (NOT p0) p1 (NOT p2) p3 (NOT p4)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p1) p2 (NOT p3) (NOT p4)))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR p0 (NOT p1) (NOT p4)))), (F (NOT (OR p0 p1 p2 p3 p4))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR (NOT p1) p2 (NOT p3) p4))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3 p4))), (F (NOT (OR p0 p1 p4))), (F (NOT (OR p1 p2 p4))), (F (NOT (OR p1 p2))), (F (NOT (OR p0 (NOT p1) p2 (NOT p3) p4))), (F (NOT (OR p2 p3 p4))), (F (NOT (AND (NOT p0) p1 (NOT p4)))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p1) p2 p3 p4))), (F (NOT (OR p0 p1 p2 (NOT p3) p4))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3) p4))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3 p4))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p3) p4))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p4)))), (F (NOT (OR p2 (NOT p3) p4))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 (NOT p1) (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p1 p2 p4))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1) p2 p3 p4))), (F (NOT (OR p1 p2 (NOT p3) p4))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) (NOT p1) p3 p4))), (F (NOT (OR p0 (NOT p1) p2 (NOT p3) (NOT p4)))), (F (NOT (AND p1 (NOT p4)))), (F (NOT (OR p0 (NOT p1) p3 p4))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p1 (NOT p2) p3 p4))), (F (NOT (OR (NOT p1) p2 p4))), (F (NOT (OR p2 p4))), (F (NOT (OR p1 (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT (OR p1 p3 p4))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3) (NOT p4)))), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p0) p2 p3 p4))), (F (NOT (OR (NOT p0) p2 p4))), (F (NOT (OR (NOT p0) (NOT p4)))), (F (NOT (OR (NOT p0) p3))), (F (NOT (OR (NOT p2) (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p0) p2 (NOT p3) p4))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3) (NOT p4)))), (F (NOT (OR p1 (NOT p2) (NOT p3) p4))), (F (NOT (AND (NOT p0) p1 p2 p3 (NOT p4)))), (F (NOT (OR p1 (NOT p3) p4))), (F (NOT (OR p1 p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p1) (NOT p4)))), (F (NOT (OR p0 (NOT p1) p2 (NOT p4)))), (F (NOT (AND (NOT p0) p1 p3 (NOT p4)))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (F (NOT (OR p1 (NOT p2) (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3) p4))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p0) (NOT p1) p4))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p2) p3 p4))), (F (NOT (OR (NOT p1) (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p0) p3 p4))), (F (NOT (OR p3 p4))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) p2 p4))), (F (NOT (OR p0 p1 (NOT p3) (NOT p4)))), (F (NOT (OR p0 p1 (NOT p3) p4))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR p1 p4))), (F (NOT (OR (NOT p1) p3 p4))), (F (NOT (OR p2 (NOT p4)))), (F (NOT (OR p1 (NOT p3) (NOT p4)))), (F (NOT (OR p0 p1 p2 p3))), (F (NOT (OR p0 p1))), (F (NOT (OR p2 (NOT p3) (NOT p4)))), (F p4), (F (NOT (AND p3 (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) p2 p3 p4))), (F (NOT (AND p1 p2 p3 (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p1) p2 p4))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3) p4))), (F (NOT (OR (NOT p1) (NOT p2) p3 p4))), (F (NOT (OR p0 p1 (NOT p2) p3 p4))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (OR p0 p1 (NOT p4)))), (F (NOT (OR (NOT p2) p3 p4))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p3) p4))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3) p4))), (F (NOT (OR (NOT p1) p2 (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (AND p2 p3 (NOT p4)))), (F (NOT (OR p1 p2 p3 p4))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (OR (NOT p0) p4))), (F (NOT (OR (NOT p3) (NOT p4)))), (F (NOT (AND p1 p3 (NOT p4)))), (F (NOT (OR p0 p1 p3 p4))), (F (NOT (OR (NOT p1) (NOT p2) p3)))]
Knowledge based reduction with 206 factoid took 17420 ms. Reduced automaton from 45 states, 491 edges and 5 AP (stutter sensitive) to 45 states, 368 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 4525 ms :[true, (AND p0 (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p2) (NOT p3)), p4, (AND (NOT p3) p4), (AND (NOT p3) p4 (NOT p2)), (AND p0 (NOT p2) (NOT p3) p4), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) p4 (NOT p2) (NOT p1)), (AND (NOT p3) p4 (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p3) p4), (AND p0 (NOT p3)), (AND (NOT p3) p4 (NOT p1)), (AND (NOT p3) p4 p0 (NOT p1)), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), p0, (NOT p1), (AND p0 (NOT p1)), (AND p0 p4), (AND p4 (NOT p1)), (AND p4 p0 (NOT p1)), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p4), (AND (NOT p2) p4), (AND p0 (NOT p2) p4), (AND p0 (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4)]
Stuttering acceptance computed with spot in 4700 ms :[true, (AND p0 (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p2) (NOT p3)), p4, (AND (NOT p3) p4), (AND (NOT p3) p4 (NOT p2)), (AND p0 (NOT p2) (NOT p3) p4), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) p4 (NOT p2) (NOT p1)), (AND (NOT p3) p4 (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p3) p4), (AND p0 (NOT p3)), (AND (NOT p3) p4 (NOT p1)), (AND (NOT p3) p4 p0 (NOT p1)), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), p0, (NOT p1), (AND p0 (NOT p1)), (AND p0 p4), (AND p4 (NOT p1)), (AND p4 p0 (NOT p1)), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p4), (AND (NOT p2) p4), (AND p0 (NOT p2) p4), (AND p0 (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4)]
Support contains 8 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 312/312 (removed 0) transitions.
// Phase 1: matrix 312 rows 155 cols
[2025-06-02 13:21:28] [INFO ] Computed 7 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:21:28] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-02 13:21:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:21:28] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2025-06-02 13:21:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:34] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:34] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:35] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:35] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:35] [INFO ] Deduced a trap composed of 24 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 13:21:35] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:35] [INFO ] Deduced a trap composed of 33 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 13:21:36] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:36] [INFO ] Deduced a trap composed of 86 places in 174 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:36] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:37] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:37] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:37] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:38] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:38] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:38] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:39] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:40] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:40] [INFO ] Deduced a trap composed of 87 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:41] [INFO ] Deduced a trap composed of 101 places in 170 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 312/467 variables, 155/182 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:53] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/467 variables, and 183 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/467 variables, 155/182 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 311/493 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:13] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:16] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:17] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:17] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 311 unsolved
SMT process timed out in 60102ms, After SMT, problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Finished structural reductions in LTL mode , in 1 iterations and 60635 ms. Remains : 155/155 places, 312/312 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p3 (NOT p4) p2 (NOT p0) p1), (X p2), (X p3), (X (NOT p4)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p4))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p0 p2 p4))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3 (NOT p4)))), (X (NOT (AND p0 p2 p3 (NOT p4)))), (X (AND (NOT p0) p1 p2 p3 (NOT p4))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2 p4))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (AND p1 p2 p3 (NOT p4)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p3 p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p4)))), (X (X (NOT (AND (NOT p1) p4)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 p2 p3 p4)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p2 p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4))))), (X (X (AND (NOT p0) p1 p2 p3 (NOT p4)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2 p4)))), (X (X (NOT (AND p0 p3 p4)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p4)))), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 p2 p3 p4)))), (X (X (NOT (AND (NOT p2) p3 p4)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3 p4)))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p4))))), (X (X (NOT (AND p1 p2 p4)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 62 factoid took 1467 ms. Reduced automaton from 45 states, 368 edges and 5 AP (stutter sensitive) to 45 states, 368 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 4660 ms :[true, (AND p0 (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p2) (NOT p3)), p4, (AND (NOT p3) p4), (AND (NOT p3) p4 (NOT p2)), (AND p0 (NOT p2) (NOT p3) p4), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) p4 (NOT p2) (NOT p1)), (AND (NOT p3) p4 (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p3) p4), (AND p0 (NOT p3)), (AND (NOT p3) p4 (NOT p1)), (AND (NOT p3) p4 p0 (NOT p1)), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), p0, (NOT p1), (AND p0 (NOT p1)), (AND p0 p4), (AND p4 (NOT p1)), (AND p4 p0 (NOT p1)), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p4), (AND (NOT p2) p4), (AND p0 (NOT p2) p4), (AND p0 (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4)]
RANDOM walk for 40000 steps (8 resets) in 1077 ms. (37 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 68/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 55 ms. (71 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 68/68 properties
[2025-06-02 13:22:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 144/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:36] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:37] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:37] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:37] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 3/155 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 312/467 variables, 155/166 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/467 variables, and 166 constraints, problems are : Problem set: 0 solved, 68 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 144/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:42] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:42] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:42] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:42] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:42] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:43] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:43] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 3/155 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:45] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:45] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:46] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 155/467 variables, and 21 constraints, problems are : Problem set: 0 solved, 68 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 0/68 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10075ms problems are : Problem set: 0 solved, 68 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 312/312 transitions.
Graph (trivial) has 147 edges and 155 vertex of which 13 / 155 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 145 transition count 274
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 29 rules applied. Total rules applied 55 place count 120 transition count 270
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 59 place count 118 transition count 268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 116 transition count 268
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 61 place count 116 transition count 260
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 77 place count 108 transition count 260
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 80 place count 105 transition count 254
Iterating global reduction 4 with 3 rules applied. Total rules applied 83 place count 105 transition count 254
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 123 place count 85 transition count 234
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 127 place count 85 transition count 230
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 129 place count 83 transition count 226
Iterating global reduction 5 with 2 rules applied. Total rules applied 131 place count 83 transition count 226
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 163 place count 67 transition count 314
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 170 place count 67 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 172 place count 66 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 6 with 28 rules applied. Total rules applied 200 place count 66 transition count 290
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 202 place count 64 transition count 288
Iterating global reduction 6 with 2 rules applied. Total rules applied 204 place count 64 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 208 place count 62 transition count 318
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 210 place count 62 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 216 place count 62 transition count 310
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 227 place count 62 transition count 299
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 253 place count 51 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 281 place count 51 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 282 place count 50 transition count 255
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 22 edges and 49 vertex of which 2 / 49 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 284 place count 48 transition count 255
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 296 place count 48 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 10 with 33 rules applied. Total rules applied 329 place count 48 transition count 210
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 330 place count 47 transition count 203
Iterating global reduction 10 with 1 rules applied. Total rules applied 331 place count 47 transition count 203
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 332 place count 46 transition count 198
Iterating global reduction 10 with 1 rules applied. Total rules applied 333 place count 46 transition count 198
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 10 with 2 rules applied. Total rules applied 335 place count 45 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 337 place count 45 transition count 195
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 338 place count 45 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 339 place count 44 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 341 place count 44 transition count 192
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 342 place count 44 transition count 192
Applied a total of 342 rules in 121 ms. Remains 44 /155 variables (removed 111) and now considering 192/312 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 44/155 places, 192/312 transitions.
RANDOM walk for 40000 steps (8 resets) in 1106 ms. (36 steps per ms) remains 54/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 76 ms. (51 steps per ms) remains 49/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 80 ms. (49 steps per ms) remains 40/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 113 ms. (35 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (8 resets) in 70 ms. (56 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (8 resets) in 69 ms. (57 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (8 resets) in 69 ms. (57 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (8 resets) in 65 ms. (60 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (8 resets) in 75 ms. (52 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (8 resets) in 66 ms. (59 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (8 resets) in 72 ms. (54 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 63 ms. (62 steps per ms) remains 32/40 properties
BEST_FIRST walk for 4000 steps (8 resets) in 55 ms. (71 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 60 ms. (65 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 75 ms. (52 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 76 ms. (51 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 69 ms. (57 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 61 ms. (64 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 28/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 25/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
[2025-06-02 13:22:47] [INFO ] Flow matrix only has 170 transitions (discarded 22 similar events)
// Phase 1: matrix 170 rows 44 cols
[2025-06-02 13:22:47] [INFO ] Computed 6 invariants in 2 ms
[2025-06-02 13:22:47] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 36/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:47] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:47] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:47] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 170/214 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 37/90 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:48] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 91 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1844 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 36/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 170/214 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 37/91 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 25/116 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:50] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:51] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/214 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/214 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 118 constraints, problems are : Problem set: 0 solved, 25 unsolved in 4891 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6758ms problems are : Problem set: 0 solved, 25 unsolved
Fused 25 Parikh solutions to 10 different solutions.
Parikh walk visited 9 properties in 1988 ms.
Support contains 8 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 44/44 places, 192/192 transitions.
RANDOM walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
Finished probabilistic random walk after 42725 steps, run visited all 16 properties in 344 ms. (steps per millisecond=124 )
Probabilistic random walk after 42725 steps, saw 8086 distinct states, run finished after 345 ms. (steps per millisecond=123 ) properties seen :16
Knowledge obtained : [(AND p3 (NOT p4) p2 (NOT p0) p1), (X p2), (X p3), (X (NOT p4)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p4))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p0 p2 p4))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3 (NOT p4)))), (X (NOT (AND p0 p2 p3 (NOT p4)))), (X (AND (NOT p0) p1 p2 p3 (NOT p4))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2 p4))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (AND p1 p2 p3 (NOT p4)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p3 p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p4)))), (X (X (NOT (AND (NOT p1) p4)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 p2 p3 p4)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p2 p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4))))), (X (X (AND (NOT p0) p1 p2 p3 (NOT p4)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2 p4)))), (X (X (NOT (AND p0 p3 p4)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p4)))), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 p2 p3 p4)))), (X (X (NOT (AND (NOT p2) p3 p4)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3 p4)))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p4))))), (X (X (NOT (AND p1 p2 p4)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p4))), (F (NOT (OR p0 p2 (NOT p1) p3))), (F (NOT (OR p0 p2 p1 p3))), (F (NOT (AND p1 (NOT p4)))), (F (NOT (OR p1 p4))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p4)))), (F (NOT (OR p1 p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p0 (NOT p2) p1 (NOT p3) p4))), (F (NOT (OR p2 (NOT p3) (NOT p4)))), (F (NOT (AND p2 p1 p3 (NOT p4)))), (F (NOT (OR p0 (NOT p2) (NOT p1) p3))), (F (NOT (OR p2 p4))), (F (NOT (OR p2 (NOT p1) p3))), (F (NOT (OR p0 p2 p1 (NOT p3)))), (F (NOT (OR p1 (NOT p3) (NOT p4)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1 (NOT p3) (NOT p4)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p4))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (AND p1 p3 (NOT p4)))), (F (NOT (OR p2 p1 p3))), (F (NOT p3)), (F (NOT (OR p2 (NOT p3) p4))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1) (NOT p3) (NOT p4)))), (F p0), (F (NOT (OR p2 (NOT p1) (NOT p3) p4))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3) (NOT p4)))), (F (NOT (OR p0 (NOT p2) (NOT p1) (NOT p4)))), (F (NOT (OR (NOT p2) (NOT p1) p3))), (F (NOT (OR p0 (NOT p2) (NOT p1) (NOT p3) (NOT p4)))), (F (NOT (AND (NOT p0) p1 p3 (NOT p4)))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT (OR (NOT p2) p1 (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p3) p4))), (F (NOT (OR p2 p1 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p4)))), (F (NOT (OR p0 p2 (NOT p1) p4))), (F (NOT (OR p0 (NOT p2) p1 p3))), (F (NOT (OR p0 p1 (NOT p3) p4))), (F (NOT (OR (NOT p2) (NOT p4)))), (F (NOT (AND p3 (NOT p4)))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR p0 (NOT p2) p1 (NOT p3) (NOT p4)))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (OR p2 p3))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR p0 p1 (NOT p4)))), (F (NOT p2)), (F p4), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1 (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p4)))), (F (NOT (OR p0 (NOT p1) (NOT p4)))), (F (NOT (AND (NOT p0) p2 p1 p3 (NOT p4)))), (F (NOT (OR p1 (NOT p4)))), (F (NOT (AND (NOT p0) p1 (NOT p4)))), (F (NOT (OR (NOT p2) p1 p3))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 (NOT p2) p1 (NOT p4)))), (F (NOT (AND p2 p3 (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p4)))), (F (NOT (OR (NOT p2) p1 (NOT p3) p4))), (F (NOT (OR (NOT p0) p3))), (F (NOT (OR (NOT p0) (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p1) (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p3) (NOT p4)))), (F (NOT (OR p2 (NOT p1) p4))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3) p4))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p2) (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p2) (NOT p1) (NOT p4)))), (F (NOT (OR (NOT p2) (NOT p1) (NOT p3) (NOT p4)))), (F (NOT (OR p0 p2 (NOT p1) (NOT p3) p4))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p1 (NOT p3) p4)))]
Knowledge based reduction with 62 factoid took 9980 ms. Reduced automaton from 45 states, 368 edges and 5 AP (stutter sensitive) to 45 states, 368 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 4712 ms :[true, (AND p0 (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p2) (NOT p3)), p4, (AND (NOT p3) p4), (AND (NOT p3) p4 (NOT p2)), (AND p0 (NOT p2) (NOT p3) p4), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) p4 (NOT p2) (NOT p1)), (AND (NOT p3) p4 (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p3) p4), (AND p0 (NOT p3)), (AND (NOT p3) p4 (NOT p1)), (AND (NOT p3) p4 p0 (NOT p1)), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), p0, (NOT p1), (AND p0 (NOT p1)), (AND p0 p4), (AND p4 (NOT p1)), (AND p4 p0 (NOT p1)), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p4), (AND (NOT p2) p4), (AND p0 (NOT p2) p4), (AND p0 (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4)]
Stuttering acceptance computed with spot in 4328 ms :[true, (AND p0 (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p2) (NOT p3)), p4, (AND (NOT p3) p4), (AND (NOT p3) p4 (NOT p2)), (AND p0 (NOT p2) (NOT p3) p4), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) p4 (NOT p2) (NOT p1)), (AND (NOT p3) p4 (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p3) p4), (AND p0 (NOT p3)), (AND (NOT p3) p4 (NOT p1)), (AND (NOT p3) p4 p0 (NOT p1)), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), p0, (NOT p1), (AND p0 (NOT p1)), (AND p0 p4), (AND p4 (NOT p1)), (AND p4 p0 (NOT p1)), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p4), (AND (NOT p2) p4), (AND p0 (NOT p2) p4), (AND p0 (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4)]
Stuttering acceptance computed with spot in 4662 ms :[true, (AND p0 (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p2) (NOT p3)), p4, (AND (NOT p3) p4), (AND (NOT p3) p4 (NOT p2)), (AND p0 (NOT p2) (NOT p3) p4), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) p4 (NOT p2) (NOT p1)), (AND (NOT p3) p4 (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p3) p4), (AND p0 (NOT p3)), (AND (NOT p3) p4 (NOT p1)), (AND (NOT p3) p4 p0 (NOT p1)), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), p0, (NOT p1), (AND p0 (NOT p1)), (AND p0 p4), (AND p4 (NOT p1)), (AND p4 p0 (NOT p1)), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p4), (AND (NOT p2) p4), (AND p0 (NOT p2) p4), (AND p0 (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4)]
Product exploration explored 100000 steps with 0 reset in 530 ms.
Product exploration explored 100000 steps with 0 reset in 505 ms.
Applying partial POR strategy [true, false, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 4587 ms :[true, (AND p0 (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p2) (NOT p3)), p4, (AND (NOT p3) p4), (AND (NOT p3) p4 (NOT p2)), (AND p0 (NOT p2) (NOT p3) p4), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) p4 (NOT p2) (NOT p1)), (AND (NOT p3) p4 (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p3) p4), (AND p0 (NOT p3)), (AND (NOT p3) p4 (NOT p1)), (AND (NOT p3) p4 p0 (NOT p1)), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), p0, (NOT p1), (AND p0 (NOT p1)), (AND p0 p4), (AND p4 (NOT p1)), (AND p4 p0 (NOT p1)), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p4), (AND (NOT p2) p4), (AND p0 (NOT p2) p4), (AND p0 (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4), (AND p0 (NOT p1) (NOT p2) p4)]
Support contains 8 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 312/312 transitions.
Graph (trivial) has 147 edges and 155 vertex of which 13 / 155 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 145 transition count 302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 145 transition count 300
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 30 place count 145 transition count 302
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 145 transition count 302
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 41 place count 137 transition count 292
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 137 transition count 292
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 74 place count 137 transition count 294
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 87 place count 124 transition count 278
Deduced a syphon composed of 39 places in 1 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 100 place count 124 transition count 278
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 118 place count 124 transition count 452
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 128 place count 124 transition count 442
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 135 place count 117 transition count 428
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 142 place count 117 transition count 428
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 117 transition count 453
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 116 transition count 451
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 116 transition count 451
Deduced a syphon composed of 51 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 3 with 52 rules applied. Total rules applied 198 place count 116 transition count 399
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 200 place count 114 transition count 397
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 202 place count 114 transition count 397
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 202 rules in 95 ms. Remains 114 /155 variables (removed 41) and now considering 397/312 (removed -85) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:23:26] [INFO ] Redundant transitions in 51 ms returned []
Running 396 sub problems to find dead transitions.
[2025-06-02 13:23:26] [INFO ] Flow matrix only has 365 transitions (discarded 32 similar events)
// Phase 1: matrix 365 rows 114 cols
[2025-06-02 13:23:26] [INFO ] Computed 7 invariants in 4 ms
[2025-06-02 13:23:26] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:32] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 11 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:32] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:32] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 8 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:32] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 4 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:33] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 19 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:33] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 15 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:33] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 12 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:33] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 9 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:33] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:33] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:34] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:34] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 8 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 13/20 constraints. Problems are: Problem set: 68 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:36] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem TDEAD125 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 1/21 constraints. Problems are: Problem set: 69 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/21 constraints. Problems are: Problem set: 69 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 364/478 variables, 114/135 constraints. Problems are: Problem set: 69 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 62/197 constraints. Problems are: Problem set: 69 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/197 constraints. Problems are: Problem set: 69 solved, 327 unsolved
At refinement iteration 8 (OVERLAPS) 1/479 variables, 1/198 constraints. Problems are: Problem set: 69 solved, 327 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 (/ 41.0 8.0))
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 1.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 (/ 15.0 4.0))
(t21 0.0)
(t22 0.0)
(t23 1.0)
(t24 0.0)
(t25 0.0)
(t26 1.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 1.0)
(t35 0.0)
(t36 0.0)
(t37 (/ 1.0 8.0))
(t38 0.0)
(t39 0.0)
(t40 1.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 (/ 3.0 2.0))
(t45 0.0)
(t46 0.0)
(t47 (/ 1.0 2.0))
(t48 0.0)
(t49 2.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 (/ 45.0 8.0))
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 1.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 1.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 1.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 1.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/479 variables, and 198 constraints, problems are : Problem set: 69 solved, 327 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 114/114 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 69 solved, 327 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 69 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 50/114 variables, 7/7 constraints. Problems are: Problem set: 69 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 14/21 constraints. Problems are: Problem set: 69 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/21 constraints. Problems are: Problem set: 69 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 364/478 variables, 114/135 constraints. Problems are: Problem set: 69 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 62/197 constraints. Problems are: Problem set: 69 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 327/524 constraints. Problems are: Problem set: 69 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:13] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:13] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 2/526 constraints. Problems are: Problem set: 69 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/479 variables, and 526 constraints, problems are : Problem set: 69 solved, 327 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 114/114 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 327/396 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60268ms problems are : Problem set: 69 solved, 327 unsolved
Search for dead transitions found 69 dead transitions in 60271ms
Found 69 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 69 transitions
Dead transitions reduction (with SMT) removed 69 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 114/155 places, 328/312 transitions.
Graph (complete) has 472 edges and 114 vertex of which 65 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.2 ms
Discarding 49 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 65 /114 variables (removed 49) and now considering 328/328 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/155 places, 328/312 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60452 ms. Remains : 65/155 places, 328/312 transitions.
Built C files in :
/tmp/ltsmin9987273187072377436
[2025-06-02 13:24:27] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9987273187072377436
Running compilation step : cd /tmp/ltsmin9987273187072377436;'/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 1373 ms.
Running link step : cd /tmp/ltsmin9987273187072377436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin9987273187072377436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10367325218769293778.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 312/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 312/312 (removed 0) transitions.
// Phase 1: matrix 312 rows 155 cols
[2025-06-02 13:24:42] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:24:42] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 13:24:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:24:42] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2025-06-02 13:24:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:48] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:48] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:48] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:48] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:48] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:49] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:49] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:49] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:49] [INFO ] Deduced a trap composed of 86 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:50] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:50] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:50] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:50] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:51] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:51] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:51] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:52] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:53] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:53] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:54] [INFO ] Deduced a trap composed of 101 places in 176 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 312/467 variables, 155/182 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:05] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/467 variables, and 183 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/467 variables, 155/182 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 311/493 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:26] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 494 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Finished structural reductions in LTL mode , in 1 iterations and 60406 ms. Remains : 155/155 places, 312/312 transitions.
Built C files in :
/tmp/ltsmin3031729955390932500
[2025-06-02 13:25:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3031729955390932500
Running compilation step : cd /tmp/ltsmin3031729955390932500;'/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 940 ms.
Running link step : cd /tmp/ltsmin3031729955390932500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3031729955390932500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6737972852351361031.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 13:25:57] [INFO ] Flatten gal took : 35 ms
[2025-06-02 13:25:57] [INFO ] Flatten gal took : 31 ms
[2025-06-02 13:25:57] [INFO ] Time to serialize gal into /tmp/LTL16413753649118525987.gal : 10 ms
[2025-06-02 13:25:57] [INFO ] Time to serialize properties into /tmp/LTL10294086377039253554.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16413753649118525987.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8135245158067719339.hoa' '-atoms' '/tmp/LTL10294086377039253554.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10294086377039253554.prop.
Loaded 5 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8135245158067719339.hoa
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t27, t28, t29, t31, t35, t36, t41, t45, t48, t52, t55, t57, t59, t60, t66, t67,...565
Detected timeout of ITS tools.
[2025-06-02 13:26:13] [INFO ] Flatten gal took : 20 ms
[2025-06-02 13:26:13] [INFO ] Flatten gal took : 19 ms
[2025-06-02 13:26:13] [INFO ] Time to serialize gal into /tmp/LTL6528073117521658707.gal : 5 ms
[2025-06-02 13:26:13] [INFO ] Time to serialize properties into /tmp/LTL12091404743117319646.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6528073117521658707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12091404743117319646.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((!("((p74==1)&&(p123==1))"))U((G(!("((p74==1)&&(p123==1))")))||((!("((p74==1)&&(p123==1))"))&&(G("(p77!=1)")))))||(((X("(p173!=1)"...648
Formula 0 simplified : (F!"(p77!=1)" U "((p74==1)&&(p123==1))") & ("((p74==1)&&(p123==1))" U (X!"(p173!=1)" R (XF!"(p173!=1)" & (X!"(p173!=1)" | (F"(((p26=...201
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t27, t28, t29, t31, t35, t36, t41, t45, t48, t52, t55, t57, t59, t60, t66, t67,...565
Detected timeout of ITS tools.
[2025-06-02 13:26:28] [INFO ] Flatten gal took : 18 ms
[2025-06-02 13:26:28] [INFO ] Applying decomposition
[2025-06-02 13:26:28] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7322764642693960088.txt' '-o' '/tmp/graph7322764642693960088.bin' '-w' '/tmp/graph7322764642693960088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7322764642693960088.bin' '-l' '-1' '-v' '-w' '/tmp/graph7322764642693960088.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:26:28] [INFO ] Decomposing Gal with order
[2025-06-02 13:26:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:26:28] [INFO ] Removed a total of 387 redundant transitions.
[2025-06-02 13:26:28] [INFO ] Flatten gal took : 122 ms
[2025-06-02 13:26:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 26 ms.
[2025-06-02 13:26:28] [INFO ] Time to serialize gal into /tmp/LTL1481035886885761583.gal : 10 ms
[2025-06-02 13:26:28] [INFO ] Time to serialize properties into /tmp/LTL14235637401680525814.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1481035886885761583.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14235637401680525814.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((!("((i3.i0.u22.p74==1)&&(i7.u40.p123==1))"))U((G(!("((i3.i0.u22.p74==1)&&(i7.u40.p123==1))")))||((!("((i3.i0.u22.p74==1)&&(i7.u40...966
Formula 0 simplified : (F!"(i6.i1.u32.p77!=1)" U "((i3.i0.u22.p74==1)&&(i7.u40.p123==1))") & ("((i3.i0.u22.p74==1)&&(i7.u40.p123==1))" U (X!"(i10.i1.u60.p1...313
Reverse transition relation is NOT exact ! Due to transitions t27, t35, t48, t90, t94, t100, t107, t175, t177, t183, t185, t192, t193, t195, t196, t197, t1...813
64 unique states visited
31 strongly connected components in search stack
90 transitions explored
64 items max in DFS search stack
494 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.21189,178424,1,0,362894,273,4565,424482,185,1029,785491
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-16-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property MedleyA-PT-16-LTLFireability-00 finished in 425867 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||X((F((p1&&X(F(p2))))&&F(p0))))))'
Support contains 1 out of 163 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 : 163/163 places, 326/326 transitions.
Graph (trivial) has 174 edges and 163 vertex of which 13 / 163 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 152 transition count 285
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 34 rules applied. Total rules applied 65 place count 122 transition count 281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 120 transition count 281
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 67 place count 120 transition count 270
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 89 place count 109 transition count 270
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 100 place count 98 transition count 248
Iterating global reduction 3 with 11 rules applied. Total rules applied 111 place count 98 transition count 248
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 96 transition count 241
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 96 transition count 241
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 155 place count 76 transition count 221
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 161 place count 76 transition count 215
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 163 place count 74 transition count 211
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 74 transition count 211
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 199 place count 57 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 200 place count 57 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 5 with 23 rules applied. Total rules applied 223 place count 57 transition count 287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
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 227 place count 55 transition count 313
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 228 place count 55 transition count 313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 229 place count 54 transition count 312
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 51 edges and 52 vertex of which 17 / 52 are part of one of the 7 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 232 place count 42 transition count 312
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 273 place count 42 transition count 271
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 275 place count 40 transition count 249
Iterating global reduction 7 with 2 rules applied. Total rules applied 277 place count 40 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 7 with 68 rules applied. Total rules applied 345 place count 40 transition count 181
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 346 place count 39 transition count 176
Iterating global reduction 7 with 1 rules applied. Total rules applied 347 place count 39 transition count 176
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 7 with 4 rules applied. Total rules applied 351 place count 37 transition count 174
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 7 with 2 rules applied. Total rules applied 353 place count 36 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 357 place count 36 transition count 176
Applied a total of 357 rules in 64 ms. Remains 36 /163 variables (removed 127) and now considering 176/326 (removed 150) transitions.
[2025-06-02 13:26:34] [INFO ] Flow matrix only has 157 transitions (discarded 19 similar events)
// Phase 1: matrix 157 rows 36 cols
[2025-06-02 13:26:34] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:26:34] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 13:26:34] [INFO ] Flow matrix only has 157 transitions (discarded 19 similar events)
[2025-06-02 13:26:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:26:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 13:26:35] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:26:35] [INFO ] Redundant transitions in 37 ms returned [116, 122, 123, 150, 151, 152, 153, 157, 158, 159]
Found 10 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 10 transitions
Redundant transitions reduction (with SMT) removed 10 transitions.
Running 162 sub problems to find dead transitions.
[2025-06-02 13:26:35] [INFO ] Flow matrix only has 147 transitions (discarded 19 similar events)
// Phase 1: matrix 147 rows 36 cols
[2025-06-02 13:26:35] [INFO ] Computed 5 invariants in 1 ms
[2025-06-02 13:26:35] [INFO ] State equation strengthened by 37 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, 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 13:26:35] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:35] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:36] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:36] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 146/182 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 37/82 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 13:26:38] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/183 variables, and 83 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8587 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 37/37 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/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 146/182 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 37/83 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 162/245 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/245 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 13:26:52] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 4 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/182 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/183 variables, and 246 constraints, problems are : Problem set: 0 solved, 162 unsolved in 23987 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32626ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 32626ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/163 places, 166/326 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 1 place count 36 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 35 transition count 165
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 33 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 33 transition count 151
Applied a total of 18 rules in 11 ms. Remains 33 /36 variables (removed 3) and now considering 151/166 (removed 15) transitions.
[2025-06-02 13:27:07] [INFO ] Flow matrix only has 135 transitions (discarded 16 similar events)
// Phase 1: matrix 135 rows 33 cols
[2025-06-02 13:27:07] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:27:07] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-02 13:27:07] [INFO ] Flow matrix only has 135 transitions (discarded 16 similar events)
[2025-06-02 13:27:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:27:07] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-02 13:27:07] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/163 places, 151/326 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33137 ms. Remains : 33/163 places, 151/326 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-02 finished in 33222 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)&&(X((p1&&F(p2)&&F(p3)))||F(p4))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 326/326 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 309
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 153 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 153 transition count 308
Applied a total of 20 rules in 8 ms. Remains 153 /163 variables (removed 10) and now considering 308/326 (removed 18) transitions.
// Phase 1: matrix 308 rows 153 cols
[2025-06-02 13:27:08] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:27:08] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-02 13:27:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:27:08] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-02 13:27:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:14] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:14] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:14] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:14] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:14] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:14] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:15] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:15] [INFO ] Deduced a trap composed of 24 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 13:27:15] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:16] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:16] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:16] [INFO ] Deduced a trap composed of 15 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 13:27:16] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:17] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:18] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:18] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:19] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:19] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:23] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:23] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:24] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:27] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 308/461 variables, 153/182 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:36] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:36] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 184 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:41] [INFO ] Deduced a trap composed of 93 places in 203 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:41] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/461 variables, 153/186 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 307/493 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:55] [INFO ] Deduced a trap along path composed of 2 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:55] [INFO ] Deduced a trap along path composed of 2 places in 89 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:55] [INFO ] Deduced a trap along path composed of 17 places in 111 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:58] [INFO ] Deduced a trap along path composed of 16 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:06] [INFO ] Deduced a trap along path composed of 28 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 498 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 153/163 places, 308/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60489 ms. Remains : 153/163 places, 308/326 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p4))), (NOT p0), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (NOT p4), (AND (NOT p4) (NOT p2)), (AND (NOT p4) (NOT p3))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-04
Product exploration explored 100000 steps with 5 reset in 268 ms.
Stack based approach found an accepted trace after 39 steps with 4 reset with depth 32 and stack size 32 in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLFireability-04 finished in 61049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&(p1 U X(G(p2))))) U X(p3)))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 326/326 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 309
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 153 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 153 transition count 308
Applied a total of 20 rules in 7 ms. Remains 153 /163 variables (removed 10) and now considering 308/326 (removed 18) transitions.
[2025-06-02 13:28:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:28:09] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-02 13:28:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:28:09] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-02 13:28:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:15] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:15] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:15] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:15] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:15] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:16] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:16] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:16] [INFO ] Deduced a trap composed of 24 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 13:28:17] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:17] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:17] [INFO ] Deduced a trap composed of 33 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 13:28:18] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:18] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:18] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:19] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:19] [INFO ] Deduced a trap composed of 87 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:20] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:20] [INFO ] Deduced a trap composed of 85 places in 157 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:24] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:24] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:25] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:27] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 308/461 variables, 153/182 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:36] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:37] [INFO ] Deduced a trap composed of 106 places in 187 ms of which 24 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 307 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 461/461 variables, and 184 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:42] [INFO ] Deduced a trap composed of 93 places in 168 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:42] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/461 variables, 153/186 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 307/493 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:56] [INFO ] Deduced a trap along path composed of 2 places in 117 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:57] [INFO ] Deduced a trap along path composed of 2 places in 93 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:57] [INFO ] Deduced a trap along path composed of 17 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:00] [INFO ] Deduced a trap along path composed of 16 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:08] [INFO ] Deduced a trap along path composed of 28 places in 87 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 498 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 153/163 places, 308/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60588 ms. Remains : 153/163 places, 308/326 transitions.
Stuttering acceptance computed with spot in 380 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 99 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 1 ms.
FORMULA MedleyA-PT-16-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLFireability-05 finished in 61117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 326/326 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 311
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 154 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 154 transition count 310
Applied a total of 18 rules in 4 ms. Remains 154 /163 variables (removed 9) and now considering 310/326 (removed 16) transitions.
// Phase 1: matrix 310 rows 154 cols
[2025-06-02 13:29:10] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:29:10] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-02 13:29:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:29:10] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-02 13:29:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:14] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:14] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:14] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:14] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:14] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:14] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:15] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:15] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:15] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:15] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:15] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:16] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:16] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:16] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:16] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:16] [INFO ] Deduced a trap composed of 23 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 13:29:16] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/178 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:22] [INFO ] Deduced a trap composed of 107 places in 102 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 179 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:43] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:44] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:46] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 310/464 variables, 154/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 309/491 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:10] [INFO ] Deduced a trap along path composed of 2 places in 128 ms of which 2 ms to minimize.
SMT process timed out in 60175ms, After SMT, problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 154/163 places, 310/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60560 ms. Remains : 154/163 places, 310/326 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-06 finished in 60776 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)) U p2) U (G(((p0||F(p1)) U p2))||(((p0||F(p1)) U p2)&&X(!p1)))) U p1))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 326/326 transitions.
Graph (trivial) has 163 edges and 163 vertex of which 8 / 163 are part of one of the 2 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 156 transition count 288
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 35 rules applied. Total rules applied 67 place count 125 transition count 284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 123 transition count 284
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 69 place count 123 transition count 274
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 89 place count 113 transition count 274
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 99 place count 103 transition count 254
Iterating global reduction 3 with 10 rules applied. Total rules applied 109 place count 103 transition count 254
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 102 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 102 transition count 250
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 155 place count 80 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 161 place count 80 transition count 222
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 163 place count 78 transition count 218
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 78 transition count 218
Performed 15 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 195 place count 63 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 228 place count 63 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 62 transition count 282
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 58 edges and 60 vertex of which 19 / 60 are part of one of the 8 SCC in 1 ms
Free SCC test removed 11 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 232 place count 49 transition count 282
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 5 with 43 rules applied. Total rules applied 275 place count 49 transition count 239
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 277 place count 47 transition count 217
Iterating global reduction 6 with 2 rules applied. Total rules applied 279 place count 47 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 6 with 68 rules applied. Total rules applied 347 place count 47 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 347 place count 47 transition count 148
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 349 place count 46 transition count 148
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 351 place count 44 transition count 140
Iterating global reduction 6 with 2 rules applied. Total rules applied 353 place count 44 transition count 140
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 357 place count 42 transition count 138
Applied a total of 357 rules in 57 ms. Remains 42 /163 variables (removed 121) and now considering 138/326 (removed 188) transitions.
[2025-06-02 13:30:11] [INFO ] Flow matrix only has 132 transitions (discarded 6 similar events)
// Phase 1: matrix 132 rows 42 cols
[2025-06-02 13:30:11] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:30:11] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 13:30:11] [INFO ] Flow matrix only has 132 transitions (discarded 6 similar events)
[2025-06-02 13:30:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:30:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-02 13:30:11] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:30:11] [INFO ] Redundant transitions in 86 ms returned [117, 137]
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 131 sub problems to find dead transitions.
[2025-06-02 13:30:11] [INFO ] Flow matrix only has 130 transitions (discarded 6 similar events)
// Phase 1: matrix 130 rows 42 cols
[2025-06-02 13:30:11] [INFO ] Computed 5 invariants in 2 ms
[2025-06-02 13:30:11] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:11] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:11] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:12] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:12] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/42 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:13] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:13] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:13] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 129/171 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/172 variables, and 64 constraints, problems are : Problem set: 0 solved, 131 unsolved in 7733 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/42 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 129/171 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 131/195 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/171 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/172 variables, and 195 constraints, problems are : Problem set: 0 solved, 131 unsolved in 13648 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21430ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 21430ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/163 places, 136/326 transitions.
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 2 place count 41 transition count 135
Applied a total of 2 rules in 5 ms. Remains 41 /42 variables (removed 1) and now considering 135/136 (removed 1) transitions.
[2025-06-02 13:30:32] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 41 cols
[2025-06-02 13:30:32] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:30:32] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 13:30:32] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-02 13:30:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:30:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-02 13:30:32] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/163 places, 135/326 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21945 ms. Remains : 41/163 places, 135/326 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-07 finished in 22133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p1)&&p0)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 326/326 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 309
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 153 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 153 transition count 308
Applied a total of 20 rules in 6 ms. Remains 153 /163 variables (removed 10) and now considering 308/326 (removed 18) transitions.
// Phase 1: matrix 308 rows 153 cols
[2025-06-02 13:30:33] [INFO ] Computed 7 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:30:33] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-02 13:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:30:33] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-02 13:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:37] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:37] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:37] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:37] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:37] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:37] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:37] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:38] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:38] [INFO ] Deduced a trap composed of 34 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 13:30:38] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:38] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:38] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:39] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:39] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:40] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:40] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:40] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:40] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:44] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:44] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:45] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:47] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 308/461 variables, 153/182 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:56] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:56] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:02] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 185 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/184 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 307/491 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 492 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 153/163 places, 308/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60430 ms. Remains : 153/163 places, 308/326 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-08 finished in 60737 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) U X(X(X((p1&&F(G(p2)))))))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 326/326 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 309
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 153 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 153 transition count 308
Applied a total of 20 rules in 8 ms. Remains 153 /163 variables (removed 10) and now considering 308/326 (removed 18) transitions.
[2025-06-02 13:31:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:31:34] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-02 13:31:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:31:34] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-02 13:31:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:39] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:40] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:40] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:40] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:40] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:40] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:40] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:41] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:41] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:42] [INFO ] Deduced a trap composed of 23 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 13:31:42] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:42] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:42] [INFO ] Deduced a trap composed of 100 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 13:31:42] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:44] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:44] [INFO ] Deduced a trap composed of 87 places in 168 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:44] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:45] [INFO ] Deduced a trap composed of 85 places in 172 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:49] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:49] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:50] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:53] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 308/461 variables, 153/182 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:02] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:02] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 184 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:07] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:07] [INFO ] Deduced a trap composed of 106 places in 180 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/461 variables, 153/186 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 307/493 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:25] [INFO ] Deduced a trap along path composed of 2 places in 138 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:25] [INFO ] Deduced a trap along path composed of 2 places in 120 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:25] [INFO ] Deduced a trap along path composed of 17 places in 128 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:29] [INFO ] Deduced a trap along path composed of 16 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 497 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 153/163 places, 308/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60621 ms. Remains : 153/163 places, 308/326 transitions.
Stuttering acceptance computed with spot in 724 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (NOT p2), (AND p0 (NOT p2)), p0]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 182 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 1 ms.
FORMULA MedleyA-PT-16-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLFireability-10 finished in 61624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(p1&&F(p2)))))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 326/326 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 311
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 154 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 154 transition count 310
Applied a total of 18 rules in 7 ms. Remains 154 /163 variables (removed 9) and now considering 310/326 (removed 16) transitions.
// Phase 1: matrix 310 rows 154 cols
[2025-06-02 13:32:35] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:32:35] [INFO ] Implicit Places using invariants in 262 ms returned []
[2025-06-02 13:32:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:32:36] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-02 13:32:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:41] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:41] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:41] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:41] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:41] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:42] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:42] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:42] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:42] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:43] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:43] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:43] [INFO ] Deduced a trap composed of 23 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 13:32:44] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:44] [INFO ] Deduced a trap composed of 101 places in 176 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:44] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:44] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:44] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/178 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:52] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:53] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:53] [INFO ] Deduced a trap composed of 94 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:53] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:54] [INFO ] Deduced a trap composed of 94 places in 154 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:54] [INFO ] Deduced a trap composed of 107 places in 162 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 6/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 184 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:09] [INFO ] Deduced a trap composed of 24 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 13:33:10] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:12] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 310/464 variables, 154/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 309/496 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:27] [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:33:27] [INFO ] Deduced a trap along path composed of 17 places in 117 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:27] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 499 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 154/163 places, 310/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60705 ms. Remains : 154/163 places, 310/326 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 258 ms.
Product exploration explored 100000 steps with 33333 reset in 308 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 146 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLFireability-11 finished in 61675 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 (G((p0||G(p1)))||((p0||G(p1))&&X(!p2))))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 326/326 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 311
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 154 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 154 transition count 310
Applied a total of 18 rules in 7 ms. Remains 154 /163 variables (removed 9) and now considering 310/326 (removed 16) transitions.
// Phase 1: matrix 310 rows 154 cols
[2025-06-02 13:33:37] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:33:37] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-02 13:33:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:33:37] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-02 13:33:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:42] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:43] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:43] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:43] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:43] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:43] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:44] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:44] [INFO ] Deduced a trap composed of 87 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:44] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:44] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:45] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:45] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:45] [INFO ] Deduced a trap composed of 100 places in 168 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:46] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:46] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:46] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:46] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:49] [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 13:33:49] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/464 variables, 154/180 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:59] [INFO ] Deduced a trap composed of 106 places in 185 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:59] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 25 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:05] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:06] [INFO ] Deduced a trap composed of 109 places in 199 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 184 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:11] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:11] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:11] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:13] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:14] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 310/464 variables, 154/189 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 309/498 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:32] [INFO ] Deduced a trap along path composed of 2 places in 102 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:32] [INFO ] Deduced a trap along path composed of 2 places in 95 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:32] [INFO ] Deduced a trap along path composed of 17 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 501 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 154/163 places, 310/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60459 ms. Remains : 154/163 places, 310/326 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (NOT p1)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 141 ms.
Product exploration explored 100000 steps with 33333 reset in 170 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 20 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLFireability-12 finished in 61048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1||F(p2)))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 326/326 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 312
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 312
Applied a total of 14 rules in 3 ms. Remains 156 /163 variables (removed 7) and now considering 312/326 (removed 14) transitions.
// Phase 1: matrix 312 rows 156 cols
[2025-06-02 13:34:38] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:34:38] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-02 13:34:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:34:38] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2025-06-02 13:34:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:43] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:44] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:44] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:44] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:44] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:44] [INFO ] Deduced a trap composed of 89 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:45] [INFO ] Deduced a trap composed of 35 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 13:34:46] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:46] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:46] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:46] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:46] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:46] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:47] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:48] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:49] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:50] [INFO ] Deduced a trap composed of 108 places in 174 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:53] [INFO ] Deduced a trap composed of 95 places in 201 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 312/468 variables, 156/181 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:03] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:04] [INFO ] Deduced a trap composed of 24 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:35:05] [INFO ] Deduced a trap composed of 108 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 13:35:05] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 21 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/468 variables, and 185 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:12] [INFO ] Deduced a trap composed of 112 places in 212 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 312/468 variables, 156/186 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 311/497 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:21] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:21] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:22] [INFO ] Deduced a trap composed of 99 places in 221 ms of which 40 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 3/500 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 500 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60076ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Starting structural reductions in LTL mode, iteration 1 : 156/163 places, 312/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60512 ms. Remains : 156/163 places, 312/326 transitions.
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (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 14 factoid took 24 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLFireability-13 finished in 61133 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(F(p0)) U (F(G(p1)) U p0)))'
Support contains 3 out of 163 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 : 163/163 places, 326/326 transitions.
Graph (trivial) has 153 edges and 163 vertex of which 8 / 163 are part of one of the 2 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 156 transition count 291
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 32 rules applied. Total rules applied 61 place count 128 transition count 287
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 126 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 125 transition count 286
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 65 place count 125 transition count 274
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 89 place count 113 transition count 274
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 101 place count 101 transition count 250
Iterating global reduction 4 with 12 rules applied. Total rules applied 113 place count 101 transition count 250
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 99 transition count 243
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 99 transition count 243
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 157 place count 79 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 159 place count 79 transition count 221
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 161 place count 77 transition count 217
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 77 transition count 217
Performed 12 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 187 place count 65 transition count 292
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 220 place count 65 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 64 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 224 place count 63 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 225 place count 62 transition count 266
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 57 edges and 60 vertex of which 21 / 60 are part of one of the 8 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 228 place count 47 transition count 266
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 6 with 45 rules applied. Total rules applied 273 place count 47 transition count 221
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 275 place count 45 transition count 200
Iterating global reduction 7 with 2 rules applied. Total rules applied 277 place count 45 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 7 with 66 rules applied. Total rules applied 343 place count 45 transition count 134
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 7 with 1 rules applied. Total rules applied 344 place count 45 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 345 place count 44 transition count 133
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 348 place count 41 transition count 125
Iterating global reduction 9 with 3 rules applied. Total rules applied 351 place count 41 transition count 125
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 9 with 2 rules applied. Total rules applied 353 place count 40 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 355 place count 39 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 361 place count 39 transition count 122
Applied a total of 361 rules in 56 ms. Remains 39 /163 variables (removed 124) and now considering 122/326 (removed 204) transitions.
[2025-06-02 13:35:39] [INFO ] Flow matrix only has 118 transitions (discarded 4 similar events)
// Phase 1: matrix 118 rows 39 cols
[2025-06-02 13:35:39] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:35:39] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 13:35:39] [INFO ] Flow matrix only has 118 transitions (discarded 4 similar events)
[2025-06-02 13:35:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:35:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 13:35:39] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:35:39] [INFO ] Redundant transitions in 65 ms returned [91, 115]
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 116 sub problems to find dead transitions.
[2025-06-02 13:35:39] [INFO ] Flow matrix only has 116 transitions (discarded 4 similar events)
// Phase 1: matrix 116 rows 39 cols
[2025-06-02 13:35:39] [INFO ] Computed 5 invariants in 1 ms
[2025-06-02 13:35:39] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:40] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:40] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:40] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:40] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:40] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:40] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:40] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 115/154 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/155 variables, and 59 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5516 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 115/154 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 116/175 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/155 variables, and 175 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7137 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12693ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 12694ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/163 places, 120/326 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 37 transition count 118
Applied a total of 4 rules in 2 ms. Remains 37 /39 variables (removed 2) and now considering 118/120 (removed 2) transitions.
[2025-06-02 13:35:52] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
// Phase 1: matrix 114 rows 37 cols
[2025-06-02 13:35:52] [INFO ] Computed 5 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:35:52] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 13:35:52] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
[2025-06-02 13:35:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:35:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 13:35:52] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/163 places, 118/326 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13181 ms. Remains : 37/163 places, 118/326 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-14 finished in 13242 ms.
All properties solved by simple procedures.
Total runtime 1059107 ms.

BK_STOP 1748871352625

--------------------
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-16"
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-16, 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-174876524100220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-16.tgz
mv MedleyA-PT-16 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;