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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 11:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:25 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 48K 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-02-LTLFireability-00
FORMULA_NAME MedleyA-PT-02-LTLFireability-01
FORMULA_NAME MedleyA-PT-02-LTLFireability-02
FORMULA_NAME MedleyA-PT-02-LTLFireability-03
FORMULA_NAME MedleyA-PT-02-LTLFireability-04
FORMULA_NAME MedleyA-PT-02-LTLFireability-05
FORMULA_NAME MedleyA-PT-02-LTLFireability-06
FORMULA_NAME MedleyA-PT-02-LTLFireability-07
FORMULA_NAME MedleyA-PT-02-LTLFireability-08
FORMULA_NAME MedleyA-PT-02-LTLFireability-09
FORMULA_NAME MedleyA-PT-02-LTLFireability-10
FORMULA_NAME MedleyA-PT-02-LTLFireability-11
FORMULA_NAME MedleyA-PT-02-LTLFireability-12
FORMULA_NAME MedleyA-PT-02-LTLFireability-13
FORMULA_NAME MedleyA-PT-02-LTLFireability-14
FORMULA_NAME MedleyA-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779698980601

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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 08:49:42] [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 08:49:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:49:42] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2026-05-25 08:49:42] [INFO ] Transformed 69 places.
[2026-05-25 08:49:42] [INFO ] Transformed 168 transitions.
[2026-05-25 08:49:42] [INFO ] Found NUPN structural information;
[2026-05-25 08:49:42] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
FORMULA MedleyA-PT-02-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 59 transition count 150
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 59 transition count 150
Applied a total of 20 rules in 21 ms. Remains 59 /69 variables (removed 10) and now considering 150/162 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-339128336330499248.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1864396986877348340.kers'
[2026-05-25 08:49:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-339128336330499248.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1864396986877348340.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 59 cols 564 entries
Finished phase 1 with 49 SingleSign rule and 1 generalized
[2026-05-25 08:49:43] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1864396986877348340.kers
Total runtime 1 ms.
[2026-05-25 08:49:43] [INFO ] Implicit Places using invariants in 439 ms returned []
[2026-05-25 08:49:43] [INFO ] Invariant cache hit.
[2026-05-25 08:49:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-25 08:49:43] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2026-05-25 08:49:43] [INFO ] Invariant cache hit.
[2026-05-25 08:49:43] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 150/209 variables, 59/83 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 60/143 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (OVERLAPS) 0/209 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 143 constraints, problems are : Problem set: 0 solved, 149 unsolved in 12589 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 150/209 variables, 59/87 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 60/147 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 149/296 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (OVERLAPS) 0/209 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 298 constraints, problems are : Problem set: 0 solved, 149 unsolved in 28488 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41208ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 41223ms
Starting structural reductions in LTL mode, iteration 1 : 59/69 places, 150/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41990 ms. Remains : 59/69 places, 150/162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2026-05-25 08:50:25] [INFO ] Invariant cache hit.
[2026-05-25 08:50:25] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 08:50:25] [INFO ] Invariant cache hit.
[2026-05-25 08:50:25] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-25 08:50:25] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 59/59 places, 150/150 transitions.
Support contains 38 out of 59 places after structural reductions.
[2026-05-25 08:50:25] [INFO ] Flatten gal took : 56 ms
[2026-05-25 08:50:25] [INFO ] Flatten gal took : 15 ms
[2026-05-25 08:50:25] [INFO ] Input system was already deterministic with 150 transitions.
Reduction of identical properties reduced properties to check from 33 to 31
RANDOM walk for 40000 steps (4005 resets) in 2369 ms. (16 steps per ms) remains 14/31 properties
BEST_FIRST walk for 40002 steps (881 resets) in 260 ms. (153 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (748 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (916 resets) in 350 ms. (113 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (910 resets) in 238 ms. (167 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (934 resets) in 163 ms. (243 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (931 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (917 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (922 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (902 resets) in 150 ms. (264 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (68 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (912 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (900 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (711 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
[2026-05-25 08:50:27] [INFO ] Invariant cache hit.
[2026-05-25 08:50:27] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 31/54 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/56 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/58 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 149/207 variables, 58/67 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 60/127 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/127 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 2/209 variables, 1/128 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/128 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/128 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 128 constraints, problems are : Problem set: 2 solved, 9 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 35/54 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 4/11 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/56 variables, 1/12 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/58 variables, 1/13 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 149/207 variables, 58/71 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 60/131 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 3/134 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 1/135 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/209 variables, 1/136 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 5/141 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 0/141 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/209 variables, 0/141 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 141 constraints, problems are : Problem set: 3 solved, 8 unsolved in 3177 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 8/11 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3702ms problems are : Problem set: 3 solved, 8 unsolved
Parikh walk visited 7 properties in 267 ms.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 150/150 transitions.
Graph (complete) has 260 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 52 transition count 138
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 52 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 16 place count 49 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 49 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 21 place count 47 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 47 transition count 114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 27 place count 45 transition count 112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 39 place count 39 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 71 place count 39 transition count 117
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 73 place count 39 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 75 place count 37 transition count 115
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 37 transition count 115
Applied a total of 76 rules in 37 ms. Remains 37 /59 variables (removed 22) and now considering 115/150 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 37/59 places, 115/150 transitions.
RANDOM walk for 40000 steps (7055 resets) in 599 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (63 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14465 steps, run visited all 1 properties in 42 ms. (steps per millisecond=344 )
Probabilistic random walk after 14465 steps, saw 3762 distinct states, run finished after 60 ms. (steps per millisecond=241 ) properties seen :1
FORMULA MedleyA-PT-02-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-02-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 325 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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((F(p0) U X(X((p1&&F(G(!p2)))))))))'
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Graph (complete) has 325 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 52 transition count 138
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 52 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 48 transition count 116
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 48 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 47 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 47 transition count 112
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 44 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 37 place count 40 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 57 place count 40 transition count 107
Applied a total of 57 rules in 19 ms. Remains 40 /59 variables (removed 19) and now considering 107/150 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14198833676070008694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-179167174701122025.kers'
[2026-05-25 08:50:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14198833676070008694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-179167174701122025.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 40 cols 440 entries
Finished phase 1 with 30 SingleSign rule and 1 generalized
[2026-05-25 08:50:32] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-179167174701122025.kers
Total runtime 0 ms.
[2026-05-25 08:50:32] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 08:50:32] [INFO ] Invariant cache hit.
[2026-05-25 08:50:32] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 08:50:32] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2026-05-25 08:50:32] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2026-05-25 08:50:32] [INFO ] Invariant cache hit.
[2026-05-25 08:50:32] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/147 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 108 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4527 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/147 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 106/214 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 214 constraints, problems are : Problem set: 0 solved, 106 unsolved in 12290 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16885ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 16887ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/59 places, 107/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17088 ms. Remains : 40/59 places, 107/150 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((F(p0) U X(X((p1&&F(G(!p2)))))))))'
Stuttering acceptance computed with spot in 619 ms :[(OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) p1 p2), p2]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-01
Stuttering criterion allowed to conclude after 21 steps with 2 reset in 2 ms.
FORMULA MedleyA-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-01 finished in 17872 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((X(p0)||p1))||p0) U (F(X(p0)) U p2)))'
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Graph (complete) has 325 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 51 transition count 137
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 51 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 16 place count 48 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 48 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 47 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 47 transition count 117
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 23 place count 46 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 31 place count 42 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 49 place count 42 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 49 place count 42 transition count 106
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 51 place count 41 transition count 106
Applied a total of 51 rules in 36 ms. Remains 41 /59 variables (removed 18) and now considering 106/150 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6020065890687794233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1335532093801937861.kers'
[2026-05-25 08:50:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6020065890687794233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1335532093801937861.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 106 rows 41 cols 418 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 08:50:50] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1335532093801937861.kers
Total runtime 1 ms.
[2026-05-25 08:50:50] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 08:50:50] [INFO ] Invariant cache hit.
[2026-05-25 08:50:50] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 08:50:50] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2026-05-25 08:50:50] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2026-05-25 08:50:50] [INFO ] Invariant cache hit.
[2026-05-25 08:50:50] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 106/147 variables, 41/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 69 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 106/147 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 100/169 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 169 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7700 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12832ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 12833ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/59 places, 106/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13028 ms. Remains : 41/59 places, 106/150 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((X(p0)||p1))||p0) U (F(X(p0)) U p2)))'
Stuttering acceptance computed with spot in 329 ms :[true, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), p0, p2]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-02
Stuttering criterion allowed to conclude after 1074 steps with 140 reset in 21 ms.
FORMULA MedleyA-PT-02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-02 finished in 13414 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) U X(((F(p1)&&X(p2)) U (X(p4)&&p3)))))'
Support contains 7 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 53 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 53 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 50 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 50 transition count 122
Applied a total of 18 rules in 3 ms. Remains 50 /59 variables (removed 9) and now considering 122/150 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6433348765333433884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3394913216148752316.kers'
[2026-05-25 08:51:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6433348765333433884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3394913216148752316.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 50 cols 470 entries
Finished phase 1 with 40 SingleSign rule and 1 generalized
[2026-05-25 08:51:03] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3394913216148752316.kers
Total runtime 1 ms.
[2026-05-25 08:51:03] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 08:51:03] [INFO ] Invariant cache hit.
[2026-05-25 08:51:03] [INFO ] State equation strengthened by 54 read => feed constraints.
[2026-05-25 08:51:03] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-25 08:51:03] [INFO ] Invariant cache hit.
[2026-05-25 08:51:03] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/172 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/172 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 119 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8154 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/172 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 121/240 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 241 constraints, problems are : Problem set: 0 solved, 121 unsolved in 29749 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37968ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 37968ms
Starting structural reductions in LTL mode, iteration 1 : 50/59 places, 122/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38250 ms. Remains : 50/59 places, 122/150 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) U X(((F(p1)&&X(p2)) U (X(p4)&&p3)))))'
Stuttering acceptance computed with spot in 654 ms :[(OR (NOT p3) (NOT p4)), (OR (NOT p3) (NOT p4)), (OR (NOT p3) (NOT p4)), (NOT p1), (NOT p2), (NOT p4), (AND (NOT p1) p3 (NOT p4)), true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p4), (AND (NOT p1) (NOT p0) p3 (NOT p4)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-03 finished in 38993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 52 transition count 137
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 52 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 49 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 49 transition count 121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 47 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 47 transition count 113
Applied a total of 24 rules in 2 ms. Remains 47 /59 variables (removed 12) and now considering 113/150 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14604150968397292057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2786846958205362422.kers'
[2026-05-25 08:51:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14604150968397292057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2786846958205362422.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 47 cols 448 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-25 08:51:42] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2786846958205362422.kers
Total runtime 0 ms.
[2026-05-25 08:51:42] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 08:51:42] [INFO ] Invariant cache hit.
[2026-05-25 08:51:42] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 08:51:42] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2026-05-25 08:51:42] [INFO ] Invariant cache hit.
[2026-05-25 08:51:42] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 113/160 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 112 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/160 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 112/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 227 constraints, problems are : Problem set: 0 solved, 112 unsolved in 17758 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22833ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 22834ms
Starting structural reductions in LTL mode, iteration 1 : 47/59 places, 113/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23025 ms. Remains : 47/59 places, 113/150 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(p0)&&p1)))'
Stuttering acceptance computed with spot in 208 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-05 finished in 23264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Graph (complete) has 325 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 50 transition count 135
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 50 transition count 135
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 19 place count 46 transition count 113
Iterating global reduction 0 with 4 rules applied. Total rules applied 23 place count 46 transition count 113
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 25 place count 44 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 27 place count 44 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 31 place count 42 transition count 103
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 39 place count 38 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 58 place count 38 transition count 93
Applied a total of 58 rules in 16 ms. Remains 38 /59 variables (removed 21) and now considering 93/150 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4316517750628635030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1443046514759273578.kers'
[2026-05-25 08:52:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4316517750628635030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1443046514759273578.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 38 cols 378 entries
Finished phase 1 with 28 SingleSign rule and 1 generalized
[2026-05-25 08:52:05] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1443046514759273578.kers
Total runtime 1 ms.
[2026-05-25 08:52:05] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 08:52:05] [INFO ] Invariant cache hit.
[2026-05-25 08:52:05] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 08:52:05] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2026-05-25 08:52:05] [INFO ] Redundant transitions in 2 ms returned []
Running 87 sub problems to find dead transitions.
[2026-05-25 08:52:05] [INFO ] Invariant cache hit.
[2026-05-25 08:52:05] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 93/131 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 62 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3564 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 93/131 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 87/149 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 149 constraints, problems are : Problem set: 0 solved, 87 unsolved in 6042 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9652ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 9652ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/59 places, 93/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9815 ms. Remains : 38/59 places, 93/150 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-06
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-06 finished in 9989 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)) U p1))'
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Graph (complete) has 325 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 51 transition count 136
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 51 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 19 place count 47 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 23 place count 47 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 46 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 46 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 29 place count 44 transition count 108
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 39 place count 39 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 65 place count 39 transition count 105
Applied a total of 65 rules in 28 ms. Remains 39 /59 variables (removed 20) and now considering 105/150 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7139136205699903689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11347104354106145701.kers'
[2026-05-25 08:52:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7139136205699903689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11347104354106145701.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 105 rows 39 cols 442 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 08:52:15] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11347104354106145701.kers
Total runtime 0 ms.
[2026-05-25 08:52:15] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 08:52:15] [INFO ] Invariant cache hit.
[2026-05-25 08:52:15] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 08:52:15] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2026-05-25 08:52:15] [INFO ] Redundant transitions in 1 ms returned []
Running 103 sub problems to find dead transitions.
[2026-05-25 08:52:15] [INFO ] Invariant cache hit.
[2026-05-25 08:52:15] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 105/144 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 53/103 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/144 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 103 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4428 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 105/144 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 53/103 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 103/206 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/144 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 206 constraints, problems are : Problem set: 0 solved, 103 unsolved in 7647 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12115ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 12116ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/59 places, 105/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12366 ms. Remains : 39/59 places, 105/150 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)) U p1))'
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-07
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-07 finished in 12553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(p1) U ((!p0&&X(p1))||X(G(p1))))))'
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 53 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 53 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 51 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 51 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 50 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 50 transition count 124
Applied a total of 18 rules in 23 ms. Remains 50 /59 variables (removed 9) and now considering 124/150 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11811760745336053656.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1417331214085354109.kers'
[2026-05-25 08:52:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11811760745336053656.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1417331214085354109.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 124 rows 50 cols 484 entries
Finished phase 1 with 40 SingleSign rule and 1 generalized
[2026-05-25 08:52:28] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-1417331214085354109.kers
Total runtime 9 ms.
[2026-05-25 08:52:28] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 08:52:28] [INFO ] Invariant cache hit.
[2026-05-25 08:52:28] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-25 08:52:28] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2026-05-25 08:52:28] [INFO ] Invariant cache hit.
[2026-05-25 08:52:28] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/174 variables, 50/67 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 55/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/174 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 123 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7638 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/174 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 55/123 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 123/246 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 247 constraints, problems are : Problem set: 0 solved, 123 unsolved in 11982 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19667ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 19667ms
Starting structural reductions in LTL mode, iteration 1 : 50/59 places, 124/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19911 ms. Remains : 50/59 places, 124/150 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(p1) U ((!p0&&X(p1))||X(G(p1))))))'
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p0) p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA MedleyA-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-08 finished in 20257 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 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Graph (complete) has 325 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 52 transition count 138
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 52 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 16 place count 49 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 49 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 21 place count 47 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 47 transition count 114
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 25 place count 46 transition count 113
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 35 place count 41 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 61 place count 41 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 61 place count 41 transition count 119
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 63 place count 40 transition count 119
Applied a total of 63 rules in 28 ms. Remains 40 /59 variables (removed 19) and now considering 119/150 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2125047823732805573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7588970613109918776.kers'
[2026-05-25 08:52:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2125047823732805573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7588970613109918776.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 119 rows 40 cols 518 entries
Finished phase 1 with 30 SingleSign rule and 1 generalized
[2026-05-25 08:52:48] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7588970613109918776.kers
Total runtime 0 ms.
[2026-05-25 08:52:48] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 08:52:48] [INFO ] Invariant cache hit.
[2026-05-25 08:52:48] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-25 08:52:48] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2026-05-25 08:52:48] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2026-05-25 08:52:48] [INFO ] Invariant cache hit.
[2026-05-25 08:52:48] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 119/159 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 59/112 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 112 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3779 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 119/159 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 59/112 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 115/227 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/159 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 227 constraints, problems are : Problem set: 0 solved, 115 unsolved in 7509 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11334ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 11335ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/59 places, 119/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11599 ms. Remains : 40/59 places, 119/150 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 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-10
Product exploration explored 100000 steps with 13248 reset in 220 ms.
Product exploration explored 100000 steps with 13238 reset in 209 ms.
Computed a total of 8 stabilizing places and 58 stable transitions
Computed a total of 8 stabilizing places and 58 stable transitions
Knowledge based reduction with 9 factoid took 65 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 (5293 resets) in 452 ms. (88 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (57 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (66 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (57 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
[2026-05-25 08:53:01] [INFO ] Invariant cache hit.
[2026-05-25 08:53:01] [INFO ] State equation strengthened by 59 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/40 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 119/159 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 59/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/159 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 108 constraints, problems are : Problem set: 0 solved, 3 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/29 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/40 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 119/159 variables, 40/49 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 59/108 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/159 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 110 constraints, problems are : Problem set: 1 solved, 2 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 353ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 119/119 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 118
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 39 transition count 118
Applied a total of 7 rules in 22 ms. Remains 39 /40 variables (removed 1) and now considering 118/119 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 39/40 places, 118/119 transitions.
RANDOM walk for 40000 steps (7198 resets) in 349 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (215 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (554 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 28843 steps, run visited all 2 properties in 146 ms. (steps per millisecond=197 )
Probabilistic random walk after 28843 steps, saw 7687 distinct states, run finished after 146 ms. (steps per millisecond=197 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 76 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 1223 ms.
FORMULA MedleyA-PT-02-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-02-LTLFireability-10 finished in 13415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(p1))))&&F(p2)))'
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 52 transition count 137
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 52 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 50 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 50 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 49 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 49 transition count 122
Applied a total of 20 rules in 2 ms. Remains 49 /59 variables (removed 10) and now considering 122/150 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14098830444671909129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8606238785218121052.kers'
[2026-05-25 08:53:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14098830444671909129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8606238785218121052.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 49 cols 480 entries
Finished phase 1 with 39 SingleSign rule and 1 generalized
[2026-05-25 08:53:01] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8606238785218121052.kers
Total runtime 0 ms.
[2026-05-25 08:53:01] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 08:53:01] [INFO ] Invariant cache hit.
[2026-05-25 08:53:01] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-25 08:53:02] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-25 08:53:02] [INFO ] Invariant cache hit.
[2026-05-25 08:53:02] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/171 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 55/118 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/171 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/171 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 120 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8561 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/171 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 55/120 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 121/241 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 241 constraints, problems are : Problem set: 0 solved, 121 unsolved in 6525 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15156ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 15157ms
Starting structural reductions in LTL mode, iteration 1 : 49/59 places, 122/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15322 ms. Remains : 49/59 places, 122/150 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(p1))))&&F(p2)))'
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-11 finished in 15542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(p1))))))'
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 52 transition count 137
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 52 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 49 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 49 transition count 121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 47 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 47 transition count 113
Applied a total of 24 rules in 7 ms. Remains 47 /59 variables (removed 12) and now considering 113/150 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-365219590205120169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6747064646354246894.kers'
[2026-05-25 08:53:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-365219590205120169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6747064646354246894.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 47 cols 448 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-25 08:53:17] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6747064646354246894.kers
Total runtime 0 ms.
[2026-05-25 08:53:17] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 08:53:17] [INFO ] Invariant cache hit.
[2026-05-25 08:53:17] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 08:53:17] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2026-05-25 08:53:17] [INFO ] Invariant cache hit.
[2026-05-25 08:53:17] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 113/160 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 112 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/160 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 112/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 227 constraints, problems are : Problem set: 0 solved, 112 unsolved in 17581 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22699ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 22708ms
Starting structural reductions in LTL mode, iteration 1 : 47/59 places, 113/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22922 ms. Remains : 47/59 places, 113/150 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)||p1)))))'
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-12
Product exploration explored 100000 steps with 25000 reset in 238 ms.
Product exploration explored 100000 steps with 25000 reset in 259 ms.
Computed a total of 9 stabilizing places and 48 stable transitions
Graph (complete) has 261 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 48 stable transitions
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (3984 resets) in 212 ms. (187 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (929 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (896 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
[2026-05-25 08:53:41] [INFO ] Invariant cache hit.
[2026-05-25 08:53:41] [INFO ] State equation strengthened by 52 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/43 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 112/157 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/160 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/160 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 108 constraints, problems are : Problem set: 0 solved, 2 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/43 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 112/157 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/160 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 110 constraints, problems are : Problem set: 0 solved, 2 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 738ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 113/113 transitions.
Graph (complete) has 201 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 44 transition count 110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 13 place count 40 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 35 place count 40 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 35 place count 40 transition count 108
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 37 place count 39 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 39 place count 38 transition count 120
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 38 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 37 transition count 119
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 37 transition count 119
Applied a total of 45 rules in 24 ms. Remains 37 /47 variables (removed 10) and now considering 119/113 (removed -6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 37/47 places, 119/113 transitions.
RANDOM walk for 40000 steps (8818 resets) in 312 ms. (127 steps per ms) remains 2/2 properties
BEST_FIRST walk for 28503 steps (1418 resets) in 38 ms. (730 steps per ms) remains 0/2 properties
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1502 ms.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 113/113 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2026-05-25 08:53:42] [INFO ] Invariant cache hit.
[2026-05-25 08:53:42] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 08:53:42] [INFO ] Invariant cache hit.
[2026-05-25 08:53:42] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 08:53:42] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 47/47 places, 113/113 transitions.
Computed a total of 9 stabilizing places and 48 stable transitions
Graph (complete) has 261 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 9 stabilizing places and 48 stable transitions
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (4005 resets) in 231 ms. (172 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (936 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (891 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
[2026-05-25 08:53:43] [INFO ] Invariant cache hit.
[2026-05-25 08:53:43] [INFO ] State equation strengthened by 52 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/43 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 112/157 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/160 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/160 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 108 constraints, problems are : Problem set: 0 solved, 2 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/43 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 112/157 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/160 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 110 constraints, problems are : Problem set: 0 solved, 2 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 608ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 113/113 transitions.
Graph (complete) has 201 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 44 transition count 110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 13 place count 40 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 35 place count 40 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 35 place count 40 transition count 108
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 37 place count 39 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 39 place count 38 transition count 120
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 38 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 37 transition count 119
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 37 transition count 119
Applied a total of 45 rules in 11 ms. Remains 37 /47 variables (removed 10) and now considering 119/113 (removed -6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 37/47 places, 119/113 transitions.
RANDOM walk for 40000 steps (8784 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 32407 steps (1605 resets) in 78 ms. (410 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1244 ms.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 192 ms.
Product exploration explored 100000 steps with 25000 reset in 174 ms.
Spot run failed in 170 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/ltsmin4933250004525288071
[2026-05-25 08:53:45] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4933250004525288071
Running compilation step : cd /tmp/ltsmin4933250004525288071;'/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 569 ms.
Running link step : cd /tmp/ltsmin4933250004525288071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin4933250004525288071;'/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/stateBased11668054758458713005.hoa' '--buchi-type=spotba'
LTSmin run took 111 ms.
FORMULA MedleyA-PT-02-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-02-LTLFireability-12 finished in 28453 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)))'
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Graph (complete) has 325 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 51 transition count 136
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 51 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 18 place count 48 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 21 place count 48 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 47 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 47 transition count 115
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 27 place count 45 transition count 113
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 35 place count 41 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 57 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 57 place count 41 transition count 111
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 59 place count 40 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 61 place count 39 transition count 123
Applied a total of 61 rules in 16 ms. Remains 39 /59 variables (removed 20) and now considering 123/150 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3694422217728423927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15479157392432124886.kers'
[2026-05-25 08:53:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3694422217728423927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15479157392432124886.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 39 cols 544 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 08:53:45] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15479157392432124886.kers
Total runtime 1 ms.
[2026-05-25 08:53:45] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 08:53:45] [INFO ] Invariant cache hit.
[2026-05-25 08:53:46] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-25 08:53:46] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2026-05-25 08:53:46] [INFO ] Redundant transitions in 2 ms returned []
Running 119 sub problems to find dead transitions.
[2026-05-25 08:53:46] [INFO ] Invariant cache hit.
[2026-05-25 08:53:46] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 123/162 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 62/112 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 112 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5234 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 123/162 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 62/112 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 119/231 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 231 constraints, problems are : Problem set: 0 solved, 119 unsolved in 14976 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20283ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 20284ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/59 places, 123/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20527 ms. Remains : 39/59 places, 123/150 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)))'
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-13
Product exploration explored 100000 steps with 15135 reset in 226 ms.
Product exploration explored 100000 steps with 15269 reset in 205 ms.
Computed a total of 8 stabilizing places and 61 stable transitions
Computed a total of 8 stabilizing places and 61 stable transitions
Knowledge based reduction with 3 factoid took 89 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 (6090 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1283 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7463 steps, run visited all 1 properties in 25 ms. (steps per millisecond=298 )
Probabilistic random walk after 7463 steps, saw 1911 distinct states, run finished after 26 ms. (steps per millisecond=287 ) properties seen :1
Knowledge based reduction with 3 factoid took 70 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 92 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 352 ms.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2026-05-25 08:54:07] [INFO ] Invariant cache hit.
[2026-05-25 08:54:07] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 08:54:07] [INFO ] Invariant cache hit.
[2026-05-25 08:54:07] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-25 08:54:07] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2026-05-25 08:54:07] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 266 ms. Remains : 39/39 places, 123/123 transitions.
Computed a total of 8 stabilizing places and 61 stable transitions
Computed a total of 8 stabilizing places and 61 stable transitions
Knowledge based reduction with 3 factoid took 52 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 (6097 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1373 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7463 steps, run visited all 1 properties in 13 ms. (steps per millisecond=574 )
Probabilistic random walk after 7463 steps, saw 1911 distinct states, run finished after 17 ms. (steps per millisecond=439 ) properties seen :1
Knowledge based reduction with 3 factoid took 68 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 69 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 257 ms.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15191 reset in 169 ms.
Product exploration explored 100000 steps with 15213 reset in 195 ms.
Built C files in :
/tmp/ltsmin8865420325632282189
[2026-05-25 08:54:08] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2026-05-25 08:54:08] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:54:08] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2026-05-25 08:54:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:54:08] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2026-05-25 08:54:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:54:08] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8865420325632282189
Running compilation step : cd /tmp/ltsmin8865420325632282189;'/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 291 ms.
Running link step : cd /tmp/ltsmin8865420325632282189;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8865420325632282189;'/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/stateBased9327492515705481116.hoa' '--buchi-type=spotba'
LTSmin run took 1781 ms.
FORMULA MedleyA-PT-02-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-02-LTLFireability-13 finished in 24831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(X((X(!p2)&&(!p1 U (p3||G(!p1))))))))'
Support contains 10 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 53 transition count 138
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 53 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 49 transition count 116
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 49 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 48 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 48 transition count 112
Applied a total of 22 rules in 17 ms. Remains 48 /59 variables (removed 11) and now considering 112/150 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9164518888809641533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15605132824030285714.kers'
[2026-05-25 08:54:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9164518888809641533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15605132824030285714.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 48 cols 438 entries
Finished phase 1 with 38 SingleSign rule and 1 generalized
[2026-05-25 08:54:10] [INFO ] Computed 9 invariants in 12 ms
Computed 9 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-15605132824030285714.kers
Total runtime 14 ms.
[2026-05-25 08:54:10] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 08:54:10] [INFO ] Invariant cache hit.
[2026-05-25 08:54:10] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-25 08:54:10] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2026-05-25 08:54:10] [INFO ] Invariant cache hit.
[2026-05-25 08:54:10] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 112/160 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/160 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 111 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4315 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 112/160 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 111/222 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 222 constraints, problems are : Problem set: 0 solved, 111 unsolved in 9109 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13475ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 13475ms
Starting structural reductions in LTL mode, iteration 1 : 48/59 places, 112/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13665 ms. Remains : 48/59 places, 112/150 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(X((X(!p2)&&(!p1 U (p3||G(!p1))))))))'
Stuttering acceptance computed with spot in 1057 ms :[(OR p2 (AND p1 (NOT p3))), (OR p2 (AND p1 (NOT p3))), (AND (NOT p1) p2), (OR p2 (AND p1 (NOT p3))), (OR p2 (AND p1 (NOT p3))), true, p2, (AND p1 (NOT p3)), (AND (NOT p1) p2), (OR p2 (AND p1 (NOT p3))), (AND (NOT p1) p2), (OR p2 (AND p1 (NOT p3))), (AND (NOT p1) p2), (AND p1 (NOT p3)), p2, (AND (NOT p1) p2), p2, (AND p1 (NOT p3) (NOT p2)), (AND (NOT p1) p2), p2, (NOT p1)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-14
Entered a terminal (fully accepting) state of product in 95 steps with 23 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-14 finished in 14806 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) U p1)) U p2)||F(p3)))'
Support contains 8 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 150/150 transitions.
Graph (complete) has 325 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 52 transition count 138
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 52 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 16 place count 49 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 49 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 48 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 48 transition count 117
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 45 transition count 114
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 33 place count 42 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 45 place count 42 transition count 119
Applied a total of 45 rules in 8 ms. Remains 42 /59 variables (removed 17) and now considering 119/150 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-742699396980544055.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16787814327609669081.kers'
[2026-05-25 08:54:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-742699396980544055.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16787814327609669081.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 119 rows 42 cols 496 entries
Finished phase 1 with 32 SingleSign rule and 1 generalized
[2026-05-25 08:54:25] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16787814327609669081.kers
Total runtime 0 ms.
[2026-05-25 08:54:25] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 08:54:25] [INFO ] Invariant cache hit.
[2026-05-25 08:54:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-25 08:54:25] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2026-05-25 08:54:25] [INFO ] Redundant transitions in 1 ms returned []
Running 117 sub problems to find dead transitions.
[2026-05-25 08:54:25] [INFO ] Invariant cache hit.
[2026-05-25 08:54:25] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 119/161 variables, 42/56 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 57/113 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 113 constraints, problems are : Problem set: 0 solved, 117 unsolved in 3826 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 119/161 variables, 42/56 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 57/113 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 117/230 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/161 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (OVERLAPS) 0/161 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 231 constraints, problems are : Problem set: 0 solved, 117 unsolved in 13399 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17286ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 17286ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/59 places, 119/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17491 ms. Remains : 42/59 places, 119/150 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) U p1)) U p2)||F(p3)))'
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-15
Stuttering criterion allowed to conclude after 34 steps with 8 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-15 finished in 17780 ms.
All properties solved by simple procedures.
Total runtime 300709 ms.

BK_STOP 1779699283346

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-02"
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-02, 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-177969019900108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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