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-177969020000276.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-23, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.3K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:32 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 150K 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-23-LTLFireability-00
FORMULA_NAME MedleyA-PT-23-LTLFireability-01
FORMULA_NAME MedleyA-PT-23-LTLFireability-02
FORMULA_NAME MedleyA-PT-23-LTLFireability-03
FORMULA_NAME MedleyA-PT-23-LTLFireability-04
FORMULA_NAME MedleyA-PT-23-LTLFireability-05
FORMULA_NAME MedleyA-PT-23-LTLFireability-06
FORMULA_NAME MedleyA-PT-23-LTLFireability-07
FORMULA_NAME MedleyA-PT-23-LTLFireability-08
FORMULA_NAME MedleyA-PT-23-LTLFireability-09
FORMULA_NAME MedleyA-PT-23-LTLFireability-10
FORMULA_NAME MedleyA-PT-23-LTLFireability-11
FORMULA_NAME MedleyA-PT-23-LTLFireability-12
FORMULA_NAME MedleyA-PT-23-LTLFireability-13
FORMULA_NAME MedleyA-PT-23-LTLFireability-14
FORMULA_NAME MedleyA-PT-23-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779703641237

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-23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 10:07:22] [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 10:07:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:07:22] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2026-05-25 10:07:22] [INFO ] Transformed 378 places.
[2026-05-25 10:07:22] [INFO ] Transformed 614 transitions.
[2026-05-25 10:07:22] [INFO ] Found NUPN structural information;
[2026-05-25 10:07:23] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-23-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 614/614 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 375 transition count 614
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 96 place count 282 transition count 521
Iterating global reduction 1 with 93 rules applied. Total rules applied 189 place count 282 transition count 521
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 254 place count 217 transition count 456
Iterating global reduction 1 with 65 rules applied. Total rules applied 319 place count 217 transition count 456
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 344 place count 192 transition count 407
Iterating global reduction 1 with 25 rules applied. Total rules applied 369 place count 192 transition count 407
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 376 place count 185 transition count 389
Iterating global reduction 1 with 7 rules applied. Total rules applied 383 place count 185 transition count 389
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 386 place count 182 transition count 380
Iterating global reduction 1 with 3 rules applied. Total rules applied 389 place count 182 transition count 380
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 392 place count 182 transition count 377
Applied a total of 392 rules in 85 ms. Remains 182 /378 variables (removed 196) and now considering 377/614 (removed 237) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13583995219591248411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2852537023418932454.kers'
[2026-05-25 10:07:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13583995219591248411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2852537023418932454.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 377 rows 182 cols 1324 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-25 10:07:23] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2852537023418932454.kers
Total runtime 2 ms.
[2026-05-25 10:07:23] [INFO ] Implicit Places using invariants in 298 ms returned []
[2026-05-25 10:07:23] [INFO ] Invariant cache hit.
[2026-05-25 10:07:24] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1296 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2026-05-25 10:07:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (OVERLAPS) 377/559 variables, 182/190 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 559/559 variables, and 193 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (OVERLAPS) 377/559 variables, 182/192 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 376/568 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 376 unsolved
SMT process timed out in 60350ms, After SMT, problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Starting structural reductions in LTL mode, iteration 1 : 182/378 places, 377/614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61797 ms. Remains : 182/378 places, 377/614 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 377/377 (removed 0) transitions.
[2026-05-25 10:08:24] [INFO ] Invariant cache hit.
[2026-05-25 10:08:25] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-25 10:08:25] [INFO ] Invariant cache hit.
[2026-05-25 10:08:25] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 182/182 places, 377/377 transitions.
Support contains 50 out of 182 places after structural reductions.
[2026-05-25 10:08:25] [INFO ] Flatten gal took : 60 ms
[2026-05-25 10:08:25] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:08:25] [INFO ] Input system was already deterministic with 377 transitions.
Support contains 49 out of 182 places (down from 50) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 39 to 38
RANDOM walk for 40000 steps (50 resets) in 1529 ms. (26 steps per ms) remains 7/38 properties
BEST_FIRST walk for 40004 steps (23 resets) in 156 ms. (254 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (46 resets) in 159 ms. (250 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (56 resets) in 137 ms. (289 steps per ms) remains 2/3 properties
BEST_FIRST walk for 32998 steps (38 resets) in 136 ms. (240 steps per ms) remains 0/2 properties
FORMULA MedleyA-PT-23-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 18 stabilizing places and 23 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' '!((F((p0||X(((!p1 U (p2||G(!p1))) U (p0&&(!p1 U (p2||G(!p1)))))))) U X(p3)))'
Support contains 2 out of 182 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 166 transition count 352
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 166 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 166 transition count 351
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 158 transition count 335
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 158 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 158 transition count 333
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 153 transition count 322
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 153 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 153 transition count 319
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 67 place count 150 transition count 312
Iterating global reduction 3 with 3 rules applied. Total rules applied 70 place count 150 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 150 transition count 310
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 149 transition count 308
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 149 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 149 transition count 307
Applied a total of 75 rules in 34 ms. Remains 149 /182 variables (removed 33) and now considering 307/377 (removed 70) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8698657150935171322.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4801722368907954102.kers'
[2026-05-25 10:08:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8698657150935171322.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4801722368907954102.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 149 cols 1064 entries
Finished phase 1 with 141 SingleSign rule and 0 generalized
[2026-05-25 10:08:27] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4801722368907954102.kers
Total runtime 4 ms.
[2026-05-25 10:08:27] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 10:08:27] [INFO ] Invariant cache hit.
[2026-05-25 10:08:27] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2026-05-25 10:08:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/456 variables, 149/157 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 161 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/456 variables, 149/158 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 306/464 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 3/467 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 470 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in LTL mode, iteration 1 : 149/182 places, 307/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60563 ms. Remains : 149/182 places, 307/377 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||X(((!p1 U (p2||G(!p1))) U (p0&&(!p1 U (p2||G(!p1)))))))) U X(p3)))'
Stuttering acceptance computed with spot in 525 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-00
Product exploration explored 100000 steps with 7388 reset in 235 ms.
Stack based approach found an accepted trace after 3689 steps with 268 reset with depth 17 and stack size 17 in 8 ms.
FORMULA MedleyA-PT-23-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-23-LTLFireability-00 finished in 61478 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((G(p1)||p0))))'
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Graph (trivial) has 145 edges and 182 vertex of which 21 / 182 are part of one of the 3 SCC in 4 ms
Free SCC test removed 18 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 163 transition count 332
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 152 transition count 332
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 23 place count 152 transition count 324
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 39 place count 144 transition count 324
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 59 place count 124 transition count 292
Iterating global reduction 2 with 20 rules applied. Total rules applied 79 place count 124 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 124 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 81 place count 124 transition count 289
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 123 transition count 289
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 117 transition count 273
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 117 transition count 273
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 99 place count 117 transition count 269
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 4 with 50 rules applied. Total rules applied 149 place count 92 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 152 place count 92 transition count 241
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 159 place count 85 transition count 220
Iterating global reduction 5 with 7 rules applied. Total rules applied 166 place count 85 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 169 place count 85 transition count 217
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 185 place count 77 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 194 place count 77 transition count 220
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 197 place count 74 transition count 211
Iterating global reduction 6 with 3 rules applied. Total rules applied 200 place count 74 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 203 place count 74 transition count 208
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 205 place count 72 transition count 206
Applied a total of 205 rules in 119 ms. Remains 72 /182 variables (removed 110) and now considering 206/377 (removed 171) transitions.
[2026-05-25 10:09:28] [INFO ] Flow matrix only has 197 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4037215745474666355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17091608772446594576.kers'
[2026-05-25 10:09:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4037215745474666355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17091608772446594576.kers]
Normalized transition count is 196 out of 197 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 72 cols 779 entries
Finished phase 1 with 64 SingleSign rule and 0 generalized
[2026-05-25 10:09:28] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17091608772446594576.kers
Total runtime 3 ms.
[2026-05-25 10:09:28] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 10:09:28] [INFO ] Flow matrix only has 197 transitions (discarded 9 similar events)
[2026-05-25 10:09:28] [INFO ] Invariant cache hit.
[2026-05-25 10:09:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 10:09:29] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2026-05-25 10:09:29] [INFO ] Redundant transitions in 12 ms returned []
Running 177 sub problems to find dead transitions.
[2026-05-25 10:09:29] [INFO ] Flow matrix only has 197 transitions (discarded 9 similar events)
[2026-05-25 10:09:29] [INFO ] Invariant cache hit.
[2026-05-25 10:09:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 193/262 variables, 69/77 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 6/268 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/269 variables, and 82 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10837 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 193/262 variables, 69/77 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 6/268 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 174/261 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (OVERLAPS) 0/268 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/269 variables, and 261 constraints, problems are : Problem set: 0 solved, 177 unsolved in 21248 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 32145ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 32147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/182 places, 206/377 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32550 ms. Remains : 72/182 places, 206/377 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((G(p1)||p0))))'
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-01
Product exploration explored 100000 steps with 10 reset in 211 ms.
Product exploration explored 100000 steps with 8 reset in 183 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge based reduction with 9 factoid took 66 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (21 resets) in 476 ms. (83 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (66 resets) in 230 ms. (173 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (24 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
[2026-05-25 10:10:02] [INFO ] Flow matrix only has 197 transitions (discarded 9 similar events)
[2026-05-25 10:10:02] [INFO ] Invariant cache hit.
[2026-05-25 10:10:02] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/14 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 97/111 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 137/248 variables, 38/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/260 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 268/269 variables, and 82 constraints, problems are : Problem set: 1 solved, 0 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 660 ms.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 72 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 206/206 transitions.
Applied a total of 0 rules in 6 ms. Remains 72 /72 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2026-05-25 10:10:02] [INFO ] Flow matrix only has 197 transitions (discarded 9 similar events)
[2026-05-25 10:10:02] [INFO ] Invariant cache hit.
[2026-05-25 10:10:02] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 10:10:02] [INFO ] Flow matrix only has 197 transitions (discarded 9 similar events)
[2026-05-25 10:10:02] [INFO ] Invariant cache hit.
[2026-05-25 10:10:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 10:10:02] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2026-05-25 10:10:02] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 72/72 places, 206/206 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (20 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30393 steps (36 resets) in 29 ms. (1013 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 289 ms.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 161 ms.
Product exploration explored 100000 steps with 0 reset in 141 ms.
Built C files in :
/tmp/ltsmin1854028601280952303
[2026-05-25 10:10:03] [INFO ] Computing symmetric may disable matrix : 206 transitions.
[2026-05-25 10:10:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:10:03] [INFO ] Computing symmetric may enable matrix : 206 transitions.
[2026-05-25 10:10:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:10:03] [INFO ] Computing Do-Not-Accords matrix : 206 transitions.
[2026-05-25 10:10:03] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:10:03] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1854028601280952303
Running compilation step : cd /tmp/ltsmin1854028601280952303;'/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 626 ms.
Running link step : cd /tmp/ltsmin1854028601280952303;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin1854028601280952303;'/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/stateBased15212994800031503031.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 206/206 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 70 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 70 transition count 202
Applied a total of 4 rules in 24 ms. Remains 70 /72 variables (removed 2) and now considering 202/206 (removed 4) transitions.
[2026-05-25 10:10:18] [INFO ] Flow matrix only has 193 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-278614098908646360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11395799074025858122.kers'
[2026-05-25 10:10:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-278614098908646360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11395799074025858122.kers]
Normalized transition count is 192 out of 193 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 192 rows 70 cols 765 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-25 10:10:18] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11395799074025858122.kers
Total runtime 1 ms.
[2026-05-25 10:10:18] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-25 10:10:18] [INFO ] Flow matrix only has 193 transitions (discarded 9 similar events)
[2026-05-25 10:10:18] [INFO ] Invariant cache hit.
[2026-05-25 10:10:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 10:10:19] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2026-05-25 10:10:19] [INFO ] Redundant transitions in 13 ms returned []
Running 173 sub problems to find dead transitions.
[2026-05-25 10:10:19] [INFO ] Flow matrix only has 193 transitions (discarded 9 similar events)
[2026-05-25 10:10:19] [INFO ] Invariant cache hit.
[2026-05-25 10:10:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 189/256 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 6/262 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 0/262 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/263 variables, and 80 constraints, problems are : Problem set: 0 solved, 173 unsolved in 9679 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 189/256 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 6/262 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 170/255 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 12 (OVERLAPS) 0/262 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/263 variables, and 255 constraints, problems are : Problem set: 0 solved, 173 unsolved in 14504 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 24242ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 24243ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/72 places, 202/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24660 ms. Remains : 70/72 places, 202/206 transitions.
Built C files in :
/tmp/ltsmin16261136319061584318
[2026-05-25 10:10:43] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2026-05-25 10:10:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:10:43] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2026-05-25 10:10:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:10:43] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2026-05-25 10:10:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:10:43] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16261136319061584318
Running compilation step : cd /tmp/ltsmin16261136319061584318;'/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 469 ms.
Running link step : cd /tmp/ltsmin16261136319061584318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin16261136319061584318;'/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/stateBased536834359985992805.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 10:10:58] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:10:58] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:10:58] [INFO ] Time to serialize gal into /tmp/LTL7208034759032986487.gal : 5 ms
[2026-05-25 10:10:58] [INFO ] Time to serialize properties into /tmp/LTL16441632457562252228.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/LTL7208034759032986487.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8651633679994540113.hoa' '-atoms' '/tmp/LTL16441632457562252228.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/LTL16441632457562252228.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8651633679994540113.hoa
Reverse transition relation is NOT exact ! Due to transitions t112, t113, t248, t249, t250, t258, t259, t260, t295, t296, t297, t302, t303, t304, t363, t36...911
Computing Next relation with stutter on 43456 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
525 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.29052,133320,1,0,414,513692,431,180,4527,619335,449
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-23-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property MedleyA-PT-23-LTLFireability-01 finished in 95878 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(p0)||F(p1)||X(p2)))'
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 166 transition count 352
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 166 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 166 transition count 351
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 158 transition count 337
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 158 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 158 transition count 336
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 154 transition count 327
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 154 transition count 327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 154 transition count 325
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 63 place count 151 transition count 318
Iterating global reduction 3 with 3 rules applied. Total rules applied 66 place count 151 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 151 transition count 316
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 150 transition count 314
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 150 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 150 transition count 313
Applied a total of 71 rules in 26 ms. Remains 150 /182 variables (removed 32) and now considering 313/377 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-458448385173081062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10830226577862823602.kers'
[2026-05-25 10:11:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-458448385173081062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10830226577862823602.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 150 cols 1088 entries
Finished phase 1 with 142 SingleSign rule and 0 generalized
[2026-05-25 10:11:04] [INFO ] Computed 8 invariants in 15 ms
Computed 8 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-10830226577862823602.kers
Total runtime 17 ms.
[2026-05-25 10:11:04] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-25 10:11:04] [INFO ] Invariant cache hit.
[2026-05-25 10:11:05] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2026-05-25 10:11:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/463 variables, 150/159 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 163 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/463 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 312/472 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 478 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 313/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60547 ms. Remains : 150/182 places, 313/377 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)||F(p1)||X(p2)))'
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-02
Product exploration explored 100000 steps with 5 reset in 147 ms.
Stuttering criterion allowed to conclude after 272 steps with 5 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-02 finished in 61003 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||F(p1)))&&X(X(!p2)))) U p2))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 167 transition count 353
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 167 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 167 transition count 352
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 159 transition count 336
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 159 transition count 336
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 159 transition count 334
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 155 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 155 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 155 transition count 321
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 153 transition count 317
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 153 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 153 transition count 315
Applied a total of 66 rules in 6 ms. Remains 153 /182 variables (removed 29) and now considering 315/377 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-634612745130323428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11266796851000910008.kers'
[2026-05-25 10:12:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-634612745130323428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11266796851000910008.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 153 cols 1092 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-25 10:12:05] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11266796851000910008.kers
Total runtime 1 ms.
[2026-05-25 10:12:05] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-25 10:12:05] [INFO ] Invariant cache hit.
[2026-05-25 10:12:06] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2026-05-25 10:12:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 315/468 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/468 variables, and 165 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (OVERLAPS) 315/468 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 314/477 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 483 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 315/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60568 ms. Remains : 153/182 places, 315/377 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||F(p1)))&&X(X(!p2)))) U p2))'
Stuttering acceptance computed with spot in 574 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1)), p2, (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-03
Stuttering criterion allowed to conclude after 55 steps with 1 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-03 finished in 61257 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((X(X(X(p1)))||F(p2)||p0)))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 167 transition count 353
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 167 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 167 transition count 352
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 159 transition count 338
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 159 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 159 transition count 336
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 154 transition count 325
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 154 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 154 transition count 322
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 151 transition count 315
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 151 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 151 transition count 313
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 150 transition count 311
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 150 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 150 transition count 310
Applied a total of 73 rules in 21 ms. Remains 150 /182 variables (removed 32) and now considering 310/377 (removed 67) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16761287717972386953.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-203171882168211621.kers'
[2026-05-25 10:13:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16761287717972386953.kers, --Pflows, --basisKERS=/tmp/petrispot-output-203171882168211621.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 150 cols 1076 entries
Finished phase 1 with 142 SingleSign rule and 0 generalized
[2026-05-25 10:13:06] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-203171882168211621.kers
Total runtime 1 ms.
[2026-05-25 10:13:07] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-25 10:13:07] [INFO ] Invariant cache hit.
[2026-05-25 10:13:07] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2026-05-25 10:13:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 310/460 variables, 150/158 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 162 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/460 variables, 150/159 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 309/468 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 475 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 310/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60497 ms. Remains : 150/182 places, 310/377 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((X(X(X(p1)))||F(p2)||p0)))'
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-04
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-04 finished in 60765 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(p1))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Graph (trivial) has 154 edges and 182 vertex of which 21 / 182 are part of one of the 3 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 163 transition count 330
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 150 transition count 330
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 27 place count 150 transition count 322
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 43 place count 142 transition count 322
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 62 place count 123 transition count 291
Iterating global reduction 2 with 19 rules applied. Total rules applied 81 place count 123 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 123 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 82 place count 123 transition count 289
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 122 transition count 289
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 90 place count 116 transition count 271
Iterating global reduction 3 with 6 rules applied. Total rules applied 96 place count 116 transition count 271
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 101 place count 116 transition count 266
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 153 place count 90 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 157 place count 90 transition count 236
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 165 place count 82 transition count 212
Iterating global reduction 5 with 8 rules applied. Total rules applied 173 place count 82 transition count 212
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 176 place count 82 transition count 209
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 6 with 2 rules applied. Total rules applied 178 place count 81 transition count 208
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 196 place count 72 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 205 place count 72 transition count 214
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 208 place count 69 transition count 205
Iterating global reduction 6 with 3 rules applied. Total rules applied 211 place count 69 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 214 place count 69 transition count 202
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 216 place count 67 transition count 200
Applied a total of 216 rules in 72 ms. Remains 67 /182 variables (removed 115) and now considering 200/377 (removed 177) transitions.
[2026-05-25 10:14:07] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10895089170179657358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2553593586338644821.kers'
[2026-05-25 10:14:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10895089170179657358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2553593586338644821.kers]
Normalized transition count is 189 out of 190 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 189 rows 66 cols 703 entries
Finished phase 1 with 59 SingleSign rule and 0 generalized
[2026-05-25 10:14:07] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2553593586338644821.kers
Total runtime 1 ms.
[2026-05-25 10:14:07] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 10:14:07] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
[2026-05-25 10:14:07] [INFO ] Invariant cache hit.
[2026-05-25 10:14:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 10:14:07] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2026-05-25 10:14:07] [INFO ] Redundant transitions in 2 ms returned []
Running 172 sub problems to find dead transitions.
[2026-05-25 10:14:07] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
[2026-05-25 10:14:07] [INFO ] Invariant cache hit.
[2026-05-25 10:14:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 186/250 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 6/256 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/257 variables, and 78 constraints, problems are : Problem set: 0 solved, 172 unsolved in 13941 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 186/250 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 6/256 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 171/250 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/257 variables, and 250 constraints, problems are : Problem set: 0 solved, 172 unsolved in 11437 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 25425ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 25429ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/182 places, 200/377 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25776 ms. Remains : 67/182 places, 200/377 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(p1))))'
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-06 finished in 25947 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) U ((p2||G(p3))&&p1)))'
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Graph (trivial) has 144 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 164 transition count 335
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 154 transition count 335
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 21 place count 154 transition count 327
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 37 place count 146 transition count 327
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 56 place count 127 transition count 298
Iterating global reduction 2 with 19 rules applied. Total rules applied 75 place count 127 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 127 transition count 297
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 76 place count 127 transition count 296
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 126 transition count 296
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 84 place count 120 transition count 278
Iterating global reduction 3 with 6 rules applied. Total rules applied 90 place count 120 transition count 278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 94 place count 120 transition count 274
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 4 with 48 rules applied. Total rules applied 142 place count 96 transition count 250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 96 transition count 248
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 152 place count 88 transition count 224
Iterating global reduction 5 with 8 rules applied. Total rules applied 160 place count 88 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 162 place count 88 transition count 222
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 180 place count 79 transition count 237
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 191 place count 79 transition count 226
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 194 place count 76 transition count 217
Iterating global reduction 6 with 3 rules applied. Total rules applied 197 place count 76 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 200 place count 76 transition count 214
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 202 place count 76 transition count 214
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 204 place count 74 transition count 212
Applied a total of 204 rules in 52 ms. Remains 74 /182 variables (removed 108) and now considering 212/377 (removed 165) transitions.
[2026-05-25 10:14:33] [INFO ] Flow matrix only has 203 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4089398830757982278.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6469788751472507878.kers'
[2026-05-25 10:14:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4089398830757982278.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6469788751472507878.kers]
Normalized transition count is 202 out of 203 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 74 cols 797 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-25 10:14:33] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6469788751472507878.kers
Total runtime 1 ms.
[2026-05-25 10:14:33] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 10:14:33] [INFO ] Flow matrix only has 203 transitions (discarded 9 similar events)
[2026-05-25 10:14:33] [INFO ] Invariant cache hit.
[2026-05-25 10:14:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 10:14:33] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2026-05-25 10:14:33] [INFO ] Redundant transitions in 2 ms returned []
Running 182 sub problems to find dead transitions.
[2026-05-25 10:14:33] [INFO ] Flow matrix only has 203 transitions (discarded 9 similar events)
[2026-05-25 10:14:33] [INFO ] Invariant cache hit.
[2026-05-25 10:14:33] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 199/270 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 6/276 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/277 variables, and 84 constraints, problems are : Problem set: 0 solved, 182 unsolved in 12422 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 199/270 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 6/276 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 179/267 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (OVERLAPS) 0/276 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/277 variables, and 269 constraints, problems are : Problem set: 0 solved, 182 unsolved in 23043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 35513ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 35514ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/182 places, 212/377 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35801 ms. Remains : 74/182 places, 212/377 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) U ((G(p2)||p3)&&p1)))'
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), p0, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p2))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-07 finished in 36044 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))) U ((!p0 U p1)&&X(X(p2)))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 167 transition count 354
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 167 transition count 354
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 159 transition count 338
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 159 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 159 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 155 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 155 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 155 transition count 326
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 153 transition count 321
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 153 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 153 transition count 320
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 152 transition count 318
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 152 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 152 transition count 317
Applied a total of 66 rules in 8 ms. Remains 152 /182 variables (removed 30) and now considering 317/377 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16707058179097440376.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14142117507268861724.kers'
[2026-05-25 10:15:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16707058179097440376.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14142117507268861724.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 152 cols 1096 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-25 10:15:09] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14142117507268861724.kers
Total runtime 1 ms.
[2026-05-25 10:15:09] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 10:15:09] [INFO ] Invariant cache hit.
[2026-05-25 10:15:09] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2026-05-25 10:15:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 317/469 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/469 variables, and 165 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 317/469 variables, 152/162 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 316/478 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 485 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 152/182 places, 317/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60428 ms. Remains : 152/182 places, 317/377 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))) U ((!p0 U p1)&&X(X(p2)))))'
Stuttering acceptance computed with spot in 625 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-09
Product exploration explored 100000 steps with 1 reset in 201 ms.
Entered a terminal (fully accepting) state of product in 373 steps with 4 reset in 2 ms.
FORMULA MedleyA-PT-23-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-09 finished in 61328 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(X(((G(p0)||G(p1)) U (p2 U (p3||G(p2)))))))))'
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 167 transition count 357
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 167 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 167 transition count 356
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 158 transition count 339
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 158 transition count 339
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 158 transition count 337
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 154 transition count 328
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 154 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 154 transition count 326
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 64 place count 151 transition count 319
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 151 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 151 transition count 317
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 150 transition count 315
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 150 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 150 transition count 314
Applied a total of 72 rules in 7 ms. Remains 150 /182 variables (removed 32) and now considering 314/377 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6890750416992664514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15847174371193498467.kers'
[2026-05-25 10:16:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6890750416992664514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15847174371193498467.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 314 rows 150 cols 1102 entries
Finished phase 1 with 142 SingleSign rule and 0 generalized
[2026-05-25 10:16:10] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15847174371193498467.kers
Total runtime 1 ms.
[2026-05-25 10:16:11] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-25 10:16:11] [INFO ] Invariant cache hit.
[2026-05-25 10:16:11] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2026-05-25 10:16:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 314/464 variables, 150/158 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 162 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 314/464 variables, 150/159 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 313/472 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 481 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 314/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60692 ms. Remains : 150/182 places, 314/377 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(X(((G(p0)||G(p1)) U (p2 U (G(p2)||p3))))))))'
Stuttering acceptance computed with spot in 724 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2) p0), (AND (NOT p0) (NOT p3) (NOT p2) p1)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-11
Entered a terminal (fully accepting) state of product in 162 steps with 3 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-11 finished in 61472 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((X(p1)&&p0)))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 165 transition count 351
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 165 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 165 transition count 350
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 157 transition count 336
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 157 transition count 336
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 157 transition count 334
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 152 transition count 323
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 152 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 152 transition count 320
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 69 place count 149 transition count 313
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 149 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 149 transition count 311
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 148 transition count 309
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 148 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 148 transition count 308
Applied a total of 77 rules in 18 ms. Remains 148 /182 variables (removed 34) and now considering 308/377 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8486740771455201419.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14162822458680240073.kers'
[2026-05-25 10:17:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8486740771455201419.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14162822458680240073.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 148 cols 1072 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-25 10:17:12] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14162822458680240073.kers
Total runtime 4 ms.
[2026-05-25 10:17:12] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-25 10:17:12] [INFO ] Invariant cache hit.
[2026-05-25 10:17:12] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2026-05-25 10:17:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 308/456 variables, 148/156 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 160 constraints, problems are : Problem set: 0 solved, 307 unsolved in 27432 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/456 variables, 148/158 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 307/465 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 3/468 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 3/473 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 473 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 57518ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 57519ms
Starting structural reductions in LTL mode, iteration 1 : 148/182 places, 308/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57969 ms. Remains : 148/182 places, 308/377 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((X(p1)&&p0)))))'
Stuttering acceptance computed with spot in 200 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-12 finished in 58199 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 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Graph (trivial) has 154 edges and 182 vertex of which 21 / 182 are part of one of the 3 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 163 transition count 330
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 150 transition count 330
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 27 place count 150 transition count 322
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 43 place count 142 transition count 322
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 63 place count 122 transition count 290
Iterating global reduction 2 with 20 rules applied. Total rules applied 83 place count 122 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 122 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 84 place count 122 transition count 288
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 121 transition count 288
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 92 place count 115 transition count 270
Iterating global reduction 3 with 6 rules applied. Total rules applied 98 place count 115 transition count 270
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 103 place count 115 transition count 265
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 155 place count 89 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 159 place count 89 transition count 235
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 167 place count 81 transition count 211
Iterating global reduction 5 with 8 rules applied. Total rules applied 175 place count 81 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 178 place count 81 transition count 208
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 6 with 2 rules applied. Total rules applied 180 place count 80 transition count 207
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 198 place count 71 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 207 place count 71 transition count 213
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 210 place count 68 transition count 204
Iterating global reduction 6 with 3 rules applied. Total rules applied 213 place count 68 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 216 place count 68 transition count 201
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 218 place count 66 transition count 199
Applied a total of 218 rules in 61 ms. Remains 66 /182 variables (removed 116) and now considering 199/377 (removed 178) transitions.
[2026-05-25 10:18:10] [INFO ] Flow matrix only has 189 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11886041001035521401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3278257022225345546.kers'
[2026-05-25 10:18:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11886041001035521401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3278257022225345546.kers]
Normalized transition count is 188 out of 189 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 188 rows 65 cols 701 entries
Finished phase 1 with 58 SingleSign rule and 0 generalized
[2026-05-25 10:18:10] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3278257022225345546.kers
Total runtime 2 ms.
[2026-05-25 10:18:10] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-25 10:18:10] [INFO ] Flow matrix only has 189 transitions (discarded 10 similar events)
[2026-05-25 10:18:10] [INFO ] Invariant cache hit.
[2026-05-25 10:18:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 10:18:10] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2026-05-25 10:18:10] [INFO ] Redundant transitions in 0 ms returned []
Running 171 sub problems to find dead transitions.
[2026-05-25 10:18:10] [INFO ] Flow matrix only has 189 transitions (discarded 10 similar events)
[2026-05-25 10:18:10] [INFO ] Invariant cache hit.
[2026-05-25 10:18:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 185/248 variables, 63/71 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 6/254 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/254 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/255 variables, and 77 constraints, problems are : Problem set: 0 solved, 171 unsolved in 14463 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 185/248 variables, 63/71 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 6/254 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 171/248 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 0/254 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/255 variables, and 249 constraints, problems are : Problem set: 0 solved, 171 unsolved in 16134 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 30637ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 30637ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/182 places, 199/377 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31031 ms. Remains : 66/182 places, 199/377 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 70 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-13 finished in 31127 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(G((X(X(p0))||(p1&&X(G((G(p3)||p2))))))))'
Support contains 6 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 166 transition count 354
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 166 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 166 transition count 353
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 157 transition count 336
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 157 transition count 336
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 157 transition count 334
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 152 transition count 323
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 152 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 152 transition count 320
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 69 place count 149 transition count 313
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 149 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 149 transition count 311
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 148 transition count 309
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 148 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 148 transition count 308
Applied a total of 77 rules in 20 ms. Remains 148 /182 variables (removed 34) and now considering 308/377 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6256583628720849605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13591685713630454030.kers'
[2026-05-25 10:18:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6256583628720849605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13591685713630454030.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 148 cols 1078 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-25 10:18:41] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13591685713630454030.kers
Total runtime 2 ms.
[2026-05-25 10:18:41] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-25 10:18:41] [INFO ] Invariant cache hit.
[2026-05-25 10:18:42] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2026-05-25 10:18:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 308/456 variables, 148/156 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 160 constraints, problems are : Problem set: 0 solved, 307 unsolved in 25017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/456 variables, 148/158 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 307/465 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 4/469 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 475 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 55118ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 55119ms
Starting structural reductions in LTL mode, iteration 1 : 148/182 places, 308/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55524 ms. Remains : 148/182 places, 308/377 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(G((X(X(p0))||(X(G((G(p2)||p1)))&&p3)))))'
Stuttering acceptance computed with spot in 638 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-14
Product exploration explored 100000 steps with 20039 reset in 144 ms.
Product exploration explored 100000 steps with 20001 reset in 122 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 10 states, 20 edges and 4 AP (stutter sensitive) to 10 states, 20 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (17 resets) in 957 ms. (41 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (26 resets) in 126 ms. (314 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40001 steps (22 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (47 resets) in 88 ms. (449 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40002 steps (39 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (29 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (23 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
[2026-05-25 10:19:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 20/26 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/61 variables, 4/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/277 variables, 61/69 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/69 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 142/419 variables, 68/137 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/137 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/447 variables, 13/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 456/456 variables, and 156 constraints, problems are : Problem set: 4 solved, 0 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 279ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge based reduction with 11 factoid took 193 ms. Reduced automaton from 10 states, 20 edges and 4 AP (stutter sensitive) to 10 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 473 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 1624 ms.
Stuttering acceptance computed with spot in 460 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 308/308 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2026-05-25 10:19:40] [INFO ] Invariant cache hit.
[2026-05-25 10:19:40] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 10:19:40] [INFO ] Invariant cache hit.
[2026-05-25 10:19:40] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 148/148 places, 308/308 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 10 states, 15 edges and 4 AP (stutter sensitive) to 10 states, 15 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (27 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 65 ms. (606 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (34 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
[2026-05-25 10:19:40] [INFO ] Invariant cache hit.
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) 12/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 214/273 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 146/419 variables, 70/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/447 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/456 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/456 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 157 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 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) 12/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 214/273 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 146/419 variables, 70/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/447 variables, 13/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/456 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/456 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 667ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 47 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=47 )
Parikh walk visited 1 properties in 9 ms.
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 10 states, 15 edges and 4 AP (stutter sensitive) to 10 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 513 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 1568 ms.
Stuttering acceptance computed with spot in 528 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 599 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 20013 reset in 108 ms.
Product exploration explored 100000 steps with 19953 reset in 147 ms.
Spot run failed in 107 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/ltsmin2805159811454690067
[2026-05-25 10:19:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2805159811454690067
Running compilation step : cd /tmp/ltsmin2805159811454690067;'/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 591 ms.
Running link step : cd /tmp/ltsmin2805159811454690067;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2805159811454690067;'/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/stateBased8417992287108411141.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 308/308 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2026-05-25 10:19:58] [INFO ] Invariant cache hit.
[2026-05-25 10:19:58] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-25 10:19:58] [INFO ] Invariant cache hit.
[2026-05-25 10:19:59] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 148/148 places, 308/308 transitions.
Built C files in :
/tmp/ltsmin11720117237656448769
[2026-05-25 10:19:59] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11720117237656448769
Running compilation step : cd /tmp/ltsmin11720117237656448769;'/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 547 ms.
Running link step : cd /tmp/ltsmin11720117237656448769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin11720117237656448769;'/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/stateBased966655304620975279.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 10:20:14] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:20:14] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:20:14] [INFO ] Time to serialize gal into /tmp/LTL9621212689656557101.gal : 16 ms
[2026-05-25 10:20:14] [INFO ] Time to serialize properties into /tmp/LTL2058542294148021686.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/LTL9621212689656557101.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16113823902873934428.hoa' '-atoms' '/tmp/LTL2058542294148021686.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/LTL2058542294148021686.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16113823902873934428.hoa
Detected timeout of ITS tools.
[2026-05-25 10:20:29] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:20:29] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:20:29] [INFO ] Time to serialize gal into /tmp/LTL11867644378889930337.gal : 2 ms
[2026-05-25 10:20:29] [INFO ] Time to serialize properties into /tmp/LTL16888890332544462977.ltl : 7 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/LTL11867644378889930337.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16888890332544462977.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...277
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X("((p14==0)||(p226==0))")))||((X(G(("((p12!=1)||(p30!=1))")||(("(p215!=1)")||(G("((p14!=1)||(p212!=1))"))))))&&("(((p12!=1)...185
Formula 0 simplified : XF(XX!"((p14==0)||(p226==0))" & (!"(((p12!=1)||(p30!=1))||(p215!=1))" | XF(!"((p12!=1)||(p30!=1))" & !"(p215!=1)" & F!"((p14!=1)||(p...167
Detected timeout of ITS tools.
[2026-05-25 10:20:44] [INFO ] Flatten gal took : 32 ms
[2026-05-25 10:20:44] [INFO ] Applying decomposition
[2026-05-25 10:20:44] [INFO ] Flatten gal took : 22 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/graph11014843179961181972.txt' '-o' '/tmp/graph11014843179961181972.bin' '-w' '/tmp/graph11014843179961181972.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11014843179961181972.bin' '-l' '-1' '-v' '-w' '/tmp/graph11014843179961181972.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:20:44] [INFO ] Decomposing Gal with order
[2026-05-25 10:20:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:20:44] [INFO ] Removed a total of 454 redundant transitions.
[2026-05-25 10:20:44] [INFO ] Flatten gal took : 78 ms
[2026-05-25 10:20:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 9 ms.
[2026-05-25 10:20:44] [INFO ] Time to serialize gal into /tmp/LTL3377025315136376740.gal : 4 ms
[2026-05-25 10:20:44] [INFO ] Time to serialize properties into /tmp/LTL17817306187343547281.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/LTL3377025315136376740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17817306187343547281.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...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X("((i0.u2.p14==0)||(i3.u21.p226==0))")))||((X(G(("((i5.u1.p12!=1)||(i3.u5.p30!=1))")||(("(i4.u23.p215!=1)")||(G("((i0.u2.p1...249
Formula 0 simplified : XF(XX!"((i0.u2.p14==0)||(i3.u21.p226==0))" & (!"(((i5.u1.p12!=1)||(i3.u5.p30!=1))||(i4.u23.p215!=1))" | XF(!"((i5.u1.p12!=1)||(i3.u5...231
Reverse transition relation is NOT exact ! Due to transitions t20, t61, t172, t174, t175, t211, t213, t214, t237, t239, t240, t245, t246, t247, t249, t250,...809
Computing Next relation with stutter on 122115 deadlock states
Detected timeout of ITS tools.
Treatment of property MedleyA-PT-23-LTLFireability-14 finished in 138113 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(((F(!p0) U p1) U (p2&&X(p0)))))'
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 377/377 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 166 transition count 352
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 166 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 166 transition count 351
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 159 transition count 336
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 159 transition count 336
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 159 transition count 334
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 155 transition count 326
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 155 transition count 326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 155 transition count 323
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 153 transition count 318
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 153 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 153 transition count 317
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 66 place count 152 transition count 315
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 152 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 152 transition count 314
Applied a total of 68 rules in 16 ms. Remains 152 /182 variables (removed 30) and now considering 314/377 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15408275883225250098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14230986074763881488.kers'
[2026-05-25 10:20:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15408275883225250098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14230986074763881488.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 314 rows 152 cols 1090 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-25 10:20:59] [INFO ] Computed 8 invariants in 4 ms
Computed 8 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14230986074763881488.kers
Total runtime 5 ms.
[2026-05-25 10:21:00] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-25 10:21:00] [INFO ] Invariant cache hit.
[2026-05-25 10:21:00] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2026-05-25 10:21:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 314/466 variables, 152/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 164 constraints, problems are : Problem set: 0 solved, 313 unsolved in 27596 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 314/466 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 313/474 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 484 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 57687ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 57688ms
Starting structural reductions in LTL mode, iteration 1 : 152/182 places, 314/377 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58196 ms. Remains : 152/182 places, 314/377 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(((F(!p0) U p1) U (p2&&X(p0)))))'
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), p0, (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-15
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-15 finished in 58673 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(G((X(X(p0))||(p1&&X(G((G(p3)||p2))))))))'
Spot run failed in 67 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 10:21:58] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4422310447275964084
[2026-05-25 10:21:58] [INFO ] Computing symmetric may disable matrix : 377 transitions.
[2026-05-25 10:21:58] [INFO ] Applying decomposition
[2026-05-25 10:21:58] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:21:58] [INFO ] Computing symmetric may enable matrix : 377 transitions.
[2026-05-25 10:21:58] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:21:58] [INFO ] Flatten gal took : 17 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/graph8093357119469728228.txt' '-o' '/tmp/graph8093357119469728228.bin' '-w' '/tmp/graph8093357119469728228.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8093357119469728228.bin' '-l' '-1' '-v' '-w' '/tmp/graph8093357119469728228.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:21:58] [INFO ] Decomposing Gal with order
[2026-05-25 10:21:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:21:58] [INFO ] Computing Do-Not-Accords matrix : 377 transitions.
[2026-05-25 10:21:58] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:21:58] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4422310447275964084
Running compilation step : cd /tmp/ltsmin4422310447275964084;'/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 10:21:58] [INFO ] Removed a total of 563 redundant transitions.
[2026-05-25 10:21:58] [INFO ] Flatten gal took : 27 ms
[2026-05-25 10:21:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 9 ms.
[2026-05-25 10:21:58] [INFO ] Time to serialize gal into /tmp/LTLFireability2035008555359132941.gal : 3 ms
[2026-05-25 10:21:58] [INFO ] Time to serialize properties into /tmp/LTLFireability7325106504039272375.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/LTLFireability2035008555359132941.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7325106504039272375.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...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X("((i0.i0.u4.p14==0)||(i4.i1.u33.p226==0))")))||(("(((i1.u3.p12!=1)||(i1.u7.p30!=1))||(i4.i0.u30.p215!=1))")&&(X(G(("((i1.u...267
Formula 0 simplified : XF(XX!"((i0.i0.u4.p14==0)||(i4.i1.u33.p226==0))" & (!"(((i1.u3.p12!=1)||(i1.u7.p30!=1))||(i4.i0.u30.p215!=1))" | XF(!"((i1.u3.p12!=1...249
Compilation finished in 864 ms.
Running link step : cd /tmp/ltsmin4422310447275964084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4422310447275964084;'/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(X((LTLAPp0==true)))||((LTLAPp1==true)&&X([](([]((LTLAPp3==true))||(LTLAPp2==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t21, t61, t171, t172, t174, t175, t183, t203, t210, t211, t213, t214, t229, t236, t237, t239,...1286
Computing Next relation with stutter on 283112 deadlock states
72 unique states visited
0 strongly connected components in search stack
139 transitions explored
39 items max in DFS search stack
23079 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,230.84,5557808,1,0,8.87333e+06,2047,5069,1.46989e+07,447,8529,17521405
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-23-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1146038 ms.

BK_STOP 1779704788855

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

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