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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 4.7K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 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 82K 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-07-LTLFireability-00
FORMULA_NAME MedleyA-PT-07-LTLFireability-01
FORMULA_NAME MedleyA-PT-07-LTLFireability-02
FORMULA_NAME MedleyA-PT-07-LTLFireability-03
FORMULA_NAME MedleyA-PT-07-LTLFireability-04
FORMULA_NAME MedleyA-PT-07-LTLFireability-05
FORMULA_NAME MedleyA-PT-07-LTLFireability-06
FORMULA_NAME MedleyA-PT-07-LTLFireability-07
FORMULA_NAME MedleyA-PT-07-LTLFireability-08
FORMULA_NAME MedleyA-PT-07-LTLFireability-09
FORMULA_NAME MedleyA-PT-07-LTLFireability-10
FORMULA_NAME MedleyA-PT-07-LTLFireability-11
FORMULA_NAME MedleyA-PT-07-LTLFireability-12
FORMULA_NAME MedleyA-PT-07-LTLFireability-13
FORMULA_NAME MedleyA-PT-07-LTLFireability-14
FORMULA_NAME MedleyA-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779699372566

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 08:56:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 08:56:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:56:13] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2026-05-25 08:56:13] [INFO ] Transformed 145 places.
[2026-05-25 08:56:13] [INFO ] Transformed 287 transitions.
[2026-05-25 08:56:13] [INFO ] Found NUPN structural information;
[2026-05-25 08:56:13] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-07-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 285/285 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 285
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 33 place count 110 transition count 251
Iterating global reduction 1 with 31 rules applied. Total rules applied 64 place count 110 transition count 251
Applied a total of 64 rules in 34 ms. Remains 110 /143 variables (removed 33) and now considering 251/285 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16527320025876480655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2183171581085112184.kers'
[2026-05-25 08:56:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16527320025876480655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2183171581085112184.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 251 rows 110 cols 1166 entries
Finished phase 1 with 96 SingleSign rule and 4 generalized
[2026-05-25 08:56:14] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2183171581085112184.kers
Total runtime 2 ms.
[2026-05-25 08:56:14] [INFO ] Implicit Places using invariants in 176 ms returned []
[2026-05-25 08:56:14] [INFO ] Invariant cache hit.
[2026-05-25 08:56:14] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2026-05-25 08:56:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/110 variables, 6/10 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 8/18 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/18 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 251/361 variables, 110/128 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 4/132 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/132 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/361 variables, 0/132 constraints. Problems are: Problem set: 48 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 132 constraints, problems are : Problem set: 48 solved, 202 unsolved in 17959 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 48 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 4/4 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 6/10 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 8/18 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/18 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 251/361 variables, 110/128 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 202/330 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 2/332 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 2/334 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 1/335 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 4/339 constraints. Problems are: Problem set: 48 solved, 202 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/339 constraints. Problems are: Problem set: 48 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 339 constraints, problems are : Problem set: 48 solved, 202 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 202/250 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 48246ms problems are : Problem set: 48 solved, 202 unsolved
Search for dead transitions found 48 dead transitions in 48259ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/143 places, 203/285 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48704 ms. Remains : 110/143 places, 203/285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 203/203 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12000310835472092084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3058434620039074265.kers'
[2026-05-25 08:57:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12000310835472092084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3058434620039074265.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 110 cols 814 entries
Finished phase 1 with 96 SingleSign rule and 4 generalized
[2026-05-25 08:57:02] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3058434620039074265.kers
Total runtime 1 ms.
[2026-05-25 08:57:02] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 08:57:02] [INFO ] Invariant cache hit.
[2026-05-25 08:57:02] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2026-05-25 08:57:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/313 variables, 110/128 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/313 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 131 constraints, problems are : Problem set: 0 solved, 202 unsolved in 21058 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/313 variables, 110/129 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 202/331 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 343 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51128ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 51129ms
Finished structural reductions in LTL mode , in 1 iterations and 51279 ms. Remains : 110/110 places, 203/203 transitions.
Support contains 28 out of 110 places after structural reductions.
[2026-05-25 08:57:54] [INFO ] Flatten gal took : 47 ms
[2026-05-25 08:57:54] [INFO ] Flatten gal took : 19 ms
[2026-05-25 08:57:54] [INFO ] Input system was already deterministic with 203 transitions.
RANDOM walk for 40000 steps (1406 resets) in 1067 ms. (37 steps per ms) remains 10/22 properties
BEST_FIRST walk for 40003 steps (348 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (319 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (311 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (350 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (329 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (351 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (334 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (323 resets) in 80 ms. (493 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (345 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (312 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
[2026-05-25 08:57:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 71/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 3 (OVERLAPS) 2/88 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 177/265 variables, 88/96 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 23/288 variables, 9/106 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 4/292 variables, 2/108 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 17/309 variables, 10/118 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/309 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 4/313 variables, 3/121 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/313 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 121 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1267 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 71/86 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/88 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 177/265 variables, 88/96 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 3/99 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 1/100 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 1/101 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 23/288 variables, 9/110 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 4/114 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 1/115 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 1/116 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 4/292 variables, 2/118 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/292 variables, 0/118 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 17/309 variables, 10/128 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/309 variables, 0/128 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 4/313 variables, 3/131 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/313 variables, 0/131 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/313 variables, 0/131 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 131 constraints, problems are : Problem set: 2 solved, 7 unsolved in 2451 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3741ms problems are : Problem set: 2 solved, 7 unsolved
Parikh walk visited 5 properties in 730 ms.
Support contains 8 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 203/203 transitions.
Graph (complete) has 348 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 105 transition count 171
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 51 place count 88 transition count 167
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 55 place count 86 transition count 165
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 55 place count 86 transition count 160
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 65 place count 81 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 70 place count 76 transition count 151
Iterating global reduction 3 with 5 rules applied. Total rules applied 75 place count 76 transition count 151
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 113 place count 57 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 57 transition count 129
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 127 place count 51 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 145 place count 51 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 149 place count 49 transition count 157
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 153 place count 49 transition count 153
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 157 place count 45 transition count 153
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 45 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 161 place count 43 transition count 151
Applied a total of 161 rules in 43 ms. Remains 43 /110 variables (removed 67) and now considering 151/203 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 43/110 places, 151/203 transitions.
RANDOM walk for 40000 steps (96 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (82 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (121 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 11541 steps, run visited all 2 properties in 34 ms. (steps per millisecond=339 )
Probabilistic random walk after 11541 steps, saw 3002 distinct states, run finished after 38 ms. (steps per millisecond=303 ) properties seen :2
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA MedleyA-PT-07-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 13 stabilizing places and 15 stable transitions
Graph (complete) has 348 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 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||X((X(X(G(!p1))) U (p0&&X(X(G(!p1))))))))'
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 203/203 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 107 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 107 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 106 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 106 transition count 197
Applied a total of 8 rules in 18 ms. Remains 106 /110 variables (removed 4) and now considering 197/203 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-94214318675895392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11511701673905701948.kers'
[2026-05-25 08:58:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-94214318675895392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11511701673905701948.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 106 cols 802 entries
Finished phase 1 with 92 SingleSign rule and 4 generalized
[2026-05-25 08:58:00] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-11511701673905701948.kers
Total runtime 20 ms.
[2026-05-25 08:58:00] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 08:58:00] [INFO ] Invariant cache hit.
[2026-05-25 08:58:00] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2026-05-25 08:58:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/303 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 123 constraints, problems are : Problem set: 0 solved, 196 unsolved in 15587 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/303 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 196/318 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/303 variables, and 324 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45667ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 45668ms
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 197/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45932 ms. Remains : 106/110 places, 197/203 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||X((X(X(G(!p1))) U (p0&&X(X(G(!p1))))))))'
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), (OR (NOT p0) p1), p1, p1, true]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-00
Entered a terminal (fully accepting) state of product in 765 steps with 26 reset in 10 ms.
FORMULA MedleyA-PT-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-00 finished in 46381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F((p1||(p1 U p2)))))))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 203/203 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 106 transition count 197
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 106 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 105 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 105 transition count 195
Applied a total of 10 rules in 6 ms. Remains 105 /110 variables (removed 5) and now considering 195/203 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17591694763288927713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7566285106650758987.kers'
[2026-05-25 08:58:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17591694763288927713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7566285106650758987.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 105 cols 798 entries
Finished phase 1 with 91 SingleSign rule and 4 generalized
[2026-05-25 08:58:46] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7566285106650758987.kers
Total runtime 1 ms.
[2026-05-25 08:58:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 08:58:46] [INFO ] Invariant cache hit.
[2026-05-25 08:58:46] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-25 08:58:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 123 constraints, problems are : Problem set: 0 solved, 194 unsolved in 18090 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 194/316 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (OVERLAPS) 0/300 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 320 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 48169ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 48169ms
Starting structural reductions in LTL mode, iteration 1 : 105/110 places, 195/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48334 ms. Remains : 105/110 places, 195/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F((p1||(p1 U p2)))))))'
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-01
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-01 finished in 48567 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||F(G(p1)))))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 203/203 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 105 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 105 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 104 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 104 transition count 194
Applied a total of 12 rules in 9 ms. Remains 104 /110 variables (removed 6) and now considering 194/203 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-558946441465075974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10528379592860107975.kers'
[2026-05-25 08:59:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-558946441465075974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10528379592860107975.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 104 cols 796 entries
Finished phase 1 with 90 SingleSign rule and 4 generalized
[2026-05-25 08:59:35] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10528379592860107975.kers
Total runtime 1 ms.
[2026-05-25 08:59:35] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 08:59:35] [INFO ] Invariant cache hit.
[2026-05-25 08:59:35] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-25 08:59:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 122 constraints, problems are : Problem set: 0 solved, 193 unsolved in 9716 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 0/298 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 317 constraints, problems are : Problem set: 0 solved, 193 unsolved in 21475 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 31224ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 31227ms
Starting structural reductions in LTL mode, iteration 1 : 104/110 places, 194/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31409 ms. Remains : 104/110 places, 194/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||p1)))'
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-02
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-02 finished in 31580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 203/203 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 105 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 105 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 104 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 104 transition count 194
Applied a total of 12 rules in 5 ms. Remains 104 /110 variables (removed 6) and now considering 194/203 (removed 9) transitions.
[2026-05-25 09:00:06] [INFO ] Invariant cache hit.
[2026-05-25 09:00:06] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 09:00:06] [INFO ] Invariant cache hit.
[2026-05-25 09:00:06] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 104/110 places, 194/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 104/110 places, 194/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-03 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(G(p0)) U !p1) U (G((F(G(p0)) U !p1))||(p2&&(F(G(p0)) U !p1))))))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 203/203 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 105 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 105 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 104 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 104 transition count 194
Applied a total of 12 rules in 5 ms. Remains 104 /110 variables (removed 6) and now considering 194/203 (removed 9) transitions.
[2026-05-25 09:00:06] [INFO ] Invariant cache hit.
[2026-05-25 09:00:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 09:00:06] [INFO ] Invariant cache hit.
[2026-05-25 09:00:07] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 104/110 places, 194/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 104/110 places, 194/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(G(p0)) U !p1) U (G((F(G(p0)) U !p1))||(p2&&(F(G(p0)) U !p1))))))'
Stuttering acceptance computed with spot in 155 ms :[p1, p1, (NOT p0), p1]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Graph (complete) has 336 edges and 104 vertex of which 99 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 10 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 12 ms. Proved property starting from automaton with 4 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 18 ms.
FORMULA MedleyA-PT-07-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-07-LTLFireability-04 finished in 584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F((p0&&X(X(X(F(p1))))))))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 203/203 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 105 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 105 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 104 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 104 transition count 194
Applied a total of 12 rules in 3 ms. Remains 104 /110 variables (removed 6) and now considering 194/203 (removed 9) transitions.
[2026-05-25 09:00:07] [INFO ] Invariant cache hit.
[2026-05-25 09:00:07] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 09:00:07] [INFO ] Invariant cache hit.
[2026-05-25 09:00:07] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 104/110 places, 194/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 104/110 places, 194/203 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(F((p0&&X(X(X(F(p1))))))))))'
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-07
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-07 finished in 388 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(F((p1&&G(p2)))))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 203/203 transitions.
Graph (complete) has 348 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 104 transition count 184
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 90 transition count 180
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 88 transition count 178
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 38 place count 88 transition count 173
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 48 place count 83 transition count 173
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 52 place count 79 transition count 166
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 79 transition count 166
Performed 24 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 106 place count 53 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 53 transition count 137
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 126 place count 44 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 144 place count 44 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 148 place count 42 transition count 169
Applied a total of 148 rules in 34 ms. Remains 42 /110 variables (removed 68) and now considering 169/203 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1553078640475225563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12340902018739230283.kers'
[2026-05-25 09:00:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1553078640475225563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12340902018739230283.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 42 cols 844 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-25 09:00:07] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12340902018739230283.kers
Total runtime 1 ms.
[2026-05-25 09:00:07] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-25 09:00:07] [INFO ] Invariant cache hit.
[2026-05-25 09:00:08] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-25 09:00:08] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2026-05-25 09:00:08] [INFO ] Redundant transitions in 31 ms returned [69, 70]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 161 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9734067622634463597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-815442094475094910.kers'
[2026-05-25 09:00:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9734067622634463597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-815442094475094910.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 42 cols 840 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-25 09:00:08] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-815442094475094910.kers
Total runtime 1 ms.
[2026-05-25 09:00:08] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 167/209 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 55/103 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 103 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5319 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 167/209 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 55/103 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 161/264 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/209 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 264 constraints, problems are : Problem set: 0 solved, 161 unsolved in 10014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15464ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 15465ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/110 places, 167/203 transitions.
Applied a total of 0 rules in 8 ms. Remains 42 /42 variables (removed 0) and now considering 167/167 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15688 ms. Remains : 42/110 places, 167/203 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(F((p1&&G(p2)))))))'
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (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-07-LTLFireability-11
Product exploration explored 100000 steps with 11797 reset in 243 ms.
Product exploration explored 100000 steps with 11804 reset in 232 ms.
Computed a total of 4 stabilizing places and 48 stable transitions
Computed a total of 4 stabilizing places and 48 stable transitions
Knowledge based reduction with 13 factoid took 60 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (4689 resets) in 478 ms. (83 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (975 resets) in 307 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (966 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
[2026-05-25 09:00:24] [INFO ] Invariant cache hit.
[2026-05-25 09:00:24] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/34 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 155/189 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 52/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/209 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 103 constraints, problems are : Problem set: 0 solved, 2 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/34 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 155/189 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 52/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/209 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 481ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1628 steps, including 102 resets, run visited all 2 properties in 19 ms. (steps per millisecond=85 )
Parikh walk visited 2 properties in 23 ms.
Knowledge based reduction with 13 factoid took 162 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 1164 ms.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 167/167 transitions.
Applied a total of 0 rules in 6 ms. Remains 42 /42 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2026-05-25 09:00:25] [INFO ] Invariant cache hit.
[2026-05-25 09:00:25] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 09:00:25] [INFO ] Invariant cache hit.
[2026-05-25 09:00:25] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-25 09:00:25] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2026-05-25 09:00:25] [INFO ] Redundant transitions in 32 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 42/42 places, 167/167 transitions.
Computed a total of 4 stabilizing places and 48 stable transitions
Computed a total of 4 stabilizing places and 48 stable transitions
Knowledge based reduction with 13 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (4702 resets) in 338 ms. (117 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (985 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (953 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
[2026-05-25 09:00:26] [INFO ] Invariant cache hit.
[2026-05-25 09:00:26] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/34 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 155/189 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 52/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/209 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 103 constraints, problems are : Problem set: 0 solved, 2 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/34 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 155/189 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 52/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/209 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 499ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 167/167 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 42 transition count 160
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 7 place count 42 transition count 159
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 41 transition count 159
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 41 transition count 156
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 38 transition count 156
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 38 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 36 transition count 154
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 36 transition count 154
Applied a total of 21 rules in 15 ms. Remains 36 /42 variables (removed 6) and now considering 154/167 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 36/42 places, 154/167 transitions.
RANDOM walk for 37420 steps (5454 resets) in 176 ms. (211 steps per ms) remains 0/2 properties
Knowledge based reduction with 13 factoid took 144 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 1179 ms.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 11777 reset in 261 ms.
Product exploration explored 100000 steps with 11759 reset in 200 ms.
Built C files in :
/tmp/ltsmin15460347420917044237
[2026-05-25 09:00:27] [INFO ] Computing symmetric may disable matrix : 167 transitions.
[2026-05-25 09:00:27] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:00:27] [INFO ] Computing symmetric may enable matrix : 167 transitions.
[2026-05-25 09:00:27] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:00:27] [INFO ] Computing Do-Not-Accords matrix : 167 transitions.
[2026-05-25 09:00:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:00:27] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15460347420917044237
Running compilation step : cd /tmp/ltsmin15460347420917044237;'/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 618 ms.
Running link step : cd /tmp/ltsmin15460347420917044237;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 105 ms.
Running LTSmin : cd /tmp/ltsmin15460347420917044237;'/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/stateBased12821153605046409793.hoa' '--buchi-type=spotba'
LTSmin run took 3837 ms.
FORMULA MedleyA-PT-07-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-07-LTLFireability-11 finished in 24527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 203/203 transitions.
Graph (complete) has 348 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 104 transition count 184
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 90 transition count 180
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 88 transition count 178
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 38 place count 88 transition count 174
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 46 place count 84 transition count 174
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 51 place count 79 transition count 165
Iterating global reduction 3 with 5 rules applied. Total rules applied 56 place count 79 transition count 165
Performed 25 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 108 place count 52 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 52 transition count 135
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 124 place count 45 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 132 place count 45 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 136 place count 43 transition count 172
Applied a total of 136 rules in 44 ms. Remains 43 /110 variables (removed 67) and now considering 172/203 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16209143597026130657.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14275471110147008920.kers'
[2026-05-25 09:00:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16209143597026130657.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14275471110147008920.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 43 cols 940 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-25 09:00:32] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14275471110147008920.kers
Total runtime 2 ms.
[2026-05-25 09:00:32] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 09:00:32] [INFO ] Invariant cache hit.
[2026-05-25 09:00:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:00:32] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2026-05-25 09:00:32] [INFO ] Redundant transitions in 20 ms returned [76, 77]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 164 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3392616466845932889.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10150813464255358167.kers'
[2026-05-25 09:00:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3392616466845932889.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10150813464255358167.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 43 cols 936 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-25 09:00:32] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10150813464255358167.kers
Total runtime 1 ms.
[2026-05-25 09:00:32] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 170/213 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 65 constraints, problems are : Problem set: 0 solved, 164 unsolved in 5048 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 170/213 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 164/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 213/213 variables, and 229 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35192ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 35193ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/110 places, 170/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35403 ms. Remains : 43/110 places, 170/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-13
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-13 finished in 35477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 203/203 transitions.
Graph (complete) has 348 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 104 transition count 184
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 90 transition count 182
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 89 transition count 180
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 88 transition count 179
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 37 place count 88 transition count 173
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 49 place count 82 transition count 173
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 54 place count 77 transition count 164
Iterating global reduction 4 with 5 rules applied. Total rules applied 59 place count 77 transition count 164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 59 place count 77 transition count 163
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 76 transition count 163
Performed 24 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 111 place count 50 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 113 place count 50 transition count 134
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 127 place count 43 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 137 place count 43 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 141 place count 41 transition count 169
Applied a total of 141 rules in 37 ms. Remains 41 /110 variables (removed 69) and now considering 169/203 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9239786232329443110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8745970427290162421.kers'
[2026-05-25 09:01:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9239786232329443110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8745970427290162421.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 41 cols 756 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-25 09:01:07] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8745970427290162421.kers
Total runtime 1 ms.
[2026-05-25 09:01:07] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 09:01:07] [INFO ] Invariant cache hit.
[2026-05-25 09:01:08] [INFO ] State equation strengthened by 84 read => feed constraints.
[2026-05-25 09:01:08] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2026-05-25 09:01:08] [INFO ] Redundant transitions in 23 ms returned [75, 76]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 161 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16570158101888958257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3000270028647517696.kers'
[2026-05-25 09:01:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16570158101888958257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3000270028647517696.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 41 cols 752 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-25 09:01:08] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3000270028647517696.kers
Total runtime 1 ms.
[2026-05-25 09:01:08] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 167/208 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 84/131 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 131 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6497 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 41/41 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 167/208 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 84/131 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 161/292 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 292 constraints, problems are : Problem set: 0 solved, 161 unsolved in 9353 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 41/41 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15964ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 15965ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/110 places, 167/203 transitions.
Applied a total of 0 rules in 10 ms. Remains 41 /41 variables (removed 0) and now considering 167/167 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16191 ms. Remains : 41/110 places, 167/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-14
Product exploration explored 100000 steps with 13164 reset in 248 ms.
Product exploration explored 100000 steps with 13178 reset in 208 ms.
Computed a total of 7 stabilizing places and 81 stable transitions
Computed a total of 7 stabilizing places and 81 stable transitions
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 28630 steps (3756 resets) in 146 ms. (194 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Knowledge-based reduction took 302 ms.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 167/167 transitions.
Applied a total of 0 rules in 7 ms. Remains 41 /41 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2026-05-25 09:01:25] [INFO ] Invariant cache hit.
[2026-05-25 09:01:25] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 09:01:25] [INFO ] Invariant cache hit.
[2026-05-25 09:01:25] [INFO ] State equation strengthened by 84 read => feed constraints.
[2026-05-25 09:01:25] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2026-05-25 09:01:25] [INFO ] Redundant transitions in 32 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 41/41 places, 167/167 transitions.
Computed a total of 7 stabilizing places and 81 stable transitions
Computed a total of 7 stabilizing places and 81 stable transitions
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 39414 steps (5178 resets) in 256 ms. (153 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Knowledge-based reduction took 260 ms.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13132 reset in 173 ms.
Product exploration explored 100000 steps with 13182 reset in 227 ms.
Built C files in :
/tmp/ltsmin15612471516645890137
[2026-05-25 09:01:26] [INFO ] Computing symmetric may disable matrix : 167 transitions.
[2026-05-25 09:01:26] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:01:26] [INFO ] Computing symmetric may enable matrix : 167 transitions.
[2026-05-25 09:01:26] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:01:26] [INFO ] Computing Do-Not-Accords matrix : 167 transitions.
[2026-05-25 09:01:26] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:01:26] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15612471516645890137
Running compilation step : cd /tmp/ltsmin15612471516645890137;'/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 452 ms.
Running link step : cd /tmp/ltsmin15612471516645890137;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin15612471516645890137;'/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/stateBased5830864744663228028.hoa' '--buchi-type=spotba'
LTSmin run took 175 ms.
FORMULA MedleyA-PT-07-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-07-LTLFireability-14 finished in 18960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((X(X(p0)) U X(p1)))) U p2))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 203/203 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 106 transition count 197
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 106 transition count 197
Applied a total of 8 rules in 2 ms. Remains 106 /110 variables (removed 4) and now considering 197/203 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16979729164900888882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6404712158600546420.kers'
[2026-05-25 09:01:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16979729164900888882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6404712158600546420.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 106 cols 802 entries
Finished phase 1 with 92 SingleSign rule and 4 generalized
[2026-05-25 09:01:26] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6404712158600546420.kers
Total runtime 4 ms.
[2026-05-25 09:01:26] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-25 09:01:26] [INFO ] Invariant cache hit.
[2026-05-25 09:01:27] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2026-05-25 09:01:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/303 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 124 constraints, problems are : Problem set: 0 solved, 196 unsolved in 17045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/303 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 196/318 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/303 variables, and 324 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47127ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 47128ms
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 197/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47453 ms. Remains : 106/110 places, 197/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((X(X(p0)) U X(p1)))) U p2))'
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-15 finished in 47781 ms.
All properties solved by simple procedures.
Total runtime 360853 ms.

BK_STOP 1779699734690

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

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

Sequence of Actions to be Executed by the VM

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

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

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