fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r128-smll-174876524000124
Last Updated
June 24, 2025

About the Execution of ITS-Tools for MedleyA-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 457992.00 0.00 0.00 FFTFFFFFFFFTFFTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 28K 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-04-LTLFireability-00
FORMULA_NAME MedleyA-PT-04-LTLFireability-01
FORMULA_NAME MedleyA-PT-04-LTLFireability-02
FORMULA_NAME MedleyA-PT-04-LTLFireability-03
FORMULA_NAME MedleyA-PT-04-LTLFireability-04
FORMULA_NAME MedleyA-PT-04-LTLFireability-05
FORMULA_NAME MedleyA-PT-04-LTLFireability-06
FORMULA_NAME MedleyA-PT-04-LTLFireability-07
FORMULA_NAME MedleyA-PT-04-LTLFireability-08
FORMULA_NAME MedleyA-PT-04-LTLFireability-09
FORMULA_NAME MedleyA-PT-04-LTLFireability-10
FORMULA_NAME MedleyA-PT-04-LTLFireability-11
FORMULA_NAME MedleyA-PT-04-LTLFireability-12
FORMULA_NAME MedleyA-PT-04-LTLFireability-13
FORMULA_NAME MedleyA-PT-04-LTLFireability-14
FORMULA_NAME MedleyA-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748843995313

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-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 05:59:57] [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 05:59:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:59:58] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2025-06-02 05:59:58] [INFO ] Transformed 115 places.
[2025-06-02 05:59:58] [INFO ] Transformed 107 transitions.
[2025-06-02 05:59:58] [INFO ] Found NUPN structural information;
[2025-06-02 05:59:58] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 107
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 105 transition count 98
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 105 transition count 98
Applied a total of 19 rules in 79 ms. Remains 105 /115 variables (removed 10) and now considering 98/107 (removed 9) transitions.
// Phase 1: matrix 98 rows 105 cols
[2025-06-02 05:59:58] [INFO ] Computed 8 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:59:59] [INFO ] Implicit Places using invariants in 366 ms returned []
[2025-06-02 05:59:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:59:59] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2025-06-02 05:59:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:01] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:01] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:01] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:01] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:01] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:01] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:02] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:02] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:02] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:02] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:02] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:02] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:02] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:02] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:02] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:02] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:02] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:03] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:03] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:03] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:03] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:03] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:03] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:03] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:04] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:04] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:04] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:04] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:04] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:05] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:05] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:06] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 98/203 variables, 105/145 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:08] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:08] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:08] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:09] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:09] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 150 constraints, problems are : Problem set: 0 solved, 97 unsolved in 14025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:14] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 98/203 variables, 105/151 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 97/248 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:17] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:20] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:21] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:22] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 203/203 variables, and 252 constraints, problems are : Problem set: 0 solved, 97 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44196ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 44218ms
Starting structural reductions in LTL mode, iteration 1 : 105/115 places, 98/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44985 ms. Remains : 105/115 places, 98/107 transitions.
Support contains 41 out of 105 places after structural reductions.
[2025-06-02 06:00:43] [INFO ] Flatten gal took : 54 ms
[2025-06-02 06:00:44] [INFO ] Flatten gal took : 22 ms
[2025-06-02 06:00:44] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 40 out of 105 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (1132 resets) in 1990 ms. (20 steps per ms) remains 7/33 properties
BEST_FIRST walk for 40002 steps (306 resets) in 240 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (341 resets) in 219 ms. (181 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (334 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (304 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (335 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (305 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
[2025-06-02 06:00:45] [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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 44/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 31/82 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 98/180 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/203 variables, 23/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:45] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:45] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 115 constraints, problems are : Problem set: 0 solved, 6 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 44/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 31/82 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 98/180 variables, 82/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 23/203 variables, 23/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/203 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 121 constraints, problems are : Problem set: 0 solved, 6 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1314ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 4071 ms.
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 98/98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 105 transition count 83
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 90 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 90 transition count 73
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 80 transition count 73
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 77 transition count 70
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 77 transition count 70
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 94 place count 58 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 58 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 57 transition count 50
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 57 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 55 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 55 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 54 transition count 48
Applied a total of 101 rules in 52 ms. Remains 54 /105 variables (removed 51) and now considering 48/98 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 54/105 places, 48/98 transitions.
RANDOM walk for 40000 steps (3394 resets) in 293 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1795 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1792 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1810 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1823 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1747 resets) in 116 ms. (341 steps per ms) remains 4/6 properties
// Phase 1: matrix 48 rows 54 cols
[2025-06-02 06:00:50] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 34/44 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 37/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/83 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 14/97 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/97 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:51] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/97 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/98 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/98 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/98 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 4/102 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/102 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:51] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:51] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/102 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/102 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/102 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 65 constraints, problems are : Problem set: 0 solved, 4 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 34/44 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 37/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/83 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/83 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 14/97 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/97 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/97 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/98 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/98 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/98 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/102 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/102 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/102 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:51] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/102 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/102 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/102 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 70 constraints, problems are : Problem set: 0 solved, 4 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1190ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 757 ms.
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 48/48 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 54 transition count 47
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 53 transition count 47
Applied a total of 2 rules in 7 ms. Remains 53 /54 variables (removed 1) and now considering 47/48 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 53/54 places, 47/48 transitions.
RANDOM walk for 40000 steps (3345 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1782 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1843 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1833 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1817 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 5650 steps, run visited all 4 properties in 75 ms. (steps per millisecond=75 )
Probabilistic random walk after 5650 steps, saw 2736 distinct states, run finished after 82 ms. (steps per millisecond=68 ) properties seen :4
Computed a total of 105 stabilizing places and 98 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 105 transition count 98
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 X(p0)))'
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 100 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 100 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 99 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 99 transition count 92
Applied a total of 12 rules in 30 ms. Remains 99 /105 variables (removed 6) and now considering 92/98 (removed 6) transitions.
// Phase 1: matrix 92 rows 99 cols
[2025-06-02 06:00:53] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:00:54] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-02 06:00:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:00:54] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-02 06:00:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:55] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:55] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:55] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:56] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:56] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:56] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:56] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:56] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:56] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:57] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:57] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:57] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:57] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:58] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:58] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:58] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:58] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:58] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 125 constraints, problems are : Problem set: 0 solved, 91 unsolved in 7682 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:04] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:17] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 6 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/191 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:23] [INFO ] Deduced a trap composed of 25 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 06:01:23] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:30] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/191 variables, and 221 constraints, problems are : Problem set: 0 solved, 91 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37742ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 37744ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 92/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38127 ms. Remains : 99/105 places, 92/98 transitions.
Stuttering acceptance computed with spot in 385 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-00 finished in 38618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 104 transition count 84
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 91 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 90 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 28 place count 90 transition count 73
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 48 place count 80 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 78 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 78 transition count 71
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 90 place count 59 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 56 transition count 50
Applied a total of 95 rules in 57 ms. Remains 56 /105 variables (removed 49) and now considering 50/98 (removed 48) transitions.
// Phase 1: matrix 50 rows 56 cols
[2025-06-02 06:01:32] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:01:32] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 06:01:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:01:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 06:01:32] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:01:32] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-02 06:01:32] [INFO ] Invariant cache hit.
[2025-06-02 06:01:32] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:33] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:33] [INFO ] Deduced a trap composed of 4 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 06:01:33] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:33] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:35] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 69 constraints, problems are : Problem set: 0 solved, 48 unsolved in 3471 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 48/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 1/106 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 117 constraints, problems are : Problem set: 0 solved, 48 unsolved in 7765 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11258ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 11260ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/105 places, 50/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11571 ms. Remains : 56/105 places, 50/98 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-01
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-01 finished in 11723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(!p0))&&F((p1||(!p2&&X(G(p3))))))||X(X(G(!p0)))))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 100 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 100 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 99 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 99 transition count 92
Applied a total of 12 rules in 6 ms. Remains 99 /105 variables (removed 6) and now considering 92/98 (removed 6) transitions.
// Phase 1: matrix 92 rows 99 cols
[2025-06-02 06:01:44] [INFO ] Computed 8 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:01:44] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 06:01:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:01:44] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-02 06:01:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:45] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:45] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:45] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:45] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:45] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:45] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:46] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:46] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:47] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:47] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:47] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:47] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:48] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 120 constraints, problems are : Problem set: 0 solved, 91 unsolved in 7160 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/211 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:53] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:53] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:54] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:56] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:56] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:56] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:57] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:01] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:07] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/191 variables, and 220 constraints, problems are : Problem set: 0 solved, 91 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37191ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 37192ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 92/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37405 ms. Remains : 99/105 places, 92/98 transitions.
Stuttering acceptance computed with spot in 394 ms :[p0, p0, (AND p0 (NOT p1) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) p2)), p0, (AND p0 (NOT p1) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) p2)), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 344 ms.
Product exploration explored 100000 steps with 33333 reset in 253 ms.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 (NOT p2) p3 (NOT p0)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) p3 p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (G p1)), (F (G (NOT p2))), (F (G p3)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 24 factoid took 47 ms. Reduced automaton from 10 states, 23 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-04-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-02 finished in 38576 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)&&F(p1)&&F(p2)))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 104 transition count 84
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 91 transition count 84
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 26 place count 91 transition count 74
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 46 place count 81 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 79 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 79 transition count 72
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 2 with 40 rules applied. Total rules applied 90 place count 59 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 57 transition count 51
Applied a total of 93 rules in 37 ms. Remains 57 /105 variables (removed 48) and now considering 51/98 (removed 47) transitions.
// Phase 1: matrix 51 rows 57 cols
[2025-06-02 06:02:22] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:02:22] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-02 06:02:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:02:23] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:02:23] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2025-06-02 06:02:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:23] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:23] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:23] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 1/57 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 51/108 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 70 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2330 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 1/57 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 51/108 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:27] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/108 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 0/108 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 121 constraints, problems are : Problem set: 0 solved, 50 unsolved in 5793 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8147ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 8148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/105 places, 51/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8441 ms. Remains : 57/105 places, 51/98 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-03
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-03 finished in 8611 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((X(p1)&&p0))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 99 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 99 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 91
Applied a total of 14 rules in 5 ms. Remains 98 /105 variables (removed 7) and now considering 91/98 (removed 7) transitions.
// Phase 1: matrix 91 rows 98 cols
[2025-06-02 06:02:31] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:02:31] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 06:02:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:02:31] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-02 06:02:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:32] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:32] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:33] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:33] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:33] [INFO ] Deduced a trap composed of 19 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 06:02:33] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:33] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:34] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:35] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:35] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:35] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:35] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 118 constraints, problems are : Problem set: 0 solved, 90 unsolved in 7420 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:39] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 90/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:41] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:43] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:50] [INFO ] Deduced a trap along path composed of 8 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:51] [INFO ] Deduced a trap along path composed of 8 places in 52 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:00] [INFO ] Deduced a trap along path composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:05] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/189 variables, and 215 constraints, problems are : Problem set: 0 solved, 90 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 37443ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 37443ms
Starting structural reductions in LTL mode, iteration 1 : 98/105 places, 91/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37643 ms. Remains : 98/105 places, 91/98 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-04
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-04 finished in 37769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(X(G(p1)) U G(p2)))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 104 transition count 86
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 24 place count 93 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 91 transition count 84
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 26 place count 91 transition count 73
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 48 place count 80 transition count 73
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 52 place count 76 transition count 69
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 76 transition count 69
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 90 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 56 transition count 50
Applied a total of 94 rules in 16 ms. Remains 56 /105 variables (removed 49) and now considering 50/98 (removed 48) transitions.
// Phase 1: matrix 50 rows 56 cols
[2025-06-02 06:03:09] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 06:03:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:09] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:03:09] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-02 06:03: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/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:09] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:10] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:10] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 68 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2621 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 48/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 1/106 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:15] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/106 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 117 constraints, problems are : Problem set: 0 solved, 48 unsolved in 7134 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9765ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 9766ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/105 places, 50/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9958 ms. Remains : 56/105 places, 50/98 transitions.
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-05 finished in 10379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)||X(X(X(F(p2))))))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 104 transition count 84
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 91 transition count 84
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 26 place count 91 transition count 74
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 46 place count 81 transition count 74
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 78 transition count 71
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 78 transition count 71
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 2 with 40 rules applied. Total rules applied 92 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 57 transition count 50
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 95 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 55 transition count 49
Applied a total of 96 rules in 26 ms. Remains 55 /105 variables (removed 50) and now considering 49/98 (removed 49) transitions.
// Phase 1: matrix 49 rows 55 cols
[2025-06-02 06:03:19] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:19] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 06:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:19] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:03:19] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-02 06:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:19] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:20] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:20] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:20] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:20] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 49/104 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 67 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1891 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 49/104 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 48/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:23] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/104 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/104 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 116 constraints, problems are : Problem set: 0 solved, 48 unsolved in 6177 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8085ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 8086ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/105 places, 49/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8287 ms. Remains : 55/105 places, 49/98 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-06 finished in 8461 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))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 100 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 100 transition count 93
Applied a total of 10 rules in 4 ms. Remains 100 /105 variables (removed 5) and now considering 93/98 (removed 5) transitions.
// Phase 1: matrix 93 rows 100 cols
[2025-06-02 06:03:27] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:28] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-02 06:03:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:28] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2025-06-02 06:03: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/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:29] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:29] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:29] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:29] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:29] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:29] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:29] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/193 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:30] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:30] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:31] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:31] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:31] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:31] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 122 constraints, problems are : Problem set: 0 solved, 92 unsolved in 6265 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/193 variables, 100/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 92/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:36] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:37] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:38] [INFO ] Deduced a trap composed of 17 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 06:03:39] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 218 constraints, problems are : Problem set: 0 solved, 92 unsolved in 25923 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32206ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 32207ms
Starting structural reductions in LTL mode, iteration 1 : 100/105 places, 93/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32461 ms. Remains : 100/105 places, 93/98 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-07 finished in 32633 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)||X(p1)))&&(G(p0)||X(X(!p2)))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 99 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 99 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 91
Applied a total of 14 rules in 5 ms. Remains 98 /105 variables (removed 7) and now considering 91/98 (removed 7) transitions.
// Phase 1: matrix 91 rows 98 cols
[2025-06-02 06:04:00] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:04:00] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-02 06:04:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:04:00] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-02 06:04:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:02] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:02] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:02] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:02] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:02] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:02] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:03] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:04] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:04] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:04] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:04] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:04] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 118 constraints, problems are : Problem set: 0 solved, 90 unsolved in 7495 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:09] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 90/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:11] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:13] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:21] [INFO ] Deduced a trap along path composed of 8 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:21] [INFO ] Deduced a trap along path composed of 8 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:29] [INFO ] Deduced a trap along path composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:33] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/189 variables, and 215 constraints, problems are : Problem set: 0 solved, 90 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 37522ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 37522ms
Starting structural reductions in LTL mode, iteration 1 : 98/105 places, 91/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37879 ms. Remains : 98/105 places, 91/98 transitions.
Stuttering acceptance computed with spot in 371 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), p2, (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0)), p2, true, (NOT p0), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-08 finished in 38284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0))&&(F(p1)||X(G(p2)))))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 100 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 100 transition count 93
Applied a total of 10 rules in 3 ms. Remains 100 /105 variables (removed 5) and now considering 93/98 (removed 5) transitions.
// Phase 1: matrix 93 rows 100 cols
[2025-06-02 06:04:38] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:04:38] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 06:04:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:04:39] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2025-06-02 06:04:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:39] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:39] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:40] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:40] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:40] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:40] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:40] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:40] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:40] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 93/193 variables, 100/117 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:41] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:42] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:42] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:42] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:42] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:42] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:42] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:42] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:42] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:42] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 127 constraints, problems are : Problem set: 0 solved, 92 unsolved in 7367 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/193 variables, 100/127 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 92/219 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:54] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:54] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 4 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/193 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:00] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:05] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 223 constraints, problems are : Problem set: 0 solved, 92 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37387ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 37387ms
Starting structural reductions in LTL mode, iteration 1 : 100/105 places, 93/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37618 ms. Remains : 100/105 places, 93/98 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-09 finished in 37839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 104 transition count 82
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 89 transition count 82
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 89 transition count 72
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 79 transition count 72
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 76 transition count 69
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 76 transition count 69
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 2 with 40 rules applied. Total rules applied 96 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 55 transition count 48
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 99 place count 54 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 53 transition count 47
Applied a total of 100 rules in 15 ms. Remains 53 /105 variables (removed 52) and now considering 47/98 (removed 51) transitions.
// Phase 1: matrix 47 rows 53 cols
[2025-06-02 06:05:16] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:16] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-02 06:05:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:16] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:05:16] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2025-06-02 06:05:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:17] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 47/100 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 65 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1837 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 47/100 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 46/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 111 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2754 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4600ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 4600ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/105 places, 47/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4761 ms. Remains : 53/105 places, 47/98 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-10
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-10 finished in 4868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(p0) U p1)&&p2) U !F((X(p1)||p1))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 100 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 100 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 99 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 99 transition count 92
Applied a total of 12 rules in 4 ms. Remains 99 /105 variables (removed 6) and now considering 92/98 (removed 6) transitions.
// Phase 1: matrix 92 rows 99 cols
[2025-06-02 06:05:21] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:21] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 06:05:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:21] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-02 06:05:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:23] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:23] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:23] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:23] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:23] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:23] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:23] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:23] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:24] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:25] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:25] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:25] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:25] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:25] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 121 constraints, problems are : Problem set: 0 solved, 91 unsolved in 7342 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/212 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:30] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:31] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:32] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:32] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:32] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:51] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 4 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/191 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/191 variables, and 218 constraints, problems are : Problem set: 0 solved, 91 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37364ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 37365ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 92/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37683 ms. Remains : 99/105 places, 92/98 transitions.
Stuttering acceptance computed with spot in 170 ms :[p1, true, p1, p1, (AND p1 (NOT p0))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-12
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-12 finished in 37874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0)&&X(p1)) U p1))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 99 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 99 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 91
Applied a total of 14 rules in 3 ms. Remains 98 /105 variables (removed 7) and now considering 91/98 (removed 7) transitions.
// Phase 1: matrix 91 rows 98 cols
[2025-06-02 06:05:59] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:59] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 06:05:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:59] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-02 06:05:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:01] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:01] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:01] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:01] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:01] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:01] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:01] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:02] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:03] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:03] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:03] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:03] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 118 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6910 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:07] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 90/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:08] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:10] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:17] [INFO ] Deduced a trap along path composed of 8 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:17] [INFO ] Deduced a trap along path composed of 8 places in 35 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:25] [INFO ] Deduced a trap along path composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:29] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/189 variables, and 215 constraints, problems are : Problem set: 0 solved, 90 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 36932ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 36933ms
Starting structural reductions in LTL mode, iteration 1 : 98/105 places, 91/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37195 ms. Remains : 98/105 places, 91/98 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-13 finished in 37433 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||G(p1)))))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 105 transition count 84
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 91 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 90 transition count 83
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 30 place count 90 transition count 72
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 52 place count 79 transition count 72
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 76 transition count 69
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 76 transition count 69
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 94 place count 58 transition count 51
Applied a total of 94 rules in 13 ms. Remains 58 /105 variables (removed 47) and now considering 51/98 (removed 47) transitions.
// Phase 1: matrix 51 rows 58 cols
[2025-06-02 06:06:36] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:06:37] [INFO ] Implicit Places using invariants in 87 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/105 places, 51/98 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 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 50
Applied a total of 2 rules in 4 ms. Remains 56 /57 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 56 cols
[2025-06-02 06:06:37] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:06:37] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-02 06:06:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:06:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 06:06:37] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/105 places, 50/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 363 ms. Remains : 56/105 places, 50/98 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-14
Product exploration explored 100000 steps with 13695 reset in 284 ms.
Product exploration explored 100000 steps with 13522 reset in 333 ms.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 21 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-14 finished in 1182 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))||G((F(p2)&&p1))))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 100 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 100 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 99 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 99 transition count 92
Applied a total of 12 rules in 3 ms. Remains 99 /105 variables (removed 6) and now considering 92/98 (removed 6) transitions.
// Phase 1: matrix 92 rows 99 cols
[2025-06-02 06:06:38] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:06:38] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 06:06:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:06:38] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-02 06:06: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/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:39] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:39] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:39] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:39] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:39] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:39] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:39] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:40] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:40] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:41] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:42] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:42] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:42] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:42] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 121 constraints, problems are : Problem set: 0 solved, 91 unsolved in 7806 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/212 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:47] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:48] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:49] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:49] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:49] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:10] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/191 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/191 variables, and 218 constraints, problems are : Problem set: 0 solved, 91 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37828ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 37829ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 92/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38065 ms. Remains : 99/105 places, 92/98 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-15
Product exploration explored 100000 steps with 7184 reset in 114 ms.
Product exploration explored 100000 steps with 7047 reset in 502 ms.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 263 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 272 steps (7 resets) in 7 ms. (34 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 18 factoid took 625 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 99 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 : 99/99 places, 92/92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 83
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 90 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 89 transition count 82
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 18 place count 89 transition count 70
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 42 place count 77 transition count 70
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 78 place count 59 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 56 transition count 50
Applied a total of 83 rules in 16 ms. Remains 56 /99 variables (removed 43) and now considering 50/92 (removed 42) transitions.
// Phase 1: matrix 50 rows 56 cols
[2025-06-02 06:07:18] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:07:18] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 06:07:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:07:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 06:07:18] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:07:18] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-02 06:07:18] [INFO ] Invariant cache hit.
[2025-06-02 06:07:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:19] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:19] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:19] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:19] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:20] [INFO ] Deduced a trap along path composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:21] [INFO ] Deduced a trap along path composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/106 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 70 constraints, problems are : Problem set: 0 solved, 48 unsolved in 3335 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 48/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:23] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 1/106 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 119 constraints, problems are : Problem set: 0 solved, 48 unsolved in 6648 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 9997ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 9998ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/99 places, 50/92 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10297 ms. Remains : 56/99 places, 50/92 transitions.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 737 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0)]
Knowledge based reduction with 6 factoid took 1014 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
[2025-06-02 06:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 06:07:31] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-02 06:07:31] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-02 06:07:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 06:07:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-02 06:07:31] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-06-02 06:07:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 06:07:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-02 06:07:31] [INFO ] Computed and/alt/rep : 46/98/46 causal constraints (skipped 2 transitions) in 12 ms.
[2025-06-02 06:07:31] [INFO ] Added : 29 causal constraints over 6 iterations in 126 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 34762 reset in 124 ms.
Product exploration explored 100000 steps with 34642 reset in 296 ms.
Built C files in :
/tmp/ltsmin14511461505481927040
[2025-06-02 06:07:32] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2025-06-02 06:07:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:07:32] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2025-06-02 06:07:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:07:32] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2025-06-02 06:07:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:07:32] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14511461505481927040
Running compilation step : cd /tmp/ltsmin14511461505481927040;'/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 546 ms.
Running link step : cd /tmp/ltsmin14511461505481927040;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin14511461505481927040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14235188460788221918.hoa' '--buchi-type=spotba'
LTSmin run took 180 ms.
FORMULA MedleyA-PT-04-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-04-LTLFireability-15 finished in 54852 ms.
All properties solved by simple procedures.
Total runtime 455084 ms.

BK_STOP 1748844453305

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

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