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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.6K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 11:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 11:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 11:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:31 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 70K 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-21-LTLFireability-00
FORMULA_NAME MedleyA-PT-21-LTLFireability-01
FORMULA_NAME MedleyA-PT-21-LTLFireability-02
FORMULA_NAME MedleyA-PT-21-LTLFireability-03
FORMULA_NAME MedleyA-PT-21-LTLFireability-04
FORMULA_NAME MedleyA-PT-21-LTLFireability-05
FORMULA_NAME MedleyA-PT-21-LTLFireability-06
FORMULA_NAME MedleyA-PT-21-LTLFireability-07
FORMULA_NAME MedleyA-PT-21-LTLFireability-08
FORMULA_NAME MedleyA-PT-21-LTLFireability-09
FORMULA_NAME MedleyA-PT-21-LTLFireability-10
FORMULA_NAME MedleyA-PT-21-LTLFireability-11
FORMULA_NAME MedleyA-PT-21-LTLFireability-12
FORMULA_NAME MedleyA-PT-21-LTLFireability-13
FORMULA_NAME MedleyA-PT-21-LTLFireability-14
FORMULA_NAME MedleyA-PT-21-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779702240431

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-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:44:01] [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:44:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:44:02] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2026-05-25 09:44:02] [INFO ] Transformed 306 places.
[2026-05-25 09:44:02] [INFO ] Transformed 298 transitions.
[2026-05-25 09:44:02] [INFO ] Found NUPN structural information;
[2026-05-25 09:44:02] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-21-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 298/298 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 267 transition count 259
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 267 transition count 259
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 110 place count 235 transition count 227
Iterating global reduction 0 with 32 rules applied. Total rules applied 142 place count 235 transition count 227
Applied a total of 142 rules in 54 ms. Remains 235 /306 variables (removed 71) and now considering 227/298 (removed 71) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15700474343790798462.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12416836242709321881.kers'
[2026-05-25 09:44:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15700474343790798462.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12416836242709321881.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 227 rows 235 cols 558 entries
Finished phase 1 with 215 SingleSign rule and 0 generalized
[2026-05-25 09:44:02] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12416836242709321881.kers
Total runtime 3 ms.
[2026-05-25 09:44:02] [INFO ] Implicit Places using invariants in 399 ms returned []
[2026-05-25 09:44:02] [INFO ] Invariant cache hit.
[2026-05-25 09:44:03] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2026-05-25 09:44:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 227/462 variables, 235/276 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/462 variables, and 278 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 227/462 variables, 235/277 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 226/503 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 8/511 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 519 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 235/306 places, 227/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60926 ms. Remains : 235/306 places, 227/298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-25 09:45:03] [INFO ] Invariant cache hit.
[2026-05-25 09:45:03] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-25 09:45:03] [INFO ] Invariant cache hit.
[2026-05-25 09:45:03] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 235/235 places, 227/227 transitions.
Support contains 35 out of 235 places after structural reductions.
[2026-05-25 09:45:04] [INFO ] Flatten gal took : 66 ms
[2026-05-25 09:45:04] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:45:04] [INFO ] Input system was already deterministic with 227 transitions.
Support contains 33 out of 235 places (down from 35) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1774 ms. (22 steps per ms) remains 7/30 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 3/4 properties
[2026-05-25 09:45:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/81 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 154/235 variables, 14/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 227/462 variables, 235/257 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 1/258 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/462 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 258 constraints, problems are : Problem set: 1 solved, 2 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 177/235 variables, 15/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 3/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 227/462 variables, 235/260 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 2/262 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/262 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/462 variables, 0/262 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 262 constraints, problems are : Problem set: 1 solved, 2 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 910ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 518 steps, including 3 resets, run visited all 2 properties in 7 ms. (steps per millisecond=74 )
Parikh walk visited 2 properties in 16 ms.
FORMULA MedleyA-PT-21-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 37 stabilizing places and 37 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(F(p1))))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 226 transition count 218
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 226 transition count 218
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 222 transition count 214
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 222 transition count 214
Applied a total of 26 rules in 32 ms. Remains 222 /235 variables (removed 13) and now considering 214/227 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13778034286076461663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15985952123167472974.kers'
[2026-05-25 09:45:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13778034286076461663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15985952123167472974.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 222 cols 532 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-25 09:45:06] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15985952123167472974.kers
Total runtime 3 ms.
[2026-05-25 09:45:06] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-25 09:45:06] [INFO ] Invariant cache hit.
[2026-05-25 09:45:06] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-25 09:45:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/436 variables, 222/254 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/436 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 255 constraints, problems are : Problem set: 0 solved, 213 unsolved in 29772 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/436 variables, 222/255 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 213/468 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 4/481 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 484 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 59809ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 59810ms
Starting structural reductions in LTL mode, iteration 1 : 222/235 places, 214/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60205 ms. Remains : 222/235 places, 214/227 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(F(p1))))))'
Stuttering acceptance computed with spot in 535 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 255 ms.
Stack based approach found an accepted trace after 200 steps with 0 reset with depth 201 and stack size 201 in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-00 finished in 61152 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(G(p1))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 227 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 227 transition count 219
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 224 transition count 216
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 224 transition count 216
Applied a total of 22 rules in 16 ms. Remains 224 /235 variables (removed 11) and now considering 216/227 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12433588080639093616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11663247947981687468.kers'
[2026-05-25 09:46:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12433588080639093616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11663247947981687468.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 224 cols 536 entries
Finished phase 1 with 204 SingleSign rule and 0 generalized
[2026-05-25 09:46:07] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11663247947981687468.kers
Total runtime 2 ms.
[2026-05-25 09:46:07] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:46:07] [INFO ] Invariant cache hit.
[2026-05-25 09:46:07] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2026-05-25 09:46:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/440 variables, 224/259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/440 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 260 constraints, problems are : Problem set: 0 solved, 215 unsolved in 27769 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/440 variables, 224/259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 215/474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 5/479 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 490 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 57819ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 57820ms
Starting structural reductions in LTL mode, iteration 1 : 224/235 places, 216/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58050 ms. Remains : 224/235 places, 216/227 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(G(p1))))'
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-01
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLFireability-01 finished in 58308 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||(p1&&F(G(p2))))) U X(p2)))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 227 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 227 transition count 219
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 224 transition count 216
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 224 transition count 216
Applied a total of 22 rules in 28 ms. Remains 224 /235 variables (removed 11) and now considering 216/227 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18185956865899280665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11110602152073296190.kers'
[2026-05-25 09:47:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18185956865899280665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11110602152073296190.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 224 cols 536 entries
Finished phase 1 with 204 SingleSign rule and 0 generalized
[2026-05-25 09:47:05] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11110602152073296190.kers
Total runtime 2 ms.
[2026-05-25 09:47:06] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-25 09:47:06] [INFO ] Invariant cache hit.
[2026-05-25 09:47:06] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 224/235 places, 216/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 224/235 places, 216/227 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||(p1&&F(G(p2))))) U X(p2)))'
Stuttering acceptance computed with spot in 263 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-03
Product exploration explored 100000 steps with 10 reset in 150 ms.
Stack based approach found an accepted trace after 1688 steps with 31 reset with depth 217 and stack size 217 in 3 ms.
FORMULA MedleyA-PT-21-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-03 finished in 824 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)||(X(X(F(p1)))&&F(p2)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 234 transition count 172
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 180 transition count 172
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 108 place count 180 transition count 140
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 172 place count 148 transition count 140
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 180 place count 140 transition count 132
Iterating global reduction 2 with 8 rules applied. Total rules applied 188 place count 140 transition count 132
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 188 place count 140 transition count 126
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 200 place count 134 transition count 126
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 276 place count 96 transition count 88
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 282 place count 93 transition count 111
Applied a total of 282 rules in 49 ms. Remains 93 /235 variables (removed 142) and now considering 111/227 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14945016668148176542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1159918036422665488.kers'
[2026-05-25 09:47:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14945016668148176542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1159918036422665488.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 111 rows 92 cols 573 entries
Finished phase 1 with 73 SingleSign rule and 0 generalized
[2026-05-25 09:47:06] [INFO ] Computed 20 invariants in 12 ms
Computed 20 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-1159918036422665488.kers
Total runtime 25 ms.
[2026-05-25 09:47:06] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 09:47:06] [INFO ] Invariant cache hit.
[2026-05-25 09:47:06] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 09:47:06] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2026-05-25 09:47:06] [INFO ] Redundant transitions in 1 ms returned []
Running 93 sub problems to find dead transitions.
[2026-05-25 09:47:06] [INFO ] Invariant cache hit.
[2026-05-25 09:47:06] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 111/204 variables, 93/117 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 14/131 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 131 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3363 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 93/93 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 111/204 variables, 93/117 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 14/131 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 93/224 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 224 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4891 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 93/93 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8308ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 8310ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/235 places, 111/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8539 ms. Remains : 93/235 places, 111/227 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)||(X(X(F(p1)))&&F(p2)))))'
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-04
Product exploration explored 100000 steps with 2 reset in 100 ms.
Product exploration explored 100000 steps with 14 reset in 184 ms.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 0/5 properties
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 512 ms.
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 111/111 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2026-05-25 09:47:16] [INFO ] Invariant cache hit.
[2026-05-25 09:47:16] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 09:47:16] [INFO ] Invariant cache hit.
[2026-05-25 09:47:16] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 09:47:16] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2026-05-25 09:47:16] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 93/93 places, 111/111 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 199 ms. (200 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 27390 steps (6 resets) in 69 ms. (391 steps per ms) remains 0/2 properties
Knowledge based reduction with 9 factoid took 166 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 616 ms.
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 124 ms.
Product exploration explored 100000 steps with 1 reset in 106 ms.
Built C files in :
/tmp/ltsmin15370759430369565298
[2026-05-25 09:47:17] [INFO ] Computing symmetric may disable matrix : 111 transitions.
[2026-05-25 09:47:17] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:47:17] [INFO ] Computing symmetric may enable matrix : 111 transitions.
[2026-05-25 09:47:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:47:17] [INFO ] Computing Do-Not-Accords matrix : 111 transitions.
[2026-05-25 09:47:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:47:17] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15370759430369565298
Running compilation step : cd /tmp/ltsmin15370759430369565298;'/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 453 ms.
Running link step : cd /tmp/ltsmin15370759430369565298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15370759430369565298;'/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/stateBased9256082931668050413.hoa' '--buchi-type=spotba'
LTSmin run took 89 ms.
FORMULA MedleyA-PT-21-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-21-LTLFireability-04 finished in 11789 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 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Graph (trivial) has 163 edges and 235 vertex of which 6 / 235 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 229 transition count 168
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 176 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 175 transition count 167
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 109 place count 175 transition count 136
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 171 place count 144 transition count 136
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 178 place count 137 transition count 129
Iterating global reduction 3 with 7 rules applied. Total rules applied 185 place count 137 transition count 129
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 185 place count 137 transition count 124
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 195 place count 132 transition count 124
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 271 place count 94 transition count 86
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 283 place count 88 transition count 132
Applied a total of 283 rules in 36 ms. Remains 88 /235 variables (removed 147) and now considering 132/227 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8353966768154476934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3349843042977193277.kers'
[2026-05-25 09:47:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8353966768154476934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3349843042977193277.kers]
Normalized transition count is 131 out of 132 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 131 rows 87 cols 623 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-25 09:47:18] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3349843042977193277.kers
Total runtime 1 ms.
[2026-05-25 09:47:18] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 09:47:18] [INFO ] Invariant cache hit.
[2026-05-25 09:47:18] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-25 09:47:18] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2026-05-25 09:47:18] [INFO ] Redundant transitions in 1 ms returned []
Running 114 sub problems to find dead transitions.
[2026-05-25 09:47:18] [INFO ] Invariant cache hit.
[2026-05-25 09:47:18] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 131/219 variables, 88/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 22/135 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 1/220 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/220 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 136 constraints, problems are : Problem set: 0 solved, 114 unsolved in 5209 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 88/88 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 131/219 variables, 88/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 22/135 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 114/249 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 1/220 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/220 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 251 constraints, problems are : Problem set: 0 solved, 114 unsolved in 12571 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 88/88 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 17828ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 17829ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/235 places, 132/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18095 ms. Remains : 88/235 places, 132/227 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 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-21-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLFireability-05 finished in 18226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Graph (trivial) has 161 edges and 235 vertex of which 6 / 235 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 229 transition count 167
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 175 transition count 167
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 109 place count 175 transition count 138
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 167 place count 146 transition count 138
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 174 place count 139 transition count 131
Iterating global reduction 2 with 7 rules applied. Total rules applied 181 place count 139 transition count 131
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 181 place count 139 transition count 126
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 191 place count 134 transition count 126
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 269 place count 95 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 275 place count 92 transition count 110
Applied a total of 275 rules in 25 ms. Remains 92 /235 variables (removed 143) and now considering 110/227 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9130575656263579017.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-637961748095659966.kers'
[2026-05-25 09:47:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9130575656263579017.kers, --Pflows, --basisKERS=/tmp/petrispot-output-637961748095659966.kers]
Normalized transition count is 109 out of 110 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 109 rows 91 cols 567 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-25 09:47:36] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-637961748095659966.kers
Total runtime 1 ms.
[2026-05-25 09:47:36] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 09:47:36] [INFO ] Invariant cache hit.
[2026-05-25 09:47:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 09:47:37] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2026-05-25 09:47:37] [INFO ] Redundant transitions in 1 ms returned []
Running 92 sub problems to find dead transitions.
[2026-05-25 09:47:37] [INFO ] Invariant cache hit.
[2026-05-25 09:47:37] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 109/201 variables, 92/117 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/202 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 92 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 131 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3692 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 109/201 variables, 92/117 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 92/222 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 1/202 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 12 (OVERLAPS) 0/202 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 225 constraints, problems are : Problem set: 0 solved, 92 unsolved in 7736 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11489ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 11490ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/235 places, 110/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11771 ms. Remains : 92/235 places, 110/227 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-21-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLFireability-06 finished in 11900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X((F(G(p0)) U p1)) U (p2&&F(p3))) U p4)))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 226 transition count 218
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 226 transition count 218
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 221 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 221 transition count 213
Applied a total of 28 rules in 19 ms. Remains 221 /235 variables (removed 14) and now considering 213/227 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1012488064466688385.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9842150423570091319.kers'
[2026-05-25 09:47:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1012488064466688385.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9842150423570091319.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 221 cols 530 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-25 09:47:48] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9842150423570091319.kers
Total runtime 1 ms.
[2026-05-25 09:47:48] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 09:47:48] [INFO ] Invariant cache hit.
[2026-05-25 09:47:48] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2026-05-25 09:47:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/434 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 253 constraints, problems are : Problem set: 0 solved, 212 unsolved in 25004 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/434 variables, 221/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 212/465 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 10/475 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 482 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 55045ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 55047ms
Starting structural reductions in LTL mode, iteration 1 : 221/235 places, 213/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55313 ms. Remains : 221/235 places, 213/227 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X((F(G(p0)) U p1)) U (p2&&F(p3))) U p4)))'
Stuttering acceptance computed with spot in 443 ms :[(NOT p4), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p4), (NOT p3), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 158 ms.
Stack based approach found an accepted trace after 190 steps with 0 reset with depth 191 and stack size 191 in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-07 finished in 56056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 225 transition count 217
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 225 transition count 217
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 220 transition count 212
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 220 transition count 212
Applied a total of 30 rules in 25 ms. Remains 220 /235 variables (removed 15) and now considering 212/227 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15210152244917698301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17268938541888177038.kers'
[2026-05-25 09:48:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15210152244917698301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17268938541888177038.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 220 cols 528 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-25 09:48:44] [INFO ] Computed 20 invariants in 3 ms
Computed 20 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17268938541888177038.kers
Total runtime 5 ms.
[2026-05-25 09:48:44] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-25 09:48:44] [INFO ] Invariant cache hit.
[2026-05-25 09:48:45] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2026-05-25 09:48:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/432 variables, 220/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 255 constraints, problems are : Problem set: 0 solved, 211 unsolved in 24044 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/432 variables, 220/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 211/466 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 478 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 54090ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 54090ms
Starting structural reductions in LTL mode, iteration 1 : 220/235 places, 212/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54524 ms. Remains : 220/235 places, 212/227 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-21-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLFireability-08 finished in 54692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G((p1||X(p2))))))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 226 transition count 218
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 226 transition count 218
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 221 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 221 transition count 213
Applied a total of 28 rules in 10 ms. Remains 221 /235 variables (removed 14) and now considering 213/227 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10635728909188065665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18033251387525907458.kers'
[2026-05-25 09:49:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10635728909188065665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18033251387525907458.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 221 cols 530 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-25 09:49:39] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18033251387525907458.kers
Total runtime 1 ms.
[2026-05-25 09:49:39] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-25 09:49:39] [INFO ] Invariant cache hit.
[2026-05-25 09:49:39] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2026-05-25 09:49:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/434 variables, 221/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 255 constraints, problems are : Problem set: 0 solved, 212 unsolved in 23991 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/434 variables, 221/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 212/466 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 6/472 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 480 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 54034ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 54035ms
Starting structural reductions in LTL mode, iteration 1 : 221/235 places, 213/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54436 ms. Remains : 221/235 places, 213/227 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G((p1||X(p2))))))))'
Stuttering acceptance computed with spot in 355 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 145 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 407 ms. (98 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/5 properties
[2026-05-25 09:50:34] [INFO ] Invariant cache hit.
Problem apf6 is UNSAT
After SMT solving in domain Real declared 1/434 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/221 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 798 ms.
Stuttering acceptance computed with spot in 272 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 221 /221 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2026-05-25 09:50:35] [INFO ] Invariant cache hit.
[2026-05-25 09:50:35] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-25 09:50:35] [INFO ] Invariant cache hit.
[2026-05-25 09:50:36] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 221/221 places, 213/213 transitions.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge based reduction with 1 factoid took 51 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 31627 steps (6 resets) in 86 ms. (363 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 691 ms.
Stuttering acceptance computed with spot in 384 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 232 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 126 ms.
Product exploration explored 100000 steps with 0 reset in 134 ms.
Spot run failed in 157 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/ltsmin5938872106089631494
[2026-05-25 09:50:37] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5938872106089631494
Running compilation step : cd /tmp/ltsmin5938872106089631494;'/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 367 ms.
Running link step : cd /tmp/ltsmin5938872106089631494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin5938872106089631494;'/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/stateBased5963238266034796288.hoa' '--buchi-type=spotba'
LTSmin run took 7064 ms.
FORMULA MedleyA-PT-21-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-21-LTLFireability-09 finished in 65946 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)))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 225 transition count 217
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 225 transition count 217
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 220 transition count 212
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 220 transition count 212
Applied a total of 30 rules in 8 ms. Remains 220 /235 variables (removed 15) and now considering 212/227 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11379968444732128177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18146058595658755507.kers'
[2026-05-25 09:50:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11379968444732128177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18146058595658755507.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 220 cols 528 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-25 09:50:45] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18146058595658755507.kers
Total runtime 1 ms.
[2026-05-25 09:50:45] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-25 09:50:45] [INFO ] Invariant cache hit.
[2026-05-25 09:50:45] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2026-05-25 09:50:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/432 variables, 220/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 255 constraints, problems are : Problem set: 0 solved, 211 unsolved in 25169 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/432 variables, 220/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 211/466 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 478 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 55233ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 55236ms
Starting structural reductions in LTL mode, iteration 1 : 220/235 places, 212/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55554 ms. Remains : 220/235 places, 212/227 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 78 ms.
Product exploration explored 100000 steps with 33333 reset in 102 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 26 ms. Proved property starting from automaton with 4 states, 4 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 32 ms.
FORMULA MedleyA-PT-21-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-21-LTLFireability-11 finished in 55996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 226 transition count 218
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 226 transition count 218
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 222 transition count 214
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 222 transition count 214
Applied a total of 26 rules in 8 ms. Remains 222 /235 variables (removed 13) and now considering 214/227 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1607523215138620412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4087499157151885992.kers'
[2026-05-25 09:51:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1607523215138620412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4087499157151885992.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 222 cols 532 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-25 09:51:41] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4087499157151885992.kers
Total runtime 1 ms.
[2026-05-25 09:51:41] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-25 09:51:41] [INFO ] Invariant cache hit.
[2026-05-25 09:51:41] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-25 09:51:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 214/436 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/436 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 257 constraints, problems are : Problem set: 0 solved, 213 unsolved in 27711 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 213/469 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 7/476 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 484 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 57758ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 57759ms
Starting structural reductions in LTL mode, iteration 1 : 222/235 places, 214/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58089 ms. Remains : 222/235 places, 214/227 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&&G(p1))))'
Stuttering acceptance computed with spot in 274 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-13
Entered a terminal (fully accepting) state of product in 118 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLFireability-13 finished in 58404 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 X(G(p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 226 transition count 218
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 226 transition count 218
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 221 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 221 transition count 213
Applied a total of 28 rules in 18 ms. Remains 221 /235 variables (removed 14) and now considering 213/227 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7162295575543373934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8431174706101111167.kers'
[2026-05-25 09:52:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7162295575543373934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8431174706101111167.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 221 cols 530 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-25 09:52:39] [INFO ] Computed 20 invariants in 6 ms
Computed 20 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8431174706101111167.kers
Total runtime 7 ms.
[2026-05-25 09:52:39] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-25 09:52:39] [INFO ] Invariant cache hit.
[2026-05-25 09:52:40] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2026-05-25 09:52:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 213/434 variables, 221/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 0/434 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 255 constraints, problems are : Problem set: 0 solved, 212 unsolved in 26552 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/434 variables, 221/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 212/466 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 6/472 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 479 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56582ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 56583ms
Starting structural reductions in LTL mode, iteration 1 : 221/235 places, 213/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56991 ms. Remains : 221/235 places, 213/227 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 X(G(p1))))'
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-21-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLFireability-14 finished in 57134 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)&&(F((p1&&X(p2))) U p3)))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 225 transition count 217
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 225 transition count 217
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 220 transition count 212
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 220 transition count 212
Applied a total of 30 rules in 7 ms. Remains 220 /235 variables (removed 15) and now considering 212/227 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13616799551857765955.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2048680471557079415.kers'
[2026-05-25 09:53:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13616799551857765955.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2048680471557079415.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 220 cols 528 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-25 09:53:36] [INFO ] Computed 20 invariants in 4 ms
Computed 20 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2048680471557079415.kers
Total runtime 5 ms.
[2026-05-25 09:53:37] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 09:53:37] [INFO ] Invariant cache hit.
[2026-05-25 09:53:37] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2026-05-25 09:53:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/432 variables, 220/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 255 constraints, problems are : Problem set: 0 solved, 211 unsolved in 23218 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/432 variables, 220/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 211/466 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 478 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 53248ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 53249ms
Starting structural reductions in LTL mode, iteration 1 : 220/235 places, 212/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53510 ms. Remains : 220/235 places, 212/227 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)&&(F((p1&&X(p2))) U p3)))'
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p2)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 87 ms.
Stack based approach found an accepted trace after 169 steps with 0 reset with depth 170 and stack size 170 in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-15 finished in 53852 ms.
All properties solved by simple procedures.
Total runtime 628855 ms.

BK_STOP 1779702870780

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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-21"
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-21, 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-177969020000260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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