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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.8K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 89K 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-16-LTLFireability-00
FORMULA_NAME MedleyA-PT-16-LTLFireability-01
FORMULA_NAME MedleyA-PT-16-LTLFireability-02
FORMULA_NAME MedleyA-PT-16-LTLFireability-03
FORMULA_NAME MedleyA-PT-16-LTLFireability-04
FORMULA_NAME MedleyA-PT-16-LTLFireability-05
FORMULA_NAME MedleyA-PT-16-LTLFireability-06
FORMULA_NAME MedleyA-PT-16-LTLFireability-07
FORMULA_NAME MedleyA-PT-16-LTLFireability-08
FORMULA_NAME MedleyA-PT-16-LTLFireability-09
FORMULA_NAME MedleyA-PT-16-LTLFireability-10
FORMULA_NAME MedleyA-PT-16-LTLFireability-11
FORMULA_NAME MedleyA-PT-16-LTLFireability-12
FORMULA_NAME MedleyA-PT-16-LTLFireability-13
FORMULA_NAME MedleyA-PT-16-LTLFireability-14
FORMULA_NAME MedleyA-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779700600378

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:16: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 09:16:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:16:42] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2026-05-25 09:16:42] [INFO ] Transformed 196 places.
[2026-05-25 09:16:42] [INFO ] Transformed 392 transitions.
[2026-05-25 09:16:42] [INFO ] Found NUPN structural information;
[2026-05-25 09:16:42] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-16-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 166 transition count 342
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 166 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 166 transition count 341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 165 transition count 340
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 165 transition count 340
Applied a total of 63 rules in 48 ms. Remains 165 /196 variables (removed 31) and now considering 340/390 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-446852719369142063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12578390991961428577.kers'
[2026-05-25 09:16:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-446852719369142063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12578390991961428577.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 340 rows 165 cols 1080 entries
Finished phase 1 with 157 SingleSign rule and 1 generalized
[2026-05-25 09:16:42] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12578390991961428577.kers
Total runtime 2 ms.
[2026-05-25 09:16:43] [INFO ] Implicit Places using invariants in 310 ms returned []
[2026-05-25 09:16:43] [INFO ] Invariant cache hit.
[2026-05-25 09:16:43] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-05-25 09:16:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 340/505 variables, 165/203 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 204 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (OVERLAPS) 340/505 variables, 165/206 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 339/545 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 546 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Starting structural reductions in LTL mode, iteration 1 : 165/196 places, 340/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60865 ms. Remains : 165/196 places, 340/390 transitions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Applied a total of 0 rules in 12 ms. Remains 165 /165 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2026-05-25 09:17:43] [INFO ] Invariant cache hit.
[2026-05-25 09:17:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 09:17:43] [INFO ] Invariant cache hit.
[2026-05-25 09:17:43] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 165/165 places, 340/340 transitions.
Support contains 45 out of 165 places after structural reductions.
[2026-05-25 09:17:44] [INFO ] Flatten gal took : 70 ms
[2026-05-25 09:17:44] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:17:44] [INFO ] Input system was already deterministic with 340 transitions.
Reduction of identical properties reduced properties to check from 39 to 36
RANDOM walk for 40000 steps (8 resets) in 1827 ms. (21 steps per ms) remains 31/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 75 ms. (52 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 81 ms. (48 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
[2026-05-25 09:17:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 126/165 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 176 constraints, problems are : Problem set: 0 solved, 30 unsolved in 2517 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 126/165 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 340/505 variables, 165/177 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 30/207 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 210 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7535ms problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 340/340 transitions.
Graph (trivial) has 85 edges and 165 vertex of which 4 / 165 are part of one of the 1 SCC in 62 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 162 transition count 318
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 144 transition count 316
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 143 transition count 311
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 50 place count 138 transition count 311
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 50 place count 138 transition count 302
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 68 place count 129 transition count 302
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 71 place count 126 transition count 299
Iterating global reduction 4 with 3 rules applied. Total rules applied 74 place count 126 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 126 transition count 298
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 109 place count 109 transition count 281
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 110 place count 108 transition count 277
Iterating global reduction 5 with 1 rules applied. Total rules applied 111 place count 108 transition count 277
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 123 place count 102 transition count 294
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 136 place count 102 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 136 place count 102 transition count 280
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 101 transition count 280
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 100 transition count 279
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 100 transition count 279
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 144 place count 98 transition count 296
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 152 place count 98 transition count 288
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 160 place count 90 transition count 288
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 164 place count 86 transition count 280
Iterating global reduction 6 with 4 rules applied. Total rules applied 168 place count 86 transition count 280
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 86 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 170 place count 85 transition count 279
Applied a total of 170 rules in 164 ms. Remains 85 /165 variables (removed 80) and now considering 279/340 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 85/165 places, 279/340 transitions.
RANDOM walk for 40000 steps (8 resets) in 719 ms. (55 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
[2026-05-25 09:17:53] [INFO ] Flow matrix only has 276 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-281588078413133794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6728453987165080818.kers'
[2026-05-25 09:17:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-281588078413133794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6728453987165080818.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 276 rows 83 cols 967 entries
Finished phase 1 with 77 SingleSign rule and 1 generalized
[2026-05-25 09:17:53] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6728453987165080818.kers
Total runtime 2 ms.
[2026-05-25 09:17:53] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 50/76 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 273/349 variables, 76/83 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 11/94 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 12/361 variables, 9/103 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/361 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 104 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1996 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 50/76 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 273/349 variables, 76/83 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 11/94 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 12/361 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/361 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 125 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2700 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4724ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 12 properties in 11031 ms.
Support contains 11 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 279/279 transitions.
Graph (trivial) has 67 edges and 85 vertex of which 5 / 85 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 82 transition count 270
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 78 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 77 transition count 269
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 11 place count 77 transition count 265
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 21 place count 71 transition count 265
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 64 edges and 71 vertex of which 12 / 71 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 24 place count 63 transition count 263
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 49 place count 63 transition count 238
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 52 place count 60 transition count 228
Iterating global reduction 5 with 3 rules applied. Total rules applied 55 place count 60 transition count 228
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 60 place count 60 transition count 223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 62 place count 59 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 63 place count 59 transition count 221
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 79 place count 51 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 7 with 66 rules applied. Total rules applied 145 place count 51 transition count 207
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 146 place count 51 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 147 place count 50 transition count 206
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 148 place count 49 transition count 199
Iterating global reduction 9 with 1 rules applied. Total rules applied 149 place count 49 transition count 199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 151 place count 48 transition count 204
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 156 place count 48 transition count 199
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 161 place count 43 transition count 199
Applied a total of 161 rules in 39 ms. Remains 43 /85 variables (removed 42) and now considering 199/279 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 43/85 places, 199/279 transitions.
RANDOM walk for 40000 steps (476 resets) in 1229 ms. (32 steps per ms) remains 0/7 properties
Computed a total of 16 stabilizing places and 16 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0)||X(X(X(p1))))))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 154 transition count 323
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 154 transition count 323
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 36 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 153 transition count 308
Applied a total of 38 rules in 6 ms. Remains 153 /165 variables (removed 12) and now considering 308/340 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3224257839341110330.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15189151687791963350.kers'
[2026-05-25 09:18:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3224257839341110330.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15189151687791963350.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 153 cols 988 entries
Finished phase 1 with 145 SingleSign rule and 1 generalized
[2026-05-25 09:18:10] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15189151687791963350.kers
Total runtime 2 ms.
[2026-05-25 09:18:10] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-25 09:18:10] [INFO ] Invariant cache hit.
[2026-05-25 09:18:10] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2026-05-25 09:18:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/179 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 180 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 307/487 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 491 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in LTL mode, iteration 1 : 153/165 places, 308/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60596 ms. Remains : 153/165 places, 308/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0)||X(X(X(p1))))))))'
Stuttering acceptance computed with spot in 627 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-00
Product exploration explored 100000 steps with 14291 reset in 206 ms.
Product exploration explored 100000 steps with 14303 reset in 202 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 11 states, 17 edges and 2 AP (stutter sensitive) to 11 states, 17 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 721 ms. (55 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 277 ms. (143 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1576542 steps, run timeout after 3001 ms. (steps per millisecond=525 ) properties seen :5 out of 6
Probabilistic random walk after 1576542 steps, saw 356892 distinct states, run finished after 3012 ms. (steps per millisecond=523 ) properties seen :5
[2026-05-25 09:19:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 104/461 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 3/7 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 11 states, 17 edges and 2 AP (stutter sensitive) to 11 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 695 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Knowledge-based reduction took 4728 ms.
Stuttering acceptance computed with spot in 605 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 308/308 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2026-05-25 09:19:17] [INFO ] Invariant cache hit.
[2026-05-25 09:19:17] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 09:19:17] [INFO ] Invariant cache hit.
[2026-05-25 09:19:18] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 423 ms. Remains : 153/153 places, 308/308 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 11 states, 16 edges and 2 AP (stutter sensitive) to 11 states, 16 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 71824 steps, run visited all 3 properties in 172 ms. (steps per millisecond=417 )
Probabilistic random walk after 71824 steps, saw 14468 distinct states, run finished after 184 ms. (steps per millisecond=390 ) properties seen :3
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 11 states, 16 edges and 2 AP (stutter sensitive) to 11 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 518 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Knowledge-based reduction took 1074 ms.
Stuttering acceptance computed with spot in 687 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 446 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 14254 reset in 158 ms.
Product exploration explored 100000 steps with 14283 reset in 142 ms.
Spot run failed in 96 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/ltsmin9827288724270451403
[2026-05-25 09:19:20] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9827288724270451403
Running compilation step : cd /tmp/ltsmin9827288724270451403;'/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 882 ms.
Running link step : cd /tmp/ltsmin9827288724270451403;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 115 ms.
Running LTSmin : cd /tmp/ltsmin9827288724270451403;'/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/stateBased2990846908171847586.hoa' '--buchi-type=spotba'
LTSmin run took 4015 ms.
FORMULA MedleyA-PT-16-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLFireability-00 finished in 75337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p1))&&p0) U X(((p3 U p4)&&X(p5)&&p2))))'
Support contains 7 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 324
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 324
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 34 place count 155 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 154 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 154 transition count 309
Applied a total of 36 rules in 5 ms. Remains 154 /165 variables (removed 11) and now considering 309/340 (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-8966871486538500058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4661633391090176381.kers'
[2026-05-25 09:19:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8966871486538500058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4661633391090176381.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 154 cols 990 entries
Finished phase 1 with 146 SingleSign rule and 1 generalized
[2026-05-25 09:19:25] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4661633391090176381.kers
Total runtime 1 ms.
[2026-05-25 09:19:26] [INFO ] Implicit Places using invariants in 295 ms returned []
[2026-05-25 09:19:26] [INFO ] Invariant cache hit.
[2026-05-25 09:19:26] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2026-05-25 09:19:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 309/463 variables, 154/183 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (OVERLAPS) 0/463 variables, 5/188 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 188 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/463 variables, 154/188 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 308/496 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 499 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 154/165 places, 309/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60665 ms. Remains : 154/165 places, 309/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p1))&&p0) U X(((p3 U p4)&&X(p5)&&p2))))'
Stuttering acceptance computed with spot in 728 ms :[(OR (NOT p4) (NOT p2) (NOT p5)), (OR (NOT p2) (NOT p4) (NOT p5)), (OR (NOT p2) (NOT p4) (NOT p5)), true, (NOT p4), (NOT p5), (NOT p1), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p5)), (NOT p5), (NOT p5), (NOT p4)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-16-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-01 finished in 61485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)&&F(p2)))'
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Graph (trivial) has 166 edges and 165 vertex of which 13 / 165 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 154 transition count 298
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 123 transition count 294
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 121 transition count 294
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 69 place count 121 transition count 287
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 83 place count 114 transition count 287
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 94 place count 103 transition count 268
Iterating global reduction 3 with 11 rules applied. Total rules applied 105 place count 103 transition count 268
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 119 place count 103 transition count 254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 119 place count 103 transition count 253
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 102 transition count 253
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 161 place count 82 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 167 place count 82 transition count 227
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 170 place count 79 transition count 219
Iterating global reduction 5 with 3 rules applied. Total rules applied 173 place count 79 transition count 219
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -112
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 207 place count 62 transition count 331
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 208 place count 62 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 231 place count 62 transition count 307
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 235 place count 60 transition count 333
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 236 place count 59 transition count 332
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 43 edges and 58 vertex of which 9 / 58 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 238 place count 53 transition count 332
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 249 place count 53 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 8 with 53 rules applied. Total rules applied 302 place count 53 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 304 place count 52 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 318 place count 52 transition count 267
Applied a total of 318 rules in 68 ms. Remains 52 /165 variables (removed 113) and now considering 267/340 (removed 73) transitions.
[2026-05-25 09:20:27] [INFO ] Flow matrix only has 207 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8968994360222065209.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6885474597601923855.kers'
[2026-05-25 09:20:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8968994360222065209.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6885474597601923855.kers]
Normalized transition count is 206 out of 207 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 206 rows 51 cols 796 entries
Finished phase 1 with 45 SingleSign rule and 1 generalized
[2026-05-25 09:20:27] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6885474597601923855.kers
Total runtime 1 ms.
[2026-05-25 09:20:27] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 09:20:27] [INFO ] Flow matrix only has 207 transitions (discarded 60 similar events)
[2026-05-25 09:20:27] [INFO ] Invariant cache hit.
[2026-05-25 09:20:27] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-25 09:20:27] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2026-05-25 09:20:27] [INFO ] Redundant transitions in 46 ms returned [255]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 263 sub problems to find dead transitions.
[2026-05-25 09:20:27] [INFO ] Flow matrix only has 206 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5006002470259022415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14967815667889865857.kers'
[2026-05-25 09:20:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5006002470259022415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14967815667889865857.kers]
Normalized transition count is 205 out of 206 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 205 rows 51 cols 793 entries
Finished phase 1 with 45 SingleSign rule and 1 generalized
[2026-05-25 09:20:27] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14967815667889865857.kers
Total runtime 1 ms.
[2026-05-25 09:20:27] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 2/52 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 205/257 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 1/258 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 113 constraints, problems are : Problem set: 0 solved, 263 unsolved in 17944 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 52/52 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 205/257 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 263/375 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/258 variables, and 376 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 52/52 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48079ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 48079ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/165 places, 266/340 transitions.
Applied a total of 0 rules in 7 ms. Remains 52 /52 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48430 ms. Remains : 52/165 places, 266/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)&&F(p2)))'
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 108 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLFireability-03 finished in 48763 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((X(X(X(p1)))&&p0)) U p2)))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 326
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 326
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 30 place count 156 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 155 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 155 transition count 313
Applied a total of 32 rules in 6 ms. Remains 155 /165 variables (removed 10) and now considering 313/340 (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-5778919387154110214.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14981230126815795618.kers'
[2026-05-25 09:21:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5778919387154110214.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14981230126815795618.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 155 cols 1002 entries
Finished phase 1 with 147 SingleSign rule and 1 generalized
[2026-05-25 09:21:16] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14981230126815795618.kers
Total runtime 2 ms.
[2026-05-25 09:21:16] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 09:21:16] [INFO ] Invariant cache hit.
[2026-05-25 09:21:16] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2026-05-25 09:21:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 313/468 variables, 155/189 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/468 variables, and 189 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/468 variables, 155/189 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 312/501 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 504 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 155/165 places, 313/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60376 ms. Remains : 155/165 places, 313/340 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((X(X(X(p1)))&&p0)) U p2)))'
Stuttering acceptance computed with spot in 541 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 125 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLFireability-04 finished in 61116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1 U (G(p1)||(p1&&G(p2)))))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 325
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 325
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 29 place count 155 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 154 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 154 transition count 315
Applied a total of 31 rules in 5 ms. Remains 154 /165 variables (removed 11) and now considering 315/340 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9328726881283528942.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5685850569746471434.kers'
[2026-05-25 09:22:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9328726881283528942.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5685850569746471434.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 154 cols 1012 entries
Finished phase 1 with 146 SingleSign rule and 1 generalized
[2026-05-25 09:22:17] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5685850569746471434.kers
Total runtime 1 ms.
[2026-05-25 09:22:17] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 09:22:17] [INFO ] Invariant cache hit.
[2026-05-25 09:22:17] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2026-05-25 09:22:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (OVERLAPS) 315/469 variables, 154/184 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/469 variables, and 185 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/469 variables, 154/185 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 314/499 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 503 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 154/165 places, 315/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60362 ms. Remains : 154/165 places, 315/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1 U (G(p1)||(p1&&G(p2)))))))'
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 172 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLFireability-05 finished in 60835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(p1))))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 325
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 325
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 32 place count 155 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 154 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 154 transition count 312
Applied a total of 34 rules in 4 ms. Remains 154 /165 variables (removed 11) and now considering 312/340 (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-553528837805542717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2726703252327619257.kers'
[2026-05-25 09:23:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-553528837805542717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2726703252327619257.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 154 cols 1000 entries
Finished phase 1 with 146 SingleSign rule and 1 generalized
[2026-05-25 09:23:18] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2726703252327619257.kers
Total runtime 8 ms.
[2026-05-25 09:23:18] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-25 09:23:18] [INFO ] Invariant cache hit.
[2026-05-25 09:23:18] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2026-05-25 09:23:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 312/466 variables, 154/181 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 181 constraints, problems are : Problem set: 0 solved, 311 unsolved in 28728 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 312/466 variables, 154/182 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 311/493 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 496 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 58793ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 58793ms
Starting structural reductions in LTL mode, iteration 1 : 154/165 places, 312/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59161 ms. Remains : 154/165 places, 312/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(p1))))))'
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 147 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 332 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 24295 steps, run visited all 4 properties in 145 ms. (steps per millisecond=167 )
Probabilistic random walk after 24295 steps, saw 5657 distinct states, run finished after 145 ms. (steps per millisecond=167 ) properties seen :4
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 888 ms.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 312/312 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2026-05-25 09:24:18] [INFO ] Invariant cache hit.
[2026-05-25 09:24:18] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 09:24:18] [INFO ] Invariant cache hit.
[2026-05-25 09:24:19] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 154/154 places, 312/312 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 24295 steps, run visited all 4 properties in 114 ms. (steps per millisecond=213 )
Probabilistic random walk after 24295 steps, saw 5657 distinct states, run finished after 114 ms. (steps per millisecond=213 ) properties seen :4
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 835 ms.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 168 ms.
Product exploration explored 100000 steps with 0 reset in 133 ms.
Spot run failed in 71 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/ltsmin9316019314348789512
[2026-05-25 09:24:20] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9316019314348789512
Running compilation step : cd /tmp/ltsmin9316019314348789512;'/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 521 ms.
Running link step : cd /tmp/ltsmin9316019314348789512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin9316019314348789512;'/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/stateBased6552226973048009256.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
FORMULA MedleyA-PT-16-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLFireability-06 finished in 63362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Graph (trivial) has 176 edges and 165 vertex of which 13 / 165 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 154 transition count 297
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 122 transition count 293
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 120 transition count 293
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 71 place count 120 transition count 286
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 113 transition count 286
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 97 place count 101 transition count 264
Iterating global reduction 3 with 12 rules applied. Total rules applied 109 place count 101 transition count 264
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 123 place count 101 transition count 250
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 123 place count 101 transition count 249
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 100 transition count 249
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 169 place count 78 transition count 227
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 175 place count 78 transition count 221
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 179 place count 74 transition count 210
Iterating global reduction 5 with 4 rules applied. Total rules applied 183 place count 74 transition count 210
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 217 place count 57 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 218 place count 57 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 6 with 28 rules applied. Total rules applied 246 place count 57 transition count 287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 250 place count 55 transition count 313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 251 place count 54 transition count 312
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 45 edges and 53 vertex of which 9 / 53 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 253 place count 48 transition count 312
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 271 place count 48 transition count 294
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 272 place count 47 transition count 280
Iterating global reduction 8 with 1 rules applied. Total rules applied 273 place count 47 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 8 with 43 rules applied. Total rules applied 316 place count 47 transition count 237
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 317 place count 46 transition count 228
Iterating global reduction 8 with 1 rules applied. Total rules applied 318 place count 46 transition count 228
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 322 place count 44 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 8 with 23 rules applied. Total rules applied 345 place count 44 transition count 225
Applied a total of 345 rules in 69 ms. Remains 44 /165 variables (removed 121) and now considering 225/340 (removed 115) transitions.
[2026-05-25 09:24:21] [INFO ] Flow matrix only has 166 transitions (discarded 59 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6372799973275476098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9194503757682313444.kers'
[2026-05-25 09:24:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6372799973275476098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9194503757682313444.kers]
Normalized transition count is 165 out of 166 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 44 cols 628 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-25 09:24:21] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9194503757682313444.kers
Total runtime 1 ms.
[2026-05-25 09:24:21] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 09:24:21] [INFO ] Flow matrix only has 166 transitions (discarded 59 similar events)
[2026-05-25 09:24:21] [INFO ] Invariant cache hit.
[2026-05-25 09:24:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-25 09:24:22] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2026-05-25 09:24:22] [INFO ] Redundant transitions in 29 ms returned [206]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 220 sub problems to find dead transitions.
[2026-05-25 09:24:22] [INFO ] Flow matrix only has 165 transitions (discarded 59 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7958631022274174045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17821854736034132052.kers'
[2026-05-25 09:24:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7958631022274174045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17821854736034132052.kers]
Normalized transition count is 164 out of 165 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 44 cols 624 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-25 09:24:22] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17821854736034132052.kers
Total runtime 1 ms.
[2026-05-25 09:24:22] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 164/208 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 48/102 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 1/209 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (OVERLAPS) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 103 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10773 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 164/208 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 48/102 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 220/322 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (OVERLAPS) 1/209 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 13 (OVERLAPS) 0/209 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 325 constraints, problems are : Problem set: 0 solved, 220 unsolved in 24588 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35423ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 35423ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/165 places, 224/340 transitions.
Applied a total of 0 rules in 12 ms. Remains 44 /44 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36139 ms. Remains : 44/165 places, 224/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-07 finished in 36228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)))))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 324
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 324
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 34 place count 155 transition count 310
Applied a total of 34 rules in 4 ms. Remains 155 /165 variables (removed 10) and now considering 310/340 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2022540947845252161.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6330134458107143585.kers'
[2026-05-25 09:24:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2022540947845252161.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6330134458107143585.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 155 cols 992 entries
Finished phase 1 with 147 SingleSign rule and 1 generalized
[2026-05-25 09:24:57] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-6330134458107143585.kers
Total runtime 13 ms.
[2026-05-25 09:24:57] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-25 09:24:57] [INFO ] Invariant cache hit.
[2026-05-25 09:24:57] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2026-05-25 09:24:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 310/465 variables, 155/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/465 variables, and 187 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/465 variables, 155/186 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 309/495 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 497 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 155/165 places, 310/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60522 ms. Remains : 155/165 places, 310/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&p1))))'
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-08 finished in 60739 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)||(!p1&&X((!p1 U (!p2||G(!p1)))))) U (G((X(p0)||(!p1&&X((!p1 U (!p2||G(!p1)))))))||((X(p0)||(!p1&&X((!p1 U (!p2||G(!p1))))))&&(!p0||F(!p3))))))'
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 327
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 327
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 27 place count 156 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 155 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 155 transition count 317
Applied a total of 29 rules in 4 ms. Remains 155 /165 variables (removed 10) and now considering 317/340 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1074119174061654111.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1975023118204609554.kers'
[2026-05-25 09:25:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1074119174061654111.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1975023118204609554.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 155 cols 1016 entries
Finished phase 1 with 147 SingleSign rule and 1 generalized
[2026-05-25 09:25:58] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1975023118204609554.kers
Total runtime 2 ms.
[2026-05-25 09:25:58] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-25 09:25:58] [INFO ] Invariant cache hit.
[2026-05-25 09:25:58] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2026-05-25 09:25:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (OVERLAPS) 317/472 variables, 155/178 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 180 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 317/472 variables, 155/180 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 316/496 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 499 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 155/165 places, 317/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60404 ms. Remains : 155/165 places, 317/340 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)||(!p1&&X((!p1 U (!p2||G(!p1)))))) U (G((X(p0)||(!p1&&X((!p1 U (!p2||G(!p1)))))))||((X(p0)||(!p1&&X((!p1 U (!p2||G(!p1))))))&&(!p0||F(!p3))))))'
Stuttering acceptance computed with spot in 510 ms :[(AND (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) p2), (AND (NOT p0) p1 p3), true, (AND p1 p2), (AND p3 p1 (NOT p0) p2), (AND p3 (NOT p0)), p3, (AND p3 p1 p2)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 22 factoid took 36 ms. Proved property starting from automaton with 10 states, 18 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 40 ms.
FORMULA MedleyA-PT-16-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLFireability-09 finished in 61258 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 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Graph (trivial) has 174 edges and 165 vertex of which 8 / 165 are part of one of the 2 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 158 transition count 300
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 71 place count 125 transition count 296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 123 transition count 296
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 73 place count 123 transition count 288
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 89 place count 115 transition count 288
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 102 place count 102 transition count 265
Iterating global reduction 3 with 13 rules applied. Total rules applied 115 place count 102 transition count 265
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 129 place count 102 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 129 place count 102 transition count 249
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 133 place count 100 transition count 249
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 175 place count 79 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 181 place count 79 transition count 222
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 185 place count 75 transition count 211
Iterating global reduction 5 with 4 rules applied. Total rules applied 189 place count 75 transition count 211
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 221 place count 59 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 222 place count 59 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 58 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 6 with 41 rules applied. Total rules applied 265 place count 58 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 266 place count 57 transition count 289
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 58 edges and 55 vertex of which 19 / 55 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 269 place count 44 transition count 289
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 7 with 43 rules applied. Total rules applied 312 place count 44 transition count 246
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 314 place count 42 transition count 224
Iterating global reduction 8 with 2 rules applied. Total rules applied 316 place count 42 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 8 with 72 rules applied. Total rules applied 388 place count 42 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 388 place count 42 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 390 place count 41 transition count 151
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 392 place count 39 transition count 143
Iterating global reduction 8 with 2 rules applied. Total rules applied 394 place count 39 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 398 place count 37 transition count 141
Applied a total of 398 rules in 25 ms. Remains 37 /165 variables (removed 128) and now considering 141/340 (removed 199) transitions.
[2026-05-25 09:26:59] [INFO ] Flow matrix only has 133 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5010927893949208329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15061571725947393246.kers'
[2026-05-25 09:26:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5010927893949208329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15061571725947393246.kers]
Normalized transition count is 132 out of 133 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 132 rows 37 cols 562 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 09:26:59] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15061571725947393246.kers
Total runtime 0 ms.
[2026-05-25 09:26:59] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 09:26:59] [INFO ] Flow matrix only has 133 transitions (discarded 8 similar events)
[2026-05-25 09:26:59] [INFO ] Invariant cache hit.
[2026-05-25 09:26:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 09:26:59] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2026-05-25 09:26:59] [INFO ] Redundant transitions in 94 ms returned [102, 140]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 135 sub problems to find dead transitions.
[2026-05-25 09:26:59] [INFO ] Flow matrix only has 131 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5193442910482437613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7046683014593662809.kers'
[2026-05-25 09:26:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5193442910482437613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7046683014593662809.kers]
Normalized transition count is 130 out of 131 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 37 cols 554 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 09:26:59] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7046683014593662809.kers
Total runtime 0 ms.
[2026-05-25 09:26:59] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 130/167 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 0/167 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/168 variables, and 58 constraints, problems are : Problem set: 0 solved, 135 unsolved in 4912 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 130/167 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 135/193 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/167 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/168 variables, and 193 constraints, problems are : Problem set: 0 solved, 135 unsolved in 6971 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11928ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 11928ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/165 places, 139/340 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 36 transition count 138
Applied a total of 2 rules in 7 ms. Remains 36 /37 variables (removed 1) and now considering 138/139 (removed 1) transitions.
[2026-05-25 09:27:11] [INFO ] Flow matrix only has 130 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18380841384420032403.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6709465819771437529.kers'
[2026-05-25 09:27:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18380841384420032403.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6709465819771437529.kers]
Normalized transition count is 129 out of 130 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 36 cols 552 entries
Finished phase 1 with 30 SingleSign rule and 1 generalized
[2026-05-25 09:27:11] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6709465819771437529.kers
Total runtime 2 ms.
[2026-05-25 09:27:11] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 09:27:11] [INFO ] Flow matrix only has 130 transitions (discarded 8 similar events)
[2026-05-25 09:27:11] [INFO ] Invariant cache hit.
[2026-05-25 09:27:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 09:27:11] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/165 places, 138/340 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12403 ms. Remains : 36/165 places, 138/340 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 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 116 ms.
Product exploration explored 100000 steps with 0 reset in 80 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 9 factoid took 69 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 (7169 resets) in 64 ms. (615 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (2494 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
[2026-05-25 09:27:12] [INFO ] Flow matrix only has 130 transitions (discarded 8 similar events)
[2026-05-25 09:27:12] [INFO ] Invariant cache hit.
[2026-05-25 09:27:12] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/134 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/165 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/165 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/166 variables, and 50 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 22/166 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5 constraints, State Equation: 0/36 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 130 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 480 ms.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 36 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2026-05-25 09:27:12] [INFO ] Flow matrix only has 130 transitions (discarded 8 similar events)
[2026-05-25 09:27:12] [INFO ] Invariant cache hit.
[2026-05-25 09:27:12] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 09:27:12] [INFO ] Flow matrix only has 130 transitions (discarded 8 similar events)
[2026-05-25 09:27:12] [INFO ] Invariant cache hit.
[2026-05-25 09:27:12] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 09:27:13] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2026-05-25 09:27:13] [INFO ] Redundant transitions in 47 ms returned []
Running 134 sub problems to find dead transitions.
[2026-05-25 09:27:13] [INFO ] Flow matrix only has 130 transitions (discarded 8 similar events)
[2026-05-25 09:27:13] [INFO ] Invariant cache hit.
[2026-05-25 09:27:13] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 129/165 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/166 variables, and 56 constraints, problems are : Problem set: 0 solved, 134 unsolved in 4708 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 129/165 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 134/190 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/166 variables, and 190 constraints, problems are : Problem set: 0 solved, 134 unsolved in 5691 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10432ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 10432ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10629 ms. Remains : 36/36 places, 138/138 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 67 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 4560 steps (859 resets) in 14 ms. (304 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 46 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 82 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 202 ms.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 55 ms.
Product exploration explored 100000 steps with 0 reset in 47 ms.
Built C files in :
/tmp/ltsmin46172138081054885
[2026-05-25 09:27:24] [INFO ] Computing symmetric may disable matrix : 138 transitions.
[2026-05-25 09:27:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:27:24] [INFO ] Computing symmetric may enable matrix : 138 transitions.
[2026-05-25 09:27:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:27:24] [INFO ] Computing Do-Not-Accords matrix : 138 transitions.
[2026-05-25 09:27:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:27:24] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin46172138081054885
Running compilation step : cd /tmp/ltsmin46172138081054885;'/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 372 ms.
Running link step : cd /tmp/ltsmin46172138081054885;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin46172138081054885;'/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/stateBased3387964733570654465.hoa' '--buchi-type=spotba'
LTSmin run took 48 ms.
FORMULA MedleyA-PT-16-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLFireability-10 finished in 24995 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 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Graph (trivial) has 176 edges and 165 vertex of which 13 / 165 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 154 transition count 297
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 122 transition count 293
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 120 transition count 293
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 71 place count 120 transition count 286
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 113 transition count 286
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 98 place count 100 transition count 263
Iterating global reduction 3 with 13 rules applied. Total rules applied 111 place count 100 transition count 263
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 125 place count 100 transition count 249
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 125 place count 100 transition count 247
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 98 transition count 247
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 169 place count 78 transition count 227
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 174 place count 78 transition count 222
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 178 place count 74 transition count 211
Iterating global reduction 5 with 4 rules applied. Total rules applied 182 place count 74 transition count 211
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 216 place count 57 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 217 place count 57 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 246 place count 57 transition count 287
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 246 place count 57 transition count 286
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 56 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 252 place count 54 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 53 transition count 311
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 54 edges and 51 vertex of which 16 / 51 are part of one of the 7 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 256 place count 42 transition count 311
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 7 with 36 rules applied. Total rules applied 292 place count 42 transition count 275
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 294 place count 40 transition count 252
Iterating global reduction 8 with 2 rules applied. Total rules applied 296 place count 40 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 8 with 71 rules applied. Total rules applied 367 place count 40 transition count 181
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 369 place count 38 transition count 172
Iterating global reduction 8 with 2 rules applied. Total rules applied 371 place count 38 transition count 172
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 8 with 4 rules applied. Total rules applied 375 place count 36 transition count 170
Applied a total of 375 rules in 49 ms. Remains 36 /165 variables (removed 129) and now considering 170/340 (removed 170) transitions.
[2026-05-25 09:27:24] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7314366614186623021.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3799298370608896931.kers'
[2026-05-25 09:27:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7314366614186623021.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3799298370608896931.kers]
Normalized transition count is 149 out of 150 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 36 cols 596 entries
Finished phase 1 with 30 SingleSign rule and 1 generalized
[2026-05-25 09:27:24] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3799298370608896931.kers
Total runtime 0 ms.
[2026-05-25 09:27:24] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-25 09:27:24] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2026-05-25 09:27:24] [INFO ] Invariant cache hit.
[2026-05-25 09:27:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:27:24] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2026-05-25 09:27:24] [INFO ] Redundant transitions in 22 ms returned [95, 125, 169]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 163 sub problems to find dead transitions.
[2026-05-25 09:27:24] [INFO ] Flow matrix only has 147 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2233146890304473059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13396256294330943032.kers'
[2026-05-25 09:27:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2233146890304473059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13396256294330943032.kers]
Normalized transition count is 146 out of 147 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 36 cols 584 entries
Finished phase 1 with 30 SingleSign rule and 1 generalized
[2026-05-25 09:27:24] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13396256294330943032.kers
Total runtime 1 ms.
[2026-05-25 09:27:24] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 146/182 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/183 variables, and 81 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5390 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 146/182 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 163/244 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 0/182 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/183 variables, and 245 constraints, problems are : Problem set: 0 solved, 163 unsolved in 19085 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24566ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 24566ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/165 places, 167/340 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 166
Applied a total of 2 rules in 8 ms. Remains 35 /36 variables (removed 1) and now considering 166/167 (removed 1) transitions.
[2026-05-25 09:27:49] [INFO ] Flow matrix only has 146 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16025620525972884944.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-577671223678059417.kers'
[2026-05-25 09:27:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16025620525972884944.kers, --Pflows, --basisKERS=/tmp/petrispot-output-577671223678059417.kers]
Normalized transition count is 145 out of 146 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 35 cols 582 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 09:27:49] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-577671223678059417.kers
Total runtime 2 ms.
[2026-05-25 09:27:49] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 09:27:49] [INFO ] Flow matrix only has 146 transitions (discarded 20 similar events)
[2026-05-25 09:27:49] [INFO ] Invariant cache hit.
[2026-05-25 09:27:49] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:27:49] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/165 places, 166/340 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25183 ms. Remains : 35/165 places, 166/340 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 121 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-11 finished in 25331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0||G(!p1)))) U ((X(X(p3))||F(p4))&&p2)))'
Support contains 7 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 154 transition count 323
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 154 transition count 323
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 36 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 153 transition count 308
Applied a total of 38 rules in 4 ms. Remains 153 /165 variables (removed 12) and now considering 308/340 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15718279648847180060.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-916137548207445423.kers'
[2026-05-25 09:27:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15718279648847180060.kers, --Pflows, --basisKERS=/tmp/petrispot-output-916137548207445423.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 153 cols 988 entries
Finished phase 1 with 145 SingleSign rule and 1 generalized
[2026-05-25 09:27:49] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-916137548207445423.kers
Total runtime 1 ms.
[2026-05-25 09:27:50] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-25 09:27:50] [INFO ] Invariant cache hit.
[2026-05-25 09:27:50] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2026-05-25 09:27:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/179 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 180 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 307/487 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 491 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 153/165 places, 308/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60547 ms. Remains : 153/165 places, 308/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0||G(!p1)))) U ((X(X(p3))||F(p4))&&p2)))'
Stuttering acceptance computed with spot in 585 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (AND (NOT p0) p1), (AND (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p0) (NOT p3) p1), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p0) p1), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4)))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 126 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLFireability-12 finished in 61346 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(p2)&&p1)))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Graph (trivial) has 173 edges and 165 vertex of which 13 / 165 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 154 transition count 296
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 71 place count 121 transition count 292
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 119 transition count 292
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 73 place count 119 transition count 285
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 87 place count 112 transition count 285
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 99 place count 100 transition count 264
Iterating global reduction 3 with 12 rules applied. Total rules applied 111 place count 100 transition count 264
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 120 place count 100 transition count 255
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 120 place count 100 transition count 253
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 124 place count 98 transition count 253
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 166 place count 77 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 172 place count 77 transition count 226
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 176 place count 73 transition count 215
Iterating global reduction 5 with 4 rules applied. Total rules applied 180 place count 73 transition count 215
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -102
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 212 place count 57 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 213 place count 57 transition count 316
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 56 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 244 place count 56 transition count 300
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 246 place count 55 transition count 313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 247 place count 54 transition count 312
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 51 edges and 52 vertex of which 20 / 52 are part of one of the 9 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 250 place count 41 transition count 312
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 281 place count 41 transition count 281
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 282 place count 40 transition count 268
Iterating global reduction 8 with 1 rules applied. Total rules applied 283 place count 40 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 90 transitions
Redundant transition composition rules discarded 90 transitions
Iterating global reduction 8 with 90 rules applied. Total rules applied 373 place count 40 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 373 place count 40 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 375 place count 39 transition count 177
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 8 with 4 rules applied. Total rules applied 379 place count 37 transition count 175
Applied a total of 379 rules in 29 ms. Remains 37 /165 variables (removed 128) and now considering 175/340 (removed 165) transitions.
[2026-05-25 09:28:51] [INFO ] Flow matrix only has 159 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14617350354042309171.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8708708986677894102.kers'
[2026-05-25 09:28:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14617350354042309171.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8708708986677894102.kers]
Normalized transition count is 158 out of 159 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 37 cols 628 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 09:28:51] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8708708986677894102.kers
Total runtime 1 ms.
[2026-05-25 09:28:51] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 09:28:51] [INFO ] Flow matrix only has 159 transitions (discarded 16 similar events)
[2026-05-25 09:28:51] [INFO ] Invariant cache hit.
[2026-05-25 09:28:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:28:51] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2026-05-25 09:28:51] [INFO ] Redundant transitions in 42 ms returned [10, 124, 162, 163, 164, 165, 173, 174]
Found 8 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 8 transitions
Redundant transitions reduction (with SMT) removed 8 transitions.
Running 163 sub problems to find dead transitions.
[2026-05-25 09:28:51] [INFO ] Flow matrix only has 151 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9592433348388143635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1335135206387320734.kers'
[2026-05-25 09:28:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9592433348388143635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1335135206387320734.kers]
Normalized transition count is 150 out of 151 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 37 cols 596 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 09:28:51] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1335135206387320734.kers
Total runtime 1 ms.
[2026-05-25 09:28:51] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 150/187 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/188 variables, and 83 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5539 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 150/187 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 163/246 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/188 variables, and 247 constraints, problems are : Problem set: 0 solved, 163 unsolved in 12793 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18386ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 18386ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/165 places, 167/340 transitions.
Applied a total of 0 rules in 5 ms. Remains 37 /37 variables (removed 0) and now considering 167/167 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18593 ms. Remains : 37/165 places, 167/340 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(p2)&&p1)))'
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-13 finished in 18871 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 G(((F(p1) U X(!p2)) U p3))))'
Support contains 7 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 154 transition count 323
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 154 transition count 323
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 36 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 153 transition count 308
Applied a total of 38 rules in 11 ms. Remains 153 /165 variables (removed 12) and now considering 308/340 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9111879726957265423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4513941595727522024.kers'
[2026-05-25 09:29:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9111879726957265423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4513941595727522024.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 153 cols 988 entries
Finished phase 1 with 145 SingleSign rule and 1 generalized
[2026-05-25 09:29:10] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4513941595727522024.kers
Total runtime 4 ms.
[2026-05-25 09:29:10] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-25 09:29:10] [INFO ] Invariant cache hit.
[2026-05-25 09:29:10] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2026-05-25 09:29:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/179 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 0/461 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 180 constraints, problems are : Problem set: 0 solved, 307 unsolved in 29175 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 307/487 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 491 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 59268ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 59270ms
Starting structural reductions in LTL mode, iteration 1 : 153/165 places, 308/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59634 ms. Remains : 153/165 places, 308/340 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 G(((F(p1) U X(!p2)) U p3))))'
Stuttering acceptance computed with spot in 779 ms :[(NOT p3), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p0) p2), (AND (NOT p0) p2 p3), (AND p2 (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-14
Product exploration explored 100000 steps with 42319 reset in 162 ms.
Product exploration explored 100000 steps with 42308 reset in 163 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge based reduction with 35 factoid took 726 ms. Reduced automaton from 12 states, 41 edges and 4 AP (stutter sensitive) to 12 states, 41 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (8 resets) in 490 ms. (81 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 600181 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :12 out of 18
Probabilistic random walk after 600181 steps, saw 101658 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :12
[2026-05-25 09:30:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 1 (OVERLAPS) 91/98 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 55/153 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 308/461 variables, 153/160 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/461 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 160 constraints, problems are : Problem set: 3 solved, 3 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 91/98 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 55/153 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 308/461 variables, 153/161 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 3/164 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/461 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 164 constraints, problems are : Problem set: 3 solved, 3 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 815ms problems are : Problem set: 3 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 154 ms.
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 308/308 transitions.
Graph (trivial) has 151 edges and 153 vertex of which 13 / 153 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 143 transition count 268
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 59 place count 116 transition count 264
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 114 transition count 264
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 61 place count 114 transition count 256
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 77 place count 106 transition count 256
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 106 transition count 255
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 82 place count 102 transition count 247
Iterating global reduction 4 with 4 rules applied. Total rules applied 86 place count 102 transition count 247
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 134 place count 78 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 138 place count 78 transition count 219
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 140 place count 76 transition count 213
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 76 transition count 213
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -119
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 176 place count 59 transition count 332
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 183 place count 59 transition count 325
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 185 place count 58 transition count 342
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 6 with 51 rules applied. Total rules applied 236 place count 58 transition count 291
Free-agglomeration rule applied 11 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 247 place count 58 transition count 273
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 275 place count 47 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 7 with 24 rules applied. Total rules applied 299 place count 47 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 300 place count 46 transition count 231
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 25 edges and 44 vertex of which 4 / 44 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 303 place count 42 transition count 231
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 329 place count 42 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 9 with 47 rules applied. Total rules applied 376 place count 42 transition count 158
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 377 place count 42 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 378 place count 41 transition count 157
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 11 with 4 rules applied. Total rules applied 382 place count 39 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 384 place count 38 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 391 place count 38 transition count 153
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 392 place count 38 transition count 153
Applied a total of 392 rules in 74 ms. Remains 38 /153 variables (removed 115) and now considering 153/308 (removed 155) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 38/153 places, 153/308 transitions.
RANDOM walk for 1964 steps (172 resets) in 16 ms. (115 steps per ms) remains 0/3 properties
Found 3 invariant AP formulas.
Knowledge based reduction with 38 factoid took 870 ms. Reduced automaton from 12 states, 41 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 443 ms :[(NOT p3), (AND (NOT p1) p2), p2, (NOT p3), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2) (NOT p3))]
[2026-05-25 09:30:17] [INFO ] Invariant cache hit.
[2026-05-25 09:30:17] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Proved EG (NOT p3) asserting that LTL formula F !(NOT p3) is false.
Negative knowledge disproves property using: (F p3)
Knowledge-based reduction took 6656 ms.
FORMULA MedleyA-PT-16-LTLFireability-14 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLFireability-14 finished in 67524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Graph (trivial) has 176 edges and 165 vertex of which 13 / 165 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 154 transition count 297
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 122 transition count 293
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 120 transition count 293
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 71 place count 120 transition count 286
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 113 transition count 286
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 97 place count 101 transition count 264
Iterating global reduction 3 with 12 rules applied. Total rules applied 109 place count 101 transition count 264
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 123 place count 101 transition count 250
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 123 place count 101 transition count 249
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 100 transition count 249
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 169 place count 78 transition count 227
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 175 place count 78 transition count 221
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 179 place count 74 transition count 210
Iterating global reduction 5 with 4 rules applied. Total rules applied 183 place count 74 transition count 210
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 217 place count 57 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 218 place count 57 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 6 with 28 rules applied. Total rules applied 246 place count 57 transition count 287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 250 place count 55 transition count 313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 251 place count 54 transition count 312
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 44 edges and 53 vertex of which 10 / 53 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 253 place count 47 transition count 312
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 272 place count 47 transition count 293
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 273 place count 46 transition count 277
Iterating global reduction 8 with 1 rules applied. Total rules applied 274 place count 46 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 8 with 41 rules applied. Total rules applied 315 place count 46 transition count 236
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 316 place count 45 transition count 227
Iterating global reduction 8 with 1 rules applied. Total rules applied 317 place count 45 transition count 227
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 321 place count 43 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 8 with 27 rules applied. Total rules applied 348 place count 43 transition count 220
Applied a total of 348 rules in 62 ms. Remains 43 /165 variables (removed 122) and now considering 220/340 (removed 120) transitions.
[2026-05-25 09:30:17] [INFO ] Flow matrix only has 164 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12422175148577248817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13880018940177716327.kers'
[2026-05-25 09:30:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12422175148577248817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13880018940177716327.kers]
Normalized transition count is 163 out of 164 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 163 rows 43 cols 624 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-25 09:30:17] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13880018940177716327.kers
Total runtime 1 ms.
[2026-05-25 09:30:17] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-25 09:30:17] [INFO ] Flow matrix only has 164 transitions (discarded 56 similar events)
[2026-05-25 09:30:17] [INFO ] Invariant cache hit.
[2026-05-25 09:30:18] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-25 09:30:18] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2026-05-25 09:30:18] [INFO ] Redundant transitions in 15 ms returned [204]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 215 sub problems to find dead transitions.
[2026-05-25 09:30:18] [INFO ] Flow matrix only has 163 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4456297260104665633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8112095740481996597.kers'
[2026-05-25 09:30:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4456297260104665633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8112095740481996597.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 43 cols 620 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-25 09:30:18] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8112095740481996597.kers
Total runtime 2 ms.
[2026-05-25 09:30:18] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/43 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 162/205 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 48/102 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 1/206 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 103 constraints, problems are : Problem set: 0 solved, 215 unsolved in 10599 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/43 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 162/205 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 48/102 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 215/317 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 13 (OVERLAPS) 0/206 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 319 constraints, problems are : Problem set: 0 solved, 215 unsolved in 26577 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37234ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 37235ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/165 places, 219/340 transitions.
Applied a total of 0 rules in 8 ms. Remains 43 /43 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37678 ms. Remains : 43/165 places, 219/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-15 finished in 37767 ms.
All properties solved by simple procedures.
Total runtime 853316 ms.

BK_STOP 1779701455492

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-16"
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-16, 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-177969020000220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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