Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339900428.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 MedleyB-PT-B01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339900428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.2K Jun 6 09:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 6 09:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 12:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 6 09:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 6 09:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 6 09:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 155K Jun 5 20:08 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 MedleyB-PT-B01-LTLFireability-00
FORMULA_NAME MedleyB-PT-B01-LTLFireability-01
FORMULA_NAME MedleyB-PT-B01-LTLFireability-02
FORMULA_NAME MedleyB-PT-B01-LTLFireability-03
FORMULA_NAME MedleyB-PT-B01-LTLFireability-04
FORMULA_NAME MedleyB-PT-B01-LTLFireability-05
FORMULA_NAME MedleyB-PT-B01-LTLFireability-06
FORMULA_NAME MedleyB-PT-B01-LTLFireability-07
FORMULA_NAME MedleyB-PT-B01-LTLFireability-08
FORMULA_NAME MedleyB-PT-B01-LTLFireability-09
FORMULA_NAME MedleyB-PT-B01-LTLFireability-10
FORMULA_NAME MedleyB-PT-B01-LTLFireability-11
FORMULA_NAME MedleyB-PT-B01-LTLFireability-12
FORMULA_NAME MedleyB-PT-B01-LTLFireability-13
FORMULA_NAME MedleyB-PT-B01-LTLFireability-14
FORMULA_NAME MedleyB-PT-B01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749385742893

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-08 12:29:04] [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-08 12:29:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 12:29:04] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2025-06-08 12:29:04] [INFO ] Transformed 925 places.
[2025-06-08 12:29:04] [INFO ] Transformed 1037 transitions.
[2025-06-08 12:29:04] [INFO ] Found NUPN structural information;
[2025-06-08 12:29:04] [INFO ] Parsed PT model containing 925 places and 1037 transitions and 2433 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MedleyB-PT-B01-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 925 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 925/925 places, 1037/1037 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 854 transition count 966
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 854 transition count 966
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 187 place count 809 transition count 921
Iterating global reduction 0 with 45 rules applied. Total rules applied 232 place count 809 transition count 921
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 256 place count 785 transition count 897
Iterating global reduction 0 with 24 rules applied. Total rules applied 280 place count 785 transition count 897
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 300 place count 765 transition count 877
Iterating global reduction 0 with 20 rules applied. Total rules applied 320 place count 765 transition count 877
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 336 place count 749 transition count 861
Iterating global reduction 0 with 16 rules applied. Total rules applied 352 place count 749 transition count 861
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 368 place count 733 transition count 845
Iterating global reduction 0 with 16 rules applied. Total rules applied 384 place count 733 transition count 845
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 400 place count 717 transition count 829
Iterating global reduction 0 with 16 rules applied. Total rules applied 416 place count 717 transition count 829
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 431 place count 702 transition count 814
Iterating global reduction 0 with 15 rules applied. Total rules applied 446 place count 702 transition count 814
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 460 place count 688 transition count 800
Iterating global reduction 0 with 14 rules applied. Total rules applied 474 place count 688 transition count 800
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 485 place count 677 transition count 789
Iterating global reduction 0 with 11 rules applied. Total rules applied 496 place count 677 transition count 789
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 498 place count 677 transition count 787
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 502 place count 673 transition count 783
Iterating global reduction 1 with 4 rules applied. Total rules applied 506 place count 673 transition count 783
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 510 place count 669 transition count 779
Iterating global reduction 1 with 4 rules applied. Total rules applied 514 place count 669 transition count 779
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 516 place count 667 transition count 777
Iterating global reduction 1 with 2 rules applied. Total rules applied 518 place count 667 transition count 777
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 520 place count 665 transition count 775
Iterating global reduction 1 with 2 rules applied. Total rules applied 522 place count 665 transition count 775
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 523 place count 664 transition count 774
Iterating global reduction 1 with 1 rules applied. Total rules applied 524 place count 664 transition count 774
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 525 place count 663 transition count 773
Iterating global reduction 1 with 1 rules applied. Total rules applied 526 place count 663 transition count 773
Applied a total of 526 rules in 758 ms. Remains 663 /925 variables (removed 262) and now considering 773/1037 (removed 264) transitions.
// Phase 1: matrix 773 rows 663 cols
[2025-06-08 12:29:05] [INFO ] Computed 4 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:29:05] [INFO ] Implicit Places using invariants in 459 ms returned []
[2025-06-08 12:29:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:29:06] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Running 772 sub problems to find dead transitions.
[2025-06-08 12:29:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 1 (OVERLAPS) 1/663 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 772 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:28] [INFO ] Deduced a trap composed of 308 places in 246 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:28] [INFO ] Deduced a trap composed of 309 places in 227 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:29] [INFO ] Deduced a trap composed of 314 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:32] [INFO ] Deduced a trap composed of 320 places in 246 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:32] [INFO ] Deduced a trap composed of 321 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:35] [INFO ] Deduced a trap composed of 311 places in 263 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:35] [INFO ] Deduced a trap composed of 321 places in 150 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/1436 variables, and 11 constraints, problems are : Problem set: 0 solved, 772 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/663 constraints, PredecessorRefiner: 772/772 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 772 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 1 (OVERLAPS) 1/663 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 772 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:45] [INFO ] Deduced a trap composed of 316 places in 168 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:46] [INFO ] Deduced a trap composed of 317 places in 219 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:52] [INFO ] Deduced a trap composed of 315 places in 230 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:55] [INFO ] Deduced a trap composed of 314 places in 301 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:55] [INFO ] Deduced a trap composed of 311 places in 245 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:55] [INFO ] Deduced a trap composed of 316 places in 221 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:56] [INFO ] Deduced a trap composed of 315 places in 301 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:56] [INFO ] Deduced a trap composed of 316 places in 245 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:57] [INFO ] Deduced a trap composed of 314 places in 166 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:57] [INFO ] Deduced a trap composed of 322 places in 184 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:59] [INFO ] Deduced a trap composed of 316 places in 244 ms of which 93 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/663 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 772 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/1436 variables, and 22 constraints, problems are : Problem set: 0 solved, 772 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/663 constraints, PredecessorRefiner: 0/772 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 772 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Starting structural reductions in LTL mode, iteration 1 : 663/925 places, 773/1037 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62100 ms. Remains : 663/925 places, 773/1037 transitions.
Support contains 26 out of 663 places after structural reductions.
[2025-06-08 12:30:06] [INFO ] Flatten gal took : 68 ms
[2025-06-08 12:30:06] [INFO ] Flatten gal took : 38 ms
[2025-06-08 12:30:06] [INFO ] Input system was already deterministic with 773 transitions.
RANDOM walk for 40000 steps (659 resets) in 972 ms. (41 steps per ms) remains 15/25 properties
BEST_FIRST walk for 4001 steps (16 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (15 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (15 resets) in 28 ms. (137 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (15 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
[2025-06-08 12:30:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 633/649 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:07] [INFO ] Deduced a trap composed of 308 places in 320 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:08] [INFO ] Deduced a trap composed of 308 places in 203 ms of which 66 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 14/663 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 773/1436 variables, 663/669 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1436 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/1436 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1436/1436 variables, and 669 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2646 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 663/663 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 633/649 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:10] [INFO ] Deduced a trap composed of 315 places in 313 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:10] [INFO ] Deduced a trap composed of 315 places in 207 ms of which 76 ms to minimize.
Problem AtomicPropp3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:11] [INFO ] Deduced a trap composed of 314 places in 286 ms of which 121 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:11] [INFO ] Deduced a trap composed of 314 places in 228 ms of which 72 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/649 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 14/663 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 773/1436 variables, 663/673 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1436 variables, 14/687 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:13] [INFO ] Deduced a trap composed of 320 places in 305 ms of which 132 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1436 variables, 1/688 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:14] [INFO ] Deduced a trap composed of 321 places in 157 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1436 variables, 1/689 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1436/1436 variables, and 689 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 663/663 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7666ms problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 663 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 663/663 places, 773/773 transitions.
Graph (trivial) has 632 edges and 663 vertex of which 39 / 663 are part of one of the 7 SCC in 6 ms
Free SCC test removed 32 places
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Graph (complete) has 918 edges and 631 vertex of which 629 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 453 transitions
Trivial Post-agglo rules discarded 453 transitions
Performed 453 trivial Post agglomeration. Transition count delta: 453
Iterating post reduction 0 with 454 rules applied. Total rules applied 456 place count 629 transition count 276
Reduce places removed 453 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 464 rules applied. Total rules applied 920 place count 176 transition count 265
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 926 place count 172 transition count 263
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 930 place count 170 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 931 place count 169 transition count 261
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 38 Pre rules applied. Total rules applied 931 place count 169 transition count 223
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 1007 place count 131 transition count 223
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 1055 place count 107 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1059 place count 107 transition count 195
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1072 place count 94 transition count 145
Iterating global reduction 6 with 13 rules applied. Total rules applied 1085 place count 94 transition count 145
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1091 place count 94 transition count 139
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1097 place count 88 transition count 133
Iterating global reduction 7 with 6 rules applied. Total rules applied 1103 place count 88 transition count 133
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1108 place count 83 transition count 128
Iterating global reduction 7 with 5 rules applied. Total rules applied 1113 place count 83 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1115 place count 83 transition count 126
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1125 place count 78 transition count 121
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1133 place count 74 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1134 place count 74 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1135 place count 74 transition count 138
Free-agglomeration rule applied 18 times.
Iterating global reduction 9 with 18 rules applied. Total rules applied 1153 place count 74 transition count 120
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1174 place count 56 transition count 117
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1177 place count 53 transition count 114
Iterating global reduction 10 with 3 rules applied. Total rules applied 1180 place count 53 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1181 place count 53 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 11 with 23 rules applied. Total rules applied 1204 place count 53 transition count 90
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1206 place count 53 transition count 90
Applied a total of 1206 rules in 80 ms. Remains 53 /663 variables (removed 610) and now considering 90/773 (removed 683) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 53/663 places, 90/773 transitions.
RANDOM walk for 36727 steps (11 resets) in 233 ms. (156 steps per ms) remains 0/14 properties
FORMULA MedleyB-PT-B01-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA MedleyB-PT-B01-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 125 stabilizing places and 131 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 773/773 transitions.
Graph (trivial) has 659 edges and 663 vertex of which 50 / 663 are part of one of the 9 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 462 rules applied. Total rules applied 463 place count 621 transition count 263
Reduce places removed 462 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 473 rules applied. Total rules applied 936 place count 159 transition count 252
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 940 place count 155 transition count 252
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 940 place count 155 transition count 216
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1012 place count 119 transition count 216
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1021 place count 110 transition count 207
Iterating global reduction 3 with 9 rules applied. Total rules applied 1030 place count 110 transition count 207
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1034 place count 106 transition count 203
Iterating global reduction 3 with 4 rules applied. Total rules applied 1038 place count 106 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1040 place count 106 transition count 201
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1041 place count 105 transition count 200
Iterating global reduction 4 with 1 rules applied. Total rules applied 1042 place count 105 transition count 200
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1043 place count 104 transition count 199
Iterating global reduction 4 with 1 rules applied. Total rules applied 1044 place count 104 transition count 199
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 1084 place count 84 transition count 178
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1100 place count 68 transition count 127
Iterating global reduction 4 with 16 rules applied. Total rules applied 1116 place count 68 transition count 127
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1123 place count 68 transition count 120
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1132 place count 59 transition count 108
Iterating global reduction 5 with 9 rules applied. Total rules applied 1141 place count 59 transition count 108
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1150 place count 50 transition count 96
Iterating global reduction 5 with 9 rules applied. Total rules applied 1159 place count 50 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1163 place count 50 transition count 92
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1177 place count 43 transition count 101
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1178 place count 42 transition count 95
Iterating global reduction 6 with 1 rules applied. Total rules applied 1179 place count 42 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1180 place count 42 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1183 place count 42 transition count 91
Applied a total of 1183 rules in 47 ms. Remains 42 /663 variables (removed 621) and now considering 91/773 (removed 682) transitions.
[2025-06-08 12:30:15] [INFO ] Flow matrix only has 87 transitions (discarded 4 similar events)
// Phase 1: matrix 87 rows 42 cols
[2025-06-08 12:30:15] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:30:15] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-08 12:30:15] [INFO ] Flow matrix only has 87 transitions (discarded 4 similar events)
[2025-06-08 12:30:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:30:15] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-08 12:30:15] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:30:15] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-08 12:30:15] [INFO ] Flow matrix only has 87 transitions (discarded 4 similar events)
[2025-06-08 12:30:15] [INFO ] Invariant cache hit.
[2025-06-08 12:30:15] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:16] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:16] [INFO ] Deduced a trap composed of 17 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-08 12:30:16] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:16] [INFO ] Deduced a trap composed of 14 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-08 12:30:16] [INFO ] Deduced a trap composed of 19 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-08 12:30:16] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:16] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 86/128 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/129 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 67 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2901 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 86/128 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 82/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/129 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 149 constraints, problems are : Problem set: 0 solved, 82 unsolved in 4609 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7531ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 7532ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/663 places, 91/773 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7676 ms. Remains : 42/663 places, 91/773 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-00
Product exploration explored 100000 steps with 587 reset in 143 ms.
Product exploration explored 100000 steps with 119 reset in 67 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 34452 steps (5677 resets) in 275 ms. (124 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 91/91 transitions.
Applied a total of 0 rules in 7 ms. Remains 42 /42 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-08 12:30:24] [INFO ] Flow matrix only has 87 transitions (discarded 4 similar events)
[2025-06-08 12:30:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:30:24] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-08 12:30:24] [INFO ] Flow matrix only has 87 transitions (discarded 4 similar events)
[2025-06-08 12:30:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:30:24] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-08 12:30:24] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:30:24] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-08 12:30:24] [INFO ] Flow matrix only has 87 transitions (discarded 4 similar events)
[2025-06-08 12:30:24] [INFO ] Invariant cache hit.
[2025-06-08 12:30:24] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:24] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:24] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:24] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:24] [INFO ] Deduced a trap composed of 14 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-08 12:30:24] [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-08 12:30:24] [INFO ] Deduced a trap composed of 19 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-08 12:30:25] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 86/128 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/129 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 67 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2949 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 86/128 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 82/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/129 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 149 constraints, problems are : Problem set: 0 solved, 82 unsolved in 4523 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7492ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 7492ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7629 ms. Remains : 42/42 places, 91/91 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 28862 steps (4720 resets) in 53 ms. (534 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 175 reset in 38 ms.
Product exploration explored 100000 steps with 16 reset in 146 ms.
Built C files in :
/tmp/ltsmin18362473880696595666
[2025-06-08 12:30:32] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2025-06-08 12:30:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:30:32] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2025-06-08 12:30:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:30:32] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2025-06-08 12:30:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:30:32] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18362473880696595666
Running compilation step : cd /tmp/ltsmin18362473880696595666;'/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 286 ms.
Running link step : cd /tmp/ltsmin18362473880696595666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin18362473880696595666;'/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/stateBased7919031266165700817.hoa' '--buchi-type=spotba'
LTSmin run took 144 ms.
FORMULA MedleyB-PT-B01-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyB-PT-B01-LTLFireability-00 finished in 17507 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)&&F(p1)) U X((p2&&F(p3)))))'
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 773/773 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 652 transition count 762
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 652 transition count 762
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 643 transition count 753
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 643 transition count 753
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 637 transition count 747
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 637 transition count 747
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 631 transition count 741
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 631 transition count 741
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 626 transition count 736
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 626 transition count 736
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 623 transition count 733
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 623 transition count 733
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 81 place count 623 transition count 732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 622 transition count 731
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 622 transition count 731
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 621 transition count 730
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 621 transition count 730
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 621 transition count 729
Applied a total of 86 rules in 137 ms. Remains 621 /663 variables (removed 42) and now considering 729/773 (removed 44) transitions.
// Phase 1: matrix 729 rows 621 cols
[2025-06-08 12:30:33] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:30:33] [INFO ] Implicit Places using invariants in 266 ms returned []
[2025-06-08 12:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:30:34] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
Running 728 sub problems to find dead transitions.
[2025-06-08 12:30:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:55] [INFO ] Deduced a trap composed of 289 places in 219 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:55] [INFO ] Deduced a trap composed of 290 places in 210 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:58] [INFO ] Deduced a trap composed of 297 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:58] [INFO ] Deduced a trap composed of 298 places in 152 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:59] [INFO ] Deduced a trap composed of 317 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:00] [INFO ] Deduced a trap composed of 311 places in 208 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:02] [INFO ] Deduced a trap composed of 290 places in 271 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:02] [INFO ] Deduced a trap composed of 297 places in 184 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:02] [INFO ] Deduced a trap composed of 310 places in 148 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:02] [INFO ] Deduced a trap composed of 310 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:03] [INFO ] Deduced a trap composed of 299 places in 295 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:03] [INFO ] Deduced a trap composed of 311 places in 255 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:04] [INFO ] Deduced a trap composed of 304 places in 280 ms of which 113 ms to minimize.
SMT process timed out in 30156ms, After SMT, problems are : Problem set: 0 solved, 728 unsolved
Search for dead transitions found 0 dead transitions in 30160ms
Starting structural reductions in LTL mode, iteration 1 : 621/663 places, 729/773 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31053 ms. Remains : 621/663 places, 729/773 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B01-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLFireability-02 finished in 31451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(X(X(!p0)))) U (p1&&(p2 U p0)))))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 773/773 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 653 transition count 763
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 653 transition count 763
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 644 transition count 754
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 644 transition count 754
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 637 transition count 747
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 637 transition count 747
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 630 transition count 740
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 630 transition count 740
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 624 transition count 734
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 624 transition count 734
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 620 transition count 730
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 620 transition count 730
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 87 place count 620 transition count 729
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 618 transition count 727
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 618 transition count 727
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 616 transition count 725
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 616 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 616 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 615 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 615 transition count 723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 614 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 614 transition count 722
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 613 transition count 721
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 613 transition count 721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 612 transition count 720
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 612 transition count 720
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 611 transition count 719
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 611 transition count 719
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 610 transition count 718
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 610 transition count 718
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 609 transition count 717
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 609 transition count 717
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 608 transition count 716
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 608 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 607 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 607 transition count 715
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 606 transition count 714
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 606 transition count 714
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 605 transition count 713
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 605 transition count 713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 604 transition count 712
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 604 transition count 712
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 604 transition count 711
Applied a total of 121 rules in 237 ms. Remains 604 /663 variables (removed 59) and now considering 711/773 (removed 62) transitions.
// Phase 1: matrix 711 rows 604 cols
[2025-06-08 12:31:04] [INFO ] Computed 4 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:31:05] [INFO ] Implicit Places using invariants in 266 ms returned []
[2025-06-08 12:31:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:31:05] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-08 12:31:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (OVERLAPS) 1/604 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:23] [INFO ] Deduced a trap composed of 297 places in 189 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:24] [INFO ] Deduced a trap composed of 290 places in 190 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:25] [INFO ] Deduced a trap composed of 307 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:29] [INFO ] Deduced a trap composed of 290 places in 226 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:30] [INFO ] Deduced a trap composed of 289 places in 279 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:30] [INFO ] Deduced a trap composed of 297 places in 199 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:30] [INFO ] Deduced a trap composed of 308 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:32] [INFO ] Deduced a trap composed of 291 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:32] [INFO ] Deduced a trap composed of 290 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:33] [INFO ] Deduced a trap composed of 290 places in 208 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:34] [INFO ] Deduced a trap composed of 291 places in 316 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:34] [INFO ] Deduced a trap composed of 296 places in 288 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:34] [INFO ] Deduced a trap composed of 302 places in 236 ms of which 95 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 604/1315 variables, and 17 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/604 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (OVERLAPS) 1/604 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:47] [INFO ] Deduced a trap composed of 301 places in 152 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:48] [INFO ] Deduced a trap composed of 301 places in 117 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/604 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:56] [INFO ] Deduced a trap composed of 289 places in 125 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/1315 variables, and 20 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/604 constraints, PredecessorRefiner: 0/710 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 604/663 places, 711/773 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61079 ms. Remains : 604/663 places, 711/773 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, p0, (NOT p0), p0, p0]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLFireability-03 finished in 61364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(p0))||(F(p0)&&X((p0||F(p1)))))))))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 773/773 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 652 transition count 762
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 652 transition count 762
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 643 transition count 753
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 643 transition count 753
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 635 transition count 745
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 635 transition count 745
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 627 transition count 737
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 627 transition count 737
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 79 place count 620 transition count 730
Iterating global reduction 0 with 7 rules applied. Total rules applied 86 place count 620 transition count 730
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 615 transition count 725
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 615 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 615 transition count 724
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 612 transition count 721
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 612 transition count 721
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 106 place count 609 transition count 718
Iterating global reduction 1 with 3 rules applied. Total rules applied 109 place count 609 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 607 transition count 715
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 605 transition count 713
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 605 transition count 713
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 604 transition count 711
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 603 transition count 710
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 602 transition count 709
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 602 transition count 709
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 601 transition count 708
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 600 transition count 707
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 599 transition count 706
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 598 transition count 705
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 598 transition count 705
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 597 transition count 704
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 597 transition count 704
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 596 transition count 703
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 596 transition count 703
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 595 transition count 702
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 595 transition count 702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 595 transition count 701
Applied a total of 140 rules in 214 ms. Remains 595 /663 variables (removed 68) and now considering 701/773 (removed 72) transitions.
// Phase 1: matrix 701 rows 595 cols
[2025-06-08 12:32:06] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:32:06] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-06-08 12:32:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:32:06] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2025-06-08 12:32:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (OVERLAPS) 1/595 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:26] [INFO ] Deduced a trap composed of 289 places in 216 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:27] [INFO ] Deduced a trap composed of 289 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:29] [INFO ] Deduced a trap composed of 290 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:32] [INFO ] Deduced a trap composed of 292 places in 213 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:32] [INFO ] Deduced a trap composed of 290 places in 272 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:32] [INFO ] Deduced a trap composed of 292 places in 278 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:33] [INFO ] Deduced a trap composed of 291 places in 271 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:33] [INFO ] Deduced a trap composed of 291 places in 236 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:33] [INFO ] Deduced a trap composed of 297 places in 153 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:33] [INFO ] Deduced a trap composed of 297 places in 195 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:34] [INFO ] Deduced a trap composed of 291 places in 210 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:34] [INFO ] Deduced a trap composed of 297 places in 149 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:34] [INFO ] Deduced a trap composed of 297 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:35] [INFO ] Deduced a trap composed of 296 places in 157 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 595/1296 variables, and 18 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/595 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (OVERLAPS) 1/595 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:47] [INFO ] Deduced a trap composed of 291 places in 214 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:52] [INFO ] Deduced a trap composed of 292 places in 181 ms of which 62 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/595 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/1296 variables, and 20 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/595 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 595/663 places, 701/773 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61039 ms. Remains : 595/663 places, 701/773 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-04
Product exploration explored 100000 steps with 25000 reset in 157 ms.
Product exploration explored 100000 steps with 25000 reset in 161 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (660 resets) in 114 ms. (347 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (162 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (162 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
[2025-06-08 12:33:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 194/196 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 399/595 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:08] [INFO ] Deduced a trap composed of 289 places in 115 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 701/1296 variables, 595/600 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1296 variables, 0/600 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1296 variables, 0/600 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1296/1296 variables, and 600 constraints, problems are : Problem set: 1 solved, 1 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 595/595 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 195/196 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 399/595 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 701/1296 variables, 595/600 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1296 variables, 1/601 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1296 variables, 0/601 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1296 variables, 0/601 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1296/1296 variables, and 601 constraints, problems are : Problem set: 1 solved, 1 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 595/595 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 960ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 12003 steps, including 174 resets, run visited all 1 properties in 25 ms. (steps per millisecond=480 )
Parikh walk visited 1 properties in 28 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyB-PT-B01-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B01-LTLFireability-04 finished in 62936 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||(p1 U (p2||G(p1)))))))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 773/773 transitions.
Graph (trivial) has 655 edges and 663 vertex of which 48 / 663 are part of one of the 8 SCC in 2 ms
Free SCC test removed 40 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 460 transitions
Trivial Post-agglo rules discarded 460 transitions
Performed 460 trivial Post agglomeration. Transition count delta: 460
Iterating post reduction 0 with 460 rules applied. Total rules applied 461 place count 622 transition count 266
Reduce places removed 460 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 471 rules applied. Total rules applied 932 place count 162 transition count 255
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 937 place count 158 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 938 place count 157 transition count 254
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 938 place count 157 transition count 220
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 1006 place count 123 transition count 220
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1014 place count 115 transition count 212
Iterating global reduction 4 with 8 rules applied. Total rules applied 1022 place count 115 transition count 212
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1025 place count 112 transition count 209
Iterating global reduction 4 with 3 rules applied. Total rules applied 1028 place count 112 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1030 place count 112 transition count 207
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1031 place count 111 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 1032 place count 111 transition count 206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1033 place count 110 transition count 205
Iterating global reduction 5 with 1 rules applied. Total rules applied 1034 place count 110 transition count 205
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 1078 place count 88 transition count 182
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1095 place count 71 transition count 130
Iterating global reduction 5 with 17 rules applied. Total rules applied 1112 place count 71 transition count 130
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1119 place count 71 transition count 123
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1128 place count 62 transition count 111
Iterating global reduction 6 with 9 rules applied. Total rules applied 1137 place count 62 transition count 111
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1146 place count 53 transition count 99
Iterating global reduction 6 with 9 rules applied. Total rules applied 1155 place count 53 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1159 place count 53 transition count 95
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1171 place count 47 transition count 102
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1172 place count 46 transition count 96
Iterating global reduction 7 with 1 rules applied. Total rules applied 1173 place count 46 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1174 place count 46 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1177 place count 46 transition count 92
Applied a total of 1177 rules in 48 ms. Remains 46 /663 variables (removed 617) and now considering 92/773 (removed 681) transitions.
[2025-06-08 12:33:08] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
// Phase 1: matrix 88 rows 46 cols
[2025-06-08 12:33:08] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:33:08] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-08 12:33:08] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2025-06-08 12:33:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:33:08] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-08 12:33:09] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:33:09] [INFO ] Redundant transitions in 2 ms returned []
Running 87 sub problems to find dead transitions.
[2025-06-08 12:33:09] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2025-06-08 12:33:09] [INFO ] Invariant cache hit.
[2025-06-08 12:33:09] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:09] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:09] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:09] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:09] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:09] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 87/133 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:10] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 1/134 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 71 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3240 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 87/133 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 87/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:14] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:16] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/134 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 14 (OVERLAPS) 0/134 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 160 constraints, problems are : Problem set: 0 solved, 87 unsolved in 8657 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11910ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 11911ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/663 places, 92/773 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12051 ms. Remains : 46/663 places, 92/773 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-05
Product exploration explored 100000 steps with 168 reset in 153 ms.
Product exploration explored 100000 steps with 224 reset in 137 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 10 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4480 resets) in 82 ms. (481 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (929 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1058 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
[2025-06-08 12:33:21] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2025-06-08 12:33:21] [INFO ] Invariant cache hit.
[2025-06-08 12:33:21] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/44 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/130 variables, 44/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 15/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/133 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 1/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 65 constraints, problems are : Problem set: 1 solved, 1 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/130 variables, 44/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 15/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 1/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:21] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/133 variables, 2/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 1/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/134 variables, 1/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/134 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 67 constraints, problems are : Problem set: 1 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 92/92 transitions.
Graph (complete) has 160 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 45 transition count 86
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 42 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 41 transition count 100
Free-agglomeration rule applied 17 times with reduction of 11 identical transitions.
Iterating global reduction 1 with 17 rules applied. Total rules applied 31 place count 41 transition count 72
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 66 place count 23 transition count 55
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 20 transition count 55
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 72 place count 17 transition count 52
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 17 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 78 place count 17 transition count 49
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 90 place count 11 transition count 31
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 108 place count 11 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 110 place count 10 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 112 place count 10 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 113 place count 9 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 114 place count 8 transition count 11
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 116 place count 8 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 117 place count 8 transition count 10
Applied a total of 117 rules in 12 ms. Remains 8 /46 variables (removed 38) and now considering 10/92 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 8/46 places, 10/92 transitions.
RANDOM walk for 40000 steps (15 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Probably explored full state space saw : 11 states, properties seen :0
Probabilistic random walk after 24 steps, saw 11 distinct states, run finished after 8 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 11 states, properties seen :0
Exhaustive walk after 24 steps, saw 11 distinct states, run finished after 2 ms. (steps per millisecond=12 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p2 p0 p1)), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 13 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyB-PT-B01-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B01-LTLFireability-05 finished in 13067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 773/773 transitions.
Graph (trivial) has 659 edges and 663 vertex of which 50 / 663 are part of one of the 9 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 462 rules applied. Total rules applied 463 place count 621 transition count 263
Reduce places removed 462 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 473 rules applied. Total rules applied 936 place count 159 transition count 252
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 941 place count 155 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 942 place count 154 transition count 251
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 942 place count 154 transition count 216
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1012 place count 119 transition count 216
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1022 place count 109 transition count 206
Iterating global reduction 4 with 10 rules applied. Total rules applied 1032 place count 109 transition count 206
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1036 place count 105 transition count 202
Iterating global reduction 4 with 4 rules applied. Total rules applied 1040 place count 105 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1042 place count 105 transition count 200
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1043 place count 104 transition count 199
Iterating global reduction 5 with 1 rules applied. Total rules applied 1044 place count 104 transition count 199
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1045 place count 103 transition count 198
Iterating global reduction 5 with 1 rules applied. Total rules applied 1046 place count 103 transition count 198
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 1086 place count 83 transition count 177
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1103 place count 66 transition count 125
Iterating global reduction 5 with 17 rules applied. Total rules applied 1120 place count 66 transition count 125
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1127 place count 66 transition count 118
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1136 place count 57 transition count 106
Iterating global reduction 6 with 9 rules applied. Total rules applied 1145 place count 57 transition count 106
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1154 place count 48 transition count 94
Iterating global reduction 6 with 9 rules applied. Total rules applied 1163 place count 48 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1167 place count 48 transition count 90
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1181 place count 41 transition count 99
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1182 place count 40 transition count 93
Iterating global reduction 7 with 1 rules applied. Total rules applied 1183 place count 40 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1184 place count 40 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1187 place count 40 transition count 89
Applied a total of 1187 rules in 35 ms. Remains 40 /663 variables (removed 623) and now considering 89/773 (removed 684) transitions.
[2025-06-08 12:33:21] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
// Phase 1: matrix 85 rows 40 cols
[2025-06-08 12:33:21] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:33:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-08 12:33:22] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2025-06-08 12:33:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:33:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-08 12:33:22] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:33:22] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-08 12:33:22] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2025-06-08 12:33:22] [INFO ] Invariant cache hit.
[2025-06-08 12:33:22] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:22] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:22] [INFO ] Deduced a trap composed of 19 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-08 12:33:22] [INFO ] Deduced a trap composed of 15 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-08 12:33:22] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:22] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:22] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 84/124 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/125 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:24] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/125 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/125 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 65 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3718 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 84/124 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 80/144 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/125 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 146 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4756 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8486ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 8486ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/663 places, 89/773 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8613 ms. Remains : 40/663 places, 89/773 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-06
Product exploration explored 100000 steps with 329 reset in 36 ms.
Stuttering criterion allowed to conclude after 457 steps with 72 reset in 1 ms.
FORMULA MedleyB-PT-B01-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLFireability-06 finished in 8706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0 U (p1||G(p0))))))))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 773/773 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 652 transition count 762
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 652 transition count 762
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 643 transition count 753
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 643 transition count 753
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 636 transition count 746
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 636 transition count 746
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 629 transition count 739
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 629 transition count 739
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 622 transition count 732
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 622 transition count 732
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 617 transition count 727
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 617 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 617 transition count 726
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 614 transition count 723
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 614 transition count 723
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 611 transition count 720
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 611 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 609 transition count 717
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 607 transition count 715
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 607 transition count 715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 607 transition count 714
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 606 transition count 713
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 606 transition count 713
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 605 transition count 712
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 604 transition count 711
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 603 transition count 710
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 602 transition count 709
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 602 transition count 709
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 601 transition count 708
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 600 transition count 707
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 599 transition count 706
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 598 transition count 705
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 598 transition count 705
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 597 transition count 704
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 597 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 597 transition count 703
Applied a total of 136 rules in 218 ms. Remains 597 /663 variables (removed 66) and now considering 703/773 (removed 70) transitions.
// Phase 1: matrix 703 rows 597 cols
[2025-06-08 12:33:30] [INFO ] Computed 4 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:33:31] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-06-08 12:33:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:33:31] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 702 sub problems to find dead transitions.
[2025-06-08 12:33: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/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:51] [INFO ] Deduced a trap composed of 289 places in 204 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:52] [INFO ] Deduced a trap composed of 297 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:53] [INFO ] Deduced a trap composed of 291 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:54] [INFO ] Deduced a trap composed of 289 places in 255 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:54] [INFO ] Deduced a trap composed of 290 places in 198 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:55] [INFO ] Deduced a trap composed of 297 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:56] [INFO ] Deduced a trap composed of 295 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:57] [INFO ] Deduced a trap composed of 290 places in 208 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:58] [INFO ] Deduced a trap composed of 291 places in 244 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:58] [INFO ] Deduced a trap composed of 294 places in 191 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:58] [INFO ] Deduced a trap composed of 300 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:59] [INFO ] Deduced a trap composed of 297 places in 153 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:59] [INFO ] Deduced a trap composed of 296 places in 166 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/1300 variables, and 17 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/597 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:12] [INFO ] Deduced a trap composed of 295 places in 193 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:14] [INFO ] Deduced a trap composed of 290 places in 128 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/1300 variables, and 19 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/597 constraints, PredecessorRefiner: 0/702 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 702 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 597/663 places, 703/773 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60988 ms. Remains : 597/663 places, 703/773 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-09
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B01-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLFireability-09 finished in 61169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X((F(p2) U ((p3&&F(p2))||G(F(p2)))))&&(!p0 U (p1||G(!p0))))))))))'
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 773/773 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 652 transition count 762
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 652 transition count 762
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 643 transition count 753
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 643 transition count 753
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 636 transition count 746
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 636 transition count 746
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 629 transition count 739
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 629 transition count 739
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 623 transition count 733
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 623 transition count 733
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 619 transition count 729
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 619 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 619 transition count 728
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 617 transition count 726
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 617 transition count 726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 615 transition count 724
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 615 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 615 transition count 723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 614 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 614 transition count 722
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 613 transition count 721
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 613 transition count 721
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 613 transition count 720
Applied a total of 103 rules in 115 ms. Remains 613 /663 variables (removed 50) and now considering 720/773 (removed 53) transitions.
// Phase 1: matrix 720 rows 613 cols
[2025-06-08 12:34:31] [INFO ] Computed 4 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:34:32] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-06-08 12:34:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:34:32] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Running 719 sub problems to find dead transitions.
[2025-06-08 12:34:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:53] [INFO ] Deduced a trap composed of 289 places in 205 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:54] [INFO ] Deduced a trap composed of 296 places in 216 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:54] [INFO ] Deduced a trap composed of 290 places in 215 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:56] [INFO ] Deduced a trap composed of 290 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:56] [INFO ] Deduced a trap composed of 290 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:57] [INFO ] Deduced a trap composed of 297 places in 211 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:57] [INFO ] Deduced a trap composed of 291 places in 291 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:58] [INFO ] Deduced a trap composed of 291 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:00] [INFO ] Deduced a trap composed of 310 places in 250 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:00] [INFO ] Deduced a trap composed of 310 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:01] [INFO ] Deduced a trap composed of 316 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:01] [INFO ] Deduced a trap composed of 297 places in 255 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:01] [INFO ] Deduced a trap composed of 297 places in 170 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1333 variables, and 17 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/613 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:12] [INFO ] Deduced a trap composed of 290 places in 220 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:17] [INFO ] Deduced a trap composed of 311 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:18] [INFO ] Deduced a trap composed of 311 places in 228 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:20] [INFO ] Deduced a trap composed of 289 places in 188 ms of which 63 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/1333 variables, and 21 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/613 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 613/663 places, 720/773 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60962 ms. Remains : 613/663 places, 720/773 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-12
Product exploration explored 100000 steps with 1645 reset in 106 ms.
Product exploration explored 100000 steps with 266 reset in 90 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 98 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (655 resets) in 128 ms. (310 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (165 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (167 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
[2025-06-08 12:35:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 405/407 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 206/613 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 720/1333 variables, 613/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1333 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1333 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1333/1333 variables, and 617 constraints, problems are : Problem set: 0 solved, 2 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 405/407 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 206/613 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:34] [INFO ] Deduced a trap composed of 291 places in 183 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:34] [INFO ] Deduced a trap composed of 297 places in 141 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 720/1333 variables, 613/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1333 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1333 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1333 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1333/1333 variables, and 621 constraints, problems are : Problem set: 0 solved, 2 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1594ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 81 ms.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 720/720 transitions.
Graph (trivial) has 606 edges and 613 vertex of which 48 / 613 are part of one of the 9 SCC in 0 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 850 edges and 574 vertex of which 571 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 426 transitions
Trivial Post-agglo rules discarded 426 transitions
Performed 426 trivial Post agglomeration. Transition count delta: 426
Iterating post reduction 0 with 429 rules applied. Total rules applied 431 place count 571 transition count 237
Reduce places removed 426 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 435 rules applied. Total rules applied 866 place count 145 transition count 228
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 870 place count 142 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 871 place count 141 transition count 227
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 871 place count 141 transition count 190
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 945 place count 104 transition count 190
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 946 place count 104 transition count 189
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 990 place count 82 transition count 167
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 996 place count 82 transition count 161
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1015 place count 63 transition count 105
Iterating global reduction 6 with 19 rules applied. Total rules applied 1034 place count 63 transition count 105
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1044 place count 63 transition count 95
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1053 place count 54 transition count 86
Iterating global reduction 7 with 9 rules applied. Total rules applied 1062 place count 54 transition count 86
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1068 place count 48 transition count 80
Iterating global reduction 7 with 6 rules applied. Total rules applied 1074 place count 48 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1077 place count 48 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1083 place count 45 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1091 place count 41 transition count 101
Free-agglomeration rule applied 16 times with reduction of 11 identical transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1107 place count 41 transition count 74
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 1133 place count 25 transition count 64
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1136 place count 22 transition count 61
Iterating global reduction 9 with 3 rules applied. Total rules applied 1139 place count 22 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1142 place count 22 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 1157 place count 22 transition count 43
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1159 place count 22 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1160 place count 22 transition count 42
Applied a total of 1160 rules in 21 ms. Remains 22 /613 variables (removed 591) and now considering 42/720 (removed 678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 22/613 places, 42/720 transitions.
RANDOM walk for 206 steps (0 resets) in 5 ms. (34 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT p1)), (F p0), (F p2), (F (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p2) p3)))), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 289 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 254 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 720/720 transitions.
Applied a total of 0 rules in 16 ms. Remains 613 /613 variables (removed 0) and now considering 720/720 (removed 0) transitions.
[2025-06-08 12:35:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:35:36] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-06-08 12:35:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:35:36] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Running 719 sub problems to find dead transitions.
[2025-06-08 12:35:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:58] [INFO ] Deduced a trap composed of 289 places in 208 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:58] [INFO ] Deduced a trap composed of 296 places in 215 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:59] [INFO ] Deduced a trap composed of 290 places in 215 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:01] [INFO ] Deduced a trap composed of 290 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:01] [INFO ] Deduced a trap composed of 290 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:02] [INFO ] Deduced a trap composed of 297 places in 212 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:02] [INFO ] Deduced a trap composed of 291 places in 292 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:03] [INFO ] Deduced a trap composed of 291 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:05] [INFO ] Deduced a trap composed of 310 places in 251 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:05] [INFO ] Deduced a trap composed of 310 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:05] [INFO ] Deduced a trap composed of 316 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:06] [INFO ] Deduced a trap composed of 297 places in 257 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:06] [INFO ] Deduced a trap composed of 297 places in 171 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1333 variables, and 17 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/613 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:16] [INFO ] Deduced a trap composed of 290 places in 201 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:21] [INFO ] Deduced a trap composed of 311 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:23] [INFO ] Deduced a trap composed of 311 places in 222 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:25] [INFO ] Deduced a trap composed of 289 places in 187 ms of which 63 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/1333 variables, and 21 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/613 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Finished structural reductions in LTL mode , in 1 iterations and 60860 ms. Remains : 613/613 places, 720/720 transitions.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p3 p1 (NOT p2) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (646 resets) in 85 ms. (465 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (168 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (165 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
[2025-06-08 12:36:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 405/407 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 206/613 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 720/1333 variables, 613/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1333 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1333 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1333/1333 variables, and 617 constraints, problems are : Problem set: 0 solved, 2 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 405/407 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 206/613 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:38] [INFO ] Deduced a trap composed of 291 places in 182 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:38] [INFO ] Deduced a trap composed of 297 places in 136 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 720/1333 variables, 613/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1333 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1333 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1333 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1333/1333 variables, and 621 constraints, problems are : Problem set: 0 solved, 2 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1282ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 76 ms.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 720/720 transitions.
Graph (trivial) has 606 edges and 613 vertex of which 48 / 613 are part of one of the 9 SCC in 1 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 850 edges and 574 vertex of which 571 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 426 transitions
Trivial Post-agglo rules discarded 426 transitions
Performed 426 trivial Post agglomeration. Transition count delta: 426
Iterating post reduction 0 with 429 rules applied. Total rules applied 431 place count 571 transition count 237
Reduce places removed 426 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 435 rules applied. Total rules applied 866 place count 145 transition count 228
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 870 place count 142 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 871 place count 141 transition count 227
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 871 place count 141 transition count 190
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 945 place count 104 transition count 190
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 946 place count 104 transition count 189
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 990 place count 82 transition count 167
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 996 place count 82 transition count 161
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1015 place count 63 transition count 105
Iterating global reduction 6 with 19 rules applied. Total rules applied 1034 place count 63 transition count 105
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1044 place count 63 transition count 95
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1053 place count 54 transition count 86
Iterating global reduction 7 with 9 rules applied. Total rules applied 1062 place count 54 transition count 86
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1068 place count 48 transition count 80
Iterating global reduction 7 with 6 rules applied. Total rules applied 1074 place count 48 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1077 place count 48 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1083 place count 45 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1091 place count 41 transition count 101
Free-agglomeration rule applied 16 times with reduction of 11 identical transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1107 place count 41 transition count 74
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 1133 place count 25 transition count 64
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1136 place count 22 transition count 61
Iterating global reduction 9 with 3 rules applied. Total rules applied 1139 place count 22 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1142 place count 22 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 1157 place count 22 transition count 43
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1159 place count 22 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1160 place count 22 transition count 42
Applied a total of 1160 rules in 17 ms. Remains 22 /613 variables (removed 591) and now considering 42/720 (removed 678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 22/613 places, 42/720 transitions.
RANDOM walk for 123 steps (0 resets) in 4 ms. (24 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p3 p1 (NOT p2) (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p3)), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (F (NOT p1)), (F p2), (F (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p2) p3)))), (F (NOT (OR (NOT p0) p1 p2)))]
Knowledge based reduction with 1 factoid took 222 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 215 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 238 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1663 reset in 108 ms.
Product exploration explored 100000 steps with 1656 reset in 109 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 253 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 720/720 transitions.
Graph (trivial) has 602 edges and 613 vertex of which 48 / 613 are part of one of the 9 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Performed 417 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 417 rules applied. Total rules applied 418 place count 574 transition count 675
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 424 place count 574 transition count 669
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 424 place count 574 transition count 672
Deduced a syphon composed of 444 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 451 place count 574 transition count 672
Discarding 371 places :
Symmetric choice reduction at 2 with 371 rule applications. Total rules 822 place count 203 transition count 301
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 2 with 371 rules applied. Total rules applied 1193 place count 203 transition count 301
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 109 places in 1 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 1227 place count 203 transition count 311
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 1283 place count 147 transition count 215
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 1339 place count 147 transition count 215
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1351 place count 147 transition count 203
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1376 place count 122 transition count 175
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 3 with 25 rules applied. Total rules applied 1401 place count 122 transition count 175
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1410 place count 113 transition count 166
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1419 place count 113 transition count 166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1422 place count 113 transition count 163
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1428 place count 107 transition count 157
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1434 place count 107 transition count 157
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1441 place count 107 transition count 199
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1450 place count 98 transition count 181
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 1459 place count 98 transition count 181
Deduced a syphon composed of 48 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1465 place count 98 transition count 175
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 1465 rules in 54 ms. Remains 98 /613 variables (removed 515) and now considering 175/720 (removed 545) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:36:40] [INFO ] Redundant transitions in 4 ms returned []
Running 167 sub problems to find dead transitions.
[2025-06-08 12:36:40] [INFO ] Flow matrix only has 171 transitions (discarded 4 similar events)
// Phase 1: matrix 171 rows 98 cols
[2025-06-08 12:36:40] [INFO ] Computed 2 invariants in 2 ms
[2025-06-08 12:36:40] [INFO ] State equation strengthened by 39 read => feed constraints.
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, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:41] [INFO ] Deduced a trap composed of 3 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-08 12:36:41] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:41] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:41] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Problem TDEAD102 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:41] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:41] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:41] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 3 ms to minimize.
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 7/9 constraints. Problems are: Problem set: 10 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 10 solved, 157 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
At refinement iteration 4 (OVERLAPS) 170/268 variables, 98/107 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 38/145 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/145 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 1/269 variables, 1/146 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/146 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/269 variables, 0/146 constraints. Problems are: Problem set: 72 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 146 constraints, problems are : Problem set: 72 solved, 95 unsolved in 9564 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 72 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 49/98 variables, 2/2 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 7/9 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 170/268 variables, 98/107 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 38/145 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 95/240 constraints. Problems are: Problem set: 72 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:53] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/241 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/241 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/242 constraints. Problems are: Problem set: 72 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:59] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 1/243 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/243 constraints. Problems are: Problem set: 72 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/269 variables, 0/243 constraints. Problems are: Problem set: 72 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 243 constraints, problems are : Problem set: 72 solved, 95 unsolved in 17180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 95/167 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26765ms problems are : Problem set: 72 solved, 95 unsolved
Search for dead transitions found 72 dead transitions in 26767ms
Found 72 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 72 transitions
Dead transitions reduction (with SMT) removed 72 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/613 places, 103/720 transitions.
Graph (complete) has 200 edges and 98 vertex of which 50 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 50 /98 variables (removed 48) and now considering 103/103 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/613 places, 103/720 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26837 ms. Remains : 50/613 places, 103/720 transitions.
Built C files in :
/tmp/ltsmin2553353919687882290
[2025-06-08 12:37:07] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2553353919687882290
Running compilation step : cd /tmp/ltsmin2553353919687882290;'/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 1063 ms.
Running link step : cd /tmp/ltsmin2553353919687882290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2553353919687882290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8095839111343286979.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 720/720 transitions.
Applied a total of 0 rules in 21 ms. Remains 613 /613 variables (removed 0) and now considering 720/720 (removed 0) transitions.
// Phase 1: matrix 720 rows 613 cols
[2025-06-08 12:37:22] [INFO ] Computed 4 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:37:22] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-06-08 12:37:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:37:23] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Running 719 sub problems to find dead transitions.
[2025-06-08 12:37: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/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:44] [INFO ] Deduced a trap composed of 289 places in 204 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:44] [INFO ] Deduced a trap composed of 296 places in 216 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:45] [INFO ] Deduced a trap composed of 290 places in 215 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:47] [INFO ] Deduced a trap composed of 290 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:47] [INFO ] Deduced a trap composed of 290 places in 146 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:48] [INFO ] Deduced a trap composed of 297 places in 200 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:48] [INFO ] Deduced a trap composed of 291 places in 287 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:49] [INFO ] Deduced a trap composed of 291 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:50] [INFO ] Deduced a trap composed of 310 places in 251 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:51] [INFO ] Deduced a trap composed of 310 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:51] [INFO ] Deduced a trap composed of 316 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:52] [INFO ] Deduced a trap composed of 297 places in 258 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:52] [INFO ] Deduced a trap composed of 297 places in 169 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1333 variables, and 17 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/613 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:02] [INFO ] Deduced a trap composed of 290 places in 199 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:08] [INFO ] Deduced a trap composed of 311 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:09] [INFO ] Deduced a trap composed of 311 places in 229 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:11] [INFO ] Deduced a trap composed of 289 places in 189 ms of which 63 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/1333 variables, and 21 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/613 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Finished structural reductions in LTL mode , in 1 iterations and 60860 ms. Remains : 613/613 places, 720/720 transitions.
Built C files in :
/tmp/ltsmin15130727378686363269
[2025-06-08 12:38:23] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15130727378686363269
Running compilation step : cd /tmp/ltsmin15130727378686363269;'/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 1055 ms.
Running link step : cd /tmp/ltsmin15130727378686363269;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15130727378686363269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7469778560540239772.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 12:38:38] [INFO ] Flatten gal took : 28 ms
[2025-06-08 12:38:38] [INFO ] Flatten gal took : 25 ms
[2025-06-08 12:38:38] [INFO ] Time to serialize gal into /tmp/LTL17970603353598953574.gal : 6 ms
[2025-06-08 12:38:38] [INFO ] Time to serialize properties into /tmp/LTL12390924587046003882.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17970603353598953574.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14048589690243655407.hoa' '-atoms' '/tmp/LTL12390924587046003882.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12390924587046003882.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14048589690243655407.hoa
Detected timeout of ITS tools.
[2025-06-08 12:38:53] [INFO ] Flatten gal took : 23 ms
[2025-06-08 12:38:53] [INFO ] Flatten gal took : 22 ms
[2025-06-08 12:38:53] [INFO ] Time to serialize gal into /tmp/LTL13030708572189765422.gal : 4 ms
[2025-06-08 12:38:53] [INFO ] Time to serialize properties into /tmp/LTL9014776552211291747.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13030708572189765422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9014776552211291747.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((("(p218!=1)")U((G("(p218!=1)"))||("((p218!=1)&&(p431!=1))")))U((G(("(p218!=1)")U(("((p218!=1)&&(p431!=1))")||(G("(p218!=1)")...310
Formula 0 simplified : XXG(F(!"((p218!=1)&&(p431!=1))" & !"(p218!=1)") & ((!"(p218!=1)" M !"((p218!=1)&&(p431!=1))") | XG(FG!"(p697==1)" & (!"(p29!=1)" | G...171
Detected timeout of ITS tools.
[2025-06-08 12:39:08] [INFO ] Flatten gal took : 22 ms
[2025-06-08 12:39:08] [INFO ] Applying decomposition
[2025-06-08 12:39:08] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12007033827520989953.txt' '-o' '/tmp/graph12007033827520989953.bin' '-w' '/tmp/graph12007033827520989953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12007033827520989953.bin' '-l' '-1' '-v' '-w' '/tmp/graph12007033827520989953.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:39:08] [INFO ] Decomposing Gal with order
[2025-06-08 12:39:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:39:08] [INFO ] Removed a total of 393 redundant transitions.
[2025-06-08 12:39:09] [INFO ] Flatten gal took : 74 ms
[2025-06-08 12:39:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 13 ms.
[2025-06-08 12:39:09] [INFO ] Time to serialize gal into /tmp/LTL17944824753934083939.gal : 9 ms
[2025-06-08 12:39:09] [INFO ] Time to serialize properties into /tmp/LTL12463308840617545417.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17944824753934083939.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12463308840617545417.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((("(i6.u63.p218!=1)")U((G("(i6.u63.p218!=1)"))||("((i6.u63.p218!=1)&&(i15.u127.p431!=1))")))U((G(("(i6.u63.p218!=1)")U(("((i6...436
Formula 0 simplified : XXG(F(!"((i6.u63.p218!=1)&&(i15.u127.p431!=1))" & !"(i6.u63.p218!=1)") & ((!"(i6.u63.p218!=1)" M !"((i6.u63.p218!=1)&&(i15.u127.p431...245
Reverse transition relation is NOT exact ! Due to transitions t224, t258, t360, t449, t604, t620, t621, t625, t628, t633, t636, t642, t643, t646, t649, t65...490
Computing Next relation with stutter on 6986 deadlock states
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B01-LTLFireability-12 finished in 292269 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)) U ((p1&&X(X(p0)))||X(X(G(p0))))))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 773/773 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 652 transition count 762
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 652 transition count 762
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 643 transition count 753
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 643 transition count 753
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 636 transition count 746
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 636 transition count 746
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 629 transition count 739
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 629 transition count 739
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 623 transition count 733
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 623 transition count 733
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 619 transition count 729
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 619 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 619 transition count 728
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 616 transition count 725
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 616 transition count 725
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 613 transition count 722
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 613 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 613 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 611 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 609 transition count 717
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 609 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 111 place count 609 transition count 716
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 608 transition count 715
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 608 transition count 715
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 607 transition count 714
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 607 transition count 714
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 606 transition count 713
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 606 transition count 713
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 605 transition count 712
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 604 transition count 711
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 603 transition count 710
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 602 transition count 709
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 602 transition count 709
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 601 transition count 708
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 600 transition count 707
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 599 transition count 706
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 599 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 599 transition count 705
Applied a total of 132 rules in 255 ms. Remains 599 /663 variables (removed 64) and now considering 705/773 (removed 68) transitions.
// Phase 1: matrix 705 rows 599 cols
[2025-06-08 12:39:24] [INFO ] Computed 4 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:39:24] [INFO ] Implicit Places using invariants in 255 ms returned []
[2025-06-08 12:39:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:39:25] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Running 704 sub problems to find dead transitions.
[2025-06-08 12:39:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (OVERLAPS) 1/599 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:45] [INFO ] Deduced a trap composed of 289 places in 206 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:46] [INFO ] Deduced a trap composed of 289 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:48] [INFO ] Deduced a trap composed of 296 places in 141 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:50] [INFO ] Deduced a trap composed of 290 places in 186 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:51] [INFO ] Deduced a trap composed of 290 places in 196 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:51] [INFO ] Deduced a trap composed of 291 places in 276 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:51] [INFO ] Deduced a trap composed of 296 places in 286 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:52] [INFO ] Deduced a trap composed of 297 places in 293 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:52] [INFO ] Deduced a trap composed of 297 places in 163 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:52] [INFO ] Deduced a trap composed of 303 places in 160 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:53] [INFO ] Deduced a trap composed of 297 places in 197 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:53] [INFO ] Deduced a trap composed of 302 places in 156 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:53] [INFO ] Deduced a trap composed of 290 places in 176 ms of which 40 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 599/1304 variables, and 17 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/599 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (OVERLAPS) 1/599 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:03] [INFO ] Deduced a trap composed of 297 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:09] [INFO ] Deduced a trap composed of 291 places in 125 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/599 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:13] [INFO ] Deduced a trap composed of 297 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:15] [INFO ] Deduced a trap composed of 290 places in 151 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/1304 variables, and 21 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/599 constraints, PredecessorRefiner: 0/704 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 704 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 599/663 places, 705/773 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61069 ms. Remains : 599/663 places, 705/773 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 136 ms.
Product exploration explored 100000 steps with 33333 reset in 149 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyB-PT-B01-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B01-LTLFireability-13 finished in 61518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X((F(p2) U ((p3&&F(p2))||G(F(p2)))))&&(!p0 U (p1||G(!p0))))))))))'
Found a Shortening insensitive property : MedleyB-PT-B01-LTLFireability-12
Stuttering acceptance computed with spot in 239 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 663/663 places, 773/773 transitions.
Graph (trivial) has 653 edges and 663 vertex of which 50 / 663 are part of one of the 9 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 453 transitions
Trivial Post-agglo rules discarded 453 transitions
Performed 453 trivial Post agglomeration. Transition count delta: 453
Iterating post reduction 0 with 453 rules applied. Total rules applied 454 place count 621 transition count 272
Reduce places removed 453 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 464 rules applied. Total rules applied 918 place count 168 transition count 261
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 925 place count 164 transition count 258
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 928 place count 161 transition count 258
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 928 place count 161 transition count 222
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1000 place count 125 transition count 222
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1009 place count 116 transition count 213
Iterating global reduction 4 with 9 rules applied. Total rules applied 1018 place count 116 transition count 213
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1022 place count 112 transition count 209
Iterating global reduction 4 with 4 rules applied. Total rules applied 1026 place count 112 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1028 place count 112 transition count 207
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1029 place count 111 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 1030 place count 111 transition count 206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1031 place count 110 transition count 205
Iterating global reduction 5 with 1 rules applied. Total rules applied 1032 place count 110 transition count 205
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 1072 place count 90 transition count 184
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1088 place count 74 transition count 133
Iterating global reduction 5 with 16 rules applied. Total rules applied 1104 place count 74 transition count 133
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1111 place count 74 transition count 126
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1119 place count 66 transition count 115
Iterating global reduction 6 with 8 rules applied. Total rules applied 1127 place count 66 transition count 115
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1135 place count 58 transition count 104
Iterating global reduction 6 with 8 rules applied. Total rules applied 1143 place count 58 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1146 place count 58 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1160 place count 51 transition count 113
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1161 place count 50 transition count 107
Iterating global reduction 7 with 1 rules applied. Total rules applied 1162 place count 50 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1163 place count 50 transition count 106
Applied a total of 1163 rules in 28 ms. Remains 50 /663 variables (removed 613) and now considering 106/773 (removed 667) transitions.
[2025-06-08 12:40:26] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
// Phase 1: matrix 102 rows 50 cols
[2025-06-08 12:40:26] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:40:26] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-08 12:40:26] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
[2025-06-08 12:40:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:40:26] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-08 12:40:26] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2025-06-08 12:40:26] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
[2025-06-08 12:40:26] [INFO ] Invariant cache hit.
[2025-06-08 12:40:26] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:26] [INFO ] Deduced a trap composed of 16 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-08 12:40:26] [INFO ] Deduced a trap composed of 20 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-08 12:40:26] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:26] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:26] [INFO ] Deduced a trap composed of 28 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-08 12:40:26] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 6/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-08 12:40:26] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 101/151 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/152 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:28] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/152 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 79 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4816 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 8/8 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/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 101/151 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 97/175 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/152 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:37] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/152 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 177 constraints, problems are : Problem set: 0 solved, 97 unsolved in 13883 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18716ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 18716ms
Starting structural reductions in LI_LTL mode, iteration 1 : 50/663 places, 106/773 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 18838 ms. Remains : 50/663 places, 106/773 transitions.
Running random walk in product with property : MedleyB-PT-B01-LTLFireability-12
Product exploration explored 100000 steps with 2782 reset in 65 ms.
Product exploration explored 100000 steps with 37 reset in 150 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 102 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (5996 resets) in 77 ms. (512 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (937 resets) in 16 ms. (2353 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (943 resets) in 13 ms. (2857 steps per ms) remains 2/2 properties
[2025-06-08 12:40:45] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
[2025-06-08 12:40:45] [INFO ] Invariant cache hit.
[2025-06-08 12:40:45] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:45] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:45] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 100/148 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/151 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/152 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/152 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 73 constraints, problems are : Problem set: 0 solved, 2 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 100/148 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/151 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/152 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 75 constraints, problems are : Problem set: 0 solved, 2 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 60 steps, including 9 resets, run visited all 2 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT p1)), (F p0), (F p2), (F (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p2) p3)))), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 222 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 106/106 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2025-06-08 12:40:46] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
[2025-06-08 12:40:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:40:46] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-08 12:40:46] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
[2025-06-08 12:40:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:40:46] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-08 12:40:46] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2025-06-08 12:40:46] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
[2025-06-08 12:40:46] [INFO ] Invariant cache hit.
[2025-06-08 12:40:46] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:47] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:47] [INFO ] Deduced a trap composed of 20 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-08 12:40:47] [INFO ] Deduced a trap composed of 16 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-08 12:40:47] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:47] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:47] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 6/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-08 12:40:47] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 101/151 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/152 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:49] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/152 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 79 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4810 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 8/8 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/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 101/151 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 97/175 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/152 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:57] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/152 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 177 constraints, problems are : Problem set: 0 solved, 97 unsolved in 13900 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18724ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 18725ms
Finished structural reductions in LTL mode , in 1 iterations and 18821 ms. Remains : 50/50 places, 106/106 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p3 p1 (NOT p2) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (5895 resets) in 72 ms. (547 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (939 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (941 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
[2025-06-08 12:41:05] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
[2025-06-08 12:41:05] [INFO ] Invariant cache hit.
[2025-06-08 12:41:05] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 100/148 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/151 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/152 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/152 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 71 constraints, problems are : Problem set: 0 solved, 2 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:05] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 100/148 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/151 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/152 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 74 constraints, problems are : Problem set: 0 solved, 2 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 251ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 14 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p3 p1 (NOT p2) (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p3)), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (F (NOT p1)), (F p2), (F (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p2) p3)))), (F (NOT (OR (NOT p0) p1 p2)))]
Knowledge based reduction with 1 factoid took 274 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 229 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 232 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 529 reset in 50 ms.
Product exploration explored 100000 steps with 944 reset in 49 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 241 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 106/106 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 50 transition count 103
Applied a total of 3 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 103/106 (removed 3) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:41:07] [INFO ] Redundant transitions in 1 ms returned []
Running 94 sub problems to find dead transitions.
[2025-06-08 12:41:07] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
// Phase 1: matrix 99 rows 50 cols
[2025-06-08 12:41:07] [INFO ] Computed 2 invariants in 0 ms
[2025-06-08 12:41:07] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:07] [INFO ] Deduced a trap composed of 16 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-08 12:41:07] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:07] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:07] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:08] [INFO ] Deduced a trap composed of 24 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-08 12:41:08] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 98/148 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:08] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 1/149 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 0/149 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 78 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4553 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 98/148 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 94/171 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 1/149 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:15] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 0/149 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 173 constraints, problems are : Problem set: 0 solved, 94 unsolved in 8162 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12731ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 12732ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/50 places, 103/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12748 ms. Remains : 50/50 places, 103/106 transitions.
Built C files in :
/tmp/ltsmin6301980797173695700
[2025-06-08 12:41:20] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6301980797173695700
Running compilation step : cd /tmp/ltsmin6301980797173695700;'/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 179 ms.
Running link step : cd /tmp/ltsmin6301980797173695700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6301980797173695700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10275084437775577423.hoa' '--buchi-type=spotba'
LTSmin run took 70 ms.
Treatment of property MedleyB-PT-B01-LTLFireability-12 finished in 54829 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2025-06-08 12:41:20] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7921236279629724558
[2025-06-08 12:41:20] [INFO ] Applying decomposition
[2025-06-08 12:41:20] [INFO ] Computing symmetric may disable matrix : 773 transitions.
[2025-06-08 12:41:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:41:20] [INFO ] Computing symmetric may enable matrix : 773 transitions.
[2025-06-08 12:41:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:41:20] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14857803882023153473.txt' '-o' '/tmp/graph14857803882023153473.bin' '-w' '/tmp/graph14857803882023153473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14857803882023153473.bin' '-l' '-1' '-v' '-w' '/tmp/graph14857803882023153473.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:41:20] [INFO ] Decomposing Gal with order
[2025-06-08 12:41:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:41:20] [INFO ] Removed a total of 384 redundant transitions.
[2025-06-08 12:41:20] [INFO ] Computing Do-Not-Accords matrix : 773 transitions.
[2025-06-08 12:41:20] [INFO ] Flatten gal took : 51 ms
[2025-06-08 12:41:20] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:41:20] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7921236279629724558
Running compilation step : cd /tmp/ltsmin7921236279629724558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
[2025-06-08 12:41:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2025-06-08 12:41:20] [INFO ] Time to serialize gal into /tmp/LTLFireability1124289922001740875.gal : 6 ms
[2025-06-08 12:41:20] [INFO ] Time to serialize properties into /tmp/LTLFireability9402216943386233282.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1124289922001740875.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9402216943386233282.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((("(i6.u63.p218!=1)")U((G("(i6.u63.p218!=1)"))||("((i6.u63.p218!=1)&&(i15.u126.p431!=1))")))U((G(("(i6.u63.p218!=1)")U(("((i6...430
Formula 0 simplified : XXG(F(!"((i6.u63.p218!=1)&&(i15.u126.p431!=1))" & !"(i6.u63.p218!=1)") & ((!"(i6.u63.p218!=1)" M !"((i6.u63.p218!=1)&&(i15.u126.p431...239
Compilation finished in 1909 ms.
Running link step : cd /tmp/ltsmin7921236279629724558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7921236279629724558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true))) U ([]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||(X((<>((LTLAPp2==true)) U (((LTLAPp3==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t166, t167, t224, t258, t269, t296, t416, t485, t604, t625, t633, t636, t642, t646, t649, t65...548
Computing Next relation with stutter on 7630 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
5574 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,55.803,1638848,1,0,2.04417e+06,617,7744,1.27408e+07,305,3265,3866760
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyB-PT-B01-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 885160 ms.

BK_STOP 1749386629349

--------------------
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="MedleyB-PT-B01"
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 MedleyB-PT-B01, 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 r254-tall-174931339900428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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