Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000228.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is MedleyA-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 175K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-17-LTLFireability-00
FORMULA_NAME MedleyA-PT-17-LTLFireability-01
FORMULA_NAME MedleyA-PT-17-LTLFireability-02
FORMULA_NAME MedleyA-PT-17-LTLFireability-03
FORMULA_NAME MedleyA-PT-17-LTLFireability-04
FORMULA_NAME MedleyA-PT-17-LTLFireability-05
FORMULA_NAME MedleyA-PT-17-LTLFireability-06
FORMULA_NAME MedleyA-PT-17-LTLFireability-07
FORMULA_NAME MedleyA-PT-17-LTLFireability-08
FORMULA_NAME MedleyA-PT-17-LTLFireability-09
FORMULA_NAME MedleyA-PT-17-LTLFireability-10
FORMULA_NAME MedleyA-PT-17-LTLFireability-11
FORMULA_NAME MedleyA-PT-17-LTLFireability-12
FORMULA_NAME MedleyA-PT-17-LTLFireability-13
FORMULA_NAME MedleyA-PT-17-LTLFireability-14
FORMULA_NAME MedleyA-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779700744014

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:19:05] [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]
[2026-05-25 09:19:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:19:05] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2026-05-25 09:19:05] [INFO ] Transformed 248 places.
[2026-05-25 09:19:05] [INFO ] Transformed 591 transitions.
[2026-05-25 09:19:05] [INFO ] Found NUPN structural information;
[2026-05-25 09:19:05] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-17-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 202 transition count 516
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 202 transition count 516
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 126 place count 202 transition count 482
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 130 place count 198 transition count 474
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 198 transition count 474
Applied a total of 134 rules in 48 ms. Remains 198 /248 variables (removed 50) and now considering 474/589 (removed 115) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13977996664194475420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1619677121713718980.kers'
[2026-05-25 09:19:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13977996664194475420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1619677121713718980.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 474 rows 198 cols 2330 entries
Finished phase 1 with 190 SingleSign rule and 1 generalized
[2026-05-25 09:19:06] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1619677121713718980.kers
Total runtime 6 ms.
[2026-05-25 09:19:06] [INFO ] Implicit Places using invariants in 301 ms returned []
[2026-05-25 09:19:06] [INFO ] Invariant cache hit.
[2026-05-25 09:19:06] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2026-05-25 09:19:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/672 variables, and 46 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/198 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 198/672 variables, and 64 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/198 constraints, PredecessorRefiner: 0/473 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60426ms
Starting structural reductions in LTL mode, iteration 1 : 198/248 places, 474/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61208 ms. Remains : 198/248 places, 474/589 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2026-05-25 09:20:07] [INFO ] Invariant cache hit.
[2026-05-25 09:20:07] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 09:20:07] [INFO ] Invariant cache hit.
[2026-05-25 09:20:07] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 198/198 places, 474/474 transitions.
Support contains 50 out of 198 places after structural reductions.
[2026-05-25 09:20:07] [INFO ] Flatten gal took : 81 ms
[2026-05-25 09:20:07] [INFO ] Flatten gal took : 34 ms
[2026-05-25 09:20:07] [INFO ] Input system was already deterministic with 474 transitions.
Support contains 49 out of 198 places (down from 50) after GAL structural reductions.
RANDOM walk for 40000 steps (1376 resets) in 1804 ms. (22 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4001 steps (28 resets) in 48 ms. (81 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (29 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (30 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (27 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (28 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (28 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (28 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (22 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (28 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (28 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (28 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (29 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (30 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (28 resets) in 27 ms. (143 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (29 resets) in 40 ms. (97 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (28 resets) in 43 ms. (91 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (29 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (27 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 447614 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :14 out of 31
Probabilistic random walk after 447614 steps, saw 80649 distinct states, run finished after 3012 ms. (steps per millisecond=148 ) properties seen :14
[2026-05-25 09:20:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 164/198 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 6/13 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 474/672 variables, 198/217 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/672 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/672 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 672/672 variables, and 217 constraints, problems are : Problem set: 1 solved, 16 unsolved in 4141 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 164/198 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 12/19 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 3/22 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 5 (OVERLAPS) 474/672 variables, 198/220 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/672 variables, 13/233 constraints. Problems are: Problem set: 4 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/672 variables, and 233 constraints, problems are : Problem set: 4 solved, 13 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 13/17 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9170ms problems are : Problem set: 4 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 474/474 transitions.
Graph (trivial) has 145 edges and 198 vertex of which 6 / 198 are part of one of the 2 SCC in 13 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 194 transition count 443
Reduce places removed 25 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 28 rules applied. Total rules applied 54 place count 169 transition count 440
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 57 place count 166 transition count 440
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 57 place count 166 transition count 428
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 81 place count 154 transition count 428
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 89 place count 146 transition count 412
Iterating global reduction 3 with 8 rules applied. Total rules applied 97 place count 146 transition count 412
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 137 place count 126 transition count 392
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 122 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 156 place count 122 transition count 393
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 164 place count 118 transition count 389
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 176 place count 112 transition count 423
Free-agglomeration rule applied 27 times.
Iterating global reduction 3 with 27 rules applied. Total rules applied 203 place count 112 transition count 396
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 251 place count 85 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 254 place count 85 transition count 372
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 260 place count 85 transition count 405
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 275 place count 79 transition count 396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 78 transition count 395
Applied a total of 276 rules in 227 ms. Remains 78 /198 variables (removed 120) and now considering 395/474 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 78/198 places, 395/474 transitions.
RANDOM walk for 40000 steps (7737 resets) in 848 ms. (47 steps per ms) remains 8/13 properties
BEST_FIRST walk for 40002 steps (1954 resets) in 318 ms. (125 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (2342 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (2340 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1916 resets) in 138 ms. (287 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (2929 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2926 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
[2026-05-25 09:20:21] [INFO ] Flow matrix only has 335 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-952432927266200008.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-442339534989049784.kers'
[2026-05-25 09:20:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-952432927266200008.kers, --Pflows, --basisKERS=/tmp/petrispot-output-442339534989049784.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 335 rows 78 cols 1982 entries
Finished phase 1 with 70 SingleSign rule and 1 generalized
[2026-05-25 09:20:21] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-442339534989049784.kers
Total runtime 1 ms.
[2026-05-25 09:20:21] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 61/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 335/413 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/413 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 126 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 61/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 335/413 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/413 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 133 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1836 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2971ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 14073 ms.
Support contains 17 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 395/395 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 78 transition count 394
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 77 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 76 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 76 transition count 392
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 75 transition count 391
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 75 transition count 386
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 16 place count 70 transition count 386
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 70 transition count 388
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 69 transition count 385
Applied a total of 21 rules in 46 ms. Remains 69 /78 variables (removed 9) and now considering 385/395 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 69/78 places, 385/395 transitions.
RANDOM walk for 40000 steps (6852 resets) in 766 ms. (52 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (1487 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (10000 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
[2026-05-25 09:20:39] [INFO ] Flow matrix only has 315 transitions (discarded 70 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14876153834834800346.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4953688438541347454.kers'
[2026-05-25 09:20:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14876153834834800346.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4953688438541347454.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 69 cols 1764 entries
Finished phase 1 with 61 SingleSign rule and 1 generalized
[2026-05-25 09:20:39] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4953688438541347454.kers
Total runtime 2 ms.
[2026-05-25 09:20:39] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/53 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 303/356 variables, 53/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 34/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/384 variables, 16/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/384 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 112 constraints, problems are : Problem set: 0 solved, 2 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 36/36 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
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/53 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 303/356 variables, 53/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 34/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/384 variables, 16/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/384 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1271 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1431ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 705 ms.
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 385/385 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 69 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 68 transition count 384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 67 transition count 368
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 67 transition count 368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 66 transition count 370
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 66 transition count 367
Free-agglomeration rule applied 8 times with reduction of 4 identical transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 66 transition count 355
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 58 transition count 343
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 57 transition count 342
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 56 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 51 place count 56 transition count 334
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 56 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 55 transition count 333
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 55 transition count 329
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 55 transition count 397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 54 transition count 397
Applied a total of 59 rules in 64 ms. Remains 54 /69 variables (removed 15) and now considering 397/385 (removed -12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 54/69 places, 397/385 transitions.
RANDOM walk for 40000 steps (15 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (10 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (10000 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 2548 steps, run visited all 2 properties in 17 ms. (steps per millisecond=149 )
Probabilistic random walk after 2548 steps, saw 1087 distinct states, run finished after 22 ms. (steps per millisecond=115 ) properties seen :2
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA MedleyA-PT-17-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 15 stabilizing places and 15 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(F((G(!p1)||(!p1&&F(p2)))))))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 189 transition count 456
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 189 transition count 456
Applied a total of 18 rules in 6 ms. Remains 189 /198 variables (removed 9) and now considering 456/474 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13585136129467379614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18434885596700260809.kers'
[2026-05-25 09:20:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13585136129467379614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18434885596700260809.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 456 rows 189 cols 2294 entries
Finished phase 1 with 181 SingleSign rule and 1 generalized
[2026-05-25 09:20:42] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-18434885596700260809.kers
Total runtime 26 ms.
[2026-05-25 09:20:42] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-25 09:20:42] [INFO ] Invariant cache hit.
[2026-05-25 09:20:42] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2026-05-25 09:20:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 456/645 variables, 189/231 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/645 variables, and 231 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (OVERLAPS) 456/645 variables, 189/241 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 405/646 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 646 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60194ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60195ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/198 places, 406/474 transitions.
Applied a total of 0 rules in 9 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60541 ms. Remains : 189/198 places, 406/474 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(F((G(p1)||(p1&&F(p2)))))))))'
Stuttering acceptance computed with spot in 407 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-00
Product exploration explored 100000 steps with 25023 reset in 165 ms.
Product exploration explored 100000 steps with 25013 reset in 129 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 4 factoid took 48 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1376 resets) in 258 ms. (154 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (298 resets) in 217 ms. (183 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (298 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (299 resets) in 226 ms. (176 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (298 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (298 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 872144 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :3 out of 5
Probabilistic random walk after 872144 steps, saw 167833 distinct states, run finished after 3001 ms. (steps per millisecond=290 ) properties seen :3
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4502746259104164742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18265509916392693534.kers'
[2026-05-25 09:21:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4502746259104164742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18265509916392693534.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 406 rows 189 cols 1794 entries
Finished phase 1 with 181 SingleSign rule and 1 generalized
[2026-05-25 09:21:46] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18265509916392693534.kers
Total runtime 5 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/189 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 406/595 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/595 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/189 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 406/595 variables, 189/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/595 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/595 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 206 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1912ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 99 ms.
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 406/406 transitions.
Graph (trivial) has 184 edges and 189 vertex of which 9 / 189 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 183 transition count 371
Reduce places removed 26 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 157 transition count 369
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 155 transition count 369
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 57 place count 155 transition count 356
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 83 place count 142 transition count 356
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 129 place count 119 transition count 333
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 118 transition count 325
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 118 transition count 325
Performed 27 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 185 place count 91 transition count 450
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 199 place count 91 transition count 436
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 201 place count 89 transition count 420
Iterating global reduction 4 with 2 rules applied. Total rules applied 203 place count 89 transition count 420
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 208 place count 89 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 88 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 235 place count 88 transition count 404
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 5 with 6 rules applied. Total rules applied 241 place count 85 transition count 401
Free-agglomeration rule applied 30 times.
Iterating global reduction 5 with 30 rules applied. Total rules applied 271 place count 85 transition count 371
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 5 with 82 rules applied. Total rules applied 353 place count 55 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 377 place count 55 transition count 295
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 380 place count 55 transition count 292
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 383 place count 52 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 7 with 20 rules applied. Total rules applied 403 place count 52 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 405 place count 51 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 409 place count 51 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 411 place count 51 transition count 315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 413 place count 49 transition count 315
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 414 place count 48 transition count 314
Applied a total of 414 rules in 102 ms. Remains 48 /189 variables (removed 141) and now considering 314/406 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 48/189 places, 314/406 transitions.
RANDOM walk for 40000 steps (3397 resets) in 184 ms. (216 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (117 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
[2026-05-25 09:21:49] [INFO ] Flow matrix only has 240 transitions (discarded 74 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12176000731387148251.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7726937487439848539.kers'
[2026-05-25 09:21:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12176000731387148251.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7726937487439848539.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 240 rows 47 cols 1186 entries
Finished phase 1 with 40 SingleSign rule and 1 generalized
[2026-05-25 09:21:49] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7726937487439848539.kers
Total runtime 1 ms.
[2026-05-25 09:21:49] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/259 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/288 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 130/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/288 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/259 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/288 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 130/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/288 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 763ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 848 steps, including 104 resets, run visited all 1 properties in 7 ms. (steps per millisecond=121 )
Parikh walk visited 1 properties in 17 ms.
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 6752 ms.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 406/406 transitions.
Applied a total of 0 rules in 4 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9855568647744121380.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4017022680156085704.kers'
[2026-05-25 09:21:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9855568647744121380.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4017022680156085704.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 406 rows 189 cols 1794 entries
Finished phase 1 with 181 SingleSign rule and 1 generalized
[2026-05-25 09:21:50] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-4017022680156085704.kers
Total runtime 16 ms.
[2026-05-25 09:21:50] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-25 09:21:50] [INFO ] Invariant cache hit.
[2026-05-25 09:21:50] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 405 sub problems to find dead transitions.
[2026-05-25 09:21:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 406/595 variables, 189/238 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 595/595 variables, and 238 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 9 (OVERLAPS) 406/595 variables, 189/252 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/595 variables, 405/657 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/595 variables, and 657 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Finished structural reductions in LTL mode , in 1 iterations and 60665 ms. Remains : 189/189 places, 406/406 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1375 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (298 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (296 resets) in 32 ms. (1212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (300 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (298 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (296 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 933500 steps, run timeout after 3003 ms. (steps per millisecond=310 ) properties seen :3 out of 5
Probabilistic random walk after 933500 steps, saw 179754 distinct states, run finished after 3004 ms. (steps per millisecond=310 ) properties seen :3
[2026-05-25 09:22:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/189 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 406/595 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/595 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/189 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 406/595 variables, 189/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/595 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/595 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 206 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1396 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2136ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 178 ms.
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 406/406 transitions.
Graph (trivial) has 184 edges and 189 vertex of which 9 / 189 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 183 transition count 371
Reduce places removed 26 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 157 transition count 369
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 155 transition count 369
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 57 place count 155 transition count 356
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 83 place count 142 transition count 356
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 129 place count 119 transition count 333
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 118 transition count 325
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 118 transition count 325
Performed 27 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 185 place count 91 transition count 450
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 199 place count 91 transition count 436
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 201 place count 89 transition count 420
Iterating global reduction 4 with 2 rules applied. Total rules applied 203 place count 89 transition count 420
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 208 place count 89 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 88 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 235 place count 88 transition count 404
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 5 with 6 rules applied. Total rules applied 241 place count 85 transition count 401
Free-agglomeration rule applied 30 times.
Iterating global reduction 5 with 30 rules applied. Total rules applied 271 place count 85 transition count 371
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 5 with 82 rules applied. Total rules applied 353 place count 55 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 377 place count 55 transition count 295
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 380 place count 55 transition count 292
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 383 place count 52 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 7 with 20 rules applied. Total rules applied 403 place count 52 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 405 place count 51 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 409 place count 51 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 411 place count 51 transition count 315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 413 place count 49 transition count 315
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 414 place count 48 transition count 314
Applied a total of 414 rules in 69 ms. Remains 48 /189 variables (removed 141) and now considering 314/406 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 48/189 places, 314/406 transitions.
RANDOM walk for 30352 steps (2537 resets) in 149 ms. (202 steps per ms) remains 0/2 properties
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 5994 ms.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25049 reset in 125 ms.
Product exploration explored 100000 steps with 25022 reset in 110 ms.
Spot run failed in 148 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2432884665181508329
[2026-05-25 09:22:58] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2432884665181508329
Running compilation step : cd /tmp/ltsmin2432884665181508329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 874 ms.
Running link step : cd /tmp/ltsmin2432884665181508329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin2432884665181508329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased16483903060214219873.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 406/406 transitions.
Applied a total of 0 rules in 4 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2026-05-25 09:23:13] [INFO ] Invariant cache hit.
[2026-05-25 09:23:13] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-25 09:23:13] [INFO ] Invariant cache hit.
[2026-05-25 09:23:13] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 189/189 places, 406/406 transitions.
Built C files in :
/tmp/ltsmin1512785520621228485
[2026-05-25 09:23:13] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1512785520621228485
Running compilation step : cd /tmp/ltsmin1512785520621228485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 613 ms.
Running link step : cd /tmp/ltsmin1512785520621228485;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1512785520621228485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased1205669358250483835.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 09:23:28] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:23:28] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:23:28] [INFO ] Time to serialize gal into /tmp/LTL12930035997676796502.gal : 10 ms
[2026-05-25 09:23:28] [INFO ] Time to serialize properties into /tmp/LTL13616207910317556305.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12930035997676796502.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2640626714448899135.hoa' '-atoms' '/tmp/LTL13616207910317556305.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13616207910317556305.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2640626714448899135.hoa
Detected timeout of ITS tools.
[2026-05-25 09:23:43] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:23:43] [INFO ] Flatten gal took : 52 ms
[2026-05-25 09:23:43] [INFO ] Time to serialize gal into /tmp/LTL5366411944329957327.gal : 11 ms
[2026-05-25 09:23:43] [INFO ] Time to serialize properties into /tmp/LTL10516876217346425126.ltl : 5 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5366411944329957327.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10516876217346425126.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(p123==1)")||(X(X(F((G("((p136!=1)||(p188!=1))"))||(("((p136!=1)||(p188!=1))")&&(F("(p73!=1)"))))))))))
Formula 0 simplified : F(!"(p123==1)" & XXG(F!"((p136!=1)||(p188!=1))" & (!"((p136!=1)||(p188!=1))" | G!"(p73!=1)")))
Detected timeout of ITS tools.
[2026-05-25 09:23:58] [INFO ] Flatten gal took : 35 ms
[2026-05-25 09:23:58] [INFO ] Applying decomposition
[2026-05-25 09:23:58] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12053434184478793844.txt' '-o' '/tmp/graph12053434184478793844.bin' '-w' '/tmp/graph12053434184478793844.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12053434184478793844.bin' '-l' '-1' '-v' '-w' '/tmp/graph12053434184478793844.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:23:59] [INFO ] Decomposing Gal with order
[2026-05-25 09:23:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:23:59] [INFO ] Removed a total of 938 redundant transitions.
[2026-05-25 09:23:59] [INFO ] Flatten gal took : 107 ms
[2026-05-25 09:23:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 16 ms.
[2026-05-25 09:23:59] [INFO ] Time to serialize gal into /tmp/LTL14871703651704159909.gal : 5 ms
[2026-05-25 09:23:59] [INFO ] Time to serialize properties into /tmp/LTL503946398264834722.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14871703651704159909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL503946398264834722.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(i3.u29.p123==1)")||(X(X(F((G("((i5.u34.p136!=1)||(i8.u45.p188!=1))"))||(("((i5.u34.p136!=1)||(i8.u45.p188!=1))")&&(F("(i1.u12....173
Formula 0 simplified : F(!"(i3.u29.p123==1)" & XXG(F!"((i5.u34.p136!=1)||(i8.u45.p188!=1))" & (!"((i5.u34.p136!=1)||(i8.u45.p188!=1))" | G!"(i1.u12.p73!=1)...159
Reverse transition relation is NOT exact ! Due to transitions t20, t58, t103, t121, t172, t182, t184, t194, t202, t204, t228, t236, t260, t268, t280, t281,...900
Computing Next relation with stutter on 29621 deadlock states
42 unique states visited
42 strongly connected components in search stack
43 transitions explored
42 items max in DFS search stack
436 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,4.41269,178356,1,0,299941,962,5679,872363,421,3907,753485
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-17-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property MedleyA-PT-17-LTLFireability-00 finished in 202300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X(X(F(p1))))))))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 191 transition count 460
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 191 transition count 460
Applied a total of 14 rules in 3 ms. Remains 191 /198 variables (removed 7) and now considering 460/474 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17976651076280989257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16696568790349321655.kers'
[2026-05-25 09:24:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17976651076280989257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16696568790349321655.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 460 rows 191 cols 2302 entries
Finished phase 1 with 183 SingleSign rule and 1 generalized
[2026-05-25 09:24:04] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16696568790349321655.kers
Total runtime 6 ms.
[2026-05-25 09:24:04] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-25 09:24:04] [INFO ] Invariant cache hit.
[2026-05-25 09:24:04] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2026-05-25 09:24:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 191/651 variables, and 51 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/191 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
At refinement iteration 5 (OVERLAPS) 460/651 variables, 191/245 constraints. Problems are: Problem set: 50 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 409/654 constraints. Problems are: Problem set: 50 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 651/651 variables, and 654 constraints, problems are : Problem set: 50 solved, 409 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 409/459 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60190ms problems are : Problem set: 50 solved, 409 unsolved
Search for dead transitions found 50 dead transitions in 60192ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 191/198 places, 410/474 transitions.
Applied a total of 0 rules in 6 ms. Remains 191 /191 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60573 ms. Remains : 191/198 places, 410/474 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X(X(F(p1))))))))'
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-01 finished in 60901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Graph (trivial) has 203 edges and 198 vertex of which 9 / 198 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 191 transition count 439
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 163 transition count 439
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 57 place count 163 transition count 425
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 85 place count 149 transition count 425
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 94 place count 140 transition count 407
Iterating global reduction 2 with 9 rules applied. Total rules applied 103 place count 140 transition count 407
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 139 transition count 391
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 139 transition count 391
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 2 with 48 rules applied. Total rules applied 153 place count 115 transition count 367
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 114 transition count 355
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 114 transition count 355
Performed 23 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 201 place count 91 transition count 443
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 205 place count 91 transition count 439
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 207 place count 89 transition count 423
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 89 transition count 423
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 217 place count 89 transition count 415
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 221 place count 87 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 4 with 26 rules applied. Total rules applied 247 place count 87 transition count 419
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 255 place count 83 transition count 415
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 256 place count 82 transition count 414
Applied a total of 256 rules in 87 ms. Remains 82 /198 variables (removed 116) and now considering 414/474 (removed 60) transitions.
[2026-05-25 09:25:05] [INFO ] Flow matrix only has 382 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9556630275710978639.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17447218487443343629.kers'
[2026-05-25 09:25:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9556630275710978639.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17447218487443343629.kers]
Normalized transition count is 381 out of 382 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 381 rows 82 cols 1906 entries
Finished phase 1 with 74 SingleSign rule and 1 generalized
[2026-05-25 09:25:05] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17447218487443343629.kers
Total runtime 1 ms.
[2026-05-25 09:25:05] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-25 09:25:05] [INFO ] Flow matrix only has 382 transitions (discarded 32 similar events)
[2026-05-25 09:25:05] [INFO ] Invariant cache hit.
[2026-05-25 09:25:05] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:25:05] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2026-05-25 09:25:05] [INFO ] Redundant transitions in 15 ms returned []
Running 405 sub problems to find dead transitions.
[2026-05-25 09:25:05] [INFO ] Flow matrix only has 382 transitions (discarded 32 similar events)
[2026-05-25 09:25:05] [INFO ] Invariant cache hit.
[2026-05-25 09:25:05] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (OVERLAPS) 381/463 variables, 82/100 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 78/178 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (OVERLAPS) 1/464 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 179 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
At refinement iteration 3 (OVERLAPS) 381/463 variables, 82/100 constraints. Problems are: Problem set: 42 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 78/178 constraints. Problems are: Problem set: 42 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 363/541 constraints. Problems are: Problem set: 42 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/464 variables, and 541 constraints, problems are : Problem set: 42 solved, 363 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 363/405 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60245ms problems are : Problem set: 42 solved, 363 unsolved
Search for dead transitions found 42 dead transitions in 60246ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 82/198 places, 372/474 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 81 transition count 382
Applied a total of 2 rules in 22 ms. Remains 81 /82 variables (removed 1) and now considering 382/372 (removed -10) transitions.
[2026-05-25 09:26:06] [INFO ] Flow matrix only has 350 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7321735004404661341.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13500586170978998374.kers'
[2026-05-25 09:26:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7321735004404661341.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13500586170978998374.kers]
Normalized transition count is 349 out of 350 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 349 rows 81 cols 1630 entries
Finished phase 1 with 73 SingleSign rule and 1 generalized
[2026-05-25 09:26:06] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13500586170978998374.kers
Total runtime 6 ms.
[2026-05-25 09:26:06] [INFO ] Implicit Places using invariants in 152 ms returned []
[2026-05-25 09:26:06] [INFO ] Flow matrix only has 350 transitions (discarded 32 similar events)
[2026-05-25 09:26:06] [INFO ] Invariant cache hit.
[2026-05-25 09:26:06] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:26:06] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/198 places, 382/474 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61256 ms. Remains : 81/198 places, 382/474 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-02
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-02 finished in 61335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(!p0))||F((p1 U (G(p1)||(p1&&G(p2)))))) U p0))'
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 190 transition count 458
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 190 transition count 458
Applied a total of 16 rules in 3 ms. Remains 190 /198 variables (removed 8) and now considering 458/474 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5590809901003390394.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11720907595566887041.kers'
[2026-05-25 09:26:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5590809901003390394.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11720907595566887041.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 458 rows 190 cols 2298 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-05-25 09:26:06] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11720907595566887041.kers
Total runtime 3 ms.
[2026-05-25 09:26:06] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-25 09:26:06] [INFO ] Invariant cache hit.
[2026-05-25 09:26:07] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2026-05-25 09:26:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 46 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 5 (OVERLAPS) 458/648 variables, 190/239 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 407/646 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 646 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60134ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/198 places, 408/474 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60512 ms. Remains : 190/198 places, 408/474 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(!p0))||F((p1 U (G(p1)||(p1&&G(p2)))))) U p0))'
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-03
Product exploration explored 100000 steps with 24924 reset in 101 ms.
Product exploration explored 100000 steps with 24970 reset in 154 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Detected a total of 15/190 stabilizing places and 15/408 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 20 factoid took 111 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (1376 resets) in 318 ms. (125 steps per ms) remains 8/13 properties
BEST_FIRST walk for 40003 steps (298 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (302 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (303 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (305 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (360 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (301 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (305 resets) in 466 ms. (85 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (361 resets) in 42 ms. (930 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1701604251052004205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5039647114471628465.kers'
[2026-05-25 09:27:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1701604251052004205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5039647114471628465.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 408 rows 190 cols 1798 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-05-25 09:27:08] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5039647114471628465.kers
Total runtime 2 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf2 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 78/85 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem apf4 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 6/11 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 105/190 variables, 2/13 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/14 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 408/598 variables, 190/204 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/598 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 204 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 78/85 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 6/11 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 105/190 variables, 2/13 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/14 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 408/598 variables, 190/204 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 5/209 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 1/210 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 0/210 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/598 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/598 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/598 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 211 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1122 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2197ms problems are : Problem set: 3 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 484 ms.
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 408/408 transitions.
Graph (trivial) has 184 edges and 190 vertex of which 9 / 190 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 184 transition count 370
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 155 transition count 370
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 59 place count 155 transition count 358
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 83 place count 143 transition count 358
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 129 place count 120 transition count 335
Performed 26 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 181 place count 94 transition count 470
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 199 place count 94 transition count 452
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 201 place count 92 transition count 436
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 92 transition count 436
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 211 place count 92 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 224 place count 92 transition count 415
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 4 with 6 rules applied. Total rules applied 230 place count 89 transition count 412
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 88 transition count 422
Free-agglomeration rule applied 27 times.
Iterating global reduction 4 with 27 rules applied. Total rules applied 259 place count 88 transition count 395
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 4 with 83 rules applied. Total rules applied 342 place count 61 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 378 place count 61 transition count 303
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 382 place count 61 transition count 299
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 386 place count 57 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 6 with 32 rules applied. Total rules applied 418 place count 57 transition count 267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 422 place count 55 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 430 place count 55 transition count 297
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 432 place count 55 transition count 325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 434 place count 53 transition count 325
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 435 place count 52 transition count 324
Applied a total of 435 rules in 61 ms. Remains 52 /190 variables (removed 138) and now considering 324/408 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 52/190 places, 324/408 transitions.
RANDOM walk for 8290 steps (467 resets) in 39 ms. (207 steps per ms) remains 0/5 properties
Found 3 invariant AP formulas.
Knowledge based reduction with 23 factoid took 277 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
[2026-05-25 09:27:11] [INFO ] Invariant cache hit.
[2026-05-25 09:27:11] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2026-05-25 09:27:12] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2026-05-25 09:27:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:27:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 09:27:12] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2026-05-25 09:27:12] [INFO ] Computed and/alt/rep : 324/1084/324 causal constraints (skipped 83 transitions) in 19 ms.
[2026-05-25 09:27:13] [INFO ] Added : 149 causal constraints over 30 iterations in 919 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 5517 ms.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 408/408 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
[2026-05-25 09:27:13] [INFO ] Invariant cache hit.
[2026-05-25 09:27:13] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 09:27:13] [INFO ] Invariant cache hit.
[2026-05-25 09:27:13] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2026-05-25 09:27:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 407 unsolved
SMT process timed out in 30100ms, After SMT, problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 30101ms
Finished structural reductions in LTL mode , in 1 iterations and 30539 ms. Remains : 190/190 places, 408/408 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Detected a total of 15/190 stabilizing places and 15/408 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 10 factoid took 126 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1376 resets) in 171 ms. (232 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (298 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (359 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (301 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (360 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
[2026-05-25 09:27:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 105/190 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 408/598 variables, 190/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/598 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 205 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1495 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 105/190 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 408/598 variables, 190/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/598 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 210 constraints, problems are : Problem set: 0 solved, 4 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2122ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 178 ms.
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 408/408 transitions.
Graph (trivial) has 184 edges and 190 vertex of which 9 / 190 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 184 transition count 370
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 155 transition count 370
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 59 place count 155 transition count 358
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 83 place count 143 transition count 358
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 129 place count 120 transition count 335
Performed 26 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 181 place count 94 transition count 470
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 199 place count 94 transition count 452
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 201 place count 92 transition count 436
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 92 transition count 436
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 211 place count 92 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 224 place count 92 transition count 415
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 4 with 6 rules applied. Total rules applied 230 place count 89 transition count 412
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 88 transition count 422
Free-agglomeration rule applied 27 times.
Iterating global reduction 4 with 27 rules applied. Total rules applied 259 place count 88 transition count 395
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 4 with 83 rules applied. Total rules applied 342 place count 61 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 378 place count 61 transition count 303
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 382 place count 61 transition count 299
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 386 place count 57 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 6 with 32 rules applied. Total rules applied 418 place count 57 transition count 267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 422 place count 55 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 430 place count 55 transition count 297
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 432 place count 55 transition count 325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 434 place count 53 transition count 325
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 435 place count 52 transition count 324
Applied a total of 435 rules in 112 ms. Remains 52 /190 variables (removed 138) and now considering 324/408 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 52/190 places, 324/408 transitions.
RANDOM walk for 6382 steps (358 resets) in 28 ms. (220 steps per ms) remains 0/4 properties
Knowledge based reduction with 10 factoid took 217 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
[2026-05-25 09:27:47] [INFO ] Invariant cache hit.
[2026-05-25 09:27:47] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:27:47] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2026-05-25 09:27:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:27:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 09:27:47] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2026-05-25 09:27:47] [INFO ] Computed and/alt/rep : 324/1084/324 causal constraints (skipped 83 transitions) in 29 ms.
[2026-05-25 09:27:49] [INFO ] Added : 149 causal constraints over 30 iterations in 1294 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 5120 ms.
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25037 reset in 160 ms.
Product exploration explored 100000 steps with 24991 reset in 146 ms.
Spot run failed in 83 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin7579791567368044564
[2026-05-25 09:27:50] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7579791567368044564
Running compilation step : cd /tmp/ltsmin7579791567368044564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 731 ms.
Running link step : cd /tmp/ltsmin7579791567368044564;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin7579791567368044564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased13595036050082525769.hoa' '--buchi-type=spotba'
LTSmin run took 53 ms.
FORMULA MedleyA-PT-17-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-17-LTLFireability-03 finished in 104532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(p0)'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Graph (trivial) has 204 edges and 198 vertex of which 9 / 198 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 191 transition count 440
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 164 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 163 transition count 439
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 57 place count 163 transition count 425
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 85 place count 149 transition count 425
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 94 place count 140 transition count 407
Iterating global reduction 3 with 9 rules applied. Total rules applied 103 place count 140 transition count 407
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 139 transition count 391
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 139 transition count 391
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 3 with 48 rules applied. Total rules applied 153 place count 115 transition count 367
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 114 transition count 355
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 114 transition count 355
Performed 23 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 201 place count 91 transition count 443
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 205 place count 91 transition count 439
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 207 place count 89 transition count 423
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 89 transition count 423
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 217 place count 89 transition count 415
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 221 place count 87 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 247 place count 87 transition count 419
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 255 place count 83 transition count 415
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 256 place count 82 transition count 414
Applied a total of 256 rules in 87 ms. Remains 82 /198 variables (removed 116) and now considering 414/474 (removed 60) transitions.
[2026-05-25 09:27:51] [INFO ] Flow matrix only has 382 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3853819377624314166.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4874090627794378770.kers'
[2026-05-25 09:27:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3853819377624314166.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4874090627794378770.kers]
Normalized transition count is 381 out of 382 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 381 rows 82 cols 1906 entries
Finished phase 1 with 74 SingleSign rule and 1 generalized
[2026-05-25 09:27:51] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4874090627794378770.kers
Total runtime 2 ms.
[2026-05-25 09:27:51] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-25 09:27:51] [INFO ] Flow matrix only has 382 transitions (discarded 32 similar events)
[2026-05-25 09:27:51] [INFO ] Invariant cache hit.
[2026-05-25 09:27:51] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:27:51] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2026-05-25 09:27:51] [INFO ] Redundant transitions in 9 ms returned []
Running 405 sub problems to find dead transitions.
[2026-05-25 09:27:51] [INFO ] Flow matrix only has 382 transitions (discarded 32 similar events)
[2026-05-25 09:27:51] [INFO ] Invariant cache hit.
[2026-05-25 09:27:51] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (OVERLAPS) 381/463 variables, 82/100 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 78/178 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (OVERLAPS) 1/464 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 179 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
At refinement iteration 3 (OVERLAPS) 381/463 variables, 82/100 constraints. Problems are: Problem set: 42 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 78/178 constraints. Problems are: Problem set: 42 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 363/541 constraints. Problems are: Problem set: 42 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/464 variables, and 541 constraints, problems are : Problem set: 42 solved, 363 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 363/405 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 42 solved, 363 unsolved
Search for dead transitions found 42 dead transitions in 60218ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 82/198 places, 372/474 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 81 transition count 382
Applied a total of 2 rules in 19 ms. Remains 81 /82 variables (removed 1) and now considering 382/372 (removed -10) transitions.
[2026-05-25 09:28:51] [INFO ] Flow matrix only has 350 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16486692103697265635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10952801723099776878.kers'
[2026-05-25 09:28:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16486692103697265635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10952801723099776878.kers]
Normalized transition count is 349 out of 350 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 349 rows 81 cols 1630 entries
Finished phase 1 with 73 SingleSign rule and 1 generalized
[2026-05-25 09:28:51] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10952801723099776878.kers
Total runtime 3 ms.
[2026-05-25 09:28:52] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-25 09:28:52] [INFO ] Flow matrix only has 350 transitions (discarded 32 similar events)
[2026-05-25 09:28:52] [INFO ] Invariant cache hit.
[2026-05-25 09:28:52] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:28:52] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/198 places, 382/474 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61091 ms. Remains : 81/198 places, 382/474 transitions.
Initial state reduction rules removed 1 formulas.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(false)'
Stuttering acceptance computed with spot in 26 ms :[true]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-04
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-04 finished in 61143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Graph (trivial) has 187 edges and 198 vertex of which 9 / 198 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 191 transition count 441
Reduce places removed 26 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 165 transition count 439
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 163 transition count 439
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 57 place count 163 transition count 426
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 83 place count 150 transition count 426
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 92 place count 141 transition count 408
Iterating global reduction 3 with 9 rules applied. Total rules applied 101 place count 141 transition count 408
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 140 transition count 392
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 140 transition count 392
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 145 place count 119 transition count 371
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 118 transition count 359
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 118 transition count 359
Performed 22 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 191 place count 96 transition count 442
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 195 place count 96 transition count 438
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 197 place count 94 transition count 422
Iterating global reduction 4 with 2 rules applied. Total rules applied 199 place count 94 transition count 422
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 207 place count 94 transition count 414
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 211 place count 92 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 5 with 23 rules applied. Total rules applied 234 place count 92 transition count 421
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 236 place count 91 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 90 transition count 419
Applied a total of 237 rules in 67 ms. Remains 90 /198 variables (removed 108) and now considering 419/474 (removed 55) transitions.
[2026-05-25 09:28:52] [INFO ] Flow matrix only has 391 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9635248734431554996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13552045157617802001.kers'
[2026-05-25 09:28:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9635248734431554996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13552045157617802001.kers]
Normalized transition count is 390 out of 391 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 390 rows 90 cols 2000 entries
Finished phase 1 with 82 SingleSign rule and 1 generalized
[2026-05-25 09:28:52] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13552045157617802001.kers
Total runtime 3 ms.
[2026-05-25 09:28:52] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-25 09:28:52] [INFO ] Flow matrix only has 391 transitions (discarded 28 similar events)
[2026-05-25 09:28:52] [INFO ] Invariant cache hit.
[2026-05-25 09:28:52] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:28:52] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2026-05-25 09:28:52] [INFO ] Redundant transitions in 16 ms returned []
Running 413 sub problems to find dead transitions.
[2026-05-25 09:28:52] [INFO ] Flow matrix only has 391 transitions (discarded 28 similar events)
[2026-05-25 09:28:52] [INFO ] Invariant cache hit.
[2026-05-25 09:28:52] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 4/90 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (OVERLAPS) 390/480 variables, 90/109 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 78/187 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (OVERLAPS) 1/481 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/481 variables, and 188 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 90/90 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
At refinement iteration 7 (OVERLAPS) 390/480 variables, 90/112 constraints. Problems are: Problem set: 42 solved, 371 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 78/190 constraints. Problems are: Problem set: 42 solved, 371 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 371/561 constraints. Problems are: Problem set: 42 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/481 variables, and 561 constraints, problems are : Problem set: 42 solved, 371 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 90/90 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 371/413 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60197ms problems are : Problem set: 42 solved, 371 unsolved
Search for dead transitions found 42 dead transitions in 60197ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 90/198 places, 377/474 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 387
Applied a total of 2 rules in 18 ms. Remains 89 /90 variables (removed 1) and now considering 387/377 (removed -10) transitions.
[2026-05-25 09:29:53] [INFO ] Flow matrix only has 359 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4056479338759974977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16999624969490814446.kers'
[2026-05-25 09:29:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4056479338759974977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16999624969490814446.kers]
Normalized transition count is 358 out of 359 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 358 rows 89 cols 1702 entries
Finished phase 1 with 81 SingleSign rule and 1 generalized
[2026-05-25 09:29:53] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16999624969490814446.kers
Total runtime 4 ms.
[2026-05-25 09:29:53] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 09:29:53] [INFO ] Flow matrix only has 359 transitions (discarded 28 similar events)
[2026-05-25 09:29:53] [INFO ] Invariant cache hit.
[2026-05-25 09:29:53] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:29:53] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/198 places, 387/474 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61103 ms. Remains : 89/198 places, 387/474 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-05
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-05 finished in 61187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G((p1||(p1 U p0)))) U X(X(p0))))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 190 transition count 458
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 190 transition count 458
Applied a total of 16 rules in 3 ms. Remains 190 /198 variables (removed 8) and now considering 458/474 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4550510358984206188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15923716897845837105.kers'
[2026-05-25 09:29:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4550510358984206188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15923716897845837105.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 458 rows 190 cols 2298 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-05-25 09:29:53] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-15923716897845837105.kers
Total runtime 14 ms.
[2026-05-25 09:29:53] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-25 09:29:53] [INFO ] Invariant cache hit.
[2026-05-25 09:29:54] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2026-05-25 09:29:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 458/648 variables, 190/239 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 239 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/648 variables, and 62 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 0/457 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in LTL mode, iteration 1 : 190/198 places, 458/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60667 ms. Remains : 190/198 places, 458/474 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G((p1||(p1 U p0)))) U X(X(p0))))'
Stuttering acceptance computed with spot in 354 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-06 finished in 61056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Graph (trivial) has 203 edges and 198 vertex of which 9 / 198 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 191 transition count 439
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 163 transition count 439
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 57 place count 163 transition count 426
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 83 place count 150 transition count 426
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 91 place count 142 transition count 410
Iterating global reduction 2 with 8 rules applied. Total rules applied 99 place count 142 transition count 410
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 2 with 48 rules applied. Total rules applied 147 place count 118 transition count 386
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 117 transition count 370
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 117 transition count 370
Performed 22 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 193 place count 95 transition count 458
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 197 place count 95 transition count 454
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 199 place count 93 transition count 438
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 93 transition count 438
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 209 place count 93 transition count 430
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 213 place count 91 transition count 460
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 238 place count 91 transition count 435
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 246 place count 87 transition count 431
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 86 transition count 430
Applied a total of 247 rules in 97 ms. Remains 86 /198 variables (removed 112) and now considering 430/474 (removed 44) transitions.
[2026-05-25 09:30:54] [INFO ] Flow matrix only has 398 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7407501526604924984.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8204460475889668209.kers'
[2026-05-25 09:30:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7407501526604924984.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8204460475889668209.kers]
Normalized transition count is 397 out of 398 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 397 rows 86 cols 2034 entries
Finished phase 1 with 78 SingleSign rule and 1 generalized
[2026-05-25 09:30:54] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8204460475889668209.kers
Total runtime 6 ms.
[2026-05-25 09:30:54] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-25 09:30:54] [INFO ] Flow matrix only has 398 transitions (discarded 32 similar events)
[2026-05-25 09:30:54] [INFO ] Invariant cache hit.
[2026-05-25 09:30:54] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:30:55] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2026-05-25 09:30:55] [INFO ] Redundant transitions in 2 ms returned []
Running 421 sub problems to find dead transitions.
[2026-05-25 09:30:55] [INFO ] Flow matrix only has 398 transitions (discarded 32 similar events)
[2026-05-25 09:30:55] [INFO ] Invariant cache hit.
[2026-05-25 09:30:55] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 397/483 variables, 86/106 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 78/184 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (OVERLAPS) 1/484 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/484 variables, and 185 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
At refinement iteration 4 (OVERLAPS) 397/483 variables, 86/107 constraints. Problems are: Problem set: 48 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 78/185 constraints. Problems are: Problem set: 48 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 373/558 constraints. Problems are: Problem set: 48 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/484 variables, and 558 constraints, problems are : Problem set: 48 solved, 373 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 373/421 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60253ms problems are : Problem set: 48 solved, 373 unsolved
Search for dead transitions found 48 dead transitions in 60255ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 86/198 places, 382/474 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 392
Applied a total of 2 rules in 6 ms. Remains 85 /86 variables (removed 1) and now considering 392/382 (removed -10) transitions.
[2026-05-25 09:31:55] [INFO ] Flow matrix only has 360 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10933331821632241695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15529826171198398186.kers'
[2026-05-25 09:31:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10933331821632241695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15529826171198398186.kers]
Normalized transition count is 359 out of 360 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 359 rows 85 cols 1698 entries
Finished phase 1 with 77 SingleSign rule and 1 generalized
[2026-05-25 09:31:55] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15529826171198398186.kers
Total runtime 2 ms.
[2026-05-25 09:31:55] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 09:31:55] [INFO ] Flow matrix only has 360 transitions (discarded 32 similar events)
[2026-05-25 09:31:55] [INFO ] Invariant cache hit.
[2026-05-25 09:31:55] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:31:55] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/198 places, 392/474 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61193 ms. Remains : 85/198 places, 392/474 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-07
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-07 finished in 61395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(G(p1))))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 190 transition count 458
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 190 transition count 458
Applied a total of 16 rules in 4 ms. Remains 190 /198 variables (removed 8) and now considering 458/474 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13297875813631111271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6188780988541535492.kers'
[2026-05-25 09:31:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13297875813631111271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6188780988541535492.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 458 rows 190 cols 2298 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-05-25 09:31:56] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6188780988541535492.kers
Total runtime 5 ms.
[2026-05-25 09:31:56] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-25 09:31:56] [INFO ] Invariant cache hit.
[2026-05-25 09:31:56] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 190/198 places, 458/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 190/198 places, 458/474 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(G(p1))))))'
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-09
Product exploration explored 100000 steps with 3447 reset in 184 ms.
Product exploration explored 100000 steps with 3447 reset in 167 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1376 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (300 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (300 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1669788 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :1 out of 2
Probabilistic random walk after 1669788 steps, saw 284710 distinct states, run finished after 3001 ms. (steps per millisecond=556 ) properties seen :1
[2026-05-25 09:32:00] [INFO ] Invariant cache hit.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/190 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 458/648 variables, 190/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/648 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/190 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 458/648 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1058ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 458/458 transitions.
Graph (trivial) has 190 edges and 190 vertex of which 9 / 190 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 184 transition count 420
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 155 transition count 420
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 59 place count 155 transition count 408
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 83 place count 143 transition count 408
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 142 transition count 406
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 142 transition count 406
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 135 place count 117 transition count 381
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 115 transition count 353
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 115 transition count 353
Performed 25 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 189 place count 90 transition count 475
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 207 place count 90 transition count 457
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 209 place count 88 transition count 441
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 88 transition count 441
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 219 place count 88 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 223 place count 88 transition count 429
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 231 place count 84 transition count 425
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 262 place count 84 transition count 394
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 332 place count 53 transition count 355
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 5 with 43 rules applied. Total rules applied 375 place count 53 transition count 312
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 377 place count 53 transition count 340
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 379 place count 51 transition count 340
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 380 place count 50 transition count 339
Applied a total of 380 rules in 46 ms. Remains 50 /190 variables (removed 140) and now considering 339/458 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 50/190 places, 339/458 transitions.
RANDOM walk for 12102 steps (982 resets) in 59 ms. (201 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 4533 ms.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 458/458 transitions.
Applied a total of 0 rules in 1 ms. Remains 190 /190 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2026-05-25 09:32:01] [INFO ] Invariant cache hit.
[2026-05-25 09:32:01] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 09:32:01] [INFO ] Invariant cache hit.
[2026-05-25 09:32:02] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 190/190 places, 458/458 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 2 factoid took 50 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1376 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (300 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (297 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1585255 steps, run timeout after 3001 ms. (steps per millisecond=528 ) properties seen :1 out of 2
Probabilistic random walk after 1585255 steps, saw 271295 distinct states, run finished after 3001 ms. (steps per millisecond=528 ) properties seen :1
[2026-05-25 09:32:05] [INFO ] Invariant cache hit.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/190 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 458/648 variables, 190/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/648 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/190 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 458/648 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1209ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 458/458 transitions.
Graph (trivial) has 190 edges and 190 vertex of which 9 / 190 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 184 transition count 420
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 155 transition count 420
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 59 place count 155 transition count 408
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 83 place count 143 transition count 408
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 142 transition count 406
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 142 transition count 406
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 135 place count 117 transition count 381
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 115 transition count 353
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 115 transition count 353
Performed 25 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 189 place count 90 transition count 475
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 207 place count 90 transition count 457
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 209 place count 88 transition count 441
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 88 transition count 441
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 219 place count 88 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 223 place count 88 transition count 429
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 231 place count 84 transition count 425
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 262 place count 84 transition count 394
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 332 place count 53 transition count 355
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 5 with 43 rules applied. Total rules applied 375 place count 53 transition count 312
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 377 place count 53 transition count 340
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 379 place count 51 transition count 340
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 380 place count 50 transition count 339
Applied a total of 380 rules in 66 ms. Remains 50 /190 variables (removed 140) and now considering 339/458 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 50/190 places, 339/458 transitions.
RANDOM walk for 3205 steps (264 resets) in 14 ms. (213 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 4749 ms.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3447 reset in 157 ms.
Product exploration explored 100000 steps with 3447 reset in 193 ms.
Spot run failed in 83 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8287116120474190343
[2026-05-25 09:32:07] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8287116120474190343
Running compilation step : cd /tmp/ltsmin8287116120474190343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 787 ms.
Running link step : cd /tmp/ltsmin8287116120474190343;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin8287116120474190343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3954950036080871427.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 458/458 transitions.
Applied a total of 0 rules in 1 ms. Remains 190 /190 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2026-05-25 09:32:22] [INFO ] Invariant cache hit.
[2026-05-25 09:32:22] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-25 09:32:22] [INFO ] Invariant cache hit.
[2026-05-25 09:32:23] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 190/190 places, 458/458 transitions.
Built C files in :
/tmp/ltsmin13361577986055311873
[2026-05-25 09:32:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13361577986055311873
Running compilation step : cd /tmp/ltsmin13361577986055311873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 770 ms.
Running link step : cd /tmp/ltsmin13361577986055311873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin13361577986055311873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9851733987158123987.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 09:32:38] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:32:38] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:32:38] [INFO ] Time to serialize gal into /tmp/LTL1884851962569786440.gal : 4 ms
[2026-05-25 09:32:38] [INFO ] Time to serialize properties into /tmp/LTL16324853461473206181.prop : 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1884851962569786440.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7911960698936757795.hoa' '-atoms' '/tmp/LTL16324853461473206181.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16324853461473206181.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7911960698936757795.hoa
Detected timeout of ITS tools.
[2026-05-25 09:32:53] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:32:53] [INFO ] Flatten gal took : 32 ms
[2026-05-25 09:32:53] [INFO ] Time to serialize gal into /tmp/LTL14144297563251609153.gal : 4 ms
[2026-05-25 09:32:53] [INFO ] Time to serialize properties into /tmp/LTL7580751340197538143.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14144297563251609153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7580751340197538143.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((p9==0)||(p211==0))"))||(F(G("(p32!=1)")))))))
Formula 0 simplified : XX(F!"((p9==0)||(p211==0))" & GF!"(p32!=1)")
Detected timeout of ITS tools.
[2026-05-25 09:33:08] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:33:08] [INFO ] Applying decomposition
[2026-05-25 09:33:08] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3863223337390769132.txt' '-o' '/tmp/graph3863223337390769132.bin' '-w' '/tmp/graph3863223337390769132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3863223337390769132.bin' '-l' '-1' '-v' '-w' '/tmp/graph3863223337390769132.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:33:08] [INFO ] Decomposing Gal with order
[2026-05-25 09:33:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:33:08] [INFO ] Removed a total of 1078 redundant transitions.
[2026-05-25 09:33:08] [INFO ] Flatten gal took : 30 ms
[2026-05-25 09:33:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 15 ms.
[2026-05-25 09:33:08] [INFO ] Time to serialize gal into /tmp/LTL11004854184640412976.gal : 3 ms
[2026-05-25 09:33:08] [INFO ] Time to serialize properties into /tmp/LTL14724863430576422407.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11004854184640412976.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14724863430576422407.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((u3.p9==0)||(i7.i1.i1.u52.p211==0))"))||(F(G("(i3.u9.p32!=1)")))))))
Formula 0 simplified : XX(F!"((u3.p9==0)||(i7.i1.i1.u52.p211==0))" & GF!"(i3.u9.p32!=1)")
Detected timeout of ITS tools.
Treatment of property MedleyA-PT-17-LTLFireability-09 finished in 87651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Graph (trivial) has 203 edges and 198 vertex of which 9 / 198 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 191 transition count 439
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 163 transition count 439
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 57 place count 163 transition count 427
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 81 place count 151 transition count 427
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 90 place count 142 transition count 409
Iterating global reduction 2 with 9 rules applied. Total rules applied 99 place count 142 transition count 409
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 147 place count 118 transition count 385
Performed 24 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 195 place count 94 transition count 479
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 197 place count 92 transition count 463
Iterating global reduction 2 with 2 rules applied. Total rules applied 199 place count 92 transition count 463
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 207 place count 92 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 231 place count 92 transition count 431
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 239 place count 88 transition count 427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 240 place count 87 transition count 426
Applied a total of 240 rules in 27 ms. Remains 87 /198 variables (removed 111) and now considering 426/474 (removed 48) transitions.
[2026-05-25 09:33:23] [INFO ] Flow matrix only has 394 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16088791914515280204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12512499492619413671.kers'
[2026-05-25 09:33:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16088791914515280204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12512499492619413671.kers]
Normalized transition count is 393 out of 394 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 393 rows 87 cols 2058 entries
Finished phase 1 with 79 SingleSign rule and 1 generalized
[2026-05-25 09:33:23] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12512499492619413671.kers
Total runtime 7 ms.
[2026-05-25 09:33:23] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 09:33:23] [INFO ] Flow matrix only has 394 transitions (discarded 32 similar events)
[2026-05-25 09:33:23] [INFO ] Invariant cache hit.
[2026-05-25 09:33:23] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 09:33:24] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2026-05-25 09:33:24] [INFO ] Redundant transitions in 6 ms returned []
Running 417 sub problems to find dead transitions.
[2026-05-25 09:33:24] [INFO ] Flow matrix only has 394 transitions (discarded 32 similar events)
[2026-05-25 09:33:24] [INFO ] Invariant cache hit.
[2026-05-25 09:33:24] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 393/480 variables, 87/109 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 70/179 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (OVERLAPS) 1/481 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/481 variables, and 180 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 87/87 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
At refinement iteration 3 (OVERLAPS) 393/480 variables, 87/109 constraints. Problems are: Problem set: 50 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 70/179 constraints. Problems are: Problem set: 50 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 367/546 constraints. Problems are: Problem set: 50 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/481 variables, and 546 constraints, problems are : Problem set: 50 solved, 367 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 87/87 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 367/417 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60258ms problems are : Problem set: 50 solved, 367 unsolved
Search for dead transitions found 50 dead transitions in 60260ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 87/198 places, 376/474 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 386
Applied a total of 2 rules in 15 ms. Remains 86 /87 variables (removed 1) and now considering 386/376 (removed -10) transitions.
[2026-05-25 09:34:24] [INFO ] Flow matrix only has 354 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3974205486953915044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11747588445517764768.kers'
[2026-05-25 09:34:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3974205486953915044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11747588445517764768.kers]
Normalized transition count is 353 out of 354 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 353 rows 86 cols 1702 entries
Finished phase 1 with 78 SingleSign rule and 1 generalized
[2026-05-25 09:34:24] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11747588445517764768.kers
Total runtime 3 ms.
[2026-05-25 09:34:24] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-25 09:34:24] [INFO ] Flow matrix only has 354 transitions (discarded 32 similar events)
[2026-05-25 09:34:24] [INFO ] Invariant cache hit.
[2026-05-25 09:34:24] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 09:34:24] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/198 places, 386/474 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61248 ms. Remains : 86/198 places, 386/474 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 18137 reset in 263 ms.
Product exploration explored 100000 steps with 18130 reset in 288 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 21777 steps (4041 resets) in 159 ms. (136 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Knowledge-based reduction took 262 ms.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 386/386 transitions.
Applied a total of 0 rules in 10 ms. Remains 86 /86 variables (removed 0) and now considering 386/386 (removed 0) transitions.
[2026-05-25 09:34:25] [INFO ] Flow matrix only has 354 transitions (discarded 32 similar events)
[2026-05-25 09:34:25] [INFO ] Invariant cache hit.
[2026-05-25 09:34:25] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-25 09:34:25] [INFO ] Flow matrix only has 354 transitions (discarded 32 similar events)
[2026-05-25 09:34:25] [INFO ] Invariant cache hit.
[2026-05-25 09:34:26] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 09:34:26] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2026-05-25 09:34:26] [INFO ] Redundant transitions in 5 ms returned []
Running 377 sub problems to find dead transitions.
[2026-05-25 09:34:26] [INFO ] Flow matrix only has 354 transitions (discarded 32 similar events)
[2026-05-25 09:34:26] [INFO ] Invariant cache hit.
[2026-05-25 09:34:26] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 353/439 variables, 86/117 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 70/187 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 1/440 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 189 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (OVERLAPS) 353/439 variables, 86/118 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 70/188 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 377/565 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/440 variables, and 565 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60242ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60789 ms. Remains : 86/86 places, 386/386 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 36916 steps (6797 resets) in 87 ms. (419 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Knowledge-based reduction took 301 ms.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18149 reset in 163 ms.
Product exploration explored 100000 steps with 18157 reset in 165 ms.
Built C files in :
/tmp/ltsmin14012139296707205208
[2026-05-25 09:35:27] [INFO ] Computing symmetric may disable matrix : 386 transitions.
[2026-05-25 09:35:27] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:35:27] [INFO ] Computing symmetric may enable matrix : 386 transitions.
[2026-05-25 09:35:27] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:35:27] [INFO ] Computing Do-Not-Accords matrix : 386 transitions.
[2026-05-25 09:35:27] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:35:27] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14012139296707205208
Running compilation step : cd /tmp/ltsmin14012139296707205208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 968 ms.
Running link step : cd /tmp/ltsmin14012139296707205208;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin14012139296707205208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7034828044478252418.hoa' '--buchi-type=spotba'
LTSmin run took 1414 ms.
FORMULA MedleyA-PT-17-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-17-LTLFireability-10 finished in 126363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 190 transition count 458
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 190 transition count 458
Applied a total of 16 rules in 3 ms. Remains 190 /198 variables (removed 8) and now considering 458/474 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15289378161937318397.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1166455361844729245.kers'
[2026-05-25 09:35:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15289378161937318397.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1166455361844729245.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 458 rows 190 cols 2298 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-05-25 09:35:30] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1166455361844729245.kers
Total runtime 3 ms.
[2026-05-25 09:35:30] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-25 09:35:30] [INFO ] Invariant cache hit.
[2026-05-25 09:35:30] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2026-05-25 09:35:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 46 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
At refinement iteration 8 (OVERLAPS) 458/648 variables, 190/250 constraints. Problems are: Problem set: 19 solved, 438 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 688 constraints, problems are : Problem set: 19 solved, 438 unsolved in 30126 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 438/457 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60302ms problems are : Problem set: 19 solved, 438 unsolved
Search for dead transitions found 19 dead transitions in 60304ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/198 places, 439/474 transitions.
Applied a total of 0 rules in 1 ms. Remains 190 /190 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60700 ms. Remains : 190/198 places, 439/474 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-11
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-11 finished in 60828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p0 U ((p1 U p2)||G(p0)))))))'
Support contains 10 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 189 transition count 456
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 189 transition count 456
Applied a total of 18 rules in 2 ms. Remains 189 /198 variables (removed 9) and now considering 456/474 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2620791631155655150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8404027771749338668.kers'
[2026-05-25 09:36:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2620791631155655150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8404027771749338668.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 456 rows 189 cols 2294 entries
Finished phase 1 with 181 SingleSign rule and 1 generalized
[2026-05-25 09:36:30] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8404027771749338668.kers
Total runtime 2 ms.
[2026-05-25 09:36:30] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 09:36:30] [INFO ] Invariant cache hit.
[2026-05-25 09:36:31] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2026-05-25 09:36:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/645 variables, and 42 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (OVERLAPS) 456/645 variables, 189/241 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 405/646 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 646 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60164ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/198 places, 406/474 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60506 ms. Remains : 189/198 places, 406/474 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p0 U ((p1 U p2)||G(p0)))))))'
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-12
Product exploration explored 100000 steps with 3448 reset in 140 ms.
Product exploration explored 100000 steps with 3447 reset in 194 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 8 factoid took 105 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1376 resets) in 308 ms. (129 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (299 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (303 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (303 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (306 resets) in 49 ms. (800 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (296 resets) in 41 ms. (952 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (304 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (305 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (299 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 602307 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :3 out of 8
Probabilistic random walk after 602307 steps, saw 112155 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :3
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5030913937063003540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16715264330942715362.kers'
[2026-05-25 09:37:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5030913937063003540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16715264330942715362.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 406 rows 189 cols 1794 entries
Finished phase 1 with 181 SingleSign rule and 1 generalized
[2026-05-25 09:37:35] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16715264330942715362.kers
Total runtime 2 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 127/137 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 52/189 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 406/595 variables, 189/196 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/595 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 196 constraints, problems are : Problem set: 1 solved, 4 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 128/137 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 52/189 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 406/595 variables, 189/198 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 4/202 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 1/203 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/595 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 203 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2095 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2536ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1986 ms.
Support contains 9 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 406/406 transitions.
Graph (trivial) has 165 edges and 189 vertex of which 6 / 189 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 185 transition count 371
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 156 transition count 371
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 59 place count 156 transition count 358
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 85 place count 143 transition count 358
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 2 with 48 rules applied. Total rules applied 133 place count 119 transition count 334
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 118 transition count 326
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 118 transition count 326
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 169 place count 101 transition count 413
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 178 place count 101 transition count 404
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 100 transition count 396
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 100 transition count 396
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 184 place count 100 transition count 392
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 203 place count 100 transition count 373
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 4 with 6 rules applied. Total rules applied 209 place count 97 transition count 370
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 217 place count 93 transition count 403
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 246 place count 93 transition count 374
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 4 with 75 rules applied. Total rules applied 321 place count 64 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 343 place count 64 transition count 306
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 345 place count 64 transition count 304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 347 place count 62 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 363 place count 62 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 365 place count 61 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 369 place count 61 transition count 299
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 373 place count 61 transition count 331
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 385 place count 57 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 386 place count 56 transition count 322
Applied a total of 386 rules in 55 ms. Remains 56 /189 variables (removed 133) and now considering 322/406 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 56/189 places, 322/406 transitions.
RANDOM walk for 33845 steps (5751 resets) in 116 ms. (289 steps per ms) remains 0/4 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 9 factoid took 163 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 8312 ms.
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 189 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 406/406 transitions.
Applied a total of 0 rules in 1 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2026-05-25 09:37:40] [INFO ] Invariant cache hit.
[2026-05-25 09:37:40] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 09:37:40] [INFO ] Invariant cache hit.
[2026-05-25 09:37:40] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 405 sub problems to find dead transitions.
[2026-05-25 09:37:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (OVERLAPS) 406/595 variables, 189/238 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 595/595 variables, and 238 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 9 (OVERLAPS) 406/595 variables, 189/252 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/595 variables, 405/657 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/595 variables, and 657 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Finished structural reductions in LTL mode , in 1 iterations and 60508 ms. Remains : 189/189 places, 406/406 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1376 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (296 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (297 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (295 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (299 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1527644 steps, run timeout after 3001 ms. (steps per millisecond=509 ) properties seen :3 out of 4
Probabilistic random walk after 1527644 steps, saw 284363 distinct states, run finished after 3001 ms. (steps per millisecond=509 ) properties seen :3
[2026-05-25 09:38:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/189 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 406/595 variables, 189/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/595 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/189 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 406/595 variables, 189/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/595 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 637ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 406/406 transitions.
Graph (trivial) has 185 edges and 189 vertex of which 9 / 189 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 183 transition count 368
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 154 transition count 368
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 59 place count 154 transition count 356
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 83 place count 142 transition count 356
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 133 place count 117 transition count 331
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 116 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 116 transition count 323
Performed 28 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 191 place count 88 transition count 471
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 209 place count 88 transition count 453
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 211 place count 86 transition count 437
Iterating global reduction 3 with 2 rules applied. Total rules applied 213 place count 86 transition count 437
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 221 place count 86 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 238 place count 86 transition count 412
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 244 place count 83 transition count 409
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 246 place count 82 transition count 421
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 271 place count 82 transition count 396
Reduce places removed 25 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 4 with 81 rules applied. Total rules applied 352 place count 57 transition count 340
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 388 place count 57 transition count 304
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 392 place count 57 transition count 300
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 396 place count 53 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 6 with 32 rules applied. Total rules applied 428 place count 53 transition count 268
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 432 place count 53 transition count 264
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 436 place count 49 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 444 place count 49 transition count 256
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 446 place count 49 transition count 284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 448 place count 47 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 449 place count 46 transition count 283
Applied a total of 449 rules in 121 ms. Remains 46 /189 variables (removed 143) and now considering 283/406 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 46/189 places, 283/406 transitions.
RANDOM walk for 1995 steps (138 resets) in 13 ms. (142 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 4286 ms.
Stuttering acceptance computed with spot in 141 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 214 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3445 reset in 152 ms.
Product exploration explored 100000 steps with 3447 reset in 126 ms.
Spot run failed in 88 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4461215368430660281
[2026-05-25 09:38:45] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4461215368430660281
Running compilation step : cd /tmp/ltsmin4461215368430660281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 728 ms.
Running link step : cd /tmp/ltsmin4461215368430660281;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin4461215368430660281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3944726461412430167.hoa' '--buchi-type=spotba'
LTSmin run took 1545 ms.
FORMULA MedleyA-PT-17-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-17-LTLFireability-12 finished in 137454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 189 transition count 456
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 189 transition count 456
Applied a total of 18 rules in 5 ms. Remains 189 /198 variables (removed 9) and now considering 456/474 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12718437796262828688.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9479916349385136051.kers'
[2026-05-25 09:38:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12718437796262828688.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9479916349385136051.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 456 rows 189 cols 2294 entries
Finished phase 1 with 181 SingleSign rule and 1 generalized
[2026-05-25 09:38:48] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9479916349385136051.kers
Total runtime 2 ms.
[2026-05-25 09:38:48] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 09:38:48] [INFO ] Invariant cache hit.
[2026-05-25 09:38:48] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2026-05-25 09:38:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 456/645 variables, 189/231 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/645 variables, and 231 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (OVERLAPS) 456/645 variables, 189/241 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 405/646 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 646 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60221ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60223ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/198 places, 406/474 transitions.
Applied a total of 0 rules in 6 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60598 ms. Remains : 189/198 places, 406/474 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-14 finished in 60910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(X(X(p1)))) U !p1)))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 474/474 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 190 transition count 458
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 190 transition count 458
Applied a total of 16 rules in 7 ms. Remains 190 /198 variables (removed 8) and now considering 458/474 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6838204056441166265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14185722765297567976.kers'
[2026-05-25 09:39:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6838204056441166265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14185722765297567976.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 458 rows 190 cols 2298 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-05-25 09:39:49] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14185722765297567976.kers
Total runtime 4 ms.
[2026-05-25 09:39:49] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-25 09:39:49] [INFO ] Invariant cache hit.
[2026-05-25 09:39:49] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2026-05-25 09:39:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 48 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 7 (OVERLAPS) 458/648 variables, 190/243 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 407/650 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 650 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60155ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/198 places, 408/474 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60533 ms. Remains : 190/198 places, 408/474 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(X(X(p1)))) U !p1)))'
Stuttering acceptance computed with spot in 635 ms :[p1, p1, (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 14 ms. Proved property starting from automaton with 12 states, 17 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 20 ms.
FORMULA MedleyA-PT-17-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-17-LTLFireability-15 finished in 61568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(G(p1))))))'
Spot run failed in 77 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 09:40:50] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17457807756541388937
[2026-05-25 09:40:50] [INFO ] Computing symmetric may disable matrix : 474 transitions.
[2026-05-25 09:40:50] [INFO ] Applying decomposition
[2026-05-25 09:40:50] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:40:50] [INFO ] Computing symmetric may enable matrix : 474 transitions.
[2026-05-25 09:40:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:40:50] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17544451828020434529.txt' '-o' '/tmp/graph17544451828020434529.bin' '-w' '/tmp/graph17544451828020434529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17544451828020434529.bin' '-l' '-1' '-v' '-w' '/tmp/graph17544451828020434529.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:40:51] [INFO ] Decomposing Gal with order
[2026-05-25 09:40:51] [INFO ] Computing Do-Not-Accords matrix : 474 transitions.
[2026-05-25 09:40:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:40:51] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:40:51] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17457807756541388937
Running compilation step : cd /tmp/ltsmin17457807756541388937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 09:40:51] [INFO ] Removed a total of 1050 redundant transitions.
[2026-05-25 09:40:51] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:40:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 19 ms.
[2026-05-25 09:40:51] [INFO ] Time to serialize gal into /tmp/LTLFireability6609854662091396509.gal : 3 ms
[2026-05-25 09:40:51] [INFO ] Time to serialize properties into /tmp/LTLFireability13078039367973020824.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6609854662091396509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13078039367973020824.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((i1.u4.p9==0)||(i8.i0.i1.u48.p211==0))"))||(F(G("(i2.u8.p32!=1)")))))))
Formula 0 simplified : XX(F!"((i1.u4.p9==0)||(i8.i0.i1.u48.p211==0))" & GF!"(i2.u8.p32!=1)")
Compilation finished in 1232 ms.
Running link step : cd /tmp/ltsmin17457807756541388937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin17457807756541388937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(([]((LTLAPp0==true))||<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t55, t107, t108, t146, t174, t185, t186, t199, t204, t206, t228, t230, t236, t238, t260, t262...1415
Computing Next relation with stutter on 29621 deadlock states
30 unique states visited
30 strongly connected components in search stack
31 transitions explored
30 items max in DFS search stack
15700 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,157.053,1999936,1,0,1.6629e+06,39659,7424,1.33253e+07,1125,351276,4594263
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-17-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1474756 ms.

BK_STOP 1779702220483

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-17"
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-5973"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-17, 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 r178-oct2-177969020000228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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